Vectorizing Face Images by Interpreting Shape and Texture Computations

The correspondence problem in computer vision is basically a matching task between two or more sets of features. In this paper, we introduce a vectorized image representation, which is a feature-based representation where correspondence has been established with respect to a reference image. This representation has two components: (1) shape, or (x, y) feature locations, and (2) texture, defined as the image grey levels mapped onto the standard reference image. This paper explores an automatic technique for "vectorizing" face images. Our face vectorizer alternates back and forth between computation steps for shape and texture, and a key idea is to structure the two computations so that each one uses the output of the other. A hierarchical coarse-to-fine implementation is discussed, and applications are presented to the problems of facial feature detection and registration of two arbitrary faces.

Coordinate-Independent Computations on Differential Equations

This project investigates the computational representation of differentiable manifolds, with the primary goal of solving partial differential equations using multiple coordinate systems on general n- dimensional spaces. In the process, this abstraction is used to perform accurate integrations of ordinary differential equations using multiple coordinate systems. In the case of linear partial differential equations, however, unexpected difficulties arise even with the simplest equations.

Deterministic Computations Whose History Is Independent of the Order of Asynchronous Updating

Consider a network of processors (sites) in which each site x has a finite set N(x) of neighbors. There is a transition function f that for each site x computes the next state ξ(x) from the states in N(x). But these transitions (updates) are applied in arbitrary order, one or many at a time. If the state of site x at time t is η(x; t) then let us define the sequence ζ(x; 0); ζ(x; 1), ... by taking the sequence η(x; 0),η(x; 1), ... , and deleting each repetition, i.e. each element equal to the preceding one. The function f is said to have invariant histories if the sequence ζ(x; i), (while it lasts, in case it is finite) depends only on the initial configuration, not on the order of updates. This paper shows that though the invariant history property is typically undecidable, there is a useful simple sufficient condition, called commutativity: For any configuration, for any pair x; y of neighbors, if the updating would change both ξ(x) and ξ(y) then the result of updating first x and then y is the same as the result of doing this in the reverse order. This fact is derivable from known results on the confluence of term-rewriting systems but the self-contained proof given here may be justifiable.

Development of numerical techniques for near-field aeroacoustic computations

This work is concerned with the development of a numerical scheme capable of producing accurate simulations of sound propagation in the presence of a mean flow field. The method is based on the concept of variable decomposition, which leads to two separate sets of equations. These equations are the linearised Euler equations and the Reynolds-averaged Navier–Stokes equations. This paper concentrates on the development of numerical schemes for the linearised Euler equations that leads to a computational aeroacoustics (CAA) code. The resulting CAA code is a non-diffusive, time- and space-staggered finite volume code for the acoustic perturbation, and it is validated against analytic results for pure 1D sound propagation and 2D benchmark problems involving sound scattering from a cylindrical obstacle. Predictions are also given for the case of prescribed source sound propagation in a laminar boundary layer as an illustration of the effects of mean convection. Copyright © 1999 John Wiley & Sons, Ltd.

Three-phase computations of the continuous casting process

In this paper, the continuous casting process for steel slab production is modelled using a mult-physics approach. For this purpose, a Finite Volume (FV) numerical model was constructed in 3D, with the following characteristics: Time dependent, turbulent fluid flow and heat transfer in the molten steel and flux regions, solidification of the skin layer, under prescribed heat loss boundary conditions, particle tracking simulation of argon bubbles injected with the metal into the mould, full coupling between bubbles and liquid through buoyancy and interfacial forces using a novel gas accumulation technique, and a full transient simulation of flux-metal interface behaviour under the influence of gravity and fluid inertial forces and bubble plume buoyancy. The unstructure mesh FV code PHYSICA developed at Greenwich was used for carry out the simulations with physical process data and properties supplied by IRSID SA.

Fixed-node diffusion Monte Carlo computations for closed-shell jellium spheres

Fixed-node diffusion Monte Carlo computations are used to determine the ground state energy and electron density for jellium spheres with up to N = 106 electrons and background densities corresponding to the electron gas parameter 1 less than or equal to r(s)less than or equal to5.62. We analyze the density and size dependence of the surface energy, and we extrapolate our data to the thermodynamic limit. The results agree well with the predictions of density functional computations using the local density approximation. In the case of N = 20, we extend our computation to higher densities and identify a transition between atomic- and jelliumlike nodal structures occurring at the background density corresponding to r(s)=0.13. In this case the local density approximation is unable to reproduce the changes in the correlation energy due to the discontinuous transition in the ground state nodal structure. We discuss the relevance of our results for nonlocal approximations to density functional theory.

Local and semilocal density functional computations for crystals of 1-alkyl-3-methyl-imidazolium salts

The accuracy and reliability of popular density functional approximations for the compounds giving origin to room temperature ionic liquids have been assessed by computing the T=0 K crystal structure of several 1-alkyl-3-methyl-imidazolium salts. Two prototypical exchange-correlation approximations have been considered, i.e., the local density approximation (LDA) and one gradient corrected scheme [PBE-GGA, Phys. Rev. Lett. 77, 3865 (1996)]. Comparison with low-temperature x-ray diffraction data shows that the equilibrium volume predicted by either approximations is affected by large errors, nearly equal in magnitude (~10%), and of opposite sign. In both cases the error can be traced to a poor description of the intermolecular interactions, while the intramolecular structure is fairly well reproduced by LDA and PBE-GGA. The PBE-GGA optimization of atomic positions within the experimental unit cell provides results in good agreement with the x-ray structure. The correct system volume can also be restored by supplementing PBE-GGA with empirical dispersion terms reproducing the r-6 attractive tail of the van der Waals interactions.

VLSI processor for high-performance arithmetic computations

A high performance VLSI architecture to perform combined multiply-accumulate, divide, and square root operations is proposed. The circuit is highly regular, requires only minimal control, and can be pipelined right down to the bit level. The system can also be reconfigured on every cycle to perform one or more of these operations. The throughput rate for each operation is the same and is wordlength independent. This is achieved using redundant arithmetic. With current CMOS technology, throughput rates in excess of 80 million operations per second are expected.

Structured data access annotations for massively parallel computations

We describe an approach aimed at addressing the issue of joint exploitation of control (stream) and data parallelism in a skeleton based parallel programming environment, based on annotations and refactoring. Annotations drive efficient implementation of a parallel computation. Refactoring is used to transform the associated skeleton tree into a more efficient, functionally equivalent skeleton tree. In most cases, cost models are used to drive the refactoring process. We show how sample use case applications/kernels may be optimized and discuss preliminary experiments with FastFlow assessing the theoretical results. © 2013 Springer-Verlag.