FAST BLOCK MATCHING USING MINKOWSKI'S INEQUALITY

Authors

Jim Zong-Chang Lai, Department of Computer Science and Engineering, National Taiwan Ocean University, Keelung, Taiwan, R.O.C
Yi-Ching Liaw, Department of Computer Science and Information Engineering, Nanhua University, Chiayi, Taiwan, R.O.C.Follow
Shih-An Fong, Information and Communications Research Labs, Industrial Technology Research Institute, Hsinchu, Taiwan, R.O.C.

Abstract

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

Recommended Citation

Lai, Jim Zong-Chang; Liaw, Yi-Ching; and Fong, Shih-An (2010) "FAST BLOCK MATCHING USING MINKOWSKI'S INEQUALITY," Journal of Marine Science and Technology: Vol. 18: Iss. 1, Article 11.
DOI: 10.51400/2709-6998.1869
Available at: https://jmstt.ntou.edu.tw/journal/vol18/iss1/11