Fast stereo matching by iterated dynamic programming and quadtree subregioning

The application of energy minimisation methods for stereo matching has been demonstrated to produce high quality disparity maps. However the majority of these methods are known to be computationally expensive, requiring minutes or even hours of computation. We propose a fast minimisation scheme that produces strongly competitive results for significantly reduced computation, requiring only a few seconds of computation. In this paper, we present our iterated dynamic programming algorithm along with a quadtree subregioning process for fast stereo matching.

Dynamic breast MRI: Image registration and its impact on enhancement curve estimation

A novel algorithm for performing registration of dynamic contrast-enhanced (DCE) MRI data of the breast is presented. It is based on an algorithm known as iterated dynamic programming originally devised to solve the stereo matching problem. Using artificially distorted DCE-MRI breast images it is shown that the proposed algorithm is able to correct for movement and distortions over a larger range than is likely to occur during routine clinical examination. In addition, using a clinical DCE-MRI data set with an expertly labeled suspicious region, it is shown that the proposed algorithm significantly reduces the variability of the enhancement curves at the pixel level yielding more pronounced uptake and washout phases.

On the forced matching numbers of bipartite graphs

Let G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G is a subset S of M, such that S is contained in no other perfect matching of G. This notion has arisen in the study of finding resonance structures of a given molecule in chemistry. Similar concepts have been studied for block designs and graph colorings under the name defining set, and for Latin squares under the name critical set. There is some study of forcing sets of hexagonal systems in the context of chemistry, but only a few other classes of graphs have been considered. For the hypercubes Q(n), it turns out to be a very interesting notion which includes many challenging problems. In this paper we study the computational complexity of finding the forcing number of graphs, and we give some results on the possible values of forcing number for different matchings of the hypercube Q(n). Also we show an application to critical sets in back circulant Latin rectangles. (C) 2003 Elsevier B.V. All rights reserved.

Complete modulational-instability gain spectrum of nonlinear quasi-phase-matching gratings

We consider plane waves propagating in quadratic nonlinear slab waveguides with nonlinear quasi-phase-matching gratings. We predict analytically and verify numerically the complete gain spectrum for transverse modulational instability, including hitherto undescribed higher-order gain bands. (C) 2004 Optical Society of America.

Applying machine learning to catalogue matching in astrophysics

We present the results of applying automated machine learning techniques to the problem of matching different object catalogues in astrophysics. In this study, we take two partially matched catalogues where one of the two catalogues has a large positional uncertainty. The two catalogues we used here were taken from the H I Parkes All Sky Survey (HIPASS) and SuperCOSMOS optical survey. Previous work had matched 44 per cent (1887 objects) of HIPASS to the SuperCOSMOS catalogue. A supervised learning algorithm was then applied to construct a model of the matched portion of our catalogue. Validation of the model shows that we achieved a good classification performance (99.12 per cent correct). Applying this model to the unmatched portion of the catalogue found 1209 new matches. This increases the catalogue size from 1887 matched objects to 3096. The combination of these procedures yields a catalogue that is 72 per cent matched.

Edge-to-edge matching model for predicting orientation relationships and habit planes-the improvements

The edge-to-edge matching model has been further developed along with the Cu/Cr system as an example. The conditions for zigzag atom rows to be matching directions are included and the critical value of interatomic spacing misfit along matching directions and the critical value of d-value mismatch between matching planes are proposed in the new version of the model. (c) 2005 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Crystallographic study of grain refinement in aluminum alloys using the edge-to-edge matching model

The edge-to-edge matching model for describing the interfacial crystallographic characteristics between two phases that are related by reproducible orientation relationships has been applied to the typical grain refiners in aluminum alloys. Excellent atomic matching between Al3Ti nucleating substrates, known to be effective nucleation sites for primary Al, and the Al matrix in both close packed directions and close packed planes containing these directions have been identified. The crystallographic features of the grain refiner and the Al matrix are very consistent with the edge-to-edge matching model. For three other typical grain refiners for Al alloys, TiC (when a = 0.4328 nm), TiB2 and AIB(2), the matching only occurs between the close packed directions in both phases and between the second close packed plane of the Al matrix and the second close packed plane of the refiners. According to the model, it is predicted that Al3Ti is a more powerful nucleating substrate for Al alloy than TiC, TiB2 and AlB2. This agrees with the previous experimental results. The present work shows that the edge-to-edge matching model has the potential to be a powerful tool in discovering new and more powerful grain refiners for Al alloys. (C) 2004 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Comments on edge-to-edge matching and the equivalence of the invariant line, Delta g and Moire fringe approaches to the crystallographic features of precipitates

