A fast recovery method of 2D geometric compressed sensing signal

DOI10.1007/S00034-014-9913-3zbMATH Open1358.94025OpenAlexW2115813232MaRDI QIDQ736874FDOQ736874

Authors: Zhuo-Ming Du, Fei-Yue Ye, Hang Shi, Guang-Ping Zhu 

Publication date: 5 August 2016

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00034-014-9913-3

Recommendations

• 2D sparse signal recovery via 2D orthogonal matching pursuit
• Compressed sensing by inverse scale space and curvelet thresholding
• An efficient algorithm for compression-based compressed sensing
• Compressed sensing: how sharp is the restricted isometry property?
• Compressed sensing based on the non-subsampled contourlet transform for image reconstruction

zbMATH Keywords

compressed sensingrandom samplingsparse representationgeometric signal

Mathematics Subject Classification ID

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

Cites Work

• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Compressed sensing
• A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
• Single resolution compression of arbitrary triangular meshes with properties

Cited In (1)

• On the generation of discrete figures with connectivity constraints

This page was built for publication: A fast recovery method of 2D geometric compressed sensing signal

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