Nonlinear total variation based noise removal algorithms
Proceedings of the eleventh annual international conference of the Center for Nonlinear Studies on Experimental mathematics : computational issues in nonlinear science: computational issues in nonlinear science
Iterative methods for total variation denoising
SIAM Journal on Scientific Computing - Special issue on iterative methods in numerical linear algebra; selected papers from the Colorado conference
A Nonlinear Primal-Dual Method for Total Variation-Based Image Restoration
SIAM Journal on Scientific Computing
An Affine Scaling Algorithm for Minimizing Total Variation in Image Enhancement
An Affine Scaling Algorithm for Minimizing Total Variation in Image Enhancement
Sparse reconstruction by separable approximation
IEEE Transactions on Signal Processing
A New Total Variation Method for Multiplicative Noise Removal
SIAM Journal on Imaging Sciences
The Split Bregman Method for L1-Regularized Problems
SIAM Journal on Imaging Sciences
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
SIAM Journal on Imaging Sciences
Duality-based algorithms for total-variation-regularized image restoration
Computational Optimization and Applications
A Unified Primal-Dual Algorithm Framework Based on Bregman Iteration
Journal of Scientific Computing
Bregmanized Nonlocal Regularization for Deconvolution and Sparse Reconstruction
SIAM Journal on Imaging Sciences
Gradient-Based Methods for Sparse Recovery
SIAM Journal on Imaging Sciences
A fast and exact algorithm for total variation minimization
IbPRIA'05 Proceedings of the Second Iberian conference on Pattern Recognition and Image Analysis - Volume Part I
IEEE Transactions on Information Theory
Fast Algorithms for Image Reconstruction with Application to Partially Parallel MR Imaging
SIAM Journal on Imaging Sciences
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
This paper develops a Bregman operator splitting algorithm with variable stepsize (BOSVS) for solving problems of the form $\min\{\phi(Bu) +1/2\|Au-f\|_{2}^{2}\}$ , where 驴 may be nonsmooth. The original Bregman Operator Splitting (BOS) algorithm employed a fixed stepsize, while BOSVS uses a line search to achieve better efficiency. These schemes are applicable to total variation (TV)-based image reconstruction. The stepsize rule starts with a Barzilai-Borwein (BB) step, and increases the nominal step until a termination condition is satisfied. The stepsize rule is related to the scheme used in SpaRSA (Sparse Reconstruction by Separable Approximation). Global convergence of the proposed BOSVS algorithm to a solution of the optimization problem is established. BOSVS is compared with other operator splitting schemes using partially parallel magnetic resonance image reconstruction problems. The experimental results indicate that the proposed BOSVS algorithm is more efficient than the BOS algorithm and another split Bregman Barzilai-Borwein algorithm known as SBB.