Matching Shapes with Self-intersections
We address the problem of 2D shape representation and matching in presence of self-intersection for large image databases. This may occur when part of an object is hidden behind another part and results in a darker section in the gray level image of the object. The boundary contour of the object must include the boundary of this part which is entirely inside the outline of the object. In this paper, we study the e_ects of contour self-intersection on the Curvature Scale Space image. When there is no self-intersection, the CSS image contains several arch shape contours, each related to a concavity or a convexity of the shape. Self intersections create contours with minima as well as maxima in the CSS image. An efficient shape representation method has been introduced in this paper which describes a shape using the maxima as well as the minima of its CSS contours. This is a natural generalisation of the conventional method which only includes the maxima of the CSS image contours. The conventional matching algorithm has also been modified to accommodate the new information about the minima. The method has been successfully used in a real world application to find, for an unknown leaf, similar classes from a database of classiffied leaf images representing different varieties of chrysanthemum. For many classes of leaves, self intersection is inevitable during the scanning of the image.
KeywordsDark Section Gray Level Image Shape Representation Boundary Contour Leaf Image
Unable to display preview. Download preview PDF.
- 1.S. Abbasi, F. Mokhtarian, and J. Kittler. Reliable classification of chrysanthemum leaves through curvature scale space. In Proceedings of the Scale-Space’97 Conference, pages 284–295, Utrecht, Netherlands, July 1997.Google Scholar
- 2.A. Del Bimbo, P. Pala, and S. Santini. Image retrieval by elastic matching of shapes and image patterns. In Proceedings of the 1996 International Conference on Multimedia Computing and Systems, pages 215–218, Hiroshima, Japan, June 1996. IEEE, Los Alamitos, CA, USA.Google Scholar
- 4.R. Mehrotra and J. E. Gary. Feature-based retrieval of similar shapes. In Proceedings of 9th International Conference on Data Engineering, pages 108–115, Vienna, Austria, April 1993. IEEE, Los Alamitos, Computer Society Press, CA, USA.Google Scholar
- 5.F. Mokhtarian, S. Abbasi, and J. Kittler. Effcient and robust retrieval by shape content through curvature scale space. In Proceedings of the First International Workshop on Image Database and Multimedia Search, pages 35–42, Amsterdam, The Netherlands, August 1996.Google Scholar
- 6.F. Mokhtarian, S. Abbasi, and J. Kittler. Robust and efficient shape indexing through curvature scale space. In Proceedings of the seventh British Machine Vision Conference, BMVC’96, volume 1, pages 53–62, Edinburgh, September 1996.Google Scholar
- 7.D. Mumford. The problem of robust shape descriptions. In First International Conference on Computer Vision, pages 602–606, London, England,, June 1987.Google Scholar
- 9.E. Saber and A.M. Tekalp. Image query-by-example using region-based shape matching. In Proceedings of SPIE-The International Society for Optical Engineering, volume 2666, pages 200–211, 1996.Google Scholar