CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2003 vol.25 Issue No.04 - April
Issue No.04 - April (2003 vol.25)
<p><b>Abstract</b>—Using a saliency measure based on the global property of contour closure, we have developed a segmentation method which identifies smooth closed contours bounding objects of unknown shape in real images. The saliency measure incorporates the Gestalt principles of proximity and good continuity that previous methods have also exploited. Unlike previous methods, we incorporate contour closure by finding the eigenvector with the largest positive real eigenvalue of a transition matrix for a Markov process where edges from the image serve as states. Element <tmath> (i,j) </tmath> of the transition matrix is the conditional probability that a contour which contains edge <tmath> j </tmath> will also contain edge <tmath> i </tmath>. In this paper, we show how the saliency measure, defined for individual edges, can be used to derive a saliency relation, defined for pairs of edges, and further show that strongly-connected components of the graph representing the saliency relation correspond to smooth closed contours in the image. Finally, we report for the first time, results on large real images for which segmentation takes an average of about <tmath> 10 </tmath> seconds per object on a general-purpose workstation.</p>
Perceptual organization, contours, Markov chains, eigenvectors.
Lance R. Williams, Karvel K. Thornber, Kanglin Xu, "Segmentation of Multiple Salient Closed Contours from Real Images", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.25, no. 4, pp. 433-444, April 2003, doi:10.1109/TPAMI.2003.1190570