Shape alterations in the striatum in chorea-acanthocytosis

Chorea-acanthocytosis (ChAc) is an uncommon autosomal recessive disorder due to mutations of the VPS13A gene, which encodes for the membrane protein chorein. ChAc presents with progressive limb and orobuccal chorea, but there is often a marked dysexecutive syndrome. ChAc may first present with neuropsychiatric disturbance such as obsessive-compulsive disorder (OCD), suggesting a particular role for disruption to striatal structures involved in non-motor frontostriatal loops, such as the head of the caudate nucleus. Two previous studies have suggested a marked reduction in volume in the caudate nucleus and putamen, but did not examine morphometric change. We investigated morphometric change in 13 patients with genetically or biochemically confirmed ChAc and 26 age- and gender-matched controls. Subjects underwent magnetic resonance imaging and manual segmentation of the caudate nucleus and putamen, and shape analysis using a non-parametric spherical harmonic technique. Both structures showed significant and marked reductions in volume compared with controls, with reduction greatest in the caudate nucleus. Both structures showed significant shape differences, particularly in the head of the caudate nucleus. No significant correlation was shown between duration of illness and striatal volume or shape, suggesting that much structural change may have already taken place at the time of symptom onset. Our results suggest that striatal neuron loss may occur early in the disease process, and follows a dorsal-ventral gradient that may correlate with early neuropsychiatric and cognitive presentations of the disease. (C) 2010 Elsevier Ireland Ltd. All rights reserved.

Head shape evolution in Tropidurinae lizards: does locomotion constrain diet?

Different components of complex integrated systems may be specialized for different functions, and thus the selective pressures acting on the system as a whole may be conflicting and can ultimately constrain organismal performance and evolution. The vertebrate cranial system is one of the most striking examples of a complex system with several possible functions, being associated to activities as different as locomotion, prey capture, display and defensive behaviours. Therefore, selective pressures on the cranial system as a whole are possibly complex and may be conflicting. The present study focuses on the influence of potentially conflicting selective pressures (diet vs. locomotion) on the evolution of head shape in Tropidurinae lizards. For example, the expected adaptations leading to flat heads and bodies in species living on vertical structures may conflict with the need for improved bite performance associated with the inclusion of hard or tough prey into the diet, a common phenomenon in Tropidurinae lizards. Body size and six variables describing head shape were quantified in preserved specimens of 23 species, and information on diet and substrate usage was obtained from the literature. No phylogenetic signal was observed in the morphological data at any branch length tested, suggesting adaptive evolution of head shape in Tropidurinae. This pattern was confirmed by both factor analysis and independent contrast analysis, which suggested adaptive co-variation between the head shape and the inclusion of hard prey into the diet. In contrast to our expectations, habitat use did not constrain or drive head shape evolution in the group.

Shape and size of red blood cells from the Pygoscelid penguins of Antarctica using atomic force microscopy

Antarctic biodiversity is evolutionarily complex, reflecting the extreme ambient conditions. Therefore, Antarctic organisms exhibit sophisticated adaptations in all organization levels, including organs, tissues, and cells. Since red blood cells (RBCs) travel through the vertebrates blood delivering O(2) to all tissues and organs and purging the unwanted CO(2), they represent an interesting model to investigate biological adaptations. We have used atomic force microscopy (AFM) to compare the shape and size of RBCs of the Pygoscelid penguins. A total of 18 landmarks were measured in AFM images. When analyzed individually, the parameters were not capable of discriminating the RBCs of each species. However, the simultaneous use of multiple parameters discriminated (74%) among the RBCs. In addition, the use of RBC measurements was sufficient to hierarchically cluster the species in accordance to other common and reliable phylogenetic strategies. In light of these results, the use of RBC characters could effectively benefit taxonomic inferences.

Evolutionary fuzzy clustering of relational data

