Efficient block-wise algorithm for ompressive holography

Hua Zhang, Liangcai Cao, Hao Zhang, Wenhui Zhang, Guofan Jin, David J. Brady

Research output: Contribution to journalArticlepeer-review

10 Scopus citations

Abstract

Compressive holography is a relatively time-consuming image estimation in convex optimized problem. We propose an efficient block-wise algorithm to limit the searching space and reduce the calculation time while keeping the reconstruction quality. The effective anti-aliasing boundary of the sub-hologram is located to determine the block size for compressive reconstruction in the total-variation two-step iterative shrinkage/thresholding algorithm. Padded sub-holograms could be reconstructed in parallel by using multi-core processors. Compared with the traditional compressive holography, the block-wise algorithm could take approximately 1/50 of the reconstruction time and achieve an improved reconstruction quality.

Original languageEnglish (US)
Pages (from-to)24991-25003
Number of pages13
JournalOptics Express
Volume25
Issue number21
DOIs
StatePublished - Oct 16 2017
Externally publishedYes

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics

Fingerprint

Dive into the research topics of 'Efficient block-wise algorithm for ompressive holography'. Together they form a unique fingerprint.

Cite this