Paper Info
Title
An Iterative Marching with Correctness Criterion Algorithm for Shape from Shading Under Oblique Light Source.
Abstract
In this paper, a fast and robust Shape from Shading (SfS) algorithm by iterative marching with corrections criterion under oblique light source is presented. Usually, SfS algorithms are based on the assumption that image radiance is a function of normal surface alone. SfS algorithms solve first-order nonlinear Hamilton Jacobi equation called image irradiance equation. Both Fast Marching Method (FMM) and Marching with Correctness Criterion (MCC) basically work for the frontal light illumination direction, in which the image irradiance equation is an Eikonal equation. The problem task is to recover the surface from the image-which amounts to finding a solution to the Eikonal equation. FMMcopes better the image irradiance iteratively under oblique light sources with the cost of computational complexity O(N log N). One prominent solution is the Marching with MCC of Mauch which solves the Eikonal equation with computational complexity O(N). Here, we present a new iterative variant of the MCC which copes better with images taken under oblique light sources. The proposed approach is evaluated on two synthetic real images and compared with the iterative variant of FMM. The experimental results show that the proposed approach, iterative variant of MCC is more efficient than the iterative variant of FMM.
Year
DOI
Venue
2012
10.1007/978-81-322-1602-5_57
PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON SOFT COMPUTING FOR PROBLEM SOLVING (SOCPROS 2012)
Keywords
Field
DocType
SfS,FMM,MCC,Complexity
Oblique case,Fast marching method,Hamilton–Jacobi equation,Eikonal equation,Algorithm,Real image,Time complexity,Mathematics,Photometric stereo,Computational complexity theory
Conference
Volume
ISSN
Citations 
236
2194-5357
0
PageRank 
References 
Authors
0.34
8
2
Name
Order
Citations
PageRank
Gaurav Gupta101.69
Manoj Kumar2732104.98