Bound alternative direction optimization for image deblurring
Summary: This paper proposes a new method, \textit{bound alternative direction method} (BADM), to address the \(\ell_p (p \in \left(0,1\right))\) minimization problems in image deblurring. The approach is to first obtain a bound unconstrained problem through bounding the \(\ell_p\) regularizer by a novel majorizer and then, based on a variable splitting, to reformulate the bound unconstrained problem into a constrained one, which is then addressed via an augmented Lagrangian method. The proposed algorithm actually combines the reweighted \(\ell_1\) minimization method and the \textit{alternating direction method of multiples} (ADMM) such that it succeeds in extending the application of ADMM to \(\ell_p\) minimization problems. The conducted experimental studies demonstrate the superiority of the proposed algorithm for the synthesis \(\ell_p\) minimization over the state-of-the-art algorithms for the synthesis \(\ell_1\) minimization on image deblurring.
- A new reweighted minimization algorithm for image deblurring
- An alternating iterative algorithm for image deblurring and denoising problems
- Alternating split Bregman method for the bilaterally constrained image deblurring problem
- Solving regularized linear least-squares problems by the alternating direction method with applications to image restoration
- Augmented Lagrangian-based sparse representation method with dictionary updating for image deblurring
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
- A variational formulation for frame-based inverse problems
- An Augmented Lagrangian Approach to the Constrained Optimization Formulation of Imaging Inverse Problems
- An EM algorithm for wavelet-based image restoration
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Analysis versus synthesis in signal priors
- Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
- Convex analysis and monotone operator theory in Hilbert spaces
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Fast Image Recovery Using Variable Splitting and Constrained Optimization
- Fast linearized Bregman iteration for compressive sensing and sparse denoising
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 701829 (Why is no real title available?)
- Image restoration: total variation, wavelet frames, and beyond
- Introductory lectures on convex optimization. A basic course.
- Iteratively reweighted least squares minimization for sparse recovery
- Numerical Optimization
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Restricted isometry properties and nonconvex compressive sensing
- Reweighted minimization model for MR image reconstruction with split Bregman method
- Scale space and variational methods in computer vision. Second international conference, SSVM 2009, Voss, Norway, June 1--5, 2009. Proceedings
- Sparse Reconstruction by Separable Approximation
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Split Bregman methods and frame based image restoration
- The Split Bregman Method for L1-Regularized Problems
- Bregman reweighted alternating minimization and its application to image deblurring
- A new reweighted minimization algorithm for image deblurring
- Augmented Lagrangian-based sparse representation method with dictionary updating for image deblurring
- \(L^1\)-regularized inverse problems for image deblurring via bound- and equality-constrained optimization
- Alternating split Bregman method for the bilaterally constrained image deblurring problem
This page was built for publication: Bound alternative direction optimization for image deblurring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1717868)
