This paper presents a novel approach to address the problem of generic 2D shape recognition. We propose a morphological method to decompose a binary shape into entities in correspondence with their protrusions. Each entity is associated with a set of perceptual features that can be used in indexing into image databases. The matching process, based on the softassign algorithm, has produced encouraging results, showing the potential of the developed method in a variety of computer vision and pattern recognition domains. The results demonstrate its robustness in the presence of scale, reflection and rotation transformations and prove the ability to handle noise and articulated structures. In order to increase efficiency, the retrieval process is applied after a coarse scale grouping of objects, without sacrificing effectiveness and allowing indexing into large shape databases. (C) 2008 Elsevier B.V. All rights reserved.
Decomposition of two-dimensional shapes for efficient retrieval / Cecilia Di, Ruberto; Cinque, Luigi. - In: IMAGE AND VISION COMPUTING. - ISSN 0262-8856. - 27:8(2009), pp. 1097-1107. [10.1016/j.imavis.2008.10.009]
Decomposition of two-dimensional shapes for efficient retrieval
CINQUE, LUIGI
2009
Abstract
This paper presents a novel approach to address the problem of generic 2D shape recognition. We propose a morphological method to decompose a binary shape into entities in correspondence with their protrusions. Each entity is associated with a set of perceptual features that can be used in indexing into image databases. The matching process, based on the softassign algorithm, has produced encouraging results, showing the potential of the developed method in a variety of computer vision and pattern recognition domains. The results demonstrate its robustness in the presence of scale, reflection and rotation transformations and prove the ability to handle noise and articulated structures. In order to increase efficiency, the retrieval process is applied after a coarse scale grouping of objects, without sacrificing effectiveness and allowing indexing into large shape databases. (C) 2008 Elsevier B.V. All rights reserved.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.