This paper is concerned with the computational efficiency of fuzzy clustering algorithms when the data set to be clustered is described by a proximity matrix only (relational data) and the number of clusters must be automatically estimated from such data. A fuzzy variant of an evolutionary algorithm for relational clustering is derived and compared against two systematic (pseudo-exhaustive) approaches that can also be used to automatically estimate the number of fuzzy clusters in relational data. An extensive collection of experiments involving 18 artificial and two real data sets is reported and analyzed. (C) 2011 Elsevier B.V. All rights reserved.

On the efficiency of evolutionary fuzzy clustering

This paper tackles the problem of showing that evolutionary algorithms for fuzzy clustering can be more efficient than systematic (i.e. repetitive) approaches when the number of clusters in a data set is unknown. To do so, a fuzzy version of an Evolutionary Algorithm for Clustering (EAC) is introduced. A fuzzy cluster validity criterion and a fuzzy local search algorithm are used instead of their hard counterparts employed by EAC. Theoretical complexity analyses for both the systematic and evolutionary algorithms under interest are provided. Examples with computational experiments and statistical analyses are also presented.

Fiedler trees for multiscale surface analysis

In this work we introduce a new hierarchical surface decomposition method for multiscale analysis of surface meshes. In contrast to other multiresolution methods, our approach relies on spectral properties of the surface to build a binary hierarchical decomposition. Namely, we utilize the first nontrivial eigenfunction of the Laplace-Beltrami operator to recursively decompose the surface. For this reason we coin our surface decomposition the Fiedler tree. Using the Fiedler tree ensures a number of attractive properties, including: mesh-independent decomposition, well-formed and nearly equi-areal surface patches, and noise robustness. We show how the evenly distributed patches can be exploited for generating multiresolution high quality uniform meshes. Additionally, our decomposition permits a natural means for carrying out wavelet methods, resulting in an intuitive method for producing feature-sensitive meshes at multiple scales. Published by Elsevier Ltd.

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.

On the efficiency of data representation on the modeling and characterization of complex networks

Specific choices about how to represent complex networks can have a substantial impact on the execution time required for the respective construction and analysis of those structures. In this work we report a comparison of the effects of representing complex networks statically by adjacency matrices or dynamically by adjacency lists. Three theoretical models of complex networks are considered: two types of Erdos-Renyi as well as the Barabasi-Albert model. We investigated the effect of the different representations with respect to the construction and measurement of several topological properties (i.e. degree, clustering coefficient, shortest path length, and betweenness centrality). We found that different forms of representation generally have a substantial effect on the execution time, with the sparse representation frequently resulting in remarkably superior performance. (C) 2011 Elsevier B.V. All rights reserved.

Joint Experimental and Theoretical Analysis of Order Disorder Effects in Cubic BaZrO(3) Assembled Nanoparticles under Decaoctahedral Shape

Periodic first-principles calculations based on density functional theory at the B3LYP level has been carried out to investigate the photoluminescence (PL) emission of BaZrO(3) assembled nanoparticles at room temperature. The defect created in the nanocrystals and their resultant electronic features lead to a diversification of electronic recombination within the BaZrO(3) band gap. Its optical phenomena are discussed in the light of photoluminescence emission at the green-yellow region around 570 nm. The theoretical model for displaced atoms and/or angular changes leads to the breaking of the local symmetry, which is based on the refined structure provided by Rietveld methodology. For each situation a band structure, charge mapping, and density of states were built and analyzed. X-ray diffraction (XRD) patterns, UV-vis measurements, and field emission scanning electron microscopy (FE-SEM) images are essential for a full evaluation of the crystal structure and morphology.

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.

Multiscale Curvature Analysis of Asphaltic Aggregate Particles

A new method for characterization and analysis of asphaltic mixtures aggregate particles is reported. By relying on multiscale representation of the particles, curvature estimation, and discriminant analysis for optimal separation of the categories of mixtures, a particularly effective and comprehensive methodology is obtained. The potential of the methodology is illustrated with respect to three important types of particles used in asphaltic mixtures, namely basalt, gabbro, and gravel. The obtained results show that gravel particles are markedly distinct from the other two types of particles, with the gabbro category resulting with intermediate geometrical properties. The importance of each considered measurement in the discrimination between the three categories of particles was also quantified in terms of the adopted discriminant analysis.

