This paper will focus on a proposal to speed up Shape From Shading (SFS) approaches based on energy minimization. To this end, Graduated Non Convexity (GNC) algorithm has been adopted to minimize this strongly non convex energy. Achieved results are very promising and involve aspects both theoretical and practical. In fact, both a generalization of the original formulation of GNC and an effective discrete shape recovery characterize our approach. Finally, a drastic reduction of the computational time is reached in comparison with the other currently available approaches. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Gelli, D., & Vitulano, D. (2003). Speed up of shape from shading using graduated non-convexity. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2886, 504–513. https://doi.org/10.1007/978-3-540-39966-7_48
Mendeley helps you to discover research relevant for your work.