2010
DOI: 10.1117/12.848472
|View full text |Cite
|
Sign up to set email alerts
|

A fast analytical algorithm for generating CGH of 3D scene

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
4
0

Year Published

2014
2014
2015
2015

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 0 publications
0
4
0
Order By: Relevance
“…However, when the scene geometry contains complex shapes, a large number of small planar segments containing only one or a few points are needed to sample it, making the wave-field approach less efficient than the point-source approach. In order to reduce the computation burden, several methods have been proposed, including the use of analytic expression of the angular spectrum [19,20,21,22,23], and color space conversion [24,25].…”
Section: Introductionmentioning
confidence: 99%
“…However, when the scene geometry contains complex shapes, a large number of small planar segments containing only one or a few points are needed to sample it, making the wave-field approach less efficient than the point-source approach. In order to reduce the computation burden, several methods have been proposed, including the use of analytic expression of the angular spectrum [19,20,21,22,23], and color space conversion [24,25].…”
Section: Introductionmentioning
confidence: 99%
“…However, when the scene geometry contains complex shapes, a large number of small planar segments containing only one or a few points are needed to sample it, making the wave-field approach less efficient than the point-source approach. In order to reduce the CGH calculation time, several methods have been proposed, including the use of analytic expression of the angular spectrum [19,20,21,22,23] and color-space conversion [24,25].…”
Section: Introductionmentioning
confidence: 99%
“…[1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16] One of them is the look-up-table (LUT) method. 1 In this method, a significant increase of the computational speed has been obtained by precalculating all fringe patterns corresponding to point-source contributions from each of the possible locations in the object volume, which are called elemental fringe patterns (EFPs), and by storing them in the LUT.…”
Section: Introductionmentioning
confidence: 99%
“…[11][12][13][14][15][16] For the N-LUT algorithm, simultaneous loading of a set of PFPs as well as the input 3-D object data onto the internal memory of the GPU is needed for the calculation of Fresnel hologram patterns, so that the memory and computing structure of the GPU must be carefully evaluated for efficient implementation of the N-LUT on them. In this regard, the conventional 2-D N-LUT requiring more than GB memory for storing the 2-D PFPs may not be compatible with the GPU having low-memory capacities.…”
Section: Introductionmentioning
confidence: 99%