File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Fast block matching algorithms for motion estimation

TitleFast block matching algorithms for motion estimation
Authors
Issue Date1996
Citation
Icassp, Ieee International Conference On Acoustics, Speech And Signal Processing - Proceedings, 1996, v. 4, p. 2311-2314 How to Cite?
AbstractMotion compensation is an effective method for reducing temporal redundancy found in video sequence compression. However, the complexity of the full-search block matching algorithm (BMA) is extremely high and a number of fast algorithms have been proposed to reduce the computational complexity of the BMA. In this paper, we propose three techniques for reducing the arithmetic complexity of the BMA. They are namely: 1) Domain Decimation, 2) Error Function Subsampling, and 3) Multiple Candidates Search. The domain decimation and error function decimation try to reduce the arithmetic complexity by reducing the number of operations in each comparison, the search range and number of locations searched. The multiple candidates search is a technique used to increase the robust of such algorithms. Combination of these techniques can generate algorithms with different tradeoff between arithmetic complexity and quality of prediction.
Persistent Identifierhttp://hdl.handle.net/10722/158184
ISSN

 

DC FieldValueLanguage
dc.contributor.authorCheng, KWen_US
dc.contributor.authorChan, SCen_US
dc.date.accessioned2012-08-08T08:58:26Z-
dc.date.available2012-08-08T08:58:26Z-
dc.date.issued1996en_US
dc.identifier.citationIcassp, Ieee International Conference On Acoustics, Speech And Signal Processing - Proceedings, 1996, v. 4, p. 2311-2314en_US
dc.identifier.issn0736-7791en_US
dc.identifier.urihttp://hdl.handle.net/10722/158184-
dc.description.abstractMotion compensation is an effective method for reducing temporal redundancy found in video sequence compression. However, the complexity of the full-search block matching algorithm (BMA) is extremely high and a number of fast algorithms have been proposed to reduce the computational complexity of the BMA. In this paper, we propose three techniques for reducing the arithmetic complexity of the BMA. They are namely: 1) Domain Decimation, 2) Error Function Subsampling, and 3) Multiple Candidates Search. The domain decimation and error function decimation try to reduce the arithmetic complexity by reducing the number of operations in each comparison, the search range and number of locations searched. The multiple candidates search is a technique used to increase the robust of such algorithms. Combination of these techniques can generate algorithms with different tradeoff between arithmetic complexity and quality of prediction.en_US
dc.languageengen_US
dc.relation.ispartofICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedingsen_US
dc.titleFast block matching algorithms for motion estimationen_US
dc.typeConference_Paperen_US
dc.identifier.emailChan, SC:scchan@eee.hku.hken_US
dc.identifier.authorityChan, SC=rp00094en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0029765694en_US
dc.identifier.volume4en_US
dc.identifier.spage2311en_US
dc.identifier.epage2314en_US
dc.identifier.scopusauthoridCheng, KW=36439221300en_US
dc.identifier.scopusauthoridChan, SC=13310287100en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats