Block-matching algorithm: Difference between revisions

Revision as of 12:48, 2 April 2023

Revision as of 12:49, 2 April 2023

Line 34:

This algorithm calculates the [[Loss function|cost function]] at each possible ___location in the search window. This leads to the best possible match of the macro-block in the reference frame with a block in another frame. The resulting motion compensated image has highest peak signal-to-noise ratio as compared to any other block matching algorithm.

However this is the most computationally extensive block matching algorithm among all. A larger search window requires greater number of computations.

kn, l:;

==== Optimized hierarchical block matching (OHBM) ====