11
Views
0
CrossRef citations to date
0
Altmetric
Articles

Compressed sensing photoacoustic imaging based on the gradient projection Newton pursuit algorithm

, , &
Pages 955-971 | Received 30 Nov 2023, Accepted 14 May 2024, Published online: 18 Jun 2024
 

Abstract

Photoacoustic imaging (PAI) is a unique non-invasive biomedical imaging technique that illuminates biological tissue with short-pulsed laser light. This process generates acoustic waves, which in turn enable high-resolution and high-contrast imaging of deep tissue. However, the complexity of PAI imaging data presents challenges in achieving rapid and optimal reconstruction results due to the time and resource demands of traditional Nyquist sampling. On the contrary, compressive sensing (CS) overcomes the limitations of Nyquist sampling by recovering the original signal with a lower amount of sampled data, resulting in significant cost savings in signal transmission and processing. Additionally, CS-based hard-thresholding iterative algorithms possess various advantages in sparse optimization, including sparsity control and fast computation. Moreover, the assumptions of the Gradient Projection Newton Pursuit (GPNP) for CS problems are relatively weaker compared to many state-of-the-art algorithms. Therefore, we investigated the performance of the GPNP algorithm in PAI. We compared our algorithm with improved iterative hard thresholding (IIHT), conjugate gradient iterative hard thresholding (CGIHT), compressive sampling matching pursuit (CoSaMP), SPGL1, SALSA and elastic net algorithms using phantom, Vasculature, and SGERF simulation images. The simulation results demonstrate that the GPNP algorithm achieves excellent image reconstruction performance when evaluating both the quality of reconstruction and the reconstruction time. Taking the simulation results of Vasculature with a noise level of 40 dB and 40 channels as an example, the PNSR index of GPNP has improved by 4.09, 11.03, 12.89, 13.14, 13.15, and 11.75 compared to IIHT, CGIHT, elastic net algorithms, SPGL1, SALSA and CoSaMP, respectively.

Disclosure statement

No potential conflict of interest was reported by the author(s).

Additional information

Funding

This study was partly supported by the Natural Science Foundation of Shandong Province (ZR2020QF025, ZR2023Q H140), National Natural Science Foundation of China (61976110, 62176112), and Discipline with Strong Characteristics of Liaocheng University-Intelligent Science and Technology under Grants 319462208.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 61.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 922.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.