• Journal of Broadcast Engineering
• /
• v.25 no.6
• /
• pp.836-844
• /
• 2020

A very large number of pixels is required to generate a computer generated hologram (CGH) with a large-size and wide viewing angle equivalent to that of an analog hologram, which incurs a very large amount of computation. For this reason, a high-performance computing device and long computation time were required to generate high-definition CGH. To solve these problems, in this paper, we propose a technique for generating high-definition CGH by arraying the pre-calculated low-definition CGH and multiplying the appropriately-shifted concave lens function. Using the proposed technique, 0.1 Gigapixel CGH recorded by the point cloud method can be used to calculate 2.5 Gigapixels CGH at a very high speed, and the recorded hologram image was successfully reconstructed through the experiment.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.1
• /
• pp.58-63
• /
• 2020

This paper proposes the method for improving the localization accuracy of the mobile robot based on the stereo camera. To restore the position information from stereo images obtained by the stereo camera, the corresponding point which corresponds to one pixel on the left image should be found on the right image. For this, there is the general method to search for corresponding point by calculating the similarity of pixel with pixels on the epipolar line. However, there are some disadvantages because all pixels on the epipolar line should be calculated and the similarity is calculated by only pixel value like RGB color space. To make up for this weak point, this paper implements the method to search for the corresponding point simply by calculating the gap of x-coordinate when the feature points, which are extracted by feature extraction and matched by feature matching method, are a pair and located on the same y-coordinate on the left/right image. In addition, the proposed method tries to preserve the number of feature points as much as possible by finding the corresponding points through the conventional algorithm in case of unmatched features. Because the number of the feature points has effect on the accuracy of the localization. The position of the mobile robot is compensated based on 3-D coordinates of the features which are restored by the feature points and corresponding points. As experimental results, by the proposed method, the number of the feature points are increased for compensating the position and the position of the mobile robot can be compensated more than only feature extraction.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.10
• /
• pp.162-170
• /
• 2013

In recent years, the interests and needs of the Pedestrian Protection System (PPS), which is mounted on the vehicle for the purpose of traffic safety improvement is increasing. In this paper, we propose a pedestrian candidate window extraction and unit cell histogram based HOG descriptor calculation methods. At pedestrian detection candidate windows extraction stage, the bright ratio of pedestrian and its circumference region, vertical edge projection, edge factor, and PCA reconstruction image are used. Dalal's HOG requires pixel based histogram calculation by Gaussian weights and trilinear interpolation on overlapping blocks, But our method performs Gaussian down-weight and computes histogram on a per-cell basis, and then the histogram is combined with the adjacent cell, so our method can be calculated faster than Dalal's method. Our PCA reconstruction error based pedestrian detection candidate window extraction method efficiently classifies background based on the difference between pedestrian's head and shoulder area. The proposed method improves detection speed compared to the conventional HOG just using image without any prior information from camera calibration or depth map obtained from stereo cameras.

• Korean Journal of Optics and Photonics
• /
• v.17 no.6
• /
• pp.507-513
• /
• 2006

In this paper, we propose an improved image encryption and fault-tolerance decryption method using phase wrapping and phase encoding in the frequency domain. To generate an encrypted image, an encrypting key which denotes the product of a phase-encoded virtual image, not an original image, and a random phase image is zero-padded and Fourier transformed and its real-valued data is phase-encoded. The decryption process is simply performed by performing the inverse Fourier transform for multiplication of the encrypted key with the decrypting key, made of the proposed phase wrapping method, in the output plane with a spatial filter. This process has the advantages of solving optical alignment and pixel-to-pixel mapping problems. The proposed method using the virtual image, which does not contain any information from the original image, prevents the possibility of counterfeiting from unauthorized people and also can be used as a current spatial light modulator technology by phase encoding of the real-valued data. Computer simulations show the validity of the encryption scheme and the robustness to noise of the encrypted key or the decryption key in the proposed technique.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.656-659
• /
• 2012

In general, images captured by the color filter array are compressed after applying demosaicking process. Since this process introduces data redundancy which can reduce coding efficiency, several methods have been proposed to address this problem. While some conventional approachs convert color format to GBR or YUV 4:2:2 format, we propose to use the YCoCg 4:2:2 format to carry out compression. The proposed method shows an average bits reduction of 3.91% and PSNR increase of 0.04dB compared with H.264 YUV 4:2:0 intra-profile prediction method.

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.168-174
• /
• 2007

In this paper, we propose a reversible watermarking algorithm where an original image can be recovered from the watermarked image. Most watermarking algorithms cause degradation of image quality in original digital contents in the process of embedding watermarks. In the proposed algorithm, the original image can be obtained when the degradation is removed from the watermarked image after extracting watermark information. In the proposed algorithm, we utilize a peak point of image histogram and the location map and modify pixel values slightly to embed data. Because the peak point of image histogram and the location map are employed in this algorithm, there is no need of extra information transmitted to the receiving side. As the locations watermark embedding are identified using the location map, the amount of watermark data can increase through recursive embedding.

