On the uniqueness of the sparse signals reconstruction based on the missing samples variation analysis
Summary: An approach to sparse signals reconstruction considering its missing measurements/samples as variables is recently proposed. Number and positions of missing samples determine the uniqueness of the solution. It has been assumed that analyzed signals are sparse in the discrete Fourier transform (DFT) domain. A theorem for simple uniqueness check is proposed. Two forms of the theorem are presented, for an arbitrary sparse signal and for an already reconstructed signal. The results are demonstrated on illustrative and statistical examples.
- On a gradient-based algorithm for sparse signal reconstruction in the signal/measurements domain
- Exact CS reconstruction condition of undersampled spectrum-sparse signals
- Stable signal recovery from incomplete and inaccurate measurements
- On sparse reconstruction from Fourier and Gaussian measurements
- On Sparse Representations in Arbitrary Redundant Bases
- A mathematical introduction to compressive sensing
- Adaptive greedy approximations
- Beyond Nyquist: Efficient Sampling of Sparse Bandlimited Signals
- Compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Matching pursuits with time-frequency dictionaries
- Robust L-estimation based forms of signal transforms and time-frequency representations
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- The restricted isometry property and its implications for compressed sensing
- Time-Frequency Energy Distributions Meet Compressed Sensing
This page was built for publication: On the uniqueness of the sparse signals reconstruction based on the missing samples variation analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1666192)
