Image Segmentation by MAP-ML Estimations

被引:54
作者
Chen, Shifeng [1 ]
Cao, Liangliang [2 ]
Wang, Yueming [3 ,4 ]
Liu, Jianzhuang [1 ,3 ]
Tang, Xiaoou [1 ,3 ]
机构
[1] Chinese Acad Sci, Shenzhen Inst Adv Technol, Shenzhen 518055, Peoples R China
[2] Univ Illinois, Dept Elect & Comp Engn, Urbana, IL 61801 USA
[3] Chinese Univ Hong Kong, Dept Informat Engn, Hong Kong, Hong Kong, Peoples R China
[4] Zhejiang Univ, Coll Comp Sci, Hangzhou 310027, Zhejiang, Peoples R China
关键词
Graph cuts; image segmentation; Markov random fields; maximum a posteriori; maximum likelihood; TEXTURE;
D O I
10.1109/TIP.2010.2047164
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Image segmentation plays an important role in computer vision and image analysis. In this paper, image segmentation is formulated as a labeling problem under a probability maximization framework. To estimate the label configuration, an iterative optimization scheme is proposed to alternately carry out the maximum a posteriori (MAP) estimation and the maximum likelihood (ML) estimation. The MAP estimation problem is modeled with Markov random fields (MRFs) and a graph cut algorithm is used to find the solution to the MAP estimation. The ML estimation is achieved by computing the means of region features in a Gaussian model. Our algorithm can automatically segment an image into regions with relevant textures or colors without the need to know the number of regions in advance. Its results match image edges very well and are consistent with human perception. Comparing to six state-of-the-art algorithms, extensive experiments have shown that our algorithm performs the best.
引用
收藏
页码:2254 / 2264
页数:11
相关论文
共 47 条
[1]  
[Anonymous], 2001, Interactive Graph Cuts, DOI DOI 10.1109/ICCV.2001.937505
[2]  
[Anonymous], 2018, Mathematical Morphology in Image Processing, DOI DOI 10.1201/9781482277234-12/MORPHOLOGICAL-APPROACHSEGMENTATION-WATERSHED-TRANSFORMATION-BEUCHER-MEYER
[3]  
[Anonymous], UCBEECS2006195
[4]  
[Anonymous], 2000, Pattern Classification
[5]  
Borenstein E, 2004, LECT NOTES COMPUT SC, V3023, P315
[6]   Fast approximate energy minimization via graph cuts [J].
Boykov, Y ;
Veksler, O ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1222-1239
[7]   Blobworld: Image segmentation using expectation-maximization and its application to image querying [J].
Carson, C ;
Belongie, S ;
Greenspan, H ;
Malik, J .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (08) :1026-1038
[8]  
Chang PC, 2007, 2007 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN SCHEDULING, P1
[9]   ON ACTIVE CONTOUR MODELS AND BALLOONS [J].
COHEN, LD .
CVGIP-IMAGE UNDERSTANDING, 1991, 53 (02) :211-218
[10]   Mean shift: A robust approach toward feature space analysis [J].
Comaniciu, D ;
Meer, P .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (05) :603-619