• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.3
• /
• pp.873-879
• /
• 2010

In this paper, MPEG2(Moving Picture Expert Group 2) image data video decoding technique is presented, it is Huffman decoding method and fractal image method which is very complexive algorithm and have too much times to implement this method. This have defect of overlap decoding and transport work because of impossible to represent objective value of resemblance. The proposed method was calculated the mathematical absolute image resemblance and simplify the moving picture process to reducing the step of moving picture codefying. The results show that smoothed moving picture compared recent methods.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.187-194
• /
• 2011

In this paper, JPEG(Joint Photographic Experts Group) image data video decoding technique is presented, it is Huffman decoding method and fractal image method which is very complexive algorithm and the time required much it to implement this method and the first image is decoded to video frame image. This have defect of overlap decoding and transport work because of impossible to represent objective value of resemblance. The proposed method was calculated the mathematical absolute image resemblance and simplify the moving picture process to reducing the step of moving picture codefying. The results show that smoothed moving picture compared recent methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.564-575
• /
• 1996

Conventional decoding procedures have some problems in order to obtain reconstructed images with high speed. In this paper, the solutions of these are studied and a new fast decoding algorithm is proposed. The proposed algorithm uses a convergence criterion that is used to reduce the redundant iteration in the conventional method and to determine continuation of decoding. The initical image similar to roiginal image is estimated firstly in this algorithm. From the simulation resuls, the proposed algorithm is able to achieve the reconstructed image within 3-4 iteration under the objective criterion. Without any increment of the memory, the quality of the image reconstructed by the proposed algorithm has same quality asthe conventional method.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.12
• /
• pp.97-103
• /
• 1996

This paper presents a new security verification technique based on an image encryption by a white noise image that serves as an encryption key. In the proposed method that resembles holographic process, the encryption process is executed digitally using FFT routine which gives chances for separating corruptive noise from reconstructed primary image The encoded image thus obtained is regarded as an nterference pattern caused by two lightwaves transmitted through the primary image and the white noise image. The decoding process is executed optically and in real-tiem fashion where lightwave transmitted through the white noise image illuminates the encrypted card.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.5
• /
• pp.907-914
• /
• 1997

The conventional decoding procedure for the images encoded using fractal contractive transformation algorithms is performed by applying the transformations iteratively for an arbirary initial image. In this paper, we showed that the atractor image can be obtained analytically when the image is encoded using the fractal algorithm proposed by Monro and Dudbridge, in which the corresponding domain block for a range block is fixed. Using the analytical formula, we can obtain the attractor image without iteration procedure. Computer simulation results for various test images show that we can increase the image decoding speed by more than five times when we use the analytical formula compared to the previous iteration methods. Also we confirmed that the real time decoding by software on PD is possible for the moving picture with QCIF formats.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10b
• /
• pp.859-862
• /
• 2000

본 논문에서는 기존의 TV 시스템에서 사용하는 영상신호의 encoding/decoding 방법과 새롭게 제안되는 constant luminance encoding/decoding 방법을 컴퓨터로 구현하고, 기존의 방법과 제안된 방법으로 재생된 영상의 칼라 정보의 차이에 대한 데이터를 제시한다. 또한 디지털 방송에 적합한 encoding/decoding 시스템의 선택에 대한 고찰도 포함한다.

• Current Optics and Photonics
• /
• v.2 no.5
• /
• pp.422-430
• /
• 2018

Rolling shutter operation of CMOS cameras can be utilized in optical camera communications in order to transmit data from an LED to mobile devices such as smart-phones. From temporally modulated light, a spatial flicker pattern is obtained in the captured image, and this is used for signal recovery. Due to the degradation of rolling shutter images caused by light smear, motion blur, and focus blur, the conventional decoding schemes for rolling shutter cameras based on the pattern width for 'OFF' and 'ON' cannot guarantee robust communications performance for practical uses. Aside from conventional techniques, such as polynomial fitting, histogram equalization can be used for blurry light mitigation, but it requires additional computation abilities resulting in burdens on mobile devices. This paper proposes a transition-based decoding scheme for rolling shutter cameras in order to offer simple and robust data decoding in the presence of image degradation. Based on the designed synchronization pulse and modulated data symbols according to the LED dimming level, the decoding process is conducted by observing the transition patterns of two sequential symbol pulses. For this, the extended symbol pulse caused by consecutive symbol pulses with the same level determines whether the second pulse should be included for the next bit decoding or not. The proposed method simply identifies the transition patterns of sequential symbol pulses other than the pattern width of 'OFF' and 'ON' for data decoding, and thus, it is simpler and more accurate. Experimental results ensured that the transition-based decoding scheme is robust even in the presence of blurry lights in the captured image at various dimming levels

• Korean Journal of Optics and Photonics
• /
• v.19 no.4
• /
• pp.262-269
• /
• 2008

In this paper, we propose an image watermark method using multiple decoding keys. The advantages of this method are that the multiple original images are reconstructed by using multiple decoding keys in the same watermark image, and that the quality of reconstructed images is clearly enhanced based on the idea of Walsh code without any side lobe components in the decoding process. The zero-padded original images, multiplied with random-phase pattern to each other, are Fourier transformed. Encoded images are then obtained by taking the real-valued data from these Fourier transformed images. The embedding images are obtained by the product of independent Walsh codes, and these spreaded phase-encoded images which are multiplied with new random-phase images. Also we obtain the decoding keys by multiplying these random-phase images with the same Walsh code images used in the embedding images. A watermark image is then made from the linear superposition of the weighted embedding images and a cover image, which is multiplied with a new independent Walsh code. The original image is simply reconstructed by the inverse-Fourier transform of the despreaded image of the multiplication between the watermark image and the decoding key. Computer simulations demonstrate the efficiency of the proposed watermark method with multiple decoding keys and a good robustness to the external attacks such as cropping and compression.

• Journal of Korea Game Society
• /
• v.13 no.6
• /
• pp.35-42
• /
• 2013

A new compressed image format is proposed to use a large size of image in mobile games without the constraints of hardware specifications such as memory amount, processing power, which encodes each block of a large size image in scan line order. Using the experiments, we show the effectiveness of proposed method compared with a general PNG in terms of compression ratios and required memory in decoding processes. Also, the loading delay can be reduced by decoding only the displaying area of a large image in run-time.

• Journal of Broadcast Engineering
• /
• v.23 no.3
• /
• pp.431-436
• /
• 2018

In this paper, a simple but effective algorithm to reduce the computational complexity of thumbnail generation and to improve image quality without aliasing artifacts is proposed. For the high speed decoding, the proposed algorithm performs partial decoding per $4{\times}4$ boundary in TU(Transform Unit), and preforms TU boundary in PU(Prediction Unit). The proposed method defines the weights based on intra prediction directions and estimates the thumbnail pixel by using that weights. this method remains thumbnail extraction time and improves thumbnail image quality compared with conventional algorithms.