MétaCan
Menu
Back to cohort
Record W2567471568 · doi:10.1109/crv.2016.61

What is a Good Model for Depth from Defocus?

2016· article· en· W2567471568 on OpenAlexaff
Fahim Mannan, Michael Langer

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicImage Processing Techniques and Applications
Canadian institutionsMcGill University
Fundersnot available
KeywordsComputer scienceGeologyComputer vision

Abstract

fetched live from OpenAlex

Different models for estimating depth from defocused images have been proposed over the years. Typically two differently defocused images are used by these models. Many of them work on the principle of transforming one or both of the images so that the transformed images become equivalent. One of the most common models is to estimate the relative blur between a pair of defocused images and compute depth from it. Another model known as the Blur Equalization Technique (BET) works by blurring both images by an appropriate pair of blur kernels. The inverse approach is to deblur both images by an appropriate pair of blur kernels. In this paper we compare the performance of these models to find under what conditions they work best. We show that the common approach of using the Gaussian approximation of the relative blur kernel performs worse than a more general approximation of the relative blur kernel. Furthermore, we show that despite the reduction in signal content in BET, it works well in most circumstances. Finally, the performance of deconvolution based approaches depends on a large part on the shape of the blur kernel and is more appropriate for the coded aperture setup.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.011
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.009
Threshold uncertainty score0.017

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.011
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0020.007
Open science0.0030.001
Research integrity0.0030.002
Insufficient payload (model declined to judge)0.0030.002

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.021
GPT teacher head0.261
Teacher spread0.239 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations9
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicImage Processing Techniques and ApplicationsFrench-language works237,207