BookRags.com Literature Guides Literature
Guides
Criticism & Essays Criticism &
Essays
Questions & Answers Questions &
Answers
Lesson Plans Lesson
Plans
My Bibliography Periodic Table U.S. Presidents Shakespeare Sonnet Shake-Up
Research Anything:        
History | Encyclopedias | Films | News | Create a Bibliography | More... Login | Register | Help
Not What You Meant?  There are 21 definitions for BMA.

Block-matching algorithm

Print-Friendly
About 1 pages (99 words)

Bookmark and Share Questions on this topic? Just ask!

A Block-matching algorithm is a way of locating matching blocks in a sequence of Digital video frames for the purposes of Motion compensation. The purpose of a block-matching algorithm is to find a matching block from a frame <math>i</math> in some other frame <math>j</math>, which may appear before or after <math>i</math>. This can then be used to reduce the overall temporal redundancy of the video sequence. Block-matching algorithms make use of Block-matching criteria to determine whether a given block in frame <math>j</math> matches the search block in frame <math>i</math>

Block-matching algorithms

  • Cross Search
  • Full Search
  • Spiral Search

View More Summaries on Block-matching algorithm
 
Ask any question on Block-matching algorithm and get it answered FAST!
Answer questions in BookRags Q&A and earn points toward
discounted or even FREE Study Guides and other BookRags products!
Learn more about BookRags Q&A
Copyrights
Block-matching algorithm from Wíkipedia. ©2006 by Wíkipedia. Licensed under the GNU Free Documentation License. View a list of authors or edit this article.

Article Navigation
Join BookRagslearn moreJoin BookRags




About BookRags | Customer Service | Report an Error | Terms of Use | Privacy Policy