Efficient block-wise algorithm for compressive holography.

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.