Detection of image structures using the Fisher information and the Rao metric

In many detection problems, the structures to be detected are parameterized by the points of a parameter space. If the conditional probability density function for the measurements is known, then detection can be achieved by sampling the parameter space at a finite number of points and checking each point to see if the corresponding structure is supported by the data. The number of samples and the distances between neighboring samples are calculated using the Rao metric on the parameter space. The Rao metric is obtained from the Fisher information which is, in turn, obtained from the conditional probability density function. An upper bound is obtained for the probability of a false detection. The calculations are simplified in the low noise case by making an asymptotic approximation to the Fisher information. An application to line detection is described. Expressions are obtained for the asymptotic approximation to the Fisher information, the volume of the parameter space, and the number of samples. The time complexity for line detection is estimated. An experimental comparison is made with a Hough transform-based method for detecting lines

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

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

The Fisher-Rao metric for projective transformations of the line

A conditional probability density function is defined for measurements arising from a projective transformation of the line. The conditional density is a member of a parameterised family of densities in which the parameter takes values in the three dimensional manifold of projective transformations of the line. The Fisher information of the family defines on the manifold a Riemannian metric known as the Fisher-Rao metric. The Fisher-Rao metric has an approximation which is accurate if the variance of the measurement errors is small. It is shown that the manifold of parameter values has a finite volume under the approximating metric. These results are the basis of a simple algorithm for detecting those projective transformations of the line which are compatible with a given set of measurements. The algorithm searches a finite list of representative parameter values for those values compatible with the measurements. Experiments with the algorithm suggest that it can detect a projective transformation of the line even when the correspondences between the components of the measurements in the domain and the range of the projective transformation are unknown

From the Jordan product to Riemannian geometries on classical and quantum states

The Jordan product on the self-adjoint part of a finite-dimensional $C^{*}$-algebra $\mathscr{A}$ is shown to give rise to Riemannian metric tensors on suitable manifolds of states on $\mathscr{A}$, and the covariant derivative, the geodesics, the Riemann tensor, and the sectional curvature of all these metric tensors are explicitly computed. In particular, it is proved that the Fisher--Rao metric tensor is recovered in the Abelian case, that the Fubini--Study metric tensor is recovered when we consider pure states on the algebra $\mathcal{B}(\mathcal{H})$ of linear operators on a finite-dimensional Hilbert space $\mathcal{H}$, and that the Bures--Helstrom metric tensors is recovered when we consider faithful states on $\mathcal{B}(\mathcal{H})$. Moreover, an alternative derivation of these Riemannian metric tensors in terms of the GNS construction associated to a state is presented. In the case of pure and faithful states on $\mathcal{B}(\mathcal{H})$, this alternative geometrical description clarifies the analogy between the Fubini--Study and the Bures--Helstrom metric tensor.Comment: 32 pages. Minor improvements. References added. Comments are welcome

Beyond Gauss: Image-Set Matching on the Riemannian Manifold of PDFs

State-of-the-art image-set matching techniques typically implicitly model each image-set with a Gaussian distribution. Here, we propose to go beyond these representations and model image-sets as probability distribution functions (PDFs) using kernel density estimators. To compare and match image-sets, we exploit Csiszar f-divergences, which bear strong connections to the geodesic distance defined on the space of PDFs, i.e., the statistical manifold. Furthermore, we introduce valid positive definite kernels on the statistical manifolds, which let us make use of more powerful classification schemes to match image-sets. Finally, we introduce a supervised dimensionality reduction technique that learns a latent space where f-divergences reflect the class labels of the data. Our experiments on diverse problems, such as video-based face recognition and dynamic texture classification, evidence the benefits of our approach over the state-of-the-art image-set matching methods

A Fisher-Rao Metric for curves using the information in edges

Two curves which are close together in an image are indistinguishable given a measurement, in that there is no compelling reason to associate the measurement with one curve rather than the other. This observation is made quantitative using the parametric version of the Fisher-Rao metric. A probability density function for a measurement conditional on a curve is constructed. The distance between two curves is then defined to be the Fisher-Rao distance between the two conditional pdfs. A tractable approximation to the Fisher-Rao metric is obtained for the case in which the measurements are compound in that they consist of a point x and an angle α which specifies the direction of an edge at x. If the curves are circles or straight lines, then the approximating metric is generalized to take account of inlying and outlying measurements. An estimate is made of the number of measurements required for the accurate location of a circle in the presence of outliers. A Bayesian algorithm for circle detection is defined. The prior density for the algorithm is obtained from the Fisher-Rao metric. The algorithm is tested on images from the CASIA Iris Interval database