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 conic primitives 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 it 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. It is demonstrated that a given shape has a unique parameter-free decomposition into a finite set of ellipses with unit cross ratio. 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 model hypothesis can be generated Examples of shape decomposition and recognition are given for synthetic shapes and shapes extracted from grey level images of real objects using edge detection.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Barrett E.B., Payton P.M., Haag N.N., and Brill M.H. 1991. General methods for determining projective invariants in imagery. CVGIP-IU, 53:46–65.
Blum H. 1973. Biological shape and visual science. Journal of Theoretical Biology, 38:205–287.
Bookstein F. 1979. Fitting conic sections to scattered data. Computer Graphics and Image Processing, 8:56–71.
Brady M. 1983. Criteria for representation of shapes. In Rosenfeld and Beck (eds.), Human and Machine Vision, Erbaum, Hillsdale NJ, pp. 39–84.
Carlsson, S. 1992. Projectively invariant decomposition of planar shapes. In Mundy and Zisserman (eds.), Geometric Invariance in Computer Vision, MIT-Press: pp. 267–273.
Forsyth, D.A., Mundy, J.L., Zisserman, A.P., and Brown, C. 1990. Invariance—A new framework for vision. In Proc. of 3rd ICCV, pp. 598–605.
Forsyth D.A., Mundy J.L., Zisserman A.P., Coelho C., Heller A., and Rothwell C.A. 1991. Invariant descriptors for 3-D object recognition and pose. IEEE Trans. on Pattern Analysis and Machine Intelligence, 13(10):971–991.
Hoffman D.D. and Richards W. 1984. Parts of recognition. Cognition, 18:65–96.
Kass M., Witkin A., and Terzopoulos D. 1988. Snakes: Active contour models. International Journal of Computer Vision, 1:321–331.
Lamdan, Y., Schwartz, J.T., and Wolfson, H.J. 1988. Object recognition by affine invariant matching. In Proc. CVPR-88, pp. 335–344.
Lee D.T. 1982. Medial axis transform of a planar shape. IEEE Trans. on Pattern Analysis and Machine Intelligence, 4:363–369.
Richards W. and Hoffman D.D. 1985. Codon constraints on closed 2D shapes. Computer Graphics and Image Processing, 31:265–281.
Rothwell, C.A., Zisserman, A.P., Forsyth, D.A., and Mundy, J.L. 1992. Canonical frames for planar object recognition. Proc. of 2nd ECCV, pp. 757–772.
Rothwell, C.A., Zisserman, A.P., Mundy, J.L., and Forsyth, D.A., 1992. Efficient model library access by projectively invariant indexing functions. In Proc. CVPR-92, pp. 109–114.
Stein F. and Medioni G., 1992. Structural indexing: Efficient 2-D object recognition. IEEE Trans. on Pattern Analysis and Machine Intelligence, 14:1198–1204.
Van Gool, L.J., Moons, T., Pauwels, E.J., and Oosterlinck, A. 1992. Semi-differential invariants. In Mundy and Zisserman (eds.), Geometric Invariance in Computer Vision, MIT-Press: pp. 157–192.
Weiss, I. 1988. Projective invariants of shapes. In Proc. CVPR-88, pp. 291–297.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Carlsson, S. Projectively invariant decomposition and recognition of planar shapes. Int J Comput Vision 17, 193–209 (1996). https://doi.org/10.1007/BF00058751
Issue Date:
DOI: https://doi.org/10.1007/BF00058751