Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Fast block matching algorithm based on the winner-update strategy
Autore:
Chen, YS; Hung, YP; Fuh, CS;
Indirizzi:
Acad Sinica, Inst Informat Sci 20, Taipei 115, Taiwan Acad Sinica TaipeiTaiwan 115 , Inst Informat Sci 20, Taipei 115, Taiwan Natl Taiwan Univ, Dept Comp Sci & Informat Engn, Taipei 10764, Taiwan NatlTaiwan Univ Taipei Taiwan 10764 Informat Engn, Taipei 10764, Taiwan
Titolo Testata:
IEEE TRANSACTIONS ON IMAGE PROCESSING
fascicolo: 8, volume: 10, anno: 2001,
pagine: 1212 - 1222
SICI:
1057-7149(200108)10:8<1212:FBMABO>2.0.ZU;2-N
Fonte:
ISI
Lingua:
ENG
Soggetto:
FAST MOTION ESTIMATION;
Keywords:
block matching; fast algorithm; Minkowski's inequality; motion estimation; winner-update strategy;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
19
Recensione:
Indirizzi per estratti:
Indirizzo: Chen, YS Acad Sinica, Inst Informat Sci 20, Taipei 115, Taiwan Acad Sinica Taipei Taiwan 115 format Sci 20, Taipei 115, Taiwan
Citazione:
Y.S. Chen et al., "Fast block matching algorithm based on the winner-update strategy", IEEE IM PR, 10(8), 2001, pp. 1212-1222

Abstract

Block matching is a widely used method for stereo vision, visual tracking,and video compression. Many fast algorithms for block matching have been proposed in the past, but most of them do not guarantee that the match foundis the globally optimal match in a search range. This paper presents a newfast algorithm based on the winner-update strategy which utilizes an ascending lower bound list of the matching error to determine the temporary winner. Two lower bound lists derived by using partial distance and by using Minkowski's inequality are described in this paper. The basic idea of the winner-update strategy is to avoid, at each search position, the costly computation of matching error when there exists a lower bound larger than the global minimum matching error. The proposed algorithm can significantly speed up the computation of the block matching because1) computational cost of the lower bound we use is less than that of the matching error itself;2) an element in the ascending lower bound list will be calculated only when its preceding element has already been smaller than the minimum matchingerror computed so far;3) for many search positions, only the first several lower bounds in the list need to be calculated. Our experiments have shown that, when applying to motion vector estimation for several widely-used test videos. 92% to 98% of operations can be saved while still guaranteeing the global optimality, Moreover, the proposed algorithm can be easily modified either to meet the limited time requirement or to provide an ordered list of best candidate matches. Our source codes of the proposed algorithm are available at http://smart.iis.sinica.edu.tw/html/winu.html.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 13/07/20 alle ore 07:12:02