• Journal of information and communication convergence engineering
• /
• 제9권6호
• /
• pp.671-675
• /
• 2011

DVC (Distributed Video Coding) and FRUC (Frame Rate Up Conversion) techniques need to have an efficient motion compensated frame interpolation algorithms. Conventional works of these applications have mainly focused on the performance improvement of overall system. But, in some applications, it is necessary to evaluate how well the MCI (Motion Compensated Interpolation) frame matches the original frame. For this aim, this paper deals with the modeling methods for evaluating the block-based matching cost. First, several matching criteria, which have already been dealt with the motion compensated frame interpolation, are introduced and then combined to make estimate models for the size of MSE (Mean Square Error) noise of the MCI frame to original one. Through computer simulations, it is shown that the block-based matching criteria are evaluated and the proposed model can be effectively used for estimating the MSE noise.

• ETRI Journal
• /
• 제23권4호
• /
• pp.190-198
• /
• 2001

The performance of Motion Compensated Discrete Cosine Transform (MC-DCT) video coding is improved by using the region adaptive subband image coding [18]. On the assumption that the video is acquired from the camera on a moving platform and the distance between the camera and the scene is large enough, both the motion of camera and the motion of moving objects in a frame are compensated. For the compensation of camera motion, a feature matching algorithm is employed. Several feature points extracted using a Sobel operator are used to compensate the camera motion of translation, rotation, and zoom. The illumination change between frames is also compensated. Motion compensated frame differences are divided into three regions called stationary background, moving objects, and newly emerging areas each of which is arbitrarily shaped. Different quantizers are used for different regions. Compared to the conventional MC-DCT video coding using block matching algorithm, our video coding scheme shows about 1.0-dB improvements on average for the experimental video samples.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.927-928
• /
• 2008

In this paper, a interpolation error concealment algorithm of motion compensated interpolated frame for motion compensated frame rate conversion to reduce the block artifacts caused by failure of conventional motion estimation based on block matching algorithm is proposed. Experimental results show good performance of the proposed scheme with significant reduction of the block artifacts.

• 전자공학회논문지B
• /
• 제29B권8호
• /
• pp.66-73
• /
• 1992

This paper proposes a new motion estimation algorithm which takes into account the rate-distortion relation in encoding motion compensated error images. The proposed algorithm is based on a new block-matching criterion which is the function of not only the mean squared block-matching error but also the code length for the entropy coded motion vector. The proposed algorithm optimizes the trade-off between the bit rate for motion compensated error images and the bit rate for the motion vectors. Simulation results show that in the motion compensated image coding the proposed motion estimator improves the overall performance by 0.5 dB when compared to the motion estimator which uses MSE only.

• 대한전자공학회논문지
• /
• 제25권3호
• /
• pp.327-334
• /
• 1988

In this paper, the performance of PRA (pel recurdive algorithm) and BMA(block matching algorithm), which are the most well-known motion estimation techniques, is compared and the effects of the motion estimation accuracy on the motion compensated coding are described. Results of computer simulation on the real images indicate that the TSS (three step search), which is one of the BMA,is slightly better than the PRA in terms of the accuracy however, the required bit rate is 6.6-8.2 Kbps higher that of the PRA because the TSS requires a transmission of motion estimation vectors.

• Journal of the Optical Society of Korea
• /
• 제19권5호
• /
• pp.537-543
• /
• 2015

Liquid crystal displays (LCDs) have slow responses, so motion blurs are often perceived in fast moving scenes. To reduce this motion blur, we propose a novel method of robust motion compensated frame interpolation (MCFI) based on bidirectional motion estimation (BME) and weight-overlapped block motion compensation (WOBMC) with variable block sizes. In most MCFI methods, a static block size is used, so some block artefacts and motion blurs are observed. However, the proposed method adjusts motion block sizes and search ranges by comparing matching scores, so the precise motion vectors can be estimated in accordance with motions. In the MCFI, overlapping ranges for WOBMC are also determined by adjusted block sizes, so the accurate MCFI can be performed. In the experimental results, the proposed method strongly reduced motion blurs arisen from large motions, and yielded interpolated images with high visual performance and peak signal-to-noise ratio (PSNR).

• 한국콘텐츠학회논문지
• /
• 제13권5호
• /
• pp.28-36
• /
• 2013