Three apparently distinct and different approaches have been proposed to account for the crystallographic features of diffusion-controlled precipitation. These three models are based on (a) an invariant line in the habit plane, (b) the parallelism of a pair of Deltags that are perpendicular to the habit plane and (c) the parallelism of a pair of Moire fringes that are in turn parallel to the habit plane. The purpose of the present paper is to show that these approaches are in fact absolutely equivalent and that when certain conditions are satisfied they are essentially the same as the recent edge-to-edge matching model put forward by the authors. (C) 2004 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Edge-to-edge matching and its applications - Part I. Application to the simple HCP/BCC system

The edge-to-edge matching crystallographic model has been used to predict all the orientation relationships (OR) between crystals that have simple hexagonal close packed (HCP) and body-centered cubic (BCC) structures. Using the critical values for the interatomic spacing misfit along the matching directions and the cl-value mismatch between matching planes, the model predicted all the four common ORs, namely the Burgers OR, the Potter OR, the Pitsch-Schrader OR and the Rong Dunlop OR, together with the corresponding habit planes. Taking the c(H)/a(H) and a(H)/a(B) ratios as variables, where H and B denote the HCP and BCC structures respectively, the model also predicted the relationship between these variables and the four ORs. These predictions are perfectly consistent with the published experimental results. As was the case in the FCC/BCC system, the edge-to-edge matching model has been shown to be a powerful tool for predicting the crystallographic features of diffusion-controlled phase transformations. (C) 2004 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Edge-to-edge matching and its applications - Part II. Application to Mg-Al, Mg-Y and Mg-Mn alloys

A model for the crystallography and morphology of diffusion-controlled phase transformations - edge-to-edge matching - has been used to predict the orientation relationships (OR) and habit planes of precipitates Mg17Al12 in Mg-Al alloy, Mg24Y5 in Mg-Y alloy and alpha-Mn in Mg-Mn alloy. Based on the crystal structures and lattice parameters only, the model predicts that the possible ORs between Mg17Al12 and Mg matrix are the near Burgers OR, the Potter OR, the Gjonnes-Ostmoe OR and the Crawley OR. In the Mg-Y alloy, the OR between Mg24Y5 precipitates and the Mg matrix is predicted to be the Burgers OR only. The model also predicts that there are no reproducible ORs between alpha-Mn and Mg in the Mg-Mn alloy. Combining the edge-to-edge matching model and W. Zhang's Deltag approach, the habit plane and side facets of the precipitate for each OR can be determined. All the predicted ORs and the corresponding habit planes in Mg-Al and Mg-Y alloys agree very well with the experimental results. (C) 2004 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

The correspondence framework for 3D surface matching algorithms

Beyond the inherent technical challenges, current research into the three dimensional surface correspondence problem is hampered by a lack of uniform terminology, an abundance of application specific algorithms, and the absence of a consistent model for comparing existing approaches and developing new ones. This paper addresses these challenges by presenting a framework for analysing, comparing, developing, and implementing surface correspondence algorithms. The framework uses five distinct stages to establish correspondence between surfaces. It is general, encompassing a wide variety of existing techniques, and flexible, facilitating the synthesis of new correspondence algorithms. This paper presents a review of existing surface correspondence algorithms, and shows how they fit into the correspondence framework. It also shows how the framework can be used to analyse and compare existing algorithms and develop new algorithms using the framework's modular structure. Six algorithms, four existing and two new, are implemented using the framework. Each implemented algorithm is used to match a number of surface pairs. Results demonstrate that the correspondence framework implementations are faithful implementations of existing algorithms, and that powerful new surface correspondence algorithms can be created. (C) 2004 Elsevier Inc. All rights reserved.

Matching conditional moments in PDF modelling of nonpremixed combustion

The rate of generation of fluctuations with respect to the scalar values conditioned on the mixture fraction, which significantly affects turbulent nonpremixed combustion processes, is examined. Simulation of the rate in a major mixing model is investigated and the derived equations can assist in selecting the model parameters so that the level of conditional fluctuations is better reproduced by the models. A more general formulation of the multiple mapping conditioning (MMC) model that distinguishes the reference and conditioning variables is suggested. This formulation can be viewed as a methodology of enforcing certain desired conditional properties onto conventional mixing models. Examples of constructing consistent MMC models with dissipation and velocity conditioning as well as of combining MMC with large eddy simulations (LES) are also provided. (c) 2005 The Combustion Institute. Published by Elsevier Inc. All rights reserved.