Complexity scalable motion estimation
Ralph Braspenning, Gerard de Haan, Christian Hentschel · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2002
Complexity scalable algorithms are capable of trading resource usage for output quality in a near-optimal way. We present a complexity scalable motion estimation algorithm based on the 3-D recursive search block matcher. We introduce data prioritizing as a new approach to scalability. With this approach, we achieve a near-constant complexity and a continuous quality-resource distribution. While maintaining acceptable quality, it is possible to vary the resource usage from below 1 match-error calculation per block on the average to more than 5 match-error calculations per block on the average.