Segmentation of multiple salient closed contours from real images

被引:81
作者
Mahamud, S [1 ]
Williams, LR
Thornber, KK
Xu, KL
机构
[1] Carnegie Mellon Univ, Dept Comp Sci, Pittsburgh, PA 15213 USA
[2] Univ New Mexico, Dept Comp Sci, Albuquerque, NM 87131 USA
[3] NEC Res Inst, Princeton, NJ 08540 USA
关键词
perceptual organization; contours; Markov chains; eigenvectors;
D O I
10.1109/TPAMI.2003.1190570
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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 (i, j) of the transition matrix is the conditional probability that a contour which contains edge j will also contain edge i. 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 10 seconds per object on a general-purpose workstation.
引用
收藏
页码:433 / 444
页数:12
相关论文
共 27 条
[1]   A generic grouping algorithm and its quantitative analysis [J].
Amir, A ;
Lindenbaum, M .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1998, 20 (02) :168-185
[2]   TOKEN-BASED EXTRACTION OF STRAIGHT-LINES [J].
BOLDT, M ;
WEISS, R ;
RISEMAN, E .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1989, 19 (06) :1581-1594
[3]  
Brent R. P., 2002, Algorithms for Minimization without Derivatives
[5]  
CORMEM TH, 1989, INTRO ALGORITHMS, pCH23
[6]  
ELDER JH, 1996, P EUR C COMP VIS, V1, P14
[7]  
GDALYAHU Y, 1999, ADV NEURAL INFORMATI, V11
[8]   Inferring global perceptual contours from local features [J].
Guy, G ;
Medioni, G .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 1996, 20 (1-2) :113-133
[9]   FIGURE-GROUND DISCRIMINATION - A COMBINATORIAL OPTIMIZATION APPROACH [J].
HERAULT, L ;
HORAUD, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1993, 15 (09) :899-914
[10]  
HORN RA, 1990, MATRIX ANAL, pCH8