Revision as of 22:00, 15 January 2017 edit Chris the speller (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 894,226 edits m →New Three Step Search: replaced: half way → halfway using AWB ← Previous edit		Revision as of 17:49, 3 April 2017 edit undo Parkie213 (talk \| contribs) 1 edit m First sentance began with a lower case letter. Next edit →
Line 1: aA '''Block Matching Algorithm''' is a way of locating matching [[macroblock]]s in a sequence of [[digital video]] frames for the purposes of [[motion estimation]]. The underlying supposition behind motion estimation is that the patterns corresponding to objects and background in a frame of video sequence move within the frame to form corresponding objects on the subsequent frame. This can be used to discover temporal redundancy in the video sequence, increasing the effectiveness of inter-frame [[video compression]] by defining the contents of a macroblock by reference to the contents of a known macroblock which is minimally different. [[File:Block-matching algorithm.png\|thumb\|405x405px]] A block matching algorithm involves dividing the current [[Film frame\|frame]] of a video into macroblocks and comparing each of the macroblocks with a corresponding block and its adjacent neighbors in a nearby frame of the video (sometimes just the previous one). A [[vector (mathematics and physics)\|vector]] is created that models the movement of a macroblock from one ___location to another. This movement, calculated for all the macroblocks comprising a frame, constitutes the motion estimated in a frame.

Block-matching algorithm: Difference between revisions