Optimization of Depth from Defocus Based on Iterative Shrinkage Thresholding Algorithm

In solving the dynamic optimization of depth from defocus with the iterative shrinkage threshold algorithm (ISTA), the fixed iteration step decelerated the convergence efficiency of the algorithm, which led to inaccuracy of reconstructed microscopic 3D shape. Aiming at the above problems, an optimization of ISTA algorithm based on gradient estimation of acceleration operator and secant linear search (FL-ISTA) was proposed. Firstly, the acceleration operator, which consists of the linear combination of the current and previous points, was introduced to estimate the gradient and update the iteration point. Secondly, the secant linear search was used to dynamically determine the optimal iteration step, which accelerated the convergence rate of solving the dynamic optimization of depth from defocus. Experimental results of standard 500 nm grid show that compared with ISTA, FISTA and MFISTA algorithms, the efficiency of FL-ISTA algorithm was great improved and the depth from defocus decreased by 10 percentage points, which close to the scale of 500 nm grid. The experimental results indicate that FL-ISTA algorithm can effectively improve the convergence rate of solving dynamic optimization of depth from defocus and the accuracy of the reconstructed microscopic 3D shape.

[1]  Marc Teboulle,et al.  A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..

[2]  Kun Zhou,et al.  Bayesian Depth-from-Defocus with Shading Constraints , 2013, 2013 IEEE Conference on Computer Vision and Pattern Recognition.

[3]  Marc Teboulle,et al.  Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems , 2009, IEEE Transactions on Image Processing.

[4]  Stefano Soatto,et al.  Observing Shape from Defocused Images , 2004, International Journal of Computer Vision.

[5]  Stefano Soatto,et al.  This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE IEEE TRANSACTION OF PATTERN RECO , 2022 .

[6]  Alex Pentland,et al.  A New Sense for Depth of Field , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Murali Subbarao,et al.  Depth from defocus: A spatial domain approach , 1994, International Journal of Computer Vision.

[8]  Alvaro R. De Pierro,et al.  Fast and exact unidimensional L2-L1 optimization as an accelerator for iterative reconstruction algorithms , 2016, Digit. Signal Process..

[9]  Jitendra Malik,et al.  Shape Estimation from Shading, Defocus, and Correspondence Using Light-Field Angular Coherence , 2017, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Shree K. Nayar,et al.  Real-Time Focus Range Sensor , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[11]  Elias S. Helou,et al.  Accelerating Overrelaxed and Monotone Fast Iterative Shrinkage-Thresholding Algorithms With Line Search for Sparse Reconstructions , 2017, IEEE Transactions on Image Processing.

[12]  Michael Elad,et al.  L1-L2 Optimization in Signal and Image Processing , 2010, IEEE Signal Processing Magazine.