A technique for reducing complexity of recursive motion estimation algorithms
- 1 March 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15206130,p. 195-200
- https://doi.org/10.1109/sips.2003.1235668
Abstract
The recursive search motion estimation algorithm offers smooth and accurate motion vector fields. Computationally, the most expensive part of the motion estimator is the evaluation of the various motion vector candidates. Evaluation is performed by comparing blocks in two consecutive frames indicated by motion vector candidates. The paper addresses the issue of reducing the already extremely low number of motion vector evaluations. We apply preprocessing techniques to reduce the number of motion vector candidates from 7 to 5, i.e. 30%, without sacrificing quality. We exemplify the above findings through experimental results obtained using the 3D recursive search motion estimation algorithm. The required preprocessing overhead is negligible.Keywords
This publication has 4 references indexed in Scilit:
- System on silicon-IC for motion compensated scan rate conversion picture-in-picture processing, split screen applications and display processingIEEE Transactions on Consumer Electronics, 1999
- Sub-pixel motion estimation with 3-D recursive search block-matchingSignal Processing: Image Communication, 1994
- True-motion estimation with 3-D recursive search block matchingIEEE Transactions on Circuits and Systems for Video Technology, 1993
- Vector median filtersProceedings of the IEEE, 1990