A Variational Image Segmentation Model Based on Normalized Cut with Adaptive Similarity and Spatial Regularization

被引:7
作者
Wang, Faqiang [1 ]
Zhao, Cuicui [1 ]
Liu, Jun [1 ]
Huang, Haiyang [1 ]
机构
[1] Beijing Normal Univ, Sch Math Sci, Minist Educ China, Lab Math & Complex Syst, Beijing 100875, Peoples R China
基金
中国国家自然科学基金;
关键词
normalized cut; Parzen-Rosenblatt window; EM algorithm; regularization; convex optimization; adaptive similarity; duality; ACTIVE CONTOURS; FRAMEWORK; MUMFORD; MINIMIZATION; ALGORITHMS; TV;
D O I
10.1137/18M1192366
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Image segmentation is a fundamental research topic in image processing and computer vision. In recent decades, researchers developed a large number of segmentation algorithms for various applications. Among these algorithms, the normalized cut (Ncut) segmentation method is widely applied due to its good performance. The Ncut segmentation model is an optimization problem whose energy is defined on a specifically designed graph. Thus, the segmentation results of the existing Ncut method are largely dependent on a preconstructed similarity measure on the graph since this measure is usually given empirically by users. This flaw will lead to some undesirable segmentation results. In this paper, we propose an Ncut-based segmentation algorithm by integrating an adaptive similarity measure and spatial regularization. The proposed model combines the Parzen-Rosenblatt window method, nonlocal weights entropy, Ncut energy, and regularizer of phase field in a variational framework. Our method can adaptively update the similarity measure function by estimating some parameters. This adaptive procedure enables the proposed algorithm to find a better similarity measure for classification than the Ncut method. We provide some mathematical interpretation of the proposed adaptive similarity from multiple viewpoints, such as statistics and convex optimization. In addition, the regularizer of phase field can guarantee that the proposed algorithm has a robust performance in the presence of noise, and it can also rectify the similarity measure with a spatial priori. The well-posed theory such as the existence of the minimizer for the proposed model is given in the paper. Compared with some existing segmentation methods such as the traditional Ncutbased model and the classical Chan-Vese model, the numerical experiments show that our method can provide promising segmentation results.
引用
收藏
页码:651 / 684
页数:34
相关论文
共 60 条
[1]  
[Anonymous], 1960, Arch. Math. (Basel)
[2]  
[Anonymous], INT C COMP VIS
[3]  
[Anonymous], 1991, Graph theory, combinatorics, and applications, DOI DOI 10.1016/J.CAMWA.2004.05.005
[4]  
[Anonymous], 1995, PROGR NONLINEAR DIFF
[5]   Contour Detection and Hierarchical Image Segmentation [J].
Arbelaez, Pablo ;
Maire, Michael ;
Fowlkes, Charless ;
Malik, Jitendra .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2011, 33 (05) :898-916
[6]   A Variational Framework for Exemplar-Based Image Inpainting [J].
Arias, Pablo ;
Facciolo, Gabriele ;
Caselles, Vicent ;
Sapiro, Guillermo .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2011, 93 (03) :319-347
[7]   Projection algorithms for solving convex feasibility problems [J].
Bauschke, HH ;
Borwein, JM .
SIAM REVIEW, 1996, 38 (03) :367-426
[8]  
Bauschke HH., 1993, Set-Valued Anal, V1, P185, DOI DOI 10.1007/BF01027691
[9]   Laplacian eigenmaps for dimensionality reduction and data representation [J].
Belkin, M ;
Niyogi, P .
NEURAL COMPUTATION, 2003, 15 (06) :1373-1396
[10]  
Belkin M, 2006, J MACH LEARN RES, V7, P2399