Analysis of Two-Dimensional Non-Rigid Shapes

Analysis of deformable two-dimensional shapes is an important problem, encountered in numerous pattern recognition, computer vision and computer graphics applications. In this paper, we address three major problems in the analysis of non-rigid shapes: similarity, partial similarity, and correspondence. We present an axiomatic construction of similarity criteria for deformation-invariant shape comparison, based on intrinsic geometric properties of the shapes, and show that such criteria are related to the Gromov-Hausdorff distance. Next, we extend the problem of similarity computation to shapes which have similar parts but are dissimilar when considered as a whole, and present a construction of set-valued distances, based on the notion of Pareto optimality. Finally, we show that the correspondence between non-rigid shapes can be obtained as a byproduct of the non-rigid similarity problem. As a numerical framework, we use the generalized multidimensional scaling (GMDS) method, which is the numerical core of the three problems addressed in this paper.     

Over-Parameterized Variational Optical Flow

A novel optical flow estimation process based on a spatio-temporal model with varying coefficients multiplying a set of basis functions at each pixel is introduced. Previous optical flow estimation methodologies did not use such an over parameterized representation of the flow field as the problem is ill-posed even without introducing any additional parameters: Neighborhood based methods of the Lucas–Kanade type determine the flow at each pixel by constraining the flow to be described by a few parameters in small neighborhoods. Modern variational methods represent the optic flow directly via the flow field components at each pixel. The benefit of over-parametrization becomes evident in the smoothness term, which instead of directly penalizing for changes in the optic flow, accumulates a cost of deviating from the assumed optic flow model. Our proposed method is very general and the classical variational optical flow techniques are special cases of it, when used in conjunction with constant basis functions. Experimental results with the novel flow estimation process yield significant improvements with respect to the best results published so far.     

Parallel evolution using multi-chromosome cartesian genetic programming

Parallel and distributed methods for evolutionary algorithms have concentrated on maintaining multiple populations of genotypes, where each genotype in a population encodes a potential solution to the problem. In this paper, we investigate the parallelisation of the genotype itself into a collection of independent chromosomes which can be evaluated in parallel. We call this multi-chromosomal evolution (MCE). We test this approach using Cartesian Genetic Programming and apply MCE to a series of digital circuit design problems to compare the efficacy of MCE with a conventional single chromosome approach (SCE). MCE can be readily used for many digital circuits because they have multiple outputs. In MCE, an independent chromosome is assigned to each output. When we compare MCE with SCE we find that MCE allows us to evolve solutions much faster. In addition, in some cases we were able to evolve solutions with MCE that we unable to with SCE. In a case-study, we investigate how MCE can be applied to to a single objective problem in the domain of image classification, namely, the classification of breast X-rays for cancer. To apply MCE to this problem, we identify regions of interest (RoI) from the mammograms, divide the RoI into a collection of sub-images and use a chromosome to classify each sub-image. This problem allows us to evaluate various evolutionary mutation operators which can pairwise swap chromosomes either randomly or topographically or reuse chromosomes in place of other chromosomes.     

Toward the Proteome of the Human Peripheral Blood Eosinophil

Eosinophils (EOSs) are granular leukocytes that have significant roles in many inflammatory and immunoregulatory responses, especially asthma and allergic diseases. We have undertaken a fairly comprehensive proteomic analysis of purified peripheral blood EOSs from normal human donors primarily employing 2‐DE with protein spot identification by MALDI‐MS. Protein subfractionation methods employed included IEF (Zoom^® Fractionator) and subcellular fractionation using differential protein solubilization. We have identified 3141 proteins, which had Mascot expectation scores of 10^?3 or less. Of these 426 were unique and non‐redundant of which 231 were novel proteins not previously reported to occur in EOSs. Ingenuity Pathway Analysis showed that some 70% of the non‐redundant proteins could be subdivided into categories that are clearly related to currently known EOS biological activities. Cytoskeletal and associated proteins predominated among the proteins identified. Extensive protein posttranslational modifications were evident, many of which have not been previously reported that reflected the dynamic character of the EOS. This data set of eosinophilic proteins will prove valuable in comparative studies of disease versus normal states and for studies of gender differences and polymorphic variation among individuals.     

Threshold for Millimeter-Wave (60 GHz)-Induced Ocular Injury

Journal of Infrared, Millimeter, and Terahertz Waves - Millimeter waves (MMW) absorbed by skin or cornea may induce damage by heat. We have developed a 60 GHz MMW exposure-induced eye...     

Patch layout from feature graphs

The structuring of surface meshes is a labor intensive task in reverse engineering. For example, in CAD, scanned triangle meshes must be divided into characteristic/uniform patches to enable conversion into high-level spline surfaces. Typical industrial techniques, like rolling ball blends, are very labor intensive.We provide a novel, robust and quick algorithm for the automatic generation of a patch layout based on a topology consistent feature graph. The graph separates the surface along feature lines into functional and geometric building blocks. Our algorithm then thickens the edges of the feature graph and forms new regions with low varying curvature. Further, these new regions-so-called fillets and node patches-will have highly smooth boundary curves, making the algorithm an ideal preprocessor for a subsequent spline fitting algorithm.     

Method of classifier selection using the genetic approach

Abstract: The paper presents a novel machine learning algorithm used for training a compound classifier system that consists of a set of area classifiers. Area classifiers recognize objects derived from the respective competence area. Splitting feature space into areas and selecting area classifiers are two key processes of the algorithm; both take place simultaneously in the course of an optimization process aimed at maximizing the system performance. An evolutionary algorithm is used to find the optimal solution. A number of experiments have been carried out to evaluate system performance. The results prove that the proposed method outperforms each elementary classifier as well as simple voting.     

Model predictive control of a rotary cement kiln

A first principles model of a cement kiln is used to control and optimize the burning of clinker in the cement production process. The model considers heat transfer between a gas and a feed state via convection and radiation. Furthermore, it contains effects such as chemical reactions, feed transport, energy losses and energy input. A model predictive controller is used to stabilize a temperature profile along the rotary kiln, guarantee good combustion conditions and maximize production. Moving horizon estimation was used for online estimation of selected model parameters and unmeasured states. Results from the pilot site are presented.