Two- and three-dimensional shape fabric analysis by the intercept method in grey levels

The count intercept is a robust method for the numerical analysis of fabrics Launeau and Robin (1996). It counts the number of intersections between a set of parallel scan lines and a mineral phase, which must be identified on a digital image. However, the method is only sensitive to boundaries and therefore supposes the user has some knowledge about their significance. The aim of this paper is to show that a proper grey level detection of boundaries along scan lines is sufficient to calculate the two-dimensional anisotropy of grain or crystal distributions without any particular image processing. Populations of grains and crystals usually display elliptical anisotropies in rocks. When confirmed by the intercept analysis, a combination of a minimum of 3 mean length intercept roses, taken on 3 more or less perpendicular sections, allows the calculation of 3-dimensional ellipsoids and the determination of their standard deviation with direction and intensity in 3 dimensions as well. The feasibility of this quick method is attested by numerous examples on theoretical objects deformed by active and passive deformation, on BSE images of synthetic magma flow, on drawing or direct analysis of thin section pictures of sandstones and on digital images of granites directly taken and measured in the field. (C) 2010 Elsevier B.V. All rights reserved.

3D face computational photography using PCA spaces

In this paper, we present a 3D face photography system based on a facial expression training dataset, composed of both facial range images (3D geometry) and facial texture (2D photography). The proposed system allows one to obtain a 3D geometry representation of a given face provided as a 2D photography, which undergoes a series of transformations through the texture and geometry spaces estimated. In the training phase of the system, the facial landmarks are obtained by an active shape model (ASM) extracted from the 2D gray-level photography. Principal components analysis (PCA) is then used to represent the face dataset, thus defining an orthonormal basis of texture and another of geometry. In the reconstruction phase, an input is given by a face image to which the ASM is matched. The extracted facial landmarks and the face image are fed to the PCA basis transform, and a 3D version of the 2D input image is built. Experimental tests using a new dataset of 70 facial expressions belonging to ten subjects as training set show rapid reconstructed 3D faces which maintain spatial coherence similar to the human perception, thus corroborating the efficiency and the applicability of the proposed system.

Improved likelihood inference for the shape parameter in Weibull regression

We obtain adjustments to the profile likelihood function in Weibull regression models with and without censoring. Specifically, we consider two different modified profile likelihoods: (i) the one proposed by Cox and Reid [Cox, D.R. and Reid, N., 1987, Parameter orthogonality and approximate conditional inference. Journal of the Royal Statistical Society B, 49, 1-39.], and (ii) an approximation to the one proposed by Barndorff-Nielsen [Barndorff-Nielsen, O.E., 1983, On a formula for the distribution of the maximum likelihood estimator. Biometrika, 70, 343-365.], the approximation having been obtained using the results by Fraser and Reid [Fraser, D.A.S. and Reid, N., 1995, Ancillaries and third-order significance. Utilitas Mathematica, 47, 33-53.] and by Fraser et al. [Fraser, D.A.S., Reid, N. and Wu, J., 1999, A simple formula for tail probabilities for frequentist and Bayesian inference. Biometrika, 86, 655-661.]. We focus on point estimation and likelihood ratio tests on the shape parameter in the class of Weibull regression models. We derive some distributional properties of the different maximum likelihood estimators and likelihood ratio tests. The numerical evidence presented in the paper favors the approximation to Barndorff-Nielsen`s adjustment.

Matrix Representation of the Stationary Measure for the Multispecies TASEP

In this work we construct the stationary measure of the N species totally asymmetric simple exclusion process in a matrix product formulation. We make the connection between the matrix product formulation and the queueing theory picture of Ferrari and Martin. In particular, in the standard representation, the matrices act on the space of queue lengths. For N > 2 the matrices in fact become tensor products of elements of quadratic algebras. This enables us to give a purely algebraic proof of the stationary measure which we present for N=3.