• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.723-726
• /
• 2001

일반적으로 블록기반의 동영상 압축방식은 블록킹효과를 필연적으로 수반한다. 특히 저비트율의 동영상에서는 블록킹 효과가 다른 어떤 영상의 왜곡보다 많이 발생한다. 본 논문에서는 이러한 블록킹효과를 효율적으로 인간 시각체계에 적합하게 실시간으로 제거하는 후처리 알고리즘을 제안한다. 우선 복원된 영상에서 인간의 시각체계와 동영상의 특성에 따라 3가지의 모드로 분리하여 QP(quantization Parameter)에 따라 임계치를 변화함으로써 각 모드의 필터링 범위를 가변시켰다. 이후에 각 모드에 알맞은 일차원 및 적응형 필터링을 적용한다. 적용된 모드별 필터링은 과도한 블러링 현상을 방지하고 영상내의 실제 에지성분읓 보호하면서 효과적으로 블록킹효과를 제거한다. 본 논문에서 제안하는 알고리즘을 실험 영상에 적용하였을 경우에 주관적 화질 및 객관적 화질인 PSNR로 0.5dB 정도 향상되었다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.38 no.2
• /
• pp.149-159
• /
• 2001

The conventional block-based motion prediction suffers, especially in low bit-rate video application, from shortcomings such as blocking artifacts of motion field and unstable motion estimation. To overcome the deficiency, this paper proposes one method of adopting a new motion compensation scheme based on the irregular triangular mesh structure while keeping the current block-based DCT coding structure of H.263 as much as possible. To represent the reconstructed previous frame using minimal number of control points, the proposed method designs content-adaptive irregular triangular meshes, and then, estimate the motion vector of each control point using the affine transformation-based matching. The predicted current frame is obtained by applying the affine transformation to each triangular mesh. Experiment with the several real video sequences shows improvement both in objective and subjective picture quality over the conventional block-based H.263 method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.44 no.5
• /
• pp.73-83
• /
• 2007

In this paper, we propose macroblock(MB)-based adaptive interpolation filter method for improving coding efficiency in H.264/AVC. In the proposed method, nine separable two-dimensional(2D) interpolation filters are applied for precisely compensating motions in various directions. The optimal cost function which considers the bit rate and distortion for coding the MB is defined. The filter is adaptively selected per MB for minimizing the defined cost function. In the experimental results, the proposed method shows more excellent in coding efficiency than the conventional methods for the various standard $QCIF(176{\times}144)/CIF(352{\times}288)$ video test sequences. It leads to about 6.25%(1 reference frame) and 3.46%(5 reference frames) bit rate reduction on average compared to the H.264/AVC.

• Journal of KIISE:Software and Applications
• /
• v.31 no.11
• /
• pp.1474-1482
• /
• 2004

In this paper, we propose an approach for extracting and filtering block motion vectors using an adaptive weight function. We first extract motion vectors from a sequence of images by using size-varibale block matching and then process them by adaptive robust estimation to filter out outliers (motion vectors out of concern). The proposed adaptive robust estimation defines a continuous sigmoid weight function. It then adaptively tunes the sigmoid function to its hard-limit as the residual errors between the model and input data are decreased, so that we can effectively separate non-outliers (motion vectors of concern) from outliers with the finally tuned hard-limit of the weight function. The experimental results show that the suggested approach is very effective in filtering block motion vectors.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.05a
• /
• pp.362-368
• /
• 2005

This paper is related to the fast block matching algorithm, especially a method for expanding the search pattern using the second local matching point in the adaptive hexagonal search. To reduce the local minima problem in fast motion estimation, the proposed method expands the search pattern by adding new searching points selected by using the second local matching point to conventional search pattern formed by the first local matching point in the adaptive hexagonal search. According to estimating the motion vector by applying block matching algorithm based on hexagonal search to the expanded search pattern, the proposed method can effectively carry out fast motion estimation to improve the performance in terms of compensated image quality.

• Journal of the Institute of Convergence Signal Processing
• /
• v.11 no.2
• /
• pp.104-111
• /
• 2010

This paper presents an adaptive image enhancement method using the spatial frequency property in the DCT(discrete cosine transform) compressed domain. The dc coefficients, the illumination components of image, are adjusted to compress the dynamic range of image, and the ac coefficients are modified to enhance the contrast by using the human visual system(HVS) and the spatial frequency property. The ac coefficients are separated into vertical direction, horizontal direction, and mixed spatial frequency components, and adaptively modified to minimize the block artifacts that possibly occur in the image enhancement. The proposed method using dynamic range compression and adaptive contrast enhancement shows the advanced performance without the block artifact compared with existing method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.10
• /
• pp.2645-2652
• /
• 1996

In this paper wepropose a sub-block retransmission scheme for ARQ and hybrid ARQ schemes. When the cannel is quiet the sub-block retransmission scheme behaves like a conventional ARQ or hybrid ARQ scheme. As the channel is becoming noisy, the data block is dvided into small sub-blocks for transmission. Each sub-block is encoded for error control by an apprpriate shortened code and the code length of the shortened code is being adaptive to the corresponding channel BER. the reeived block is checked for errors sub-block by sub-block. The propsoed sub-block retransmission scheme provides improved throughput over conventional schemes by retransmitting only the naked sub-blocks in the occurrence of errors. An example of transferring ATM cells is considered for simulation.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1995.06a
• /
• pp.353-356
• /
• 1995

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.172-181
• /
• 2010

In this paper, we propose an adaptive block quantization method. The propose method perfrect reconstructs side information without high complexity in the encoder side, as transmitting motion vectors from a decoder to an encoder side. Also, at the encoder side, residual signals between reconstructed side information and original frame are adaptively quantized to minimize parity bits to be transmitted to the decoder. The proposed method can effectively allocate bits based on bit error rate of side information. Also, we can achieved bit-saving by transmission of parity bits based on the error correction ability of the LDPC channel decoder, because we can know bit error rate and positions of error bit in encoder side. Experimental results show that the proposed algorithm achieves bit-saving by around 66% and delay of feedback channel, compared with the convntional algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.1C
• /
• pp.19-33
• /
• 2008

A method that is adaptively selecting among previous fast motion estimation algorithms and a newly proposed fast motion estimation algorithm(UCDS) is presented in this paper. The algorithm named AUDC and a newly proposed fast motion estimation algorithms are based on the Diamond Search(DS) algorithm and Three Step Search(TSS). Although many previous fast motion estimation algorithms have lots of advantages, those have lots of disadvantages. So we thought better adaptive selection of fast motion estimation algorithms than only using one fast motion estimation algorithm. Therefore, we propose AUDC that is using length of the MV, Search Point, SAD of the neighboring block and adaptively selecting among Cross Three Step Search(CTSS), Diamond Search(DS) and Ungraded Cross Diamond Search(UCDS). Experimental results show that the AUDC is much more robust, provides a faster searching speed, and smaller distortions than other popular fast block-matching at algorithms.