On Block Motion Estimation Using a Novel Search Strategy for an Improved Adaptive Pixel Decimation

摘要: Block motion estimation using the exhaustive full search is computationally intensive. Previous fast algorithms tend to reduce computation by limiting number of locations be searched and reducing pixels for matching criterion. However, a large prediction error results when these two types techniques are combined form algorithm. In this paper, first, we present new adaptive pixel decimation algorithm with an appropriate selection control. The proposed selects targeted most representative pixels, which avoids fluctuation computational complexity among different frames. Second, smart strategy excellent complement very efficient block uses newly defined criterion adaptively select in second step estimation. It found that combination more robust than previous algorithms. Experimental show that, as compared conventional approach, novel robust, produces smaller compensation errors, has simplified complexity.