Convex multiclass segmentation with shearlet regularization

被引:54
作者
Haeuser, S. [1 ]
Steidl, G. [1 ]
机构
[1] Univ Kaiserslautern, Dept Math, D-67663 Kaiserslautern, Germany
关键词
multilabel segmentation; shearlets; fast finite shearlet transform; convex relaxation; 65T50; 65T60; 68U10; 46N10; 49N15; IMAGE; OPTIMIZATION;
D O I
10.1080/00207160.2012.688960
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Segmentation plays an important role in many preprocessing stages in image processing. Recently, convex relaxation methods for image multi-labelling were proposed in the literature. Often these models involve the total variation (TV) semi-norm as regularizing term. However, it is well known that the TV-functional is not optimal for the segmentation of textured regions. In recent years, directional representation systems were proposed to cope with curved singularities in images. In particular, curvelets and shearlets provide an optimally sparse approximation in the class of piecewise smooth functions with C 2 singularity boundaries. In this paper, we demonstrate that the discrete shearlet transform is suited as regularizer for the segmentation of curved structures. Neither the shearlet nor the curvelet transform where used as regularizer in a segmentation model so far. To this end, we have implemented a translation invariant finite discrete shearlet transform based on the fast Fourier transform. We describe how the shearlet transform can be incorporated within the multi-label segmentation model and show how to find a minimizer of the corresponding functional by applying an alternating direction method of multipliers. Here, the Parseval frame property of our shearlets comes into play. We demonstrate by numerical examples that the shearlet-regularized model can better segment curved textures than the TV-regularized one and that the method can also cope with regularizers obtained from non-local means.
引用
收藏
页码:62 / 81
页数:20
相关论文
共 48 条
[1]  
[Anonymous], 2008, Vision Modeling and Visualization
[2]  
[Anonymous], WAVELET TOUR SIGNAL
[3]  
[Anonymous], 2016, Appl. Numer. Harmon. Anal
[4]  
[Anonymous], 2002, The Journal of Geometric Analysis
[5]  
[Anonymous], 1983, AUGMENTED LAGRANGIAN, DOI DOI 10.1016/S0168-2024(08)70034-1
[6]  
Bae E., 2011, DAGSTUH REPORTS, VII, P66
[7]   Global Minimization for Continuous Multiphase Partitioning Problems Using a Dual Approach [J].
Bae, Egil ;
Yuan, Jing ;
Tai, Xue-Cheng .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2011, 92 (01) :112-129
[8]  
Bae E, 2009, LECT NOTES COMPUT SC, V5567, P1, DOI 10.1007/978-3-642-02256-2_1
[9]   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
[10]   A non-local algorithm for image denoising [J].
Buades, A ;
Coll, B ;
Morel, JM .
2005 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 2, PROCEEDINGS, 2005, :60-65