Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Fast full-search block matching
Autore:
Brunig, M; Niehsen, W;
Indirizzi:
Aachen Univ Technol, Inst Commun Engn, D-52056 Aachen, Germany Aachen UnivTechnol Aachen Germany D-52056 Engn, D-52056 Aachen, Germany
Titolo Testata:
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY
fascicolo: 2, volume: 11, anno: 2001,
pagine: 241 - 247
SICI:
1051-8215(200102)11:2<241:FFBM>2.0.ZU;2-1
Fonte:
ISI
Lingua:
ENG
Soggetto:
MOTION ESTIMATION; ALGORITHM;
Keywords:
block matching; exhaustive search; fast full-search; motion estimation;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
--discip_EC--
Citazioni:
16
Recensione:
Indirizzi per estratti:
Indirizzo: Brunig, M Aachen Univ Technol, Inst Commun Engn, D-52056 Aachen, Germany Aachen Univ Technol Aachen Germany D-52056 056 Aachen, Germany
Citazione:
M. Brunig e W. Niehsen, "Fast full-search block matching", IEEE CIR SV, 11(2), 2001, pp. 241-247

Abstract

A fast full-search block-matching algorithm is developed, The matching criterion is the sum of absolute differences or the mean-square error, The algorithm evaluates lower bounds for the matching criteria for subdivided blocks in order to reduce the number of search positions. It also uses the lower bounds for a fast calculation of the matching criterion for the remainingsearch positions. The computational complexity of the algorithm is evaluated and compared to the three-step search strategy. The search result of thealgorithm is identical to the search result of the exhaustive search.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 11/07/20 alle ore 16:52:22