Learning Depth from Focus with Multi-Candidate Estimation and Proximal Refinement

In this paper, we propose a novel Depth from Focus (DFF) framework that formulates depth estimation as an energy minimization problem and unrolls the corresponding iterative optimization into a trainable neural architecture. Given a focal stack, a deep feature extractor constructs a learned focus volume that encodes defocus and structural cues. Based on this representation, multiple candidate depth maps are generated using a plane-based probabilistic formulation, while an attention mechanism adaptively assigns pixel-wise confidence weights to each candidate. The depth estimation is performed through an iterative refinement process, where each stage corresponds to a learned proximal update implemented via lightweight conditional networks. These updates incorporate focus consistency, adaptive step sizes, and learned regularization priors, enabling effective integration of physical imaging constraints with data-driven modeling. A final refinement module further enhances prediction accuracy by fusing the refined depth, focus volume features, and candidate hypotheses to estimate residual corrections. The entire framework is trained end-to-end, ensuring coherent optimization across all components. Experimental results demonstrate that the proposed method achieves improved robustness and accuracy, particularly in low-texture and noisy regions, while preserving interpretability through its unfolding-based design.

Authors

Institutions

Publication Details

Journal
Electronics
Published
2026-06-09
DOI
https://doi.org/10.3390/electronics15122548
Primary Topic
Image Processing Techniques and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Learning Depth from Focus with Multi-Candidate Estimation and Proximal Refinement

Muhammad Tariq Mahmood
Electronics
Image Processing Techniques and Applications
article

Learning Depth from Focus with Multi-Candidate Estimation and Proximal Refinement

Muhammad Tariq Mahmood
article en

Abstract

In this paper, we propose a novel Depth from Focus (DFF) framework that formulates depth estimation as an energy minimization problem and unrolls the corresponding iterative optimization into a trainable neural architecture. Given a focal stack, a deep feature extractor constructs a learned focus volume that encodes defocus and structural cues. Based on this representation, multiple candidate depth maps are generated using a plane-based probabilistic formulation, while an attention mechanism adaptively assigns pixel-wise confidence weights to each candidate. The depth estimation is performed through an iterative refinement process, where each stage corresponds to a learned proximal update implemented via lightweight conditional networks. These updates incorporate focus consistency, adaptive step sizes, and learned regularization priors, enabling effective integration of physical imaging constraints with data-driven modeling. A final refinement module further enhances prediction accuracy by fusing the refined depth, focus volume features, and candidate hypotheses to estimate residual corrections. The entire framework is trained end-to-end, ensuring coherent optimization across all components. Experimental results demonstrate that the proposed method achieves improved robustness and accuracy, particularly in low-texture and noisy regions, while preserving interpretability through its unfolding-based design.

ElectronicsVol. 15(12)
Korea University of Technology and Education (KR)
Affordable and clean energy
Openalex Percentile: Top 7%
Image Processing Techniques and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.