• Journal of Broadcast Engineering
• /
• v.15 no.2
• /
• pp.232-235
• /
• 2010

This paper proposes an efficient depth-map coding method. The adaptive block-based depth-map coding method decides the number of bit planes to be encoded according to the quantization parameters to obtain the desired bit rates. So, the depth-map coding using the block-based decision of the bit-plane to be encoded proposes to free from the constraint of the quantization parameters. Simulation results show that the proposed method, in comparison with the adaptive block-based depth-map coding method, improves the average BD-rate savings by 3.5% and the average BD-PSNR gains by 0.25dB.

• ETRI Journal
• /
• v.43 no.2
• /
• pp.313-323
• /
• 2021

The Joint Video Exploration Team (JVET) has studied future video coding (FVC) technologies with a potential compression capacity that significantly exceeds that of the high-efficiency video coding (HEVC) standard. The joint exploration test model (JEM), a common platform for the exploration of FVC technologies in the JVET, employs quadtree plus binary tree block partitioning, which enhances the flexibility of coding unit partitioning. Despite significant improvement in coding efficiency for chrominance achieved by separating luminance and chrominance tree structures in I slices, this approach has intrinsic drawbacks that result in the redundancy of block partitioning data. In this paper, an adaptive tree structure correlating luminance and chrominance of single and dual trees is presented. Our proposed method resulted in an average reduction of -0.24% in the Y Bjontegaard Delta rate relative to the intracoding of JEM 6.0 common test conditions.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.371-374
• /
• 2001

본 논문에서는 움직임 보상을 이용한 Motion-Adaptive De-interlacing Method를 제안 한다. 정확한 움직임 추정을 위해서 Pre-filter로서 EBMF(Edge Based Median Filter)를 사용하며 새로운 Block Matching Method를 제안한다. Temporal Filter로서 Motion Missing Error를 제거하기 위해 입력 영상의 움직임 영역에 따라 각각 다른 임계 값을 적용하는 AMPDF(Adaptive Minimum Pixel Difference Filter)를 적용하였으며 MMD(Maximum Motion Detection)와 SAD(Sum of Difference)를 이용하여 빠른 움직임 영역에서 화질을 향상시켰다. 최종적으로 잘못된 움직임 보상에 기인하는 화질의 열화를 방지하기 위한 Motion Correction Filter를 제안한다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.2
• /
• pp.11-19
• /
• 2010

Most of deblocking filters assumes that the block boundaries are accurately known and the coding information like quantization parameters are available. In some applications such as commercial television, however, many external video inputs without known block boundary and coding information arc given. If a decompressed video sequence heavily degraded with blocking artifacts is given through the external video port, it is absolutely necessary to detect block boundaries and control the strength of deblocking filtering by analysing the given images. This paper presents an efficient method to find the block boundaries and estimate the strength of the blocking artifacts without the knowledge of coding information. In addition, the confidence of the estimated blocking artifact information is also evaluated to control the adaptive deblocking filter robustly. Experiment results show that the estimated block boundary locations and strength relative strength and confidence information are practically good enough to reduce the blocking artifacts without prior knowledge.

• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.65-68
• /
• 2001

In this paper, we propose a method to interpolate two images obtained from two parallel cameras. The proposed method uses BDM(Bidirectional Disparity Map) to prevent hole generation due to occlusion. Furthermore, we use the block-based DM(Disparity Map) to decrease the amount of computation, and also use the adaptive block size to minimize the error of the block-based DM.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.793-794
• /
• 2008

The block size of intra prediction mode can differentiate the texture area from the homogeneous area of image. This information can be used to enhance the size resolution of image. Specifically, in this paper, we apply the bicubic interpolation or the bilinear interpolation adaptively selected the intra prediction mode of the H.264 compression.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1097-1100
• /
• 1999

Due to the significant computation of full search in motion estimation, extensive research in fast motion estimation algorithms has been carried out. However, most of the algorithms have the degradation in predicted images compared with the full search algorithm. To reduce an amount of significant computation while keeping the same prediction quality of the full search, we propose a fast block-matching algorithm based on gradient magnitude of reference block without any degradation of predicted image. By using Taylor series expansion, we show that the block matching errors between reference block and candidate block are proportional to the gradient magnitude of matching block. With the derived result, we propose fast full search algorithm with adaptively determined scan direction in the block matching. Experimentally, our proposed algorithm is very efficient in terms of computational speedup and has the smallest computation among all the conventional full search algorithms. Therefore, our algorithm is useful in VLSI implementation of video encoder requiring real-time application.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.7-10
• /
• 2000

Fast block motion estimation technique is proposed to reduce the computational complexity in video coding. In the conventional methods the size of search region is fixed. For small motion regions like background the small size of sea of search region is enough to find a block motion. But for active motion regions the large size of search region is preferred to figure out the accurate motion vector. Therefore, it is reasonable that a block motion is estimated in the variable search region (both the size and the position of it). That is to say, the search region varies according to the predicted motion characteristics of a block. The block motion in video frames has temporal continuity and then the search region of a current block is predicted using the block motion of previous blocks. The computational complexity of the proposed technique is significantly reduced with a good picture quality compared to the conventional methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.7
• /
• pp.1687-1693
• /
• 2013

This paper addresses an adaptive postprocessing technique to remove blocking effects of the highly compressed images. The proposed technique removes blocking effects selectively by applying filters with different strength according to block analysis based on the directional activity. One-dimensional filters which are used to remove grid noises accomplish the adaptive filtering to the signal itself as well as to the directionality of the block. Moreover, we propose a detection method of the staircase noises and corner outliers and a two-dimensional directional filter to remove them. Experimental results for various images and bitrates show that the proposed method outperforms the conventional methods in PSNR for the objective performance and GBIM for the subjective quality evaluation.

• Journal of Broadcast Engineering
• /
• v.2 no.1
• /
• pp.45-55
• /
• 1997

In this paper, we propose a fast algorithm with adaptive thresholding for the wavelet transform (WT) based blocking artifact reduction. In the fast algorithm, all processings that are equivalent to the processing in WT domain of the first and second scale are performed in spatial domain. In the adaptive thresholding, the threshold values used to classify the block boundary are selected adaptively according to each input image by using the statistical properties of the WT of the coded signal at block boundary and at block center, which can be obtained in spatial domain. Experimental results showed that the proposed fast algorithm is about 10 times faster than the WT-based algorithm. It also was found that the postprocessing with proposed adaptive thresholding yields some PSNR improvement and better subjective quality over that with nonadaptive thresholding which has best performance at high compression ratios of a certain .image, even at low compression ratios.