Fast algorithms for the estimation of block motion vectors

Zahariadis, Th; Kalivas, D

dc.contributor.author	Zahariadis, Th	en
dc.contributor.author	Kalivas, D	en
dc.date.accessioned	2014-03-01T02:48:24Z
dc.date.available	2014-03-01T02:48:24Z
dc.date.issued	1996	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33798
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0030362427&partnerID=40&md5=2d85cfa4dade54602a7a4c004493c619	en
dc.subject.other	Algorithms	en
dc.subject.other	Computational complexity	en
dc.subject.other	Estimation	en
dc.subject.other	Mathematical models	en
dc.subject.other	Vectors	en
dc.subject.other	Block motion vectors	en
dc.subject.other	Spiral search algorithms	en
dc.subject.other	Motion pictures	en
dc.title	Fast algorithms for the estimation of block motion vectors	en
heal.type	conferenceItem	en
heal.publicationDate	1996	en
heal.abstract	The most important fast block matching algorithms are analyzed and evaluated. Then a new fast search method, the `Spiral Search Algorithm' (SSA), is introduced. It is a three step algorithm which follows a spiral path searching outwards for candidate locations that satisfy the matching criterion. The efficiency of the SSA arises from: (1) the reduction of the candidate locations without leaving out zones of pixels where the mean absolute difference is not evaluated, and (2) the reduction of computations since many candidate locations are being bailed out. A comparison of fast search methods and the Full Search (FS) approach is presented for a number of video sequences. The SSA is proven to be an excellent compromise between quality and speed. The hardware implementation of the block motion estimation algorithms is also discussed.	en
heal.publisher	IEEE, Piscataway, NJ, United States	en
heal.journalName	Proceedings of the IEEE International Conference on Electronics, Circuits, and Systems	en
dc.identifier.volume	2	en
dc.identifier.spage	716	en
dc.identifier.epage	719	en