cs.CVFeb 18, 2026

Depth from Defocus via Direct Optimization

Authors: Holly Jackson, Caleb Adams, Ignacio Lopez-Francos, Benjamin Recht

Organizations: ⋆University of California, Berkeley, California, USA · † NASA Ames Research Center, Moffett Field, California, USA · ‡ KBR, Houston, Texas, USA

Abstract

Though there exists a reasonable forward model for blur based on optical physics, recovering depth from a collection of defocused images remains a computationally challenging optimization problem. In this paper, we show that with contemporary optimization methods and reasonable computing resources, a global optimization approach to depth from defocus is feasible. Our approach rests on alternating minimization. When holding the depth map fixed, the forward model is linear with respect to the all-in-focus image. When holding the all-in-focus image fixed, the depth at each pixel can be computed independently, enabling embarrassingly parallel computation. We show that alternating between convex optimization and parallel grid search can effectively solve the depth-from-defocus problem at higher resolutions than current deep learning methods. We demonstrate our approach on benchmark datasets with synthetic and real defocus blur and show promising results compared to prior approaches. Our code is available at github.com/hollyjackson/dfd.

Figures & tables

Appendix figures & tables13 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Zero-Shot Depth from Defocus

    Mar 27, 2026Yiming Zuo, Hongyu Wen, Venkat Subramanian +5Metric Depth EstimationDepth Estimation

  2. The RealDefocus Benchmark for Defocus Deblurring

    Jul 23, 2026Tim Seizinger, Zhuyun Zhou, Radu TimofteImage DeblurringImage Restoration

  3. FlashReFocus: Interactive Image Refocusing in Seconds

    Oct 16, 2026Ching-Heng Cheng, Chia-Ming Lee, Ming-Ching Chang +3Neural RenderingDiffusion Models for Image Restoration