A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm

DOI10.1109/TSP.2008.2007606zbMath1391.94325MaRDI QIDQ4571522

Hosein Mohimani, Massoud Babaie-Zadeh, Christian Jutten

Publication date: 9 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Related Items

Exploiting prior knowledge in compressed sensing to design robust systems for endoscopy image recovery ⋮ Reconstruction of the magnetic particle imaging system matrix using symmetries and compressed sensing ⋮ Group subset selection for linear regression ⋮ Global optimization for sparse solution of least squares problems ⋮ A survey on compressive sensing: classical results and recent advancements ⋮ Sparsity Constrained Estimation in Image Processing and Computer Vision ⋮ A Continuous Exact $\ell_0$ Penalty (CEL0) for Least Squares Regularized Problem ⋮ Synchrotron radiation-based \(l_1\)-norm regularization on micro-CT imaging in shale structure analysis ⋮ MIMO radar imaging based on smoothed \(l_0\) norm ⋮ \(l_{0}\)-norm based structural sparse least square regression for feature selection ⋮ RBF-network based sparse signal recovery algorithm for compressed sensing reconstruction ⋮ Framework for segmented threshold \(\ell_0\) gradient approximation based network for sparse signal recovery ⋮ Sparse signal reconstruction via collaborative neurodynamic optimization ⋮ Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm ⋮ A smoothing method for sparse optimization over convex sets ⋮ A Smoothing Method for Sparse Optimization over Polyhedral Sets ⋮ Sparsity-Assisted Signal Smoothing ⋮ Affine matrix rank minimization problem via non-convex fraction function penalty ⋮ On sparsity‐inducing methods in system identification and state estimation ⋮ Effective zero-norm minimization algorithms for noisy compressed sensing ⋮ Quantum multi-image compression-encryption scheme based on quantum discrete cosine transform and 4D hyper-chaotic Hénon map ⋮ A new nonconvex approach to low-rank matrix completion with application to image inpainting ⋮ Sparse signal reconstruction based on multiparameter approximation function with smoothed \(\ell_0\) norm ⋮ The smoothing FR conjugate gradient method for solving a kind of nonsmooth optimization problem with \(l_1\)-norm ⋮ Optimized projections for compressed sensing via rank-constrained nearest correlation matrix ⋮ Sparse Recovery and Dictionary Learning to Identify the Nonlinear Dynamical Systems: One Step Toward Finding Bifurcation Points in Real Systems ⋮ Sparse decomposition by iterating Lipschitzian-type mappings ⋮ Compressing sensing based source localization for controlled acoustic signals using distributed microphone arrays ⋮ The Trimmed Lasso: Sparse Recovery Guarantees and Practical Optimization by the Generalized Soft-Min Penalty ⋮ Sparse approximate reconstruction decomposed by two optimization problems ⋮ Two-dimensional random projection ⋮ A fast recovery method of 2D geometric compressed sensing signal ⋮ Overcomplete blind source separation based on generalized Gaussian function and SL0 norm ⋮ A new smoothed L0 regularization approach for sparse signal recovery ⋮ A review on restoration of seismic wavefields based on regularization and compressive sensing ⋮ High resolution 3D imaging in MIMO radar with sparse array ⋮ A reweighted symmetric smoothed function approximating \(L_0\)-norm regularized sparse reconstruction method ⋮ A smoothed \(l_0\)-norm and \(l_1\)-norm regularization algorithm for computed tomography ⋮ A convex relaxation framework consisting of a primal-dual alternative algorithm for solving \(\ell_0\) sparsity-induced optimization problems with application to signal recovery based image restoration ⋮ Compressed sensing reconstruction using expectation propagation

This page was built for publication: A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm