Coherence pattern-guided compressive sensing with unresolved grids Highly coherent sensing matrices arise in discretization of continuum imaging problems such as radar and medical imaging when the grid spacing is below the Rayleigh threshold. Algorithms based on techniques of band exclusion (BE) and local optimization (LO) are proposed to deal with such coherent sensing matrices. These techniques are embedded in the existing compressed sensing algorithms, such as orthogonal matching pursuit (OMP), subspace pursuit (SP), iterative hard thresholding (IHT), basis pursuit (BP), and Lasso, and result in the modified algorithms BLOOMP, BLOSP, BLOIHT, BP-BLOT, and Lasso-BLOT, respectively. Under appropriate conditions, it is proved that BLOOMP can reconstruct sparse, widely separated objects up to one Rayleigh length in the Bottleneck distance independent of the grid spacing. One of the most distinguishing attributes of BLOOMP is its capability of dealing with large dynamic ranges. par The BLO-based algorithms are systematically tested with respect to four performance metrics: dynamic range, noise stability, sparsity, and resolution. With respect to dynamic range and noise stability, BLOOMP is the best performer. With respect to sparsity, BLOOMP is the best performer for high dynamic range, while for dynamic range near unity BP-BLOT and Lasso-BLOT with the optimized regularization parameter have the best performance. In the noiseless case, BP-BLOT has the highest resolving power up to certain dynamic range. The algorithms BLOSP and BLOIHT are good alternatives to BLOOMP and BP/Lasso-BLOT: they are faster than both BLOOMP and BP/Lasso-BLOT and share, to a lesser degree, BLOOMP’s amazing attribute with respect to dynamic range. Detailed comparisons with the algorithms spectral iterative hard thresholding and the frame-adapted BP demonstrate the superiority of the BLO-based algorithms for the problem of sparse approximation in terms of highly coherent, redundant dictionaries.

This software is also peer reviewed by journal TOMS.

References in zbMATH (referenced in 28 articles , 1 standard article )

Showing results 1 to 20 of 28.
Sorted by year (citations)

1 2 next

  1. Ge, Huanmin; Li, Peng: The Dantzig selector: recovery of signal via (\ell_1-\alpha\ell_2) minimization (2022)
  2. Bian, Fengmiao; Zhang, Xiaoqun: A three-operator splitting algorithm for nonconvex sparsity regularization (2021)
  3. García, Hernán; Hernández, Camilo; Junca, Mauricio; Velasco, Mauricio: Approximate super-resolution of positive measures in all dimensions (2021)
  4. Guo, Weihong; Lou, Yifei; Qin, Jing; Yan, Ming: A novel regularization based on the error function for sparse recovery (2021)
  5. Kang, Sung Ha; Liao, Wenjing; Liu, Yingjie: IDENT: identifying differential equations with numerical time evolution (2021)
  6. Li, Weilin; Liao, Wenjing: Stable super-resolution limit and smallest singular value of restricted Fourier matrices (2021)
  7. Condat, Laurent: Atomic norm minimization for decomposition into complex exponentials and optimal transport in Fourier domain (2020)
  8. Eldar, Yonina C.; Liao, Wenjing; Tang, Sui: Sensor calibration for off-the-grid spectral estimation (2020)
  9. Li, Peng; Chen, Wengu; Ge, Huanmin; Ng, Michael K.: (\ell_1-\alpha\ell_2) minimization methods for signal and image reconstruction with impulsive noise removal (2020)
  10. Moscoso, Miguel; Novikov, Alexei; Papanicolaou, George; Tsogka, Chrysoula: Imaging with highly incomplete and corrupted data (2020)
  11. Li, Yunyi; Dai, Fei; Cheng, Xiefeng; Xu, Li; Gui, Guan: Multiple-prespecified-dictionary sparse representation for compressive sensing image reconstruction with nonconvex regularization (2019)
  12. Lou, Yifei; Yan, Ming: Fast L1-L2 minimization via a proximal operator (2018)
  13. Yang, Jie; Yang, Yixin; Liao, Guisheng; Lei, Bo: A super-resolution direction of arrival estimation algorithm for coprime array via sparse Bayesian learning inference (2018)
  14. Zhang, Shuai; Xin, Jack: Minimization of transformed (L_1) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing (2018)
  15. Ma, Tian-Hui; Lou, Yifei; Huang, Ting-Zhu: Truncated (l_1-2) models for sparse recovery and rank minimization (2017)
  16. Wang, Dan; Zhang, Zhuhong: Generalized sparse recovery model and its neural dynamical optimization method for compressed sensing (2017)
  17. Yang, Zai; Xie, Lihua: On gridless sparse methods for multi-snapshot direction of arrival estimation (2017)
  18. Zhu, Zhihui; Wakin, Michael B.: Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries (2017)
  19. Adcock, Ben; Hansen, Anders C.: Generalized sampling and infinite-dimensional compressed sensing (2016)
  20. Cai, T. Tony; Eldar, Yonina C.; Li, Xiaodong: Global testing against sparse alternatives in time-frequency analysis (2016)

1 2 next