• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권9호
• /
• pp.2351-2369
• /
• 2012

This paper describes interpolation method of motion field in the Wyner-Ziv video coding (WZVC) based on Expectation-Maximization (EM) algorithm. In the EM algorithm, the estimated motion field distribution is calculated on a block-by-block basis. Each pixel in the block shares similar probability distribution, producing an undesired blocking artefact on the pixel-based motion field. The proposed interpolation techniques are Bicubic and Lanczos which successively use 16 and 32 neighborhood probability distributions of block-based motion field for one pixel in k-by-k block on pixel-based motion field. EM-based WZVC codec updates the estimated probability distribution on block-based motion field, and interpolates it to pixel resolution. This is required to generate higher-quality soft side information (SI) such that the decoding algorithm is able to make syndrome estimation more quickly. Our experiments showed that the proposed interpolation methods have the capability to reduce EM-based WZVC decoding complexity with small increment of bit rate.

• 전자공학회논문지B
• /
• 제33B권6호
• /
• pp.82-91
• /
• 1996

In this paper, an image coding technique using fractal interpolation is proposed. Similar to the conventional methods, an image is partitioned into blocks and each block is coded independently. However, an interpolation point is ahsared by its neighboring blocks. This means that each block can use all its interpolation points with minimal increase of new data. For a simple implementation, triangular blocks are used instead of square blocks and new coefficients are difined. Data obtained in the encoding process hav estatistical characteristics suitable sfor entropy coding, an dthus arithmetic coding is perfomred for improving the compression efficiency. The results of the proposed coder in comparison with those of a conventional coder show that the interpolation method reduces block effect caused by a memoryless block coder, especially at low bit rates. This improvement is due to sharing of information between adjacent blocks. Moreover, th enumber of iteration required in ecoding process is reduced since more information is used to decode each block.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제51권6호
• /
• pp.235-240
• /
• 2002

This paper presents a new method for estimating the block pulse series coefficients by using the Lagrange's second order interpolation polynomial. Block pulse functions have been used in a variety of fields such as the analysis and controller design of the systems. When the block pulse functions are used, it is necessary to find the more exact value of the block pulse series coefficients. But these coefficients have been estimated by the mean of the adjacent discrete values, and the result is not sufficient when the values are changing extremely. In this paper, the method for improving the accuracy of the block pulse series coefficients by using the Lagrange's second order interpolation polynomial is presented.

• 한국멀티미디어학회논문지
• /
• 제20권10호
• /
• pp.1655-1661
• /
• 2017

A high-speed directional interpolation algorithm based on the pattern of a $2{\times}2$ pixel block is proposed in this paper. The basic concept of the proposed algorithm is started from UDWT(un-decimated discrete wavelet transform), but there are no transform operations. In order to detect the direction of the edge, 4-pixel differences of two pairs in the $2{\times}2$ block are compared. The $2{\times}2$ block patterns are grouped into total 8 classes, and thereafter the directional interpolation is executed according to the type of the pattern. Since the calculation of the proposed algorithm is very simple and needs a few additions on integer data type, the computation time is almost same as that of bilinear interpolation algorithm. However, experimental results show that the output quality of the proposed one is better than those of the conventional interpolation ones in the objective quality and the computation time.

• 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).

• 대한전기학회논문지:시스템및제어부문D
• /
• 제52권6호
• /
• pp.351-358
• /
• 2003

This paper presents a new method for finding the Block Pulse series coefficients, deriving the Block Pulse integration operational matrices and generalizing the integration operational matrices which are necessary for the control fields using the Block Pulse functions. In order to apply the Block Pulse function technique to the problems of state estimation or parameter identification more efficiently, it is necessary to find the more exact value of the Block Pulse series coefficients and integral operational matrices. This paper presents the method for improving the accuracy of the Block Pulse series coefficients and derives the related integration operational matrices and generalized integration operational matrix by using the Lagrange second order interpolation polynomial.

• 한국인터넷방송통신학회논문지
• /
• 제17권5호
• /
• pp.157-163
• /
• 2017

데이터 탐색법 중 가장 널리 알려진 이진법은 평균과 최악의 경우 $O(log_2n)$, 보간법은 평균 $O(log_2log_2n)$, 최악의 경우 O(n)의 수행 복잡도를 갖고 있다. 또한 기존의 보간탐색법은 사전정보없이 킷값이 확률적으로 위치한 정보에 근거하여 탐색을 한다. 본 논문에서는 데이터의 MSB 인덱스를 블록으로 하는 블록탐색법으로 해당 블록범위를 결정하고, 블록 내에서는 보간법을 적용하여 탐색하는 하이브리드 블록과 보간탐색 알고리즘을 제안한다. 제안된 알고리즘은 블록탐색법의 사전 정보를 활용하여 탐색범위를 축소시키고 축소된 탐색범위내에서 무정보 방법으로 탐색하는 방법으로 평균과 최악의 경우 모두 수행복잡도는 $O(log_2log_2n_i)$, $n_i{\simeq}0.1n$으로 보간탐색법의 평균 수행복잡도에 비해 10배 정도 시간을 단축시킬 수 있다.

• 방송공학회논문지
• /
• 제9권1호
• /
• pp.54-63
• /
• 2004

서로 다른 프레임 율을 가진 영상매체 사이의 프레임 호환을 위해, 움직임 추정 (motion estimation, ME)과 움직임 보상을 이용한 중간 영상 삽입 (합성) 기법 (motion compensated interpolation, MCI)이 활용되는데, 본 논문에서는 MCI에 적합한 움직임 추정기법을 제안하고, 제안한 움직임 추정 기법을 종래의 MCI에 적용한다. 종래의 방법에선 움직임 추정 블록과 MCI 블록의 크기가 동일하나, 본 논문에서 사용된 움직임 추정 블록은 MCI 블록과 같은 중심 축을 가지고, MCI 블록보다 더 크기 때문에 인접 블록과 중첩된 특성을 가진다. 제안한 움직임 추정 블록에 의한 계산량 증가를 줄이기 위해, 제안한 움직임 추정 블록내의 화소를 샘플링 하여 움직임 추정을 실행하였다. 제안한 방식을 검증하기 위해, 움직임 추정 블록을 다양한 샘플 계수로 샘플링 한 후 움직임 추정을 실행하였다. 제안한 방식으로 추정된 움직임 벡터 (motion vector, MV)를 활용하여 MCI를 수행하였으며, 수행된 결과를 종래의 방식에 의한 결과와 비교하였다.

• 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.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제51권7호
• /
• pp.286-293
• /
• 2002

This paper presents a new method for finding the Block Pulse series coefficients and deriving the Block Pulse integration operational matrices which are necessary for the control fields using the Block Pulse functions. In order to apply the Block Pulse function technique to the problems of continuous-time dynamic systems more efficiently, it is necessary to find the more exact value of the Block Pulse series coefficients and drives the related integration operational matrices by using the Lagrange second order interpolation polynomial.