Discontinuity-Adaptive Shape from Focus Using a Non-convex Prior

Authors:
Krishnamurthy Ramnath;Ambasamudram N. Rajagopalan
Affiliations:
Image Processing and Computer Vision Laboratory Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, India;Image Processing and Computer Vision Laboratory Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, India
Venue:
Proceedings of the 31st DAGM Symposium on Pattern Recognition
Year:
2009

Citing 8
Cited 0

A New Sense for Depth of Field

IEEE Transactions on Pattern Analysis and Machine Intelligence
Visual reconstruction

Visual reconstruction
Accurate Recovery of Three-Dimensional Shape from Image Focus

IEEE Transactions on Pattern Analysis and Machine Intelligence
Markov random field modeling in computer vision

Markov random field modeling in computer vision
A Geometric Approach to Shape from Defocus

IEEE Transactions on Pattern Analysis and Machine Intelligence
3-D Shape Estimation and Image Restoration: Exploiting Defocus and Motion-Blur

3-D Shape Estimation and Image Restoration: Exploiting Defocus and Motion-Blur
Shape from Defocus via Diffusion

IEEE Transactions on Pattern Analysis and Machine Intelligence
Confocal Stereo

International Journal of Computer Vision

Quantified Score

Hi-index	0.00

Visualization

Abstract

Shape from focus (SFF) is a widely used technique for determining the 3D structure of textured microscopic objects. However, SFF output depends critically on the number of observations used and the focus measure operator adopted. In this paper, we propose a new SFF method that can provide rich structure information given limited number of observations. We observe that depth is non-linearly related to the observations and pose the shape estimation as a minimization problem within a Maximum A Posteriori (MAP) - Markov Random Field (MRF) framework. We incorporate a discontinuity-adaptive MRF prior for the underlying structure. The resulting cost function is non-convex in nature which we minimize using Graduated non-convexity algorithm. When tested on synthetic as well as real objects, the results obtained are quite impressive.