Application of the Fisher-Rao metric to ellipse detection

The parameter space for the ellipses in a two dimensional image is a five dimensional manifold, where each point of the manifold corresponds to an ellipse in the image. The parameter space becomes a Riemannian manifold under a Fisher-Rao metric, which is derived from a Gaussian model for the blurring of ellipses in the image. Two points in the parameter space are close together under the Fisher-Rao metric if the corresponding ellipses are close together in the image. The Fisher-Rao metric is accurately approximated by a simpler metric under the assumption that the blurring is small compared with the sizes of the ellipses under consideration. It is shown that the parameter space for the ellipses in the image has a finite volume under the approximation to the Fisher-Rao metric. As a consequence the parameter space can be replaced, for the purpose of ellipse detection, by a finite set of points sampled from it. An efficient algorithm for sampling the parameter space is described. The algorithm uses the fact that the approximating metric is flat, and therefore locally Euclidean, on each three dimensional family of ellipses with a fixed orientation and a fixed eccentricity. Once the sample points have been obtained, ellipses are detected in a given image by checking each sample point in turn to see if the corresponding ellipse is supported by the nearby image pixel values. The resulting algorithm for ellipse detection is implemented. A multiresolution version of the algorithm is also implemented. The experimental results suggest that ellipses can be reliably detected in a given low resolution image and that the number of false detections can be reduced using the multiresolution algorithm

Note on a Micropolar Gas-Kinetic Theory

The micropolar fluid mechanics and its transport coefficients are derived from the linearized Boltzmann equation of rotating particles. In the dilute limit, as expected, transport coefficients relating to microrotation are not important, but the results are useful for the description of collisional granular flow on an inclined slope. (This paper will be published in Traffic and Granular Flow 2001 edited by Y.Sugiyama and D. E. Wolf (Springer))Comment: 15 pages, 0 figure. To be published in Traffic and Granular Flow 2001 edited by Y.Sugiyama and D. E. Wolf (Springer

Fast and Accurate Camera Covariance Computation for Large 3D Reconstruction

Estimating uncertainty of camera parameters computed in Structure from Motion (SfM) is an important tool for evaluating the quality of the reconstruction and guiding the reconstruction process. Yet, the quality of the estimated parameters of large reconstructions has been rarely evaluated due to the computational challenges. We present a new algorithm which employs the sparsity of the uncertainty propagation and speeds the computation up about ten times \wrt previous approaches. Our computation is accurate and does not use any approximations. We can compute uncertainties of thousands of cameras in tens of seconds on a standard PC. We also demonstrate that our approach can be effectively used for reconstructions of any size by applying it to smaller sub-reconstructions.Comment: ECCV 201

Stress and Strain in Flat Piling of Disks

We have created a flat piling of disks in a numerical experiment using the Distinct Element Method (DEM) by depositing them under gravity. In the resulting pile, we then measured increments in stress and strain that were associated with a small decrease in gravity. We first describe the stress in terms of the strain using isotropic elasticity theory. Then, from a micro-mechanical view point, we calculate the relation between the stress and strain using the mean strain assumption. We compare the predicted values of Young's modulus and Poisson's ratio with those that were measured in the numerical experiment.Comment: 9 pages, 1 table, 8 figures, and 2 pages for captions of figure

A Fisher-Rao metric for paracatadioptric images of lines

In a central paracatadioptric imaging system a perspective camera takes an image of a scene reflected in a paraboloidal mirror. A 360° field of view is obtained, but the image is severely distorted. In particular, straight lines in the scene project to circles in the image. These distortions make it diffcult to detect projected lines using standard image processing algorithms. The distortions are removed using a Fisher-Rao metric which is defined on the space of projected lines in the paracatadioptric image. The space of projected lines is divided into subsets such that on each subset the Fisher-Rao metric is closely approximated by the Euclidean metric. Each subset is sampled at the vertices of a square grid and values are assigned to the sampled points using an adaptation of the trace transform. The result is a set of digital images to which standard image processing algorithms can be applied. The effectiveness of this approach to line detection is illustrated using two algorithms, both of which are based on the Sobel edge operator. The task of line detection is reduced to the task of finding isolated peaks in a Sobel image. An experimental comparison is made between these two algorithms and third algorithm taken from the literature and based on the Hough transform

A QCQP Approach to Triangulation

Triangulation of a three-dimensional point from at least two noisy 2-D images can be formulated as a quadratically constrained quadratic program. We propose an algorithm to extract candidate solutions to this problem from its semidefinite programming relaxations. We then describe a sufficient condition and a polynomial time test for certifying when such a solution is optimal. This test has no false positives. Experiments indicate that false negatives are rare, and the algorithm has excellent performance in practice. We explain this phenomenon in terms of the geometry of the triangulation problem.Comment: 14 pages, to appear in the proceedings of the 12th European Conference of Computer Vision, Firenze, Italy, 7-13 October 201

Euclidean Structure from N>=2 Parallel Circles: Theory and Algorithms

International audienceOur problem is that of recovering, in one view, the 2D Euclidean structure, induced by the projections of N parallel circles. This structure is a prerequisite for camera calibration and pose computation. Until now, no general method has been described for N > 2. The main contribution of this work is to state the problem in terms of a system of linear equations to solve.We give a closed-form solution as well as bundle adjustment-like refinements, increasing the technical applicability and numerical stability. Our theoretical approach generalizes and extends all those described in existing works for N = 2 in several respects, as we can treat simultaneously pairs of orthogonal lines and pairs of circles within a unified framework. The proposed algorithm may be easily implemented, using well-known numerical algorithms. Its performance is illustrated by simulations and experiments with real images

Distance Optimization and the Extremal Variety of the Grassmann Variety

The approximation of a multivector by a decomposable one is a distance-optimization problem between the multivector and the Grassmann variety of lines in a projective space. When the multivector diverges from the Grassmann variety, then the approximate solution sought is the worst possible. In this paper, it is shown that the worst solution of this problem is achieved, when the eigenvalues of the matrix representation of a related two-vector are all equal. Then, all these pathological points form a projective variety. We derive the equation describing this projective variety, as well as its maximum distance from the corresponding Grassmann variety. Several geometric and algebraic properties of this extremal variety are examined, providing a new aspect for the Grassmann varieties and the respective projective spaces

Transcriptomic identification of starfish neuropeptide precursors yields new insights into neuropeptide evolution

Published by the Royal Society under the terms of the Creative Commons Attribution License http://creativecommons.org/licenses/by/4.0/, which permits unrestricted use, provided the original author and source are credited.This work was supported by a PhD studentship funded by QMUL and awarded to D.C.S. and a Leverhulme Trust grant (RPG- 2013-351) awarded to M.R.E. Sequencing of the A. rubens neural transcriptome was funded by an EPSRC grant (EP/J501360/1