Multiple paths extraction in images using a constrained expanded trellis

Single shortest path extraction algorithms have been used in a number of areas such as network flow and image analysis. In image analysis, shortest path techniques can be used for object boundary detection, crack detection, or stereo disparity estimation. Sometimes one needs to find multiple paths as opposed to a single path in a network or an image where the paths must satisfy certain constraints. In this paper, we propose a new algorithm to extract multiple paths simultaneously within an image using a constrained expanded trellis (CET) for feature extraction and object segmentation. We also give a number of application examples for our multiple paths extraction algorithm.

A Bayesian approach to imposing curvature on distance functions

The estimated parameters of output distance functions frequently violate the monotonicity, quasi-convexity and convexity constraints implied by economic theory, leading to estimated elasticities and shadow prices that are incorrectly signed, and ultimately to perverse conclusions concerning the effects of input and output changes on productivity growth and relative efficiency levels. We show how a Bayesian approach can be used to impose these constraints on the parameters of a translog output distance function. Implementing the approach involves the use of a Gibbs sampler with data augmentation. A Metropolis-Hastings algorithm is also used within the Gibbs to simulate observations from truncated pdfs. Our methods are developed for the case where panel data is available and technical inefficiency effects are assumed to be time-invariant. Two models-a fixed effects model and a random effects model-are developed and applied to panel data on 17 European railways. We observe significant changes in estimated elasticities and shadow price ratios when regularity restrictions are imposed. (c) 2004 Elsevier B.V. All rights reserved.

A geometric approach to quantum circuit lower bounds

What is the minimal size quantum circuit required to exactly implement a specified n-qubit unitary operation, U, without the use of ancilla qubits? We show that a lower bound on the minimal size is provided by the length of the minimal geodesic between U and the identity, I, where length is defined by a suitable Finsler metric on the manifold SU(2(n)). The geodesic curves on these manifolds have the striking property that once an initial position and velocity are set, the remainder of the geodesic is completely determined by a second order differential equation known as the geodesic equation. This is in contrast with the usual case in circuit design, either classical or quantum, where being given part of an optimal circuit does not obviously assist in the design of the rest of the circuit. Geodesic analysis thus offers a potentially powerful approach to the problem of proving quantum circuit lower bounds. In this paper we construct several Finsler metrics whose minimal length geodesics provide lower bounds on quantum circuit size. For each Finsler metric we give a procedure to compute the corresponding geodesic equation. We also construct a large class of solutions to the geodesic equation, which we call Pauli geodesics, since they arise from isometries generated by the Pauli group. For any unitary U diagonal in the computational basis, we show that: (a) provided the minimal length geodesic is unique, it must be a Pauli geodesic; (b) finding the length of the minimal Pauli geodesic passing from I to U is equivalent to solving an exponential size instance of the closest vector in a lattice problem (CVP); and (c) all but a doubly exponentially small fraction of such unitaries have minimal Pauli geodesics of exponential length.

Geodesics without differential equations: general relativistic calculations for introductory modern physics classes

Introductory courses covering modem physics sometimes introduce some elementary ideas from general relativity, though the idea of a geodesic is generally limited to shortest Euclidean length on a curved surface of two spatial dimensions rather than extremal aging in spacetime. It is shown that Epstein charts provide a simple geometric picture of geodesics in one space and one time dimension and that for a hypothetical uniform gravitational field, geodesics are straight lines on a planar diagram. This means that the properties of geodesics in a uniform field can be calculated with only a knowledge of elementary geometry and trigonometry, thus making the calculation of some basic results of general relativity accessible to students even in an algebra-based survey course on physics.

Yield functions for porous materials with cubic symmetry using different definitions of yield

Plastic yield criteria for porous ductile materials are explored numerically using the finite-element technique. The cases of spherical voids arranged in simple cubic, body-centred cubic and face-centred cubic arrays are investigated with void volume fractions ranging from 2 % through to the percolation limit (over 90 %). Arbitrary triaxial macroscopic stress states and two definitions of yield are explored. The numerical data demonstrates that the yield criteria depend linearly on the determinant of the macroscopic stress tensor for the case of simple-cubic and body-centred cubic arrays - in contrast to the famous Gurson-Tvergaard-Needleman (GTN) formula - while there is no such dependence for face-centred cubic arrays within the accuracy of the finite-element discretisation. The data are well fit by a simple extension of the GTN formula which is valid for all void volume fractions, with yield-function convexity constraining the form of the extension in terms of parameters in the original formula. Simple cubic structures are more resistant to shear, while body-centred and face-centred structures are more resistant to hydrostatic pressure. The two yield surfaces corresponding to the two definitions of yield are not related by a simple scaling.