Geometric Saliency of Curve Correspondances and Grouping of Symmetric Comntours

Dependence on landmark points or high-order derivatives when establishing correspondences between geometrical image curves under various subclasses of projective transformation remains a shortcoming of present methods. In the proposed framework, geometric transformations are treated as smooth functions involving the parameters of the curves on which the transformation basis points lie. By allowing the basis points to vary along the curves, hypothesised correspondences are freed from the restriction to fixed point sets. An optimisation approach to localising neighbourhood-validated transformation bases is described which uses the deviation between projected and actual curve neighbourhood to iteratively improve correspondence estimates along the curves. However as transformation bases are inherently localisable to different degrees, the concept of geometric saliency is proposed in order to quantise this localisability. This measures the sensitivity of the deviation between projected and actual curve neighbourhood to perturbation of the basis points along the curves. Statistical analysis is applied to cope with image noise, and leads to the formulation of a normalised basis likelihood. Geometrically salient, neighbourhood-validated transformation bases represent hypotheses for the transformations relating image curves, and are further refined through curve support recovery and geometrically-coupled active contours. In the thorough application of this theory to the problem of detecting and grouping affine symmetric contours, good preliminary results are obtained which demonstrate the independence of this approach to landmark points.

[1]  Martin A. Fischler,et al.  Locating Perceptually Salient Points on Planar Curves , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Azriel Rosenfeld,et al.  Computer Vision , 1988, Adv. Comput..

[3]  David A. Forsyth,et al.  Class-based grouping in perspective images , 1995, Proceedings of IEEE International Conference on Computer Vision.

[4]  L. Gool,et al.  Semi-differential invariants , 1992 .

[5]  Ramakant Nevatia,et al.  Using Invariance and Quasi-Invariance for the Segmentation and Recovery of Curved Objects , 1993, Applications of Invariance in Computer Vision.

[6]  Tat-Jen Cham,et al.  Symmetry detection through local skewed symmetries , 1995, Image Vis. Comput..

[7]  J. Lapresté,et al.  Locating and modelling a flat symmetric object from a single perspective image , 1993 .

[8]  Philippe Saint-Marc,et al.  B-spline Contour Representation and Symmetry Detection , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[9]  Paul L. Rosin,et al.  Using symmetry, ellipses, and perceptual groups for detecting generic surfaces of revolution in 2D images , 1993, Defense, Security, and Sensing.

[10]  Andrew Zisserman,et al.  Geometric invariance in computer vision , 1992 .

[11]  Richard A. Volz,et al.  Recognizing Partially Occluded Parts , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Andrew Zisserman,et al.  Recognizing general curved objects efficiently , 1992 .

[13]  Ramakant Nevatia,et al.  Perception of 3-D Surfaces from 2-D Contours , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[14]  Chris Harris,et al.  Geometry from visual motion , 1993 .

[15]  Michael Brady,et al.  Seeds of Perception , 1987, Alvey Vision Conference.