- 期刊
Fast Block Matching Using Minkowski's Inequality
若您是本文的作者，可授權文章由華藝線上圖書館中協助推廣。
並列摘要
In this paper, we present a fast block matching algorithm by making use of the Minkowski's inequality. Combined with other fast block matching algorithms, our method can further reduce the computational complexity significantly with little PSNR degradation. Compared to the full search block matching algorithm, our approach can reduce the computing time by a factor of 6.4 to 21.5. Compared to MSEQ, which is a wellknown block matching algorithm preserving global optimality, our method can further reduce the corresponding computing time in average by 32.4%. The combination of our algorithm and the predictive search area approach for block motion estimation can achieve the more reduction of computing time with little PSNR degradation.