Why Simple Shrinkage Is Still Relevant for Redundant Representations?

DOI10.1109/TIT.2006.885522zbMath1309.94035WikidataQ60487166 ScholiaQ60487166MaRDI QIDQ3547948

Michael Elad

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (36)

Large sparse signal recovery by conjugate gradient algorithm based on smoothing technique ⋮ From local kernel to nonlocal multiple-model image denoising ⋮ An alternating minimization method for matrix completion problems ⋮ Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms ⋮ Seismic data interpolation and denoising by learning a tensor tight frame ⋮ Heavy-ball-based optimal thresholding algorithms for sparse linear inverse problems ⋮ Heavy-ball-based hard thresholding algorithms for sparse signal recovery ⋮ A separable surrogate function method for sparse and low-rank matrices decomposition ⋮ Exact optimization for the \(\ell ^{1}\)-compressive sensing problem using a modified Dantzig-Wolfe method ⋮ Scaled proximal gradient methods for sparse optimization problems ⋮ Smoothed \(\ell_1\)-regularization-based line search for sparse signal recovery ⋮ Sparse Recovery and Dictionary Learning to Identify the Nonlinear Dynamical Systems: One Step Toward Finding Bifurcation Points in Real Systems ⋮ Coordinate and subspace optimization methods for linear least squares with non-quadratic regularization ⋮ An alternating direction method of multipliers with the BFGS update for structured convex quadratic optimization ⋮ A pseudo-heuristic parameter selection rule for \(l^1\)-regularized minimization problems ⋮ A framelet-based image inpainting algorithm ⋮ TWO CURVELETS VARIATIONAL MODELS DEPEND ON DECOMPOSITION SPACES ⋮ An iteratively approximated gradient projection algorithm for sparse signal reconstruction ⋮ The projected GSURE for automatic parameter tuning in iterative shrinkage methods ⋮ Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms ⋮ Iterative estimation algorithms using conjugate function lower bound and minorization-maximization with applications in image denoising ⋮ A simple and feasible method for a class of large-scale \(l^1\)-problems ⋮ Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization ⋮ Ways to sparse representation: An overview ⋮ Signal reconstruction by conjugate gradient algorithm based on smoothing \(l_1\)-norm ⋮ Iterative regularization and inverse scale space methods with wave atoms ⋮ Iterative thresholding for sparse approximations ⋮ Efficient dictionary learning with sparseness-enforcing projections ⋮ Iterative gradient denoising algorithm for signal recovery using analysis-based implicit prior ⋮ Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems ⋮ From theoretical guarantee to practical performance: selectable and optimal step-lengths for IHT and HTP algorithms in compressed sensing ⋮ Dynamic thresholding algorithm with memory for linear inverse problems ⋮ Denoising AMP for MRI Reconstruction: BM3D-AMP-MRI ⋮ Dictionary-Based Classification Models. Applications for Multichannel Neural Activity Analysis ⋮ Frame soft shrinkage operators are proximity operators ⋮ Robust Data Assimilation Using $L_1$ and Huber Norms

This page was built for publication: Why Simple Shrinkage Is Still Relevant for Redundant Representations?