Novel Look-up Table Research Articles

Compact full-color holographic 3-D display based on undersampled computer-generated holograms and oblique projection imaging.

A compact full-color electro-holographic three-dimensional (3-D) display with undersampled computer-generated holograms (US-CGHs) and oblique projection imaging (OPI) is proposed. For its realization, undersampling conditions of the CGH enabling the complete recovery of image information are derived, and the OPI-based longitudinal-to-lateral depth conversion (LTL-DC) scheme allowing the simple reconstruction of full-color images is also proposed. Three-color off-axis US-CGHs are generated with their center-shifted principle fringe patterns (CS-PFPs) of the novel look-up table (NLUT) method, where center-shifts are calculated with the derived undersampling conditions of the CGH based on the generalized sampling theorem, and then multiplexed into the color-multiplexed hologram (CMH). The CMH is loaded on a SLM (spatial light modulator) and reconstructed by being illuminated with a multi-wavelength light source, where an original full-color image is reconstructed being spatially separated from the other color-dispersed images on the projected image plane with the OPI-based LTL-DC process, which enables us to view the original full-color image just with a simple filter mask. Performance analysis and successful experiments with the test 3-D objects in motion confirm the feasibility of the proposed system.

Single SLM full-color holographic three-dimensional video display based on image and frequency-shift multiplexing

A single spatial-light-modulator (SLM) full-color holographic 3-D video display based on image and frequency-shift multiplexing (IFSM) is proposed. In the frequency-shift multiplexing (FSM), three-color holograms are multiplied with their respective phase factors for shifted-separations of their corresponding frequency-spectrums on the Fourier plane. This FSM process, however, causes three-color images to be reconstructed at the center-shifted locations depending on their multiplied phase factors. Center-shifts of those color images due to the FSM can be balanced out just by generation of three-color holograms whose centers are pre-shifted to the opposite directions to those of the image shifts with the novel-look-up-table (NLUT) based on its shift-invariance property, which is called image-shift multiplexing (ISM). These image and frequency-shifted holograms are then multiplexed into a single color-multiplexed hologram and loaded on the SLM, and from which a full-color 3-D image can be reconstructed on the optical 4-f lens system without any color dispersion just by employing a simple pinhole filter mask. Fourier-optical analysis and experiments with 3-D objects in motion confirm the feasibility of the proposed system.

3차원 영상의 블록 중복성 및 N-LUT 기법을 이용한 3차원 홀로그램 프린지 패턴의 고속합성

최근, 기존의 룩업테이블(LUT: Look-up Table) 방식의 과도한 메모리 공간문제를 해결하면서 동시에 홀로그램 프린지 패턴의 고속생성이 가능한 N-LUT(Novel Look-up Table) 기법이 제안되었다. 그러나 3차원 입력영상의 해상도가 증가함에 따라 계산해야 할 물체 포인트 수가 늘어나게 되고 결과적으로 과도한 홀로그램 계산시간이 요구된다. 따라서 본 논문에서는 기존 N-LUT 방식에 3차원 물체영상의 블록 중복성을 효과적으로 이용함으로써 3차원 입체영상 홀로그램을 고속으로 생성할 수 있는 새로운 기법을 제안하였다. 테스트 영상을 이용한 실험결과 새로이 제안된 기법이 기존 방식에 비해 <TEX>$5{\times}5$</TEX> 블록의 경우 계산되는 물체 포인트 수는 43.3%, 계산시간은 47.9%로 각각 감소됨을 보임으로써 제안된 기법의 실제 응용 가능성을 제시하였다. Recently, the novel loop-up table(N-LUT) method to solve the tremendous memory problem of the conventional look-up table (LUT) method as well as to increase the generation speed of hologram patterns has been proposed. But, as the resolution of an input 3-D object is enhanced, the number of object points to be calculated for generation of its hologram pattern also increases, which results in a sharp increase of the computation time. Therefore, in this paper, a new approach for fast generation of the hologram pattern of 3-D object images is proposed by using the block redundancy feature of 3-D object images and the N-LUT method. Experimental results show that in the proposed method the number of object points and the overall computation time have been reduced by 43.3 % and 47.9 %, respectively compared to those of the conventional method for the case of the <TEX>$5{\times}5$</TEX> block size. These good experimental results finally confirm the feasibility of the proposed method.

3차원 동영상의 시ㆍ공간적 정보 중복성을 이용한 효과적인 3차원 비디오 홀로그램의 생성

