EUVIMEDEUVIMED entdecken
Crossref

Momentum-Based Hard Thresholding Pursuit for Sparse Signal Recovery

Jinfeng Zhang, Yuxun Huang, Bin Liao, Yaohua Hu

IEEE Signal Processing Letters · 2026 · 33 · 2500-2504

DOI: 10.1109/lsp.2026.3703205 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Signal Processing Letters, 2026. Verfasst von Jinfeng Zhang und 3 weiteren Autor:innen. Die Arbeit nennt 23 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Shenzhen Science and Technology Program.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Hard thresholding-based algorithms have demonstrated outstanding ability in sparse signal recovery. To further enhance their performance, this letter proposes a momentum-based hard thresholding pursuit (MHTP) algorithm, which integrates a momentum-accelerated gradient update with a pursuit step that solves constrained least-squares problems on the estimated support. A sufficient condition for exact sparse recovery under the restricted isometry property (RIP) framework, guaranteeing the convergence of MHTP, is derived. Experimental results demonstrate that MHTP achieves faster convergence and higher recovery accuracy compared to existing methods.

Förderung

  • National Natural Science Foundation of China
  • Shenzhen Science and Technology Program

Zitieren

APA

Zhang, J., Huang, Y., Liao, B., & Hu, Y. (2026). Momentum-Based Hard Thresholding Pursuit for Sparse Signal Recovery. IEEE Signal Processing Letters, 33, 2500-2504. https://doi.org/10.1109/lsp.2026.3703205

Vancouver

Zhang J, Huang Y, Liao B, Hu Y. Momentum-Based Hard Thresholding Pursuit for Sparse Signal Recovery. IEEE Signal Processing Letters. 2026;33:2500-2504. doi:10.1109/lsp.2026.3703205

BibTeX
@article{Zhang2026,
  author = {Zhang, Jinfeng and Huang, Yuxun and Liao, Bin and Hu, Yaohua},
  title = {Momentum-Based Hard Thresholding Pursuit for Sparse Signal Recovery},
  journal = {IEEE Signal Processing Letters},
  year = {2026},
  volume = {33},
  pages = {2500--2504},
  doi = {10.1109/lsp.2026.3703205}
}
Kostenlos starten →