کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
527250 | 869306 | 2009 | 11 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Decomposition of two-dimensional shapes for efficient retrieval Decomposition of two-dimensional shapes for efficient retrieval](/preview/png/527250.png)
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.
Journal: Image and Vision Computing - Volume 27, Issue 8, 2 July 2009, Pages 1097–1107