• Spatial Information Research
• /
• v.19 no.1
• /
• pp.29-40
• /
• 2011

GOCI the world first Ocean Color Imager in Geostationary Orbit, which could obtain total 8 images of the same region a day, however, its spatial resolution(500m) is not enough to use for the accurate land application, Super Resolution(SR), reconstructing the high resolution(HR) image from multiple low resolution(LR) images introduced by computer vision field. could be applied to the time-series remotely sensed images such as GOCI data, and the higher resolution image could be reconstructed from multiple images by the SR, and also the cloud masked area of images could be recovered. As the precedent study for developing the efficient SR method for GOCI images, on this research, it reproduced the simulated data under the acquisition process of the remote sensed data, and then the simulated images arc applied to the proposed algorithm. From the proposed algorithm result of the simulated data, it turned out that low resolution(LR) images could be registered in sub-pixel accuracy, and the reconstructed HR image including RMSE, PSNR, SSIM Index value compared with original HR image were 0.5763, 52.9183 db, 0.9486, could be obtained.

• Progress in Medical Physics
• /
• v.27 no.1
• /
• pp.1-7
• /
• 2016

In this work, we considered a compressed-sensing (CS)-based image deblurring scheme with a total-variation (TV) regularization penalty for improving image characteristics in digital tomosynthesis (DTS). We implemented the proposed image deblurring algorithm and performed a systematic simulation to demonstrate its viability. We also performed an experiment by using a table-top setup which consists of an x-ray tube operated at $90kV_p$, 6 mAs and a CMOS-type flat-panel detector having a $198-{\mu}m$ pixel resolution. In the both simulation and experiment, 51 projection images were taken with a tomographic angle range of ${\theta}=60^{\circ}$ and an angle step of ${\Delta}{\theta}=1.2^{\circ}$ and then deblurred by using the proposed deblurring algorithm before performing the common filtered-backprojection (FBP)-based DTS reconstruction. According to our results, the image sharpness of the recovered x-ray images and the reconstructed DTS images were significantly improved and the cross-plane spatial resolution in DTS was also improved by a factor of about 1.4. Thus the proposed deblurring scheme appears to be effective for the blurring problems in both conventional radiography and DTS and is applicable to improve the present image characteristics.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.5
• /
• pp.457-467
• /
• 2000

본 논문에서는 분산 메모리 구조를 갖는 병렬 컴퓨터 상에서 방대한 크기를 갖는 볼륨 데이터의 효과적인 가시화를 위한 병렬 광선 투사법을 제안한다. 데이터의 압축을 기반으로 하는 본 기법은 다른 프로세서의 메모리로부터 데이터를 읽기보다는 자신의 지역 메모리에 존재하는 압축된 데이터를 빠르게 복원함으로써 병렬 렌더링 성능을 향상시키는 것을 목표로 한다. 본 기법은 객체-순서와 영상-순서 탐색 알고리즘 모두의 정점을 이용하여 성능을 향상시켰다. 즉, 블록 단위의 최대-최소 팔진트리의 탐색과 각 픽셀의 불투명도 값을 동적으로 유지하는 실시간 사진트리를 응용함으로써 객체-공간과 영상-공간 각각의 응집성을 이용하였다. 본 논문에서 제안하는 압축 기반 병렬 볼륨 렌더링 방법은 렌더링 수행 중 발생하는 프로세서간의 통신을 최소화하도록 구현되었는데, 이러한 특징은 프로세서 사이의 상당히 높은 데이터 통신 비용을 감수하여야 하는 PC 및 워크스테이션의 클러스터와 같은 더욱 실용적인 분산 환경에서 매우 유용하다. 본 논문에서는 Cray T3E 병렬 컴퓨터 상에서 Visible Man 데이터를 이용하여 실험을 수행하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.657-660
• /
• 2006

자연영상이나 스팸메일 영상으로부터 텍스트 영역을 추출하고 추출한 텍스트 영역에 이진화를 수행하고 나면 가로 방향이나 세로획 방향으로 놓여 있는 "1" 그리고 "ㅡ" 에 해당하는 한글의 종성부분이 이미지 내의 잡영을 지울 때 종종 지워지는 결과를 볼 수 있다. 이렇게 지워진 획 부분을 되살리기 위한 방법으로 텍스트 Hinting 알고리즘을 제안한다. 텍스트 Hinting 알고리즘은 이진화된 이미지의 텍스트 픽셀 위치와 동일한 좌표에 해당하는 원본 이미지의 RGB 값을 추출하여 추출된 텍스트 후보 영역의 색상을 알아낸다. 추출된 텍스트 색상 레이어 이미지와 이진화된 이미지에 OR연산을 수행하게 되면 지워진 획 부분을 복원할 수 있다. 제안한 방법을 스팸 이미지에 적용한 결과 텍스트 추출결과를 획기적으로 개선할 수 있음을 보였다.