Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

An Efficient Algorithm for Focus Measure Computation in Constant Time

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Minhas, R. ; Dept. of Electr. Eng., Univ. of Windsor, Windsor, ON, Canada ; Mohammed, A.A. ; Wu, Q.M.J.

This letter presents an efficient algorithm for focus measure computation, in constant time, to estimate depth map using image sequences acquired at varying focus. Two major factors that complicate focus measure computation include neighborhood support and gradient detection for oriented intensity variations. We present a distinct focus measure based on steerable filters that is invariant to neighborhood size and accomplishes fast depth map estimation at a considerably faster speed compared to other well-documented methods. Steerable filters represent architecture to synthesize filters of arbitrary orientation using a linear combination of basis filters. Such synthesis is helpful to analytically determine the filter output as a function of orientation. Steerable filters remove inherent limitations of traditional gradient detection techniques which perform inadequately for oriented intensity variations and low textured regions.

Published in:

Circuits and Systems for Video Technology, IEEE Transactions on  (Volume:22 ,  Issue: 1 )