Back to search

University of British Columbia

Iterative depth from defocus (I-DFD) algorithms

Abstract

dc:description

Depth From Defocus (DFD) seeks to obtain depth information from camera images by measuring the amount of defocus in the images. Although DFD avoids many of the problems associated with stereo vision by maintaining only one point of view, other issues such as optical modelling and computational intensity determine speed and accuracy of DFD systems. This thesis presents the optical theory that establishes the relationship between defocus and depth. Defocus is modelled by the convolution of a scene and a defocus kernel to produce a defocussed image. Dependencies on the scene are removed by measuring the relative defocus between two images of the scene. This is modeled by the convolution of the sharper image with a relative defocus kernel to produce the blurrier image. The determination of the relative defocus kernel is the challenge of DFD. Spatial domain algorithms avoid the errors and assumptions associated with frequency domain transformations. Iterative techniques provide an accurate way of finding the relative defocus kernel, at the expense of computational intensity required by convolution calculations. This thesis develops a hierarchy of Iterative DFD (I-DFD) algorithms for the spatial domain. The hierarchy is divided into defocus modelling method (theoretical (T) or measured (M)), relative defocus shaping method (Gaussian (G) or regularized (R)) and convolution implementation (two-dimensional (2), separable (S) or integrated (I)). Four of the algorithms (TR2, TRI, TGS, TGI) in this hierarchy are implemented and fully tested on three classes of images. TR2 has been previously published and is used as a benchmark. TGS and TGI significantly reduce computational effort, but suffer from degraded accuracy. TRI reduces computational effort by several orders of magnitude with no degradation of accuracy for two of the three classes of images. Recommendations are made to alleviate the degradation in the third class of images.

Degree

thesis:*
Name thesis:degree_name
Master of Applied Science - MASc
Level thesis:degree_level
master's
Discipline thesis:degree_discipline
Electrical and Computer Engineering
Grantor dc:publisher
University of British Columbia
Year dc:date
1995

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Sewlochan, Ray

Rights

dc:rights
Statement dc:rights
  • For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.
Language dc:language
eng

Identifiers

dc:identifier.*
Handle dc:identifier
http://hdl.handle.net/2429/3716

Chain of custody

source
Harvested from
University of British Columbia
Base URL
circle.library.ubc.ca/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Sewlochan, Ray. Iterative depth from defocus (I-DFD) algorithms. master's thesis, University of British Columbia, 1995. http://hdl.handle.net/2429/3716