On Combining Fractional-Pixel Interpolation and Motion Estimation: A Cost-Effective Approach

• Published in: IEEE transactions on circuits and systems for video technology Vol. 21; no. 6; pp. 717 - 728
• Main Authors: Jiyuan Lu, Peizhao Zhang, Hongyang Chao, Fisher, P S
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.06.2011; Institute of Electrical and Electronics Engineers; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithm design and analysis; Algorithms; Applied sciences; Coding; Computational efficiency; Computing time; Detection, estimation, filtering, equalization, prediction; Exact sciences and technology; Fractional-pixel interpolation; fractional-pixel motion estimation; Image processing; Information, signal and communications theory; Interpolation; Materials; Maximum likelihood detection; Pixel; Prediction algorithms; Pruning; Reproduction; Searching; Signal and communications theory; Signal processing; Signal, noise; Studies; Telecommunications and information theory; video coding; Video coding; Motion estimation; Image processing; Refinement method; Pruning algorithm; Optimization; Video signal processing; Interpolation; Computation time; Signal processing; Motion compensation; Fractional-pixel interpolation; Fast algorithm; Cost efficiency analysis; fractional-pixel motion estimation
• ISSN: 1051-8215; 1558-2205
• DOI: 10.1109/TCSVT.2011.2129830

The additional complexity of the adoption of fractional-pixel motion compensation technology arises from two aspects: fractional-pixel interpolation (FPI) and fractional-pixel motion estimation (FPME). Different from current fast algorithms, we use the internal link between FPME and FPI as a factor in considering optimization by integrally manipulating them rather than attempting to speed them up separately. In this paper, a refinement search order for FPME is proposed to satisfy the criteria of cost/performance efficiency. And then, some strategies, i.e., FPME skipping, early termination and search pattern pruning, are also given for reducing the number of search positions with negligible coding loss. We also propose a FPI algorithm to save redundant interpolation as well as reduce duplicate calculation. Experimental results show that our integrated algorithm significantly improves the overall speed of FPME and FPI. Compared with the FFPS+XFPI and CBFPS+XFPI, the proposed algorithm has already reduced the speed by a factor of 65% and 32%. Additionally, our FPI algorithm can be used to cooperate with any fast FPME algorithms to greatly reduce the computational time of FPI.