A novel iterative shape from focus algorithm based on combinatorial optimization

摘要

Shape from focus (SFF) is a technique to estimate the depth and 3D shape of an object from a sequence of images obtained at different focus settings. In this paper, the SFF is presented as a combinatorial optimization problem. The proposed algorithm tries to find the combination of pixel frames which produces maximum focus measure computed over pixels lying on those frames. To reduce the high computational complexity, a local search method is proposed. After the estimate of the initial depth map solution of an object, the neighborhood is defined, and an intermediate image volume is generated from the neighborhood. The updated depth map solution is found from the intermediate image volume. This update process of the depth map solution continues until the amount of improvement is negligible. The results of the proposed SFF algorithm have shown significant improvements in both the accuracy of the depth map estimation and the computational complexity, with respect to the existing SFF methods.