본 논문에서는 3차원 동영상의 시 공간적 정보 중복성 (TSR: temporal-spatial redundancy)과 노블 룩업테이블(N-LUT: novel look-up table)를 이용한 효과적인 3차원 동영상 홀로그램 생성기법인 TSR-N-LUT을 제시하였다. 제안된 기법에서는 먼저, DPCM (differential pulse code modulation) 알고리즘을 이용하여 3차원 동영상 프레임간의 시간적 중복 데이터를 제거한 다음, 잔여 영상에 대해서도 각 프레임별로 영상라인 간 중복 데이터를 제거하게 된다. 따라서, 시 공간적인 중복 데이터가 제거된 물체영상에 N-LUT 기법을 적용함으로써 효과적으로 3차원 비디오 홀로그램을 합성하게 된다. 실험결과 제안된 TSR-N-LUT 기법은 기존 방법에 비해 평균적으로 홀로그램 계산을 위한 물체 포인트 수가 23.72% 감소함과 동시에 홀로그램 생성속도 역시 19.55% 개선됨을 보임으로써 제안된 기법의 실제 응용 가능성을 제시하였다. In this paper, a new method to efficiently generate the 3-D(three-dimensional) video holograms for 3-D moving scenes, which is called here the TSR-N-LUT method, is proposed by the combined use of temporal-spatial redundancy(TSR) of 3-D video images and novel look-up table(N-LUT) technique. That is, in the proposed scheme, with the differential pulse code modulation (DPCM) algorithm, temporally redundancy redundant data in the inter-frame of a 3-D video images are removed between the frames, and then inter-line redundant data in the inter-frame of 3-D video images are also removed by using the DPCM method between the lines. Experimental results show that the proposed method could reduced the number of calculated object points and the calculation time of one object point by 23.72% and 19.55%, respectively on the average compared to the conventional method. Good experimental results with 3-D test moving pictures finally confirmed the feasibility of the proposed method to the fast generation of CGH patterns of the 3-D video images.

Effective memory reduction of the novel look-up table with one-dimensional sub-principle fringe patterns in computer-generated holograms

We propose a novel approach to massively reduce the memory of the novel look-up table (N-LUT) for computer-generated holograms by employing one-dimensional (1-D) sub-principle fringe patterns (sub-PFPs). Two-dimensional (2-D) PFPs used in the conventional N-LUT method are decomposed into a pair of 1-D sub-PFPs through a trigonometric relation. Then, these 1-D sub-PFPs are pre-calculated and stored in the proposed method, which results in a remarkable reduction of the memory of the N-LUT. Experimental results reveal that the memory capacity of the LUT, N-LUT and proposed methods have been calculated to be 149.01 TB, 2.29 GB and 1.51 MB, respectively for the 3-D object having image points of 500 × 500 × 256, which means the memory of the proposed method could be reduced by 103 × 10(6) fold and 1.55 × 10(3) fold compared to those of the conventional LUT and N-LUT methods, respectively.

Accelerated computation of hologram patterns by use of interline redundancy of 3-D object images

We present a new approach for accelerated computation of hologram patterns of a three-dimensional (3-D) image by taking into account of its interline redundant data. Interline redundant data of a 3-D image are extracted with the differential pulse code modulation (DPCM) algorithm, and then the CGH patterns for these compressed line images are generated with the novel lookup table (N-LUT) technique. To confirm the feasibility of the proposed method, experiments with four kinds of 3-D test objects are carried out, and the results are comparatively discussed with the conventional methods in terms of the number of object points and the computation time. Experimental results show that the number of calculated object points and the computation time for one object point have been reduced by 73.3 and 83.9%, on the average, for four test 3-D images in the proposed method employing a top-down scanning method, compared to the conventional method.

Effective reduction of the novel look-up table memory size based on a relationship between the pixel pitch and reconstruction distance of a computer-generated hologram

In this paper, we propose an approach, new to our knowledge, to effectively generate and reconstruct the resolution-enhanced computer-generated hologram (CGH) of three-dimensional (3-D) objects with a significantly reduced in memory size novel look-up table (N-LUT) by taking into account a relationship between the pixel pitch and reconstruction distance of the hologram pattern. In the proposed method, a CGH pattern composed of shifted versions of the principal fringe patterns (PFPs) with a short pixel pitch can be reconstructed just by using the CGH generated with a much longer pixel pitch by controlling the hologram reconstruction distance. Accordingly, the corresponding N-LUT memory size required for resolution-enhanced hologram patterns can be significantly reduced in the proposed method. To confirm the feasibility of the proposed method, experiments are carried out and the results are discussed.

