High-speed block matching algorithms for multimedia service

Ordinary high-speed block matching algorithms have a disadvantage that they need to get MAD (Mean Absolute Distance) as many as the number of search points due to comparing the MAD between the current frame's search block and the reference frame's search block. To solve such disadvantage of high-speed block matching algorithm, the proposed high-speed block matching algorithm employs a MMAD calculation method using a specific characteristic that neighboring pixels have almost same values. In this paper, we can get rid of unnecessary MAD calculation between the search point blocks by the new calculation method which uses the previously calculated MAD as the current search point and by breaking from the established MAD calculation method which calculates the MAD of a new search point by each search stage. Comparing with the established high-speed block matching algorithm, this new calculation's estimated motion error was shown as similar, and the total calculation amount decreased by 2FN2Ep.