Content deleted Content added
Line 33:
=== Exhaustive Search ===
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
==== Optimized hierarchical block matching (OHBM)<ref name="Je_spic13_ohbm">{{Cite journal |doi = 10.1016/j.image.2013.04.002|title = Optimized hierarchical block matching for fast and accurate image registration|journal = Signal Processing: Image Communication|volume = 28|issue = 7|pages = 779–791|year = 2013|last1 = Je|first1 = Changsoo|last2 = Park|first2 = Hyung-Min}}</ref> ====
| |||