Copy the page URI to the clipboard
Sorwar, Golam; Murshed, Manzur and Dooley, Laurence
(2002).
DOI: https://doi.org/10.1109/ICASSP.2002.5745669
Abstract
A modified full-search (MFS) algorithm is presented for block-based motion estimation applications, which introduces the novel concept of variable distance dependent thresholds. The performance of the MFS algorithm is analyzed and quantitatively compared with both the traditional and exhaustive full-search (FS) technique, and the computationally faster, non-exhaustive three-step-search (TSS) algorithm. Experimental results show that by applying an appropriate threshold function, the MFS algorithm not only matches the speed of the TSS algorithm, but both retains a block distortion error comparable to the global minimum produced by the FS algorithm, and avoids the problem of identifying large numbers of spurious motion vectors in the search process.
Viewing alternatives
Metrics
Public Attention
Altmetrics from AltmetricNumber of Citations
Citations from DimensionsItem Actions
Export
About
- Item ORO ID
- 28896
- Item Type
- Conference or Workshop Item
- ISSN
- 1520-6149
- Extra Information
- Published in 2002 IEEE International Conference on Acoustics, Speech, and Signal Processing: Proceedings: May 13-17, 2002, Renaissance Orlando Resort, Orlando, Florida, USA, Piscataway, N.J., IEEE, 2002, pp. IV-4189 (ISBN. 0-7803-7402-9)
- Academic Unit or School
-
Faculty of Science, Technology, Engineering and Mathematics (STEM) > Computing and Communications
Faculty of Science, Technology, Engineering and Mathematics (STEM) - Research Group
- Centre for Research in Computing (CRC)
- Copyright Holders
- © 2002 IEEE
- Depositing User
- Laurence Dooley