Sorwar, G.; Murshed, M. and Dooley, L.
PDF (Not Set)
- Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
|DOI (Digital Object Identifier) Link:||http://doi.org/10.1109/ICASSP.2003.1199558|
|Google Scholar:||Look up in Google Scholar|
Trading-off computational complexity and quality is an important performance constraint for real time application of motion estimation algorithms. To address this issue, a distance dependent thresholding search (DTS) algorithm has been proposed for fast and robust true motion estimation in video coding/indexing applications (Sorwar, G. et al., Proc. ICASSP. 2002; IEEE Asia-Pacific Conf. on Circuits and Systems, 2002; 6th Int. Conf. on Signal Processing, 2002). DTS encompasses both the full search (FS) as well as fast searching modes, with different threshold settings providing various quality-of-service levels. The main drawback of DTS is that the threshold value is defined manually. The DTS algorithm is extended to a fully adaptive distance dependent thresholding search (FADTS), a key feature of which is the automatic adaptation of the threshold using the desired target and the content from the actual video sequence to achieve a guaranteed level of quality or processing complexity. Experimental results confirm the performance of the FADTS algorithm in achieving this objective with minimal additional computational cost.
|Item Type:||Conference Item|
|Academic Unit/Department:||Faculty of Science, Technology, Engineering and Mathematics (STEM) > Computing and Communications
Faculty of Science, Technology, Engineering and Mathematics (STEM)
|Interdisciplinary Research Centre:||Centre for Research in Computing (CRC)|
|Depositing User:||Laurence Dooley|
|Date Deposited:||28 Aug 2008 04:10|
|Last Modified:||05 Aug 2016 20:31|
|Share this page:|
Download history for this item
These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.