By Topic

Hierarchical image segmentation by polygon grouping

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

2 Author(s)
Prasad, L. ; Los Alamos Nat. Lab., Los Alamos, NM ; Swaminarayan, S.

We present a simple cascading algorithm for rapid hierarchical image segmentation based on perceptually driven contour completion and scene statistics. We start with an initial fine-scale segmentation of an image obtained by perceptual completion of partial contours into polygonal regions using region-contour correspondences established by Delaunay triangulation of edge pixels. The resulting polygon size distribution is analyzed for a dominant mode of granularity of the image. Polygons whose sizes are less than or equal to this granularity are merged with their spectrally closest neighbors to obtain the next level of polygonal segments in the hierarchy. The iterative application of this process precipitates textured regions as polygons with highly convolved boundaries and helps distinguish them from objects which typically have more regular boundaries.

Published in:

Computer Vision and Pattern Recognition Workshops, 2008. CVPRW '08. IEEE Computer Society Conference on

Date of Conference:

23-28 June 2008