.png){kind=icon}
.png){kind=icon}
Return
Efficient block-wise algorithm for ompressive holography
.png){kind=icon}
OA
AI
DOI：10.1364/OE.25.024991.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2017 Optical Society of America
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
6.1W
Citations:
14.3W