• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1015-1018
• /
• 2002

We show how any discrete wavelet transform or two band subband filtering with finite filters can be decomposed onto a finite sequence of simple filtering steps, which we call lifting steps but that are also known as ladder structures, We present a self-contained derivations, building the decomposition from the basic principles such as the Euclidean algorithm, with a focus on a applying it to wavelet filtering. This factorization provides an alternative for the lattice factorization, with the advantage that it can also be used in the bi-orthogonal, i.e, non-unitary case. Lifting leads to a speed-up when compared to the standard implementation. We show that this lifting scheme can be applied in image compression efficiently

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.91-94
• /
• 2003

H.264/AVC is the upcoming video coding standard of ITU-T H.264 and ISO MPEG-4 AVC. The new standard can achieve a significant improvement up to 50％ in compression ratio compared to MPEG-4 advanced simple profile. In this paper, we propose the novel intra prediction scheme to speed up intra prediction process in H.264/AVC decoder and show the hardware architecture for it. The proposed scheme uses the concurrent processing of the 4$\times$4 intra prediction, which is based on that some 4$\times$4 block pairs in a 16$\times$16 luma block can be processed concurrently. The proposed scheme can reduce intra prediction time by 33 ％.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.530-533
• /
• 1999

During the last decade, high quality digital audio has essentially replaced analog audio. During this period, digital audio have applied many application areas of the info-industry. These applications have created a demand for high quality digital audio. In audio compression, the methods using human auditory nervous properties are used and introduced from psychoacoustical model utilized perceptual audio coding unable to code above the limitation of human perception. The discussion concentrates on architectures and applications of those techniques which utilize psychoacoustical models to exploit efficiently masking characteristics of the human receiver. In this paper, the designed MDCT/IMBCT as a standard of current MPEG is implemented onto FPGA.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.8
• /
• pp.1127-1136
• /
• 1995

In this paper, a morphological shape decomposition method is proposed for the purpose of pattern recognition and image compression. In the method, a structuring element that geometrical characteristics is more similar to the shape function is preselected. The shape is decomposed into the primitive elements corresponding to the structuring element. A gray scale image also is transformed into 8 bit plane images for the hierarchical reconstruction required in image communication systems. The shape in each bitplane is decomposed to the proposed method. Through the experiment. it is proved that the description error is reduced and the coding efficiency is improved.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.10
• /
• pp.130-139
• /
• 1994

Video compression algorithms are based on removing spatial and/or temproal redundancy inherent in image sequences by predictive(DPCM) encoding, transform encoding, or a combination of predictive and transform encoding. In this paper, each 8$\times$8 DCT coefficient of DFD(displaced frame difference) is adaptively quantized by one of the four quantizers depending on total distortion level, which is determined by characteristics of HVS(human visual system) and buffer status. Therefore, the number of possible quantizer selection vectors(patterns) is 4$^{64}$. If this vectors are coded, toomany bits are required. Thus, the quantizer selection vectors are limited to 2048 for Y and 512 for each U, V by the proposed method using SWAD(sum of weighted absolute difference) for discriminating vectors. The computer simulation results, using the codebook vectors which are made by the proposed method, show that the subjective and objective image quality (PSNR) are goor with the limited bit allocation. (17Mbps)

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.1711-1714
• /
• 2003

The noise in an image degrades image quality and deteriorates coding efficiency of compression. Recently, various edge-preserving noise filtering methods based on the nonstationary image model have been proposed to overcome this problem. In most conventional nonstationary image models, however, pixels are assumed to be uncorrelated to each other In order not to increase the computational burden too much. As a result, some detailed information is lost in the filtered results. In this paper, we propose a computationally feasible adaptive noise smoothing algorithm which considers the nonstationary correlation characteristics of images. We assume that an image has a nonstationary mean and can be segmented into subimages which have individually different stationary correlations. Taking advantage of the special structure of the covariance matrix that results from the proposed image model, we derive a computationally efficient FFT-based adaptive linear minimum mean square error filter. The justification for the proposed image model is presented and the effectiveness of the proposed algorithm is demonstrated experimentally.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.4
• /
• pp.25-32
• /
• 1997

In this paper, we propose an adaptive BTC algorithm using the characteristics of the error signals. The BTC algorithm has a avantage that it is low computational complexity, but a disadvantage that it produces the ragged edges in the reconstructed images for th esloping regions beause of coding the input with 2-level signals. Firstly, proposed methods classify the input into low, medium, and high activity blocks based on the variance of th einput. Using 1-level quantizer for low activity block, 2-level for medium, and 4-level for high, it is adaptive methods that reduce bit rates and the inherent quantization noises in the 2-level quantizer. Also, in case of processing high activity block, we propose a new quantization level allocation algorithm using the characteristics of the error signals between the original signals and the reconstructed signals used by 2-level quantizer, in oder that reduce bit rates superior to the conventional 4-level quantizer. Especially, considering the characteristics of input block, we reduce the bit rates without incurrng the visual noises.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.6 no.4
• /
• pp.227-233
• /
• 2006

In order to reduce blocking artifacts and improve compression efficiency, H.264/AVC standard employs an adaptive in-loop deblocking filter. This paper proposes a new hardware architecture of the deblocking filter that employs a four-stage pipelined structure with an efficient data distribution. The proposed architecture allows a simultaneous supply of eight data samples to fully utilize the pipelined filter in both horizontal and vertical filterings. This paper also presents a new filtering order and data reuse scheme between consecutive macroblock filterings to reduce the communication for external memory access. The number of required cycles for filtering one macroblock (MB) is 357 cycles when the proposed filter uses dual port SRAMs. This execution speed is only 41.3% of that of the fastest previous work.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.60-64
• /
• 2011

In this paper, we propose a new post-processing technique that removes blocking and ringing artifacts in Block discrete cosine transformation (BDCT)-coded images using bilateral filtering. The selection of filter parameters is a key issue in the application of a bilateral filter because it significantly affects the result. An efficient method of selecting the bilateral filter parameters is presented. The experimental results show that the proposed approach alleviates the artifacts efficiently in terms of PSNR, MSDS, and SSIM.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.10 no.2
• /
• pp.46-52
• /
• 2011

This paper presents adaptive spread-spectrum watermarking scheme on the H.264/AVC video. The H.264/AVC has become popular video coding since it's compression performance has been improved greatly. That is why there is not enough space for embedding watermark using the spread-spectrum method. To overcome this problem, we propose selective block embedding scheme. The blocks which don't contain non-zero DCT (Discrete Cosine Transform) coefficients are selected by value. So we have enough space to embed watermarks. Experimental result shows that proposed scheme improves recovery rates of watermark about 12% and reduces distortion of watermarked video.