Document Type


Publication details

Sorwar, G, Murshed, M & Dooley, LS 2007, 'A fully adaptive distance-dependent thresholding search (FADTS) algorithm for performance-management motion estimation', IEEE Transactions on Circuits and Systems for Video Technology, vol. 17, no. 4, pp. 429-439.

Copyright © 2007 IEEE. Reprinted from IEEE Transactions on Circuits and Systems for Video Technology.

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Southern Cross University Library's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to

By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Published version available from:

Peer Reviewed



Trading off computational complexity and quality is an important performance constraint for real time application of motion estimation algorithm. Previously, the novel concept of a distance-dependent thresholding search (DTS) was introduced for performance scalable motion estimation in video coding applications. This encompassed the full search as well as other fast searching techniques, such as the three-step search, with different threshold settings providing various quality-of-service levels in terms of processing speed and predicted image quality. The main drawback of the DTS was that the threshold values had to be manually defined. In this paper, the DTS algorithm has been extended to a fast and fully adaptive DTS (FADTS), a key feature of which is the automatic adaptation of the threshold using a desired target and the content from the actual video sequence, to achieve either a guaranteed level of quality or processing complexity. Experimental results confirm the performance of the FADTS algorithm in achieving this objective by demonstrating either comparable or improved search speed over existing fast algorithms including the diamond search, hexagon-based search, and enhanced hexagon-based search, while maintaining similar error performance.

Find in your library