• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.795-796
• /
• 2008

H.264/AVC standard adopts multiple reference frames for motion estimation. This method improves coding efficiency, but it increases complexity of encoder. In this paper, we propose a algorithm that reduces the search range by using the correlation of motion vector. Consequently, motion estimation processing time is 47.5% when compared with standard of five reference frames, and SNR and bitrate are better than that of standard of three multi reference frames.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.811-812
• /
• 2008

In this paper, a modified cross search algorithm for fast block matching motion estimation is proposed. Various Motion Estimation (ME) algorithms have been proposed since ME requires large computational complexity. The proposed algorithm employs Modified Cross Search Pattern (MCSP) to search the motion vector. Efficient compression can be achieved since Modified Cross Search Algorithm (MCSA) simplifies the search pattern to reduce the computational complexity. The experimental results show that proposed algorithm reduces the search points up to 29% compared to conventional methods.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2001.06a
• /
• pp.177-180
• /
• 2001

This paper presents a new fast motion estimation algorithm for video coding. This method classifies blocks in a frame into moving blocks and background blocks, and then searches the best-matched blocks for only moving blocks. Experimental results show the effectiveness of the proposed method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.10a
• /
• pp.159-161
• /
• 2017

In this paper, we propose an adaptive search range allocation algorithm for high-performance HEVC encoder and a hardware architecture suitable for the proposed algorithm. In order to improve the prediction performance, the existing motion vector is configured with the motion vectors of the neighboring blocks as prediction vector candidates, and a search range of a predetermined size is allocated using one motion vector having a minimum difference from the current motion vector. The proposed algorithm reduces the computation time by reducing the size of the search range by assigning the size of the search range to the rectangle and octagon type according to the structure of the motion vectors for the surrounding four blocks. Moreover, by using all four motion vectors, it is possible to predict more precisely. By realizing it in a form suitable for hardware, hardware area and computation time are effectively reduced.

• The Journal of the Korea Contents Association
• /
• v.18 no.12
• /
• pp.35-45
• /
• 2018

Motion Estimation(ME) has been developed to reduce the redundant data in digital video signal. ME is an important part of video encoding system, However, it requires huge computational complexity of the encoder part, and fast motion search methods have been proposed to reduce huge complexity. Multi- view video is obtained by capturing on a three-dimensional scene with many cameras at different positions and its complexity increases in proportion to the number of cameras. In this paper, we proposed an efficient motion method which chooses a search pattern adaptively by using the temporal-spatial correlation of the block and the characteristics of the block. Experiment results show that the computational complexity reduction of the proposed method over TZ search method and FS method can be up to 70~75% and 99% respectively while keeping similar image quality and bit rates.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.188-191
• /
• 2002

To reduce the bit-rate of video sequences by removing temporal redundancy, motion estimation techniques have been developed. However, the high computational complexity of the problem makes such techniques very difficult to be applied to high-resolution applications in a real time environment. For this reason, low computational complexity motion estimation algorithms are viable solutions. If a priori knowledge about the motion of the current block is available before the motion estimation, a better starting point for the search of n optimal motion vector on be selected and also the computational complexity will be reduced. In this paper, we present an adaptive block matching algorithm based on temporal correlations of consecutive image frames that defines the search pattern and the location of initial starting point adaptively to reduce computational complexity. Experiments show that, comparing with DS(Diamond Search) algorithm, the proposed algorithm is about 0.1∼0.5(㏈) better than DS in terms of PSNR and improves as much as 50% in terms of the average number of search points per motion estimation.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.1
• /
• pp.60-65
• /
• 2012

This paper presents a method for occluded object based motion estimation and tracking system in dynamic image sequences using particle filter with 3D reconstruction. A unique characteristic of this study is its ability to cope with partial occlusion based continuous motion estimation using particle filter inspired from the mirror neuron system in human brain. To update a prior knowledge about the shape or motion of objects, firstly, fundamental 3D reconstruction based occlusion tracing method is applied and object landmarks are determined. And optical flow based motion vector is estimated from the movement of the landmarks. When arbitrary partial occlusions are occurred, the continuous motion of the hidden parts of object can be estimated by particle filter with optical flow. The resistance of the resulting estimation to partial occlusions enables the more accurate detection and handling of more severe occlusions.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1219-1223
• /
• 2010

This paper proposes a fast motion estimation algorithm based on motion speed and multiple initial center points. The proposed method predicts initial search points by means of the spatio-temporal neighboring motion vectors. A dynamic search pattern based on the motion speed and the predicted initial center points is proposed to quickly obtain the motion vector. Due to the usage of the spatio-temporal information and the dynamic search pattern, the proposed method greatly accelerates the search speed while keeping a good predicted image quality. Experimental results show that the proposed method has a good predicted image quality in terms of PSNR with less searching time comparing with the Full Search, New Three-Step Search, and Four-Step Search.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.6
• /
• pp.119-126
• /
• 1998

In this paper, we proposed two new methods of half-pel accuracy motion estimation using spatial correlation of half-pel accuracy motion vectors and stochastic characteristics between pixel accuracy motion vectors and half-pel accuracy motion vectors. We confirmed two facts : One is that the probability of having same half-pel accuracy motion vectors with neighboring blocks is high when having same pixel accuracy motion vectors. And the other is that there is high correlation between neighboring half-pel positions. These new half-pel motion estimation technique are shown to decrease the bit rates for vector coding and computational complexity with similar PSNR.

• Journal of Broadcast Engineering
• /
• v.16 no.1
• /
• pp.133-143
• /
• 2011

In this paper, a complexity-balancing algorithm is proposed for distributed video coding based on entropy coding. In order to reduce complexity of DVC-based decoders, the proposed method employs an entropy coder instead of channel coders and the complexity-balancing method is designed to improve RD performance with minimal computational complexity. The proposed method performs motion estimation in the decoder side and transmits the estimated motion vectors to the encoder. The proposed encoder can perform more accurate refinement using the transmitted motion vectors from the decoder. During the motion refinement, the optimal predicted motion vectors are decided by the received motion vector and the predicted motion vectors and complexity load of block is allocated by adjusting the search range based on the difference between the received motion vector and the predicted motion vectors. The computational complexity of the proposed encoder is decreased 11.9% compared to the H.264/AVC encoder and that of the proposed decoder are reduced 99% compared to the conventional DVC decoder.