A Graph Theoretic Approach for Shape from Shading

Resolving ambiguities is a fundamental problem in shape from shading (SFS). The classic SFS approach allows to reconstruct the surface locally around singular points up to an ambiguity of convex, concave or saddle point type.

[1]  Saliha Aouat,et al.  Tabu Search to Solve the Shape from Shading Ambiguity , 2015, Int. J. Artif. Intell. Tools.

[2]  John Oliensis,et al.  Uniqueness in shape from shading , 1991, International Journal of Computer Vision.

[3]  Jean-Denis Durou,et al.  Ambiguous Shape from Shading with Critical Points , 2004, Journal of Mathematical Imaging and Vision.

[4]  Anni R. Bruss.  Is What You See What You Get? , 1983, IJCAI.

[5]  Alfred M. Bruckstein,et al.  Global Shape from Shading , 1996, Comput. Vis. Image Underst..

[6]  Anna R. Bruss.  The Eikonal equation: some results applicable to computer vision , 1982 .

[7]  J. Hopcroft,et al.  Algorithm 447: efficient algorithms for graph manipulation , 1973, CACM.

[8]  Saliha Aouat,et al.  Improved shape from shading without initial information , 2017, Frontiers of Computer Science.

[9]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[10]  Stefano Soatto,et al.  Fast Marching Method for Generic Shape from Shading , 2005, VLSM.

[11]  Berthold K. P. Horn.  SHAPE FROM SHADING: A METHOD FOR OBTAINING THE SHAPE OF A SMOOTH OPAQUE OBJECT FROM ONE VIEW , 1970 .

[12]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[13]  Jianbo Shi,et al.  Shape from Shading: Recognizing the Mountains through a Global View , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[14]  Jean-Denis Durou,et al.  Edge-Preserving Integration of a Normal Field: Weighted Least-Squares, TV and L^1 Approaches , 2015, SSVM.

[15]  Ekkehard Köhler,et al.  Recognizing graphs without asteroidal triples , 2000, J. Discrete Algorithms.