Fractal structures in nonlinear plasma physics

Fractal structures appear in many situations related to the dynamics of conservative as well as dissipative dynamical systems, being a manifestation of chaotic behaviour. In open area-preserving discrete dynamical systems we can find fractal structures in the form of fractal boundaries, associated to escape basins, and even possessing the more general property of Wada. Such systems appear in certain applications in plasma physics, like the magnetic field line behaviour in tokamaks with ergodic limiters. The main purpose of this paper is to show how such fractal structures have observable consequences in terms of the transport properties in the plasma edge of tokamaks, some of which have been experimentally verified. We emphasize the role of the fractal structures in the understanding of mesoscale phenomena in plasmas, such as electromagnetic turbulence.

Pulsating strings in Lunin-Maldacena backgrounds

We consider pulsating strings in Lunin-Maldacena backgrounds, specifically in deformed Minkowski spacetime and deformed AdS(5) x S(5). We find the relation between the energy and the oscillation number of the pulsating string when the deformation is small. Since the oscillation number is an adiabatic invariant it can be used to explore the regime of highly excited string states. We then quantize the string and look for such a sector. For the deformed Minkowski background we find a precise match with the classical results if the oscillation number is quantized as an even number. For the deformed AdS(5) x S(5) we find a contribution which depends on the deformation parameter.

Fractal structures in stenoses and aneurysms in blood vessels

Recent advances in the field of chaotic advection provide the impetus to revisit the dynamics of particles transported by blood flow in the presence of vessel wall irregularities. The irregularity, being either a narrowing or expansion of the vessel, mimicking stenoses or aneurysms, generates abnormal flow patterns that lead to a peculiar filamentary distribution of advected particles, which, in the blood, would include platelets. Using a simple model, we show how the filamentary distribution depends on the size of the vessel wall irregularity, and how it varies under resting or exercise conditions. The particles transported by blood flow that spend a long time around a disturbance either stick to the vessel wall or reside on fractal filaments. We show that the faster flow associated with exercise creates widespread filaments where particles can get trapped for a longer time, thus allowing for the possible activation of such particles. We argue, based on previous results in the field of active processes in flows, that the non-trivial long-time distribution of transported particles has the potential to have major effects on biochemical processes occurring in blood flow, including the activation and deposition of platelets. One aspect of the generality of our approach is that it also applies to other relevant biological processes, an example being the coexistence of plankton species investigated previously.

Classical strings in AdS(4) x CP(3) with three angular momenta

In this paper, rotating strings in three directions of AdS(4) x CP(3) geometry are studied; its divergent energy limit, and conserved charges are also determined. An interpretation of these configurations as either giant magnons or spiky strings is discussed.

Shape classification using complex network and Multi-scale Fractal Dimension

Shape provides one of the most relevant information about an object. This makes shape one of the most important visual attributes used to characterize objects. This paper introduces a novel approach for shape characterization, which combines modeling shape into a complex network and the analysis of its complexity in a dynamic evolution context. Descriptors computed through this approach show to be efficient in shape characterization, incorporating many characteristics, such as scale and rotation invariant. Experiments using two different shape databases (an artificial shapes database and a leaf shape database) are presented in order to evaluate the method. and its results are compared to traditional shape analysis methods found in literature. (C) 2009 Published by Elsevier B.V.

PLANT LEAF IDENTIFICATION BASED ON VOLUMETRIC FRACTAL DIMENSION

Texture is an important visual attribute used to describe the pixel organization in an image. As well as it being easily identified by humans, its analysis process demands a high level of sophistication and computer complexity. This paper presents a novel approach for texture analysis, based on analyzing the complexity of the surface generated from a texture, in order to describe and characterize it. The proposed method produces a texture signature which is able to efficiently characterize different texture classes. The paper also illustrates a novel method performance on an experiment using texture images of leaves. Leaf identification is a difficult and complex task due to the nature of plants, which presents a huge pattern variation. The high classification rate yielded shows the potential of the method, improving on traditional texture techniques, such as Gabor filters and Fourier analysis.