비디오 신호에서 움직임 보상 보간 기술은 다양한 응용 분야를 갖는다. 프레임율 증가 변환이나 분산 비디오 부호화 기술에서는 효과적인 움직임 보상 보간 알고리즘을 필요로 한다. 이러한 응용 분야에서는 움직임 보상 보간 프레임에 대한 효과적인 후처리 기술을 통하여 화질을 개선하거나 또는 가상 채널 잡음을 줄임으로써 채널 전송 비트율을 줄이기 위해 각 블록 단위의 신뢰도 측정이 요구된다. 본 논문에서는 움직임 보상 보간 블록에 대한 시공간적 통계특성에 기초한 블록 기반의 신뢰도 평가방법을 제안한다. 제안한 방법은 현재 보간 프레임의 시간적 정합척도를 조사하고, 이 결과를 시간적 통계특성 뿐만 아니라, 공간적 통계특성을 조사하는 방법으로 설계된다. 모의실험을 통하여 제안한 방식은 기존의 단순한 시간적 정합 비용에 의한 방식에 비해 우수한 성능을 보인다.

• 방송공학회논문지
• /
• 제18권3호
• /
• pp.342-348
• /
• 2013

본 논문에서는 적응적인 확장 블록을 사용하는 프레임율 증강 기법인 AEBME (Adaptive Extended Bilateral Motion Estimation)을 제안하고자 한다. 기존의 EBME (Extended Bilateral Motion Estimation) 알고리듬은 동일한 구역에 두 번의 움직임 예측을 수행함으로 인해 높은 계산량이 요구되었다. 본 논문에서는 영상의 edge 정보를 활용한 블록 유형의 일치 유무를 고려하여 EBME 수행여부를 결정함으로써 움직임 예측 과정을 보다 빠르게 수행하도록 하였다. 움직임 벡터 평활화 과정이 적용되어 움직임 벡터 필드 내의 이상 벡터를 찾아 수정한다. 최종적으로 OBMC (Overlapped Block Motion Compensation)와 MCFI (Motion Compensated Frame Interpolation)이 프레임 움직임의 성질에 따라 적용되어 중간 프레임을 보간하게 된다. 실험 결과를 통해 제안하는 알고리듬이 기존의 알고리듬인 EBME에 비해 향상된 성능과 빠른 속도를 보임을 알 수 있다.

• 정보처리학회논문지B
• /
• 제8B권5호
• /
• pp.557-564
• /
• 2001

일반적으로 블록기반 움직임 추정에서 움직임 경계에 위치한 블록 내에서 서로 다른 움직임을 갖는 여러 움직임 영역이 공존한다. 이 때 블록 내의 움직임 보상오차는 각 움직임 영역에 따라 다르게 나타난다. 이는 기존의 평균절대오차와 같이 블록 전체에 대해 누적된 정합오차를 사용할 경우, 그릇된 움직임을 추정하고, 블록 전체의 움직임 보상에서 시각적으로 화질을 저하시키는 결과를 초래할 수 있다. 본 논문에서는 이러한 문제점을 해결하기 위해 시공간적으로 인접한 블록들의 움직임 정보를 이용하여 블록을 움직임에 따라 영역별로 나누고, 각 영역별 평균 움직임 보상오차를 구한 후, 영역간 보상오차의 최소편차를 고려하는 새로운 정합함수를 정의함으로써 최적의 움직임 벡터를 추정하기 위한 방법을 제안한다. 모의실험을 실시하여 기존의 평균절대오차를 사용한 전역 탐색법(full search : FS)과 윤곽기반 블룩 정합(edge oriented block matching algorithm)에 대한 추정결과를 서로 비교하여 제안한 방법의 우수성을 보였으며, 특히 움직임 보상결과 움직임 경계에서의 화질향상을 얻을 수 있었다.

• 대한전자공학회논문지
• /
• 제24권4호
• /
• pp.667-674
• /
• 1987

In this paper an effective block matching algorithm is proposed to find the motion vector. There are two approaches to the estimation of the motion vector in MCC (motion compensated coding), i.e., pel(pixel element) recursive algorithm and block matching algorithm. The search algorithm in this paper is based on the block matching method. The advantage of a proposed algorithm using integral projections is the reduction of the computation time. While the conventional block matching methods have to be computed in 2-dimensional arrays, the proposed algorithm using integral projections can be computed in 1-dimensional arrays. In comparison with conventional block matching methods, a computer simulation shows that though the prediction error increases 0.23 db, it is not detectable for human eyes and the average reduction ratio of computation time obtained from the proposed algorithm is about 3-4.