Sobol partial distortion algorithm for fast full search in block motion estimation
Proceedings of the sixth Eurographics workshop on Multimedia 2001
DCC '01 Proceedings of the Data Compression Conference
Modified winner-update search algorithm for fast block matching
Pattern Recognition Letters - Video computing
Survey on Block Matching Motion Estimation Algorithms and Architectures with New Results
Journal of VLSI Signal Processing Systems
IEEE Transactions on Circuits and Systems for Video Technology
A fast full search algorithm using directional oriented search order
VIIP '07 The Seventh IASTED International Conference on Visualization, Imaging and Image Processing
Fast full search algorithm using adaptive search order
CGIM '08 Proceedings of the Tenth IASTED International Conference on Computer Graphics and Imaging
A parallel architecture for motion estimation and DCT computation in MPEG-2 encoder
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
Low bit depth representation motion estimation algorithms: a comparative study
Journal of Real-Time Image Processing
Block motion estimation using modified two-bit transform
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Fuzzy quantization based bit transform for low bit-resolution motion estimation
Image Communication
| Hi-index | 0.00 |
A full-search based block-matching algorithm for motion estimation has a major problem of significant computational load. To solve this problem, extensive research in fast-motion estimation algorithms have been carried out. However, most of them have some degradation in the predicted image from the reduced computation. To decrease the amount of significant computation of the full-search algorithm, we propose a fast block-matching algorithm based on an adaptive matching scan and representative pixels without any degradation of the predicted image. By using Taylor series expansion, we obtain the representative pixels and show that the block-matching errors from the reference block and candidate blocks are proportional to the block complexity. With the derived result, we propose a fast full-search algorithm with adaptive scan direction in block matching. Experimentally, our proposed algorithm is very efficient in terms of computational speedup, and is the fastest among all the conventional full-search algorithms. Therefore, our algorithm is useful in VLSI implementation of video encoders for real-time encoding