Efficient generation of computer‐generated hologram patterns using spatially redundant data on a 3d object and the novel look‐up table method

In this paper, a new approach is proposed for the efficient generation of computer‐generated holograms (CGHs) using the spatially redundant data on a 3D object and the novel look‐up table (N‐LUT) method. First, the pre‐calculated N‐point principle fringe patterns (PFPs) were calculated using the 1‐point PFP of the N‐LUT. Second, spatially redundant data on a 3D object were extracted and re‐grouped into the N‐point redundancy map using the run‐length encoding (RLE) method. Then CGH patterns were generated using the spatial redundancy map and the N‐LUT method. Finally, the generated hologram patterns were reconstructed. In this approach, the object points that were involved in the calculation of the CGH patterns were dramatically reduced, due to which the computational speed was increased. Some experiments with a test 3D object were carried out and the results were compared with those of conventional methods.

Fast computation of hologram patterns of a 3D object using run-length encoding and novel look-up table methods

In this paper we propose a new approach for fast generation of computer-generated holograms (CGHs) of a 3D object by using the run-length encoding (RLE) and the novel look-up table (N-LUT) methods. With the RLE method, spatially redundant data of a 3D object are extracted and regrouped into the N-point redundancy map according to the number of the adjacent object points having the same 3D value. Based on this redundancy map, N-point principle fringe patterns (PFPs) are newly calculated by using the 1-point PFP of the N-LUT, and the CGH pattern for the 3D object is generated with these N-point PFPs. In this approach, object points to be involved in calculation of the CGH pattern can be dramatically reduced and, as a result, an increase of computational speed can be obtained. Some experiments with a test 3D object are carried out and the results are compared to those of the conventional methods.

Computational approaches for fast generation of digital 3D video holograms

Several approaches for fast generation of digital holograms of a three-dimensional (3D) object have been discussed. Among them, the novel look-up table (N-LUT) method is analyzed to dramatically reduce the number of pre-calculated fringe patterns required for computation of digital holograms of a 3D object by employing a new concept of principal fringe patterns, so that problems of computational complexity and huge memory size of the conventional ray-tracing and look-up table methods have been considerably alleviated. Meanwhile, as the 3D video images have a lot of temporally or spatially redundant data in their inter- and intra-frames, computation time of the 3D video holograms could be also reduced just by removing these redundant data. Thus, a couple of computational methods for generation of 3D video holograms by combined use of the N-LUT method and data compression algorithms are also presented and discussed. Some experimental results finally reveal that by using this approach a great reduction of computation time of 3D video holograms could be achieved.

Fast generation of three-dimensional video holograms by combined use of data compression and lookup table techniques

Even though there are many types of methods to generate CGH (computer-generated hologram) patterns of three-dimensional (3D) objects, most of them have been applied to still images but not to video images due to their computational complexity in applications of 3D video holograms. A new method for fast computation of CGH patterns for 3D video images is proposed by combined use of data compression and lookup table techniques. Temporally redundant data of the 3D video images are removed with the differential pulse code modulation (DPCM) algorithm, and then the CGH patterns for these compressed videos are generated with the novel lookup table (N-LUT) technique. To confirm the feasibility of the proposed method, some experiments with test 3D videos are carried out, and the results are comparatively discussed with the conventional methods in terms of the number of object points and computation time.

Effective generation of digital holograms of three-dimensional objects using a novel look-up table method

Several approaches for increasing the speed in computation of the digital holograms of three-dimensional objects have been presented with applications to real-time display of holographic images. Among them, a look-up table (LUT) approach, in which the precalculated principal fringe patterns for all possible image points of the object are provided, has gained a large speed increase in generation of computer-generated holograms. But the greatest drawback of this method is the enormous memory size of the LUT. A novel approach to dramatically reduce the size of the conventional LUT, still keeping its advantage of fast computational speed, is proposed, which is called here a novel LUT (N-LUT) method. A three-dimensional object can be treated as a set of image planes discretely sliced in the z direction, in which each image plane having a fixed depth is approximated as some collection of self-luminous object points of light. In the proposed method, only the fringe patterns of the center points on each image plane are precalculated, called principal fringe patterns (PFPs) and stored in the LUT. Then, the fringe patterns for other object points on each image plane can be obtained by simply shifting this precalculated PFP according to the displaced values from the center to those points and adding them together. Some experimental results reveal that the computational speed and the required memory size of the proposed approach are found to be 69.5 times faster than that of the ray-tracing method and 744 times smaller than that of the conventional LUT method, respectively.