In this paper, we propose a new approach for accelerated computation of the computer-generated hologram (CGH) of a
3-D object by using the N×N-point principle fringe patterns (PFPs)-based novel look-up table (N-LUT) method. Using
the two-dimensional (2-D) run-length encoding (RLE) algorithm, redundant data of a 3-D object are extracted in image
blocks and re-grouped into an N×N-point redundancy map depending on the block size. Basing on this redundancy map,
the N×N-point PFPs are calculated, from which the CGH pattern of a 3-D object can be generated. With the block-based
extraction of the redundant data and the N×N-point PFPs-based computation of the CGH pattern, the object points to be
calculated could be significantly reduced, which results in a great increase in the computational speed. Experimental
results show that for 3×3-point PFPs, the computational speed of the proposed method has been improved by 61.16%
compared to the conventional N-LUT method.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.