By Topic

Graph-based representation for 2-D shape using decomposition scheme

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Duck Hoon Kim ; Sch. of Electr. Eng. & Comput. Sci., Seoul Nat. Univ., South Korea ; Il Dong Yun ; Sang Uk Lee

In this paper, to represent 2-D shape as a relational structure, i.e. graph, we propose a new shape decomposition scheme composed of two stages: first, a given shape is decomposed into meaningful parts by using the constrained morphological decomposition (CMD) in a recursive manner. More specifically, the CMD adopts the use of the opening operation with the ball-shaped structuring element and the weighted convexity to select the optimal decomposition. Second, the iterative merging stage provides a compact graph-based representation based on the weighted convexity difference. From the experimental results for various and modified 2-D shapes, it is believed that the graph-based representation for 2-D shape coincides with that based on human insight, and also provides robustness to scaling, rotation, noise, shape deformation and occlusion.

Published in:

Image Processing, 2004. ICIP '04. 2004 International Conference on  (Volume:5 )

Date of Conference:

24-27 Oct. 2004