Sensing Matrix Optimization for Block-Sparse Decoding
From MaRDI portal
Abstract: Recent work has demonstrated that using a carefully designed sensing matrix rather than a random one, can improve the performance of compressed sensing. In particular, a well-designed sensing matrix can reduce the coherence between the atoms of the equivalent dictionary, and as a consequence, reduce the reconstruction error. In some applications, the signals of interest can be well approximated by a union of a small number of subspaces (e.g., face recognition and motion segmentation). This implies the existence of a dictionary which leads to block-sparse representations. In this work, we propose a framework for sensing matrix design that improves the ability of block-sparse approximation techniques to reconstruct and classify signals. This method is based on minimizing a weighted sum of the inter-block coherence and the sub-block coherence of the equivalent dictionary. Our experiments show that the proposed algorithm significantly improves signal recovery and classification ability of the Block-OMP algorithm compared to sensing matrix optimization methods that do not employ block structure.
Cited in
(7)- A preconditioning approach for improved estimation of sparse polynomial chaos expansions
- Alternating Optimization of Sensing Matrix and Sparsifying Dictionary for Compressed Sensing
- On collaborative compressive sensing systems: the framework, design, and algorithm
- Recovery under side constraints
- Exploiting prior knowledge in compressed sensing to design robust systems for endoscopy image recovery
- Foveated compressive imaging for low power vehicle fingerprinting and tracking in aerial imagery
- A near-optimal sampling strategy for sparse recovery of polynomial chaos expansions
This page was built for publication: Sensing Matrix Optimization for Block-Sparse Decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4573179)