Compressed sensing of color images

DOI10.1016/j.sigpro.2010.05.016zbMath1197.94089OpenAlexW2167326765MaRDI QIDQ1957911

Rabab Kreidieh Ward, Angshul Majumdar

Publication date: 27 September 2010

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sigpro.2010.05.016

zbMATH Keywords

compressed sensingcolor imagingsparse reconstruction

Mathematics Subject Classification ID

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

Related Items (13)

Estimation of block sparsity in compressive sensing ⋮ A new bound on the block restricted isometry constant in compressed sensing ⋮ Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP ⋮ Recovery analysis for block ℓp − ℓ1 minimization with prior support information ⋮ Block sparse signal recovery via minimizing the block \(q\)-ratio sparsity ⋮ Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model ⋮ A perturbation analysis of nonconvex block-sparse compressed sensing ⋮ A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit ⋮ Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\) ⋮ On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing ⋮ High dimensional data reconstruction based on \(L_{2,1}\) norm ⋮ A simple Gaussian measurement bound for exact recovery of block-sparse signals ⋮ The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms

Cites Work

• Unnamed Item
• Sparse recovery by non-convex optimization - instance optimality
• The benefit of group sparsity
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Fast Sparse Representation Based on Smoothed ℓ0 Norm
• The Group Lasso for Logistic Regression
• On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
• Robust Recovery of Signals From a Structured Union of Subspaces
• Model Selection and Estimation in Regression with Grouped Variables
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Compressed sensing

This page was built for publication: Compressed sensing of color images