Efficient block-wise algorithm for compressive holography.

Published

Journal Article

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.

Full Text

Duke Authors

Cited Authors

  • Zhang, H; Cao, L; Zhang, H; Zhang, W; Jin, G; Brady, DJ

Published Date

  • October 2017

Published In

Volume / Issue

  • 25 / 21

Start / End Page

  • 24991 - 25003

PubMed ID

  • 29041172

Pubmed Central ID

  • 29041172

Electronic International Standard Serial Number (EISSN)

  • 1094-4087

International Standard Serial Number (ISSN)

  • 1094-4087

Digital Object Identifier (DOI)

  • 10.1364/oe.25.024991

Language

  • eng