On the _1-norm invariant convex k-sparse decomposition of signals

DOI10.1007/S40305-013-0030-YMaRDI QIDQ743785zbMATH OpenOpenAlexFDO

Authors Guangwu Xu, Zhiqiang Xu

Publication date 30 September 2014

Published in Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1305.6021

zbMATH Keywords

\(\ell_1\) minimizationconvex \(k\)-sparse decompositionrestricted isometry propertysparse recovery

Mathematics Subject Classification ID

Nonlinear programming (90C30) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: Inspired by an interesting idea of Cai and Zhang, we formulate and prove the convex $k$-sparse decomposition of vectors which is invariant with respect to $el{l}_1$ norm. This result fits well in discussing compressed sensing problems under RIP, but we believe it also has independent interest. As an application, a simple derivation of the RIP recovery condition $delt{a}_k+het{a}_{k,k}<1$ is presented.

Recommendations

• Sparse and smooth signal estimation: convexification of \(\ell_0\)-formulations
• On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
• Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm
• The non-convex sparse problem with nonnegative constraint for signal reconstruction
• An improved condition of sparse signal reconstruction via \({l_1}\)-\({l_2}\) norm minimization
• Convergence of \(\ell_{2/3}\) regularization for sparse signal recovery
• scientific article; zbMATH DE number 7750674
• Stable recovery of sparse signals via \(\ell_p\)-minimization
• Sparse Signal Estimation by Maximally Sparse Convex Optimization
• Minimization of L₁ over L₂ for sparse signal recovery with convergence guarantee

Cites work

• Compressed Sensing and Affine Rank Minimization Under Restricted Isometry
• Decoding by Linear Programming
• New Bounds for Restricted Isometry Constants
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
• Stable Recovery of Sparse Signals and an Oracle Inequality

Cited in

(16)

• The recovery of complex sparse signals from few phaseless measurements
• Stable signal recovery from phaseless measurements
• A null-space-based weightedl₁minimization approach to compressed sensing
• Stable image reconstruction using transformed total variation minimization
• Performance analysis for unconstrained analysis based approaches
• A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
• New restricted isometry property analysis for \(\ell_1-\ell_2\) minimization methods
• Weighted _p-minimization for sparse signal recovery under arbitrary support prior
• \(\boldsymbol{L_1-\beta L_q}\) Minimization for Signal and Image Recovery
• Affine phase retrieval for sparse signals via \(\ell_1\) minimization
• Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising
• Uniform RIP analysis for the _p- _q minimization
• Sparse recovery with coherent frames via \(\ell_{1-2}\)-analysis
• The \( \ell _1 \)-analysis in phase retrieval with redundant dictionary
• Uniform RIP bounds for recovery of signals with partial support information by weighted _p-minimization
• BranchHull: convex bilinear inversion from the entrywise product of signals with known signs

This page was built for publication: On the \(\ell_1\)-norm invariant convex \(k\)-sparse decomposition of signals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q743785)