Adaptive Regularization in Convex Composite Optimization for Variational Imaging Problems

被引:8
作者
Hong, Byung-Woo [1 ]
Koo, Ja-Keoung [1 ]
Dirks, Hendrik [2 ]
Burger, Martin [2 ]
机构
[1] Chung Ang Univ, Comp Sci Dept, Seoul, South Korea
[2] Univ Munster, Inst Computat & Appl Math, Munster, Germany
来源
PATTERN RECOGNITION (GCPR 2017) | 2017年 / 10496卷
关键词
RESTORATION; MINIMIZATION; ALGORITHM;
D O I
10.1007/978-3-319-66709-6_22
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We propose an adaptive regularization scheme in a variational framework where a convex composite energy functional is optimized. We consider a number of imaging problems including segmentation and motion estimation, which are considered as optimal solutions of the energy functionals that mainly consist of data fidelity, regularization and a control parameter for their trade-off. We presents an algorithm to determine the relative weight between data fidelity and regularization based on the residual that measures how well the observation fits the model. Our adaptive regularization scheme is designed to locally control the regularization at each pixel based on the assumption that the diversity of the residual of a given imaging model spatially varies. The energy optimization is presented in the alternating direction method of multipliers (ADMM) framework where the adaptive regularization is iteratively applied along with mathematical analysis of the proposed algorithm. We demonstrate the robustness and effectiveness of our adaptive regularization through experimental results presenting that the qualitative and quantitative evaluation results of each imaging task are superior to the results with a constant regularization scheme. The desired properties, robustness and effectiveness, of the regularization parameter selection in a variational framework for imaging problems are achieved by merely replacing the static regularization parameter with our adaptive one.
引用
收藏
页码:268 / 280
页数:13
相关论文
共 37 条
[1]  
[Anonymous], 2009, BRIT MACH VIS C
[2]  
[Anonymous], P EUROPEAN C COMPUTE, DOI DOI 10.1007/3-540-57956-7
[3]  
Ayvaci Alper., 2010, Advances_in_neural_information_processing systems, P100
[4]   A Database and Evaluation Methodology for Optical Flow [J].
Baker, Simon ;
Scharstein, Daniel ;
Lewis, J. P. ;
Roth, Stefan ;
Black, Michael J. ;
Szeliski, Richard .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 2011, 92 (01) :1-31
[5]   PERFORMANCE OF OPTICAL-FLOW TECHNIQUES [J].
BARRON, JL ;
FLEET, DJ ;
BEAUCHEMIN, SS .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 1994, 12 (01) :43-77
[6]   A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems [J].
Beck, Amir ;
Teboulle, Marc .
SIAM JOURNAL ON IMAGING SCIENCES, 2009, 2 (01) :183-202
[7]   NESTA: A Fast and Accurate First-Order Method for Sparse Recovery [J].
Becker, Stephen ;
Bobin, Jerome ;
Candes, Emmanuel J. .
SIAM JOURNAL ON IMAGING SCIENCES, 2011, 4 (01) :1-39
[8]   Distributed optimization and statistical learning via the alternating direction method of multipliers [J].
Boyd S. ;
Parikh N. ;
Chu E. ;
Peleato B. ;
Eckstein J. .
Foundations and Trends in Machine Learning, 2010, 3 (01) :1-122
[9]   Fast global minimization of the active Contour/Snake model [J].
Bresson, Xavier ;
Esedoglu, Selim ;
Vandergheynst, Pierre ;
Thiran, Jean-Philippe ;
Osher, Stanley .
JOURNAL OF MATHEMATICAL IMAGING AND VISION, 2007, 28 (02) :151-167
[10]   Geodesic active contours [J].
Caselles, V ;
Kimmel, R ;
Sapiro, G .
INTERNATIONAL JOURNAL OF COMPUTER VISION, 1997, 22 (01) :61-79