Disconnected Skeleton: Shape at its Absolute Scale

We present a new skeletal representation along with a matching framework to address the deformable shape recognition problem. The disconnectedness arises as a result of excessive regularization that we use to describe a shape at an attainably coarse scale. Our motivation is to rely on the stable properties of the shape instead of inaccurately measured secondary details. The new representation does not suffer from the common instability problems of traditional connected skeletons, and the matching process gives quite successful results on a diverse database of 2D shapes. An important difference of our approach from the conventional use of the skeleton is that we replace the local coordinate frame with a global Euclidean frame supported by additional mechanisms to handle articulations and local boundary deformations. As a result, we can produce descriptions that are sensitive to any combination of changes in scale, position, orientation and articulation, as well as invariant ones.Comment: The work excluding {\S}V and {\S}VI has first appeared in 2005 ICCV: Aslan, C., Tari, S.: An Axis-Based Representation for Recognition. In ICCV(2005) 1339- 1346.; Aslan, C., : Disconnected Skeletons for Shape Recognition. Masters thesis, Department of Computer Engineering, Middle East Technical University, May 200

Adaptive Quantizers for Estimation

In this paper, adaptive estimation based on noisy quantized observations is studied. A low complexity adaptive algorithm using a quantizer with adjustable input gain and offset is presented. Three possible scalar models for the parameter to be estimated are considered: constant, Wiener process and Wiener process with deterministic drift. After showing that the algorithm is asymptotically unbiased for estimating a constant, it is shown, in the three cases, that the asymptotic mean squared error depends on the Fisher information for the quantized measurements. It is also shown that the loss of performance due to quantization depends approximately on the ratio of the Fisher information for quantized and continuous measurements. At the end of the paper the theoretical results are validated through simulation under two different classes of noise, generalized Gaussian noise and Student's-t noise

The impact of cellular characteristics on the evolution of shape homeostasis

The importance of individual cells in a developing multicellular organism is well known but precisely how the individual cellular characteristics of those cells collectively drive the emergence of robust, homeostatic structures is less well understood. For example cell communication via a diffusible factor allows for information to travel across large distances within the population, and cell polarisation makes it possible to form structures with a particular orientation, but how do these processes interact to produce a more robust and regulated structure? In this study we investigate the ability of cells with different cellular characteristics to grow and maintain homeostatic structures. We do this in the context of an individual-based model where cell behaviour is driven by an intra-cellular network that determines the cell phenotype. More precisely, we investigated evolution with 96 different permutations of our model, where cell motility, cell death, long-range growth factor (LGF), short-range growth factor (SGF) and cell polarisation were either present or absent. The results show that LGF has the largest positive impact on the fitness of the evolved solutions. SGF and polarisation also contribute, but all other capabilities essentially increase the search space, effectively making it more difficult to achieve a solution. By perturbing the evolved solutions, we found that they are highly robust to both mutations and wounding. In addition, we observed that by evolving solutions in more unstable environments they produce structures that were more robust and adaptive. In conclusion, our results suggest that robust collective behaviour is most likely to evolve when cells are endowed with long range communication, cell polarisation, and selection pressure from an unstable environment

Enhancing structure relaxations for first-principles codes: an approximate Hessian approach

We present a method for improving the speed of geometry relaxation by using a harmonic approximation for the interaction potential between nearest neighbor atoms to construct an initial Hessian estimate. The model is quite robust, and yields approximately a 30% or better reduction in the number of calculations compared to an optimized diagonal initialization. Convergence with this initializer approaches the speed of a converged BFGS Hessian, therefore it is close to the best that can be achieved. Hessian preconditioning is discussed, and it is found that a compromise between an average condition number and a narrow distribution in eigenvalues produces the best optimization.Comment: 9 pages, 3 figures, added references, expanded optimization sectio