• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.11a
• /
• pp.182-185
• /
• 2013

본 논문에서는 효과적인 홀로그래픽 비디오 서비스를 다양한 재생환경에서 제공하기 위한 스케일러블 코딩 방법을 제안한다. 이 방법은 홀로그램과 광원의 차영상을 사용하여 압축을 하는 방식으로 구성된다. 즉, 기존의 스케일러블 코딩방식인 홀로그램 해상도 스케일러블 코딩과 광원의 화질 스케일러블 코딩 방식을 조합하여 새로운 알고리즘을 제안한다. $1,024{\times}1,024$ 크기의 홀로그램의 차영상에 대해서는 손실압축, 광원의 차영상은 무손실 압축을 이용하여 스케일러블 코딩을 수행함으로써 적응적인 서비스가 가능하도록 한다.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.52 no.10
• /
• pp.591-597
• /
• 2003

In this paper, a best-basis selection algorithm that improves the performance of the coding gains and the computational complexity is proposed. The proposed algorithm limits the computational complexity according to the resolved threshold value and decomposes the parent subbands by using the top-down tree search and the relative energy between the parent subbands and the child subbands. For the experiments of the proposed algorithm, the bit-rates, the peak signal-to-noise ratio (PSNR), and the reconstructed images are presented by using the Quad-tree coder. The result of the proposed algorithm is compared to that of DWT algorithm using the Quad-tree coder for a set of standard test images. In addition, the result of the proposed algorithm is compared to that of JPEG-2000 algorithm and that of S+P algorithm.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2002.11a
• /
• pp.105-109
• /
• 2002

The main ideas of hybrid video coding methods are to reduce the spatial and temporal redundancy for efficient data compression. If compressed video stream is transmitted through the error-prone channel, bitstream can be critically damaged and the spatio-temporal error propagates through successive frames at the decoder because of drift noise in the references between encoder and decoder. In this paper, I propose the lagrangian multiplier selection method in the error-prone environment. Finally, it is shown that the performance comparisons of the R-D optimized mode decision are made against the conventional method and simulation results are given in the following.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1106-1111
• /
• 1999

Discrete cosine Transform (DCT) is most popular block transform coding in lossy mode. DCT is close to statistically optimal transform - the Karhunen Loeve transform. In this paper, a module for still image encoder is implemented with TMS320C80 based on JPEG, which are international standards for image compression. Th still image encoder consists of three parts- a transformer, a vector quantizer and an entropy encoder.

• Journal of information and communication convergence engineering
• /
• v.8 no.4
• /
• pp.405-410
• /
• 2010

Image processing operations like smoothing and edge detection, and many more are very widely used in areas like Computer Vision. We classify the image processing domain as seven branches-image acquirement and output, image coding and compression, image enhancement and restoration, image transformation, image segmentation, image description, and image recognition and description. We implemented algorithms of gaussian smoothing, laplace sharpening, image contrast effect, image black and white effect, image fog effect, image bright and dark effect, image median filter, and canny edge detection. Such experimental results show the figures respectively.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.240-245
• /
• 2010

Jacket matrices, motivated by the complex Hadamard matrix, have played important roles in signal processing, communications, image compression, cryptography, etc. In this paper, we suggest a novel approach to design a simple class of space-time block codes (STBCs) to reduce its peak-to-average power ratio. The proposed code provides coding gain due to the characteristics of the complex Hadamard matrix, which is a special case of Jacket matrices. Also, it can achieve full rate and full diversity with the simple decoding. Simulations show the good performance of the proposed codes in terms of symbol error rate. For generality, a kind of quasi-orthogonal STBC may be similarly designed with the improved performance.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.51 no.4
• /
• pp.198-205
• /
• 2002

In this paper, we proposed a wavelet image coder based on the portable embedded microprocessor. The proposed coder stores the bit level information of the wavelet coefficient in the 2D significance array. Using this information, the coder make the significance check for coefficient and bit level scanning at the same pass. The proposed method has the advantage that we can reduce the scan iteratively and the memory usage for the coding process. Experimental results show that the proposed method outperforms popular image coders such as JPEG, EZW and SPIHT in based on the portable embedded system environment.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.980-982
• /
• 1995

Image coding based on a fractal theory of iterated transformations presents highly compressed image. In this paper, we compress image using the partitioning method which devides image adaptively in horizon and vertical axis. This method can encode image more compactly than the quadtree partitioning method. The maximum range size can be selected as $32{\times}32$ blocks and the minimum size can be $4{\times}4$ blocks. And the domain size is twice as many as the range size.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.5
• /
• pp.849-855
• /
• 1987

This paper describes an implementation of the absolute moment block truncation coding(AMBTC) in real time for the moving picture data compression. We have realized a system composed of the encoder and decoder, and operated it using an NTSC TV signal. The encoder consists of a 4-1line buffer memory and a data processing block. Besides, there are signal conditioner and a control signal generator. Experimental results show that the quality of the processed image with a data rate of 10Mb/s is slightly degraded, but not objectionable, comparing data rate of 80Mb/s.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.827-830
• /
• 2000

In this paper, we propose the method using PCA(principal component analysis) algorithm when proposed algorithm performs multimedia information indexing. After we extract DC coefficients of DCT from MPEG video stream which is an international standard of moving picture compression coding, we apply PCA algorithm to image made of DC coefficients and extract the feature of each DC image. Using extracted features, we generate codebook and perform multimedia information indexing. The proposed algorithm Is very fast when indexing and can generate optimized codebook because of using statistical feature of data