Projectively invariant decomposition and recognition of planar shapes
- 30 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 471-475
- https://doi.org/10.1109/iccv.1993.378178
Abstract
An algorithm is presented for computing a decomposition of planar shapes into convex subparts represented by ellipses. The method is invariant to projective transformations of the shape, and thus the ellipses can be used for matching and definition of invariants in the same way as points and lines. The method works for arbitrary planar shapes admitting at least four distinct tangents and is based on finding ellipses with four points of contact to the given shape. The cross ratio computed from the four points on the ellipse can then be used as a projectively invariant index. For a given shape, each pair of ellipses can be used to compute two independent projective invariants. The set of invariants computed for each ellipse pair can be used as indexes to a hash table from which a model hypothesis can be generated.Keywords
This publication has 8 references indexed in Scilit:
- Projective invariants of shapesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Object recognition by affine invariant matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Canonical frames for planar object recognitionPublished by Springer Nature ,1992
- Invariant descriptors for 3D object recognition and posePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- General methods for determining projective invariants in imageryCVGIP: Image Understanding, 1991
- Parts of recognitionCognition, 1984
- Fitting conic sections to scattered dataComputer Graphics and Image Processing, 1979
- Biological shape and visual science (part I)Journal of Theoretical Biology, 1973