A fast computational method for computer‐generated Fourier hologram using patch model

Sakamoto, Yuji; Nagao, Tomohiro

doi:10.1002/ecjb.10051

Cited by 8 publications

(4 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the Fraunhofer region, when the distance from a basic patch to a hologram is z 0 , the basic object light, u b ðx b ; y b Þ, is derived by substituting z ¼ z 0 , x h ¼ x b , and y h ¼ y b into Eq. (7). By the same token, in the Fresnel region u b ðx b ; y b Þ is derived by substituting z ¼ z 0 , x h ¼ x b , and y h ¼ y b into Eq.…”

Section: Transformsmentioning

confidence: 99%

See 1 more Smart Citation

Fast computation method for a Fresnel hologram using three-dimensional affine transformations in real space

Sakata

Sakamoto

2009

Appl. Opt.

Self Cite

View full text Add to dashboard Cite

Calculating computer-generated holograms takes a tremendous amount of computation time. We propose a fast method for calculating object lights for Fresnel holograms without the use of a Fourier transform. This method generates object lights of variously shaped patches from a basic object light for a fixed-shape patch by using three-dimensional affine transforms. It can thus calculate holograms that display complex objects including patches of various shapes. Computer simulations and optical experiments demonstrate the effectiveness of this method. The results show that it performs twice as fast as a method that uses a Fourier transform.

show abstract

Section: Transformsmentioning

confidence: 99%

“…One proposed method transforms a precalculated object light from a point light and calculates an object light from another point light at a different distance [4]. Another proposed method uses a patch model [7]. The object lights from various patches are obtained by transforming only one precalculated object light from a patch.…”

Section: Introductionmentioning

confidence: 99%

Fast computation method for a Fresnel hologram using three-dimensional affine transformations in real space

Sakata

Sakamoto

2009

Appl. Opt.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Basically, heavy computation is involved in the hologram generation process, and the addition of numerical encryption will further lower the computation efficiency. Some of the representative works that provide a moderate amount of reduction on the computation load in hologram generation include [14][15][16][17][18][19][20][21][22][23]. Second, the decoding and reconstruction process is also computationally demanding as an encrypted hologram has a wider space-bandwidth product than the source data.…”

Section: Introductionmentioning

confidence: 99%

Fast numerical generation and encryption of computer-generated Fresnel holograms

2010

View full text Add to dashboard Cite

In the past two decades, generation and encryption of holographic images have been identified as two important areas of investigation in digital holography. The integration of these two technologies has enabled images to be encrypted with more dimensions of freedom on top of simply employing the encryption keys. Despite the moderate success attained to date, and the rapid advancement of computing technology in recent years, the heavy computation load involved in these two processes remains a major bottleneck in the evolution of the digital holography technology. To alleviate this problem, we have proposed a fast and economical solution which is capable of generating, and at the same time encrypting, holograms with numerical means. In our method, the hologram formation mechanism is decomposed into a pair of onedimensional (1D) processes. In the first stage, a given three-dimensional (3D) scene is partitioned into a stack of uniformed spaced horizontal planes and converted into a set of hologram sublines. Next, the sublines are expanded to a hologram by convolving it with a 1D reference signal. To encrypt the hologram, the reference signal is first convolved with a key function in the form of a maximum length sequence (also known as MLS, or M-sequence). The use of a MLS has two advantages. First, an MLS is spectrally flat so that it will not jeopardize the frequency spectrum of the hologram. Second, the autocorrelation function of an MLS is close to a train of Kronecker delta function. As a result, the encrypted hologram can be decoded by correlating it with the same key that is adopted in the encoding process. Experimental results reveal that the proposed method can be applied to generate and encrypt holograms with a small number of computations. In addition, the encrypted hologram can be decoded and reconstructed to the original 3D scene with good fidelity.

show abstract

“…The transforms are 3D affine transformations in the spatial domain. Scaling, rotation, and skew transformations in the direction of the x, y, and z axes within the Fresnel region have been proposed [5,6]. With FFT for a square-shaped hologram with n pixels on each side, the calculation order of propagation is Oðn 2 log nÞ.…”

Section: Introductionmentioning

confidence: 99%

Calculation method for computer-generated holograms with cylindrical basic object light by using a graphics processing unit

et al. 2011

Self Cite

View full text Add to dashboard Cite

It takes an enormous amount of time to calculate a computer-generated hologram (CGH). A fast calculation method for a CGH using precalculated object light has been proposed in which the light waves of an arbitrary object are calculated using transform calculations of the precalculated object light. However, this method requires a huge amount of memory. This paper proposes the use of a method that uses a cylindrical basic object light to reduce the memory requirement. Furthermore, it is accelerated by using a graphics processing unit (GPU). Experimental results show that the calculation speed on a GPU is about 65 times faster than that on a CPU.

show abstract

A fast computational method for computer‐generated Fourier hologram using patch model

Cited by 8 publications

References 6 publications

Fast computation method for a Fresnel hologram using three-dimensional affine transformations in real space

Fast computation method for a Fresnel hologram using three-dimensional affine transformations in real space

Fast numerical generation and encryption of computer-generated Fresnel holograms

Calculation method for computer-generated holograms with cylindrical basic object light by using a graphics processing unit

Contact Info

Product

Resources

About