Fractal dimension applied to plant identification

This article discusses methods to identify plants by analysing leaf complexity based on estimating their fractal dimension. Leaves were analyzed according to the complexity of their internal and external shapes. A computational program was developed to process, analyze and extract the features of leaf images, thereby allowing for automatic plant identification. Results are presented from two experiments, the first to identify plant species from the Brazilian Atlantic forest and Brazilian Cerrado scrublands, using fifty leaf samples from ten different species, and the second to identify four different species from genus Passiflora, using twenty leaf samples for each class. A comparison is made of two methods to estimate fractal dimension (box-counting and multiscale Minkowski). The results are discussed to determine the best approach to analyze shape complexity based on the performance of the technique, when estimating fractal dimension and identifying plants. (C) 2008 Elsevier Inc. All rights reserved.

ENHANCING MULTISCALE FRACTAL DESCRIPTORS USING FUNCTIONAL DATA ANALYSIS

This work presents a novel approach in order to increase the recognition power of Multiscale Fractal Dimension (MFD) techniques, when applied to image classification. The proposal uses Functional Data Analysis (FDA) with the aim of enhancing the MFD technique precision achieving a more representative descriptors vector, capable of recognizing and characterizing more precisely objects in an image. FDA is applied to signatures extracted by using the Bouligand-Minkowsky MFD technique in the generation of a descriptors vector from them. For the evaluation of the obtained improvement, an experiment using two datasets of objects was carried out. A dataset was used of characters shapes (26 characters of the Latin alphabet) carrying different levels of controlled noise and a dataset of fish images contours. A comparison with the use of the well-known methods of Fourier and wavelets descriptors was performed with the aim of verifying the performance of FDA method. The descriptor vectors were submitted to Linear Discriminant Analysis (LDA) classification method and we compared the correctness rate in the classification process among the descriptors methods. The results demonstrate that FDA overcomes the literature methods (Fourier and wavelets) in the processing of information extracted from the MFD signature. In this way, the proposed method can be considered as an interesting choice for pattern recognition and image classification using fractal analysis.

PedVis: A Structured, Space-Efficient Technique for Pedigree Visualization

Public genealogical databases are becoming increasingly populated with historical data and records of the current population`s ancestors. As this increasing amount of available information is used to link individuals to their ancestors, the resulting trees become deeper and more dense, which justifies the need for using organized, space-efficient layouts to display the data. Existing layouts are often only able to show a small subset of the data at a time. As a result, it is easy to become lost when navigating through the data or to lose sight of the overall tree structure. On the contrary, leaving space for unknown ancestors allows one to better understand the tree`s structure, but leaving this space becomes expensive and allows fewer generations to be displayed at a time. In this work, we propose that the H-tree based layout be used in genealogical software to display ancestral trees. We will show that this layout presents an increase in the number of displayable generations, provides a nicely arranged, symmetrical, intuitive and organized fractal structure, increases the user`s ability to understand and navigate through the data, and accounts for the visualization requirements necessary for displaying such trees. Finally, user-study results indicate potential for user acceptance of the new layout.

Coherent and semiclassical states in a magnetic field in the presence of the Aharonov-Bohm solenoid

A new approach to constructing coherent states (CS) and semiclassical states (SS) in a magnetic-solenoid field is proposed. The main idea is based on the fact that the AB solenoid breaks the translational symmetry in the xy-plane; this has a topological effect such that there appear two types of trajectories which embrace and do not embrace the solenoid. Due to this fact, one has to construct two different kinds of CS/SS which correspond to such trajectories in the semiclassical limit. Following this idea, we construct CS in two steps, first the instantaneous CS (ICS) and then the time-dependent CS/SS as an evolution of the ICS. The construction is realized for nonrelativistic and relativistic spinning particles both in (2 + 1) and (3 + 1) dimensions and gives a non-trivial example of SS/CS for systems with a nonquadratic Hamiltonian. It is stressed that CS depending on their parameters (quantum numbers) describe both pure quantum and semiclassical states. An analysis is represented that classifies parameters of the CS in such respect. Such a classification is used for the semiclassical decompositions of various physical quantities.

A new proposal for the picture changing operators in the minimal pure spinor formalism

Using a new proposal for the ""picture lowering"" operators, we compute the tree level scattering amplitude in the minimal pure spinor formalism by performing the integration over the pure spinor space as a multidimensional Cauchy-type integral. The amplitude will be written in terms of the projective pure spinor variables, which turns out to be useful to relate rigorously the minimal and non-minimal versions of the pure spinor formalism. The natural language for relating these formalisms is the. Cech-Dolbeault isomorphism. Moreover, the Dolbeault cocycle corresponding to the tree-level scattering amplitude must be evaluated in SO(10)/SU(5) instead of the whole pure spinor space, which means that the origin is removed from this space. Also, the. Cech-Dolbeault language plays a key role for proving the invariance of the scattering amplitude under BRST, Lorentz and supersymmetry transformations, as well as the decoupling of unphysical states. We also relate the Green`s function for the massless scalar field in ten dimensions to the tree-level scattering amplitude and comment about the scattering amplitude at higher orders. In contrast with the traditional picture lowering operators, with our new proposal the tree level scattering amplitude is independent of the constant spinors introduced to define them and the BRST exact terms decouple without integrating over these constant spinors.

Medical image retrieval based on complexity analysis

Texture is one of the most important visual attributes used in image analysis. It is used in many content-based image retrieval systems, where it allows the identification of a larger number of images from distinct origins. This paper presents a novel approach for image analysis and retrieval based on complexity analysis. The approach consists of a texture segmentation step, performed by complexity analysis through BoxCounting fractal dimension, followed by the estimation of complexity of each computed region by multiscale fractal dimension. Experiments have been performed with MRI database in both pattern recognition and image retrieval contexts. Results show the accuracy of the method and also indicate how the performance changes as the texture segmentation process is altered.

Texture analysis and classification using deterministic tourist walk

In this paper, we present a study on a deterministic partially self-avoiding walk (tourist walk), which provides a novel method for texture feature extraction. The method is able to explore an image on all scales simultaneously. Experiments were conducted using different dynamics concerning the tourist walk. A new strategy, based on histograms. to extract information from its joint probability distribution is presented. The promising results are discussed and compared to the best-known methods for texture description reported in the literature. (C) 2009 Elsevier Ltd. All rights reserved.

Texture analysis using graphs generated by deterministic partially self-avoiding walks

Texture is one of the most important visual attributes for image analysis. It has been widely used in image analysis and pattern recognition. A partially self-avoiding deterministic walk has recently been proposed as an approach for texture analysis with promising results. This approach uses walkers (called tourists) to exploit the gray scale image contexts in several levels. Here, we present an approach to generate graphs out of the trajectories produced by the tourist walks. The generated graphs embody important characteristics related to tourist transitivity in the image. Computed from these graphs, the statistical position (degree mean) and dispersion (entropy of two vertices with the same degree) measures are used as texture descriptors. A comparison with traditional texture analysis methods is performed to illustrate the high performance of this novel approach. (C) 2011 Elsevier Ltd. All rights reserved.

A complex network-based approach for boundary shape analysis

This paper introduces a novel methodology to shape boundary characterization, where a shape is modeled into a small-world complex network. It uses degree and joint degree measurements in a dynamic evolution network to compose a set of shape descriptors. The proposed shape characterization method has all efficient power of shape characterization, it is robust, noise tolerant, scale invariant and rotation invariant. A leaf plant classification experiment is presented on three image databases in order to evaluate the method and compare it with other descriptors in the literature (Fourier descriptors, Curvature, Zernike moments and multiscale fractal dimension). (C) 2008 Elsevier Ltd. All rights reserved.