This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Multiresolution Approach for Shape from Shading Coupling Deterministic and Stochastic Optimization
November 2003 (vol. 25 no. 11)
pp. 1416-1421

Abstract—Shape from shading is an ill-posed inverse problem for which there is no completely satisfactory solution in the existing literature. In this paper, we address shape from shading as an energy minimization problem. We first show that the deterministic approach provides efficient algorithms in terms of CPU time, but reaches its limits since the energy associated with shape from shading can contain multiple deep local minima. We derive an alternative stochastic approach using simulated annealing. The obtained results strongly outperform the results of the deterministic approach. The shortcoming is an extreme slowness of the optimization. Therefore, we propose a hybrid approach which combines the deterministic and stochastic approaches in a multiresolution framework.

[1] Shape from Shading, B.K.P. Horn and M.J. Brooks, eds. MIT Press, 1989.
[2] A. Crouzil, X. Descombes, and J.-D. Durou, A Multiresolution Approach for Shape from Shading Coupling Deterministic and Stochastic Optimization technical report, IRIT, Univ. Paul Sabatier, Toulouse, France, 2003.
[3] B.K.P. Horn, Obtaining Shape from Shading Information The Psychology of Computer Vision, P.H. Winston, ed., chapter 4, pp. 115-155, McGraw-Hill, 1975.
[4] R. Kimmel and A.M. Bruckstein, “Tracking Level-Sets by Level-Sets: A Method for Solving the Shape from Shading Problem,” Computer Vision and Image Understanding, vol. 62, no. 1, pp. 47-58, 1995.
[5] J.-D. Durou and D. Piau, Ambiguous Shape from Shading with Critical Points J. Math. Imaging and Vision, vol. 12, no. 2, pp. 99-108, Apr. 2000.
[6] P.-L. Lions, E. Rouy, and A. Tourin, Shape-from-Shading, Viscosity Solutions and Edges Numerische Mathematik, vol. 64, pp. 323-353, 1993.
[7] P. Dupuis and J. Oliensis, Direct Method for Reconstructing Shape from Shading Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 453-458, June 1992.
[8] M. Falcone and M. Sagona, An Algorithm for the Global Solution of the Shape-from-Shading Model Proc. Ninth IEEE Int'l Conf. Image Analysis and Processing, vol. I, pp. 596-603, Sept. 1997.
[9] P.-S. Tsai and M. Shah, Shape from Shading Using Linear Approximation,} Image and Vision Computing, vol. 12, no. 8, pp. 487-498, Oct. 1994.
[10] P. Daniel and J.-D. Durou, From Deterministic to Stochastic Methods for Shape From Shading Proc. Fourth Asian Conf. Computer Vision, pp. 187-192, Jan. 2000.
[11] R. Zhang, P.-S. Tsai, J. Cryer, and M. Shah, Shape from Shading: A Survey IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 21, no. 8, pp. 690-706, Aug. 1999.
[12] B.K.P. Horn and M.J. Brooks, “The Variational Approach to Shape from Shading,” Computer Vision, Graphics, and Image Processing, vol. 33. no. 2, pp. 174-208, 1986.
[13] K. Ikeuchi and B.K.P. Horn, Numerical Shape from Shading and Occluding Boundaries Artificial Intelligence, vol. 17, no. 1-3, pp. 141-194, Aug. 1981.
[14] R.T. Frankot and R. Chellappa, “A Method for Enforcing Integrabilty in Shape from Shading Algorithms,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 4, pp. 439-451, Apr. 1988.
[15] B.K.P. Horn, Height and Gradient from Shading Int'l J. Computer Vision, vol. 5, no. 1, pp. 37-75, Aug. 1990.
[16] R. Szeliski, “Fast Shape from Shading,” Computer Vision, Graphics, and Image Processing: Image Understanding, vol. 53, pp. 129-153, 1991.
[17] K.M. Lee and C.C.J. Kuo, “Shape from Shading with a Linear Triangular Element Surface Model,” IEEE Pattern Analysis and Machine, vol. 15, no. 8, pp. 815-822, 1993.
[18] P.L. Worthington and E.R. Hancock, “New Constraints on Data-Closeness and Needle-Map Consistency for SFS,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 21, no. 12, pp. 1250-1267, Dec. 1999.
[19] J.-D. Durou and H. Maître, On Convergence in the Methods of Strat and of Smith for Shape from Shading Int'l J. Computer Vision, vol. 17, no. 3, pp. 273-289, Mar. 1996.
[20] A. Blake, A. Zisserman, and G. Knowles, Surface Descriptions from Stereo and Shading Image and Vision Computing, vol. 3, no. 4, pp. 183-191, 1985.
[21] G. Winkler, Image Analysis, Random Fields and Dynamic Monte Carlo Methods: A Mathematical Introduction. Springer-Verlag, 1995.
[22] J. Besag, Spatial Interaction and the Statistical Analysis of Lattice Systems J. Royal Statistical Soc. B, vol. 36, no. 2, pp. 192-326, July 1974.
[23] S. Geman and D. Geman, Stochastic Relaxation, Gibbs Distribution, and the Bayesian Restoration of Images IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 6, no. 6, pp. 721-741, Nov. 1984.
[24] D. Terzopoulos, Efficient Multiresolution Algorithms for Computing Lightness, Shape from Shading, and Optical Flow Proc. Fourth Nat'l Conf. Artificial Intelligence, pp. 314-317, Aug. 1984.
[25] S. Peleg and G. Ron, Nonlinear Multiresolution: A Shape-from-Shading Example IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 12, no. 12, pp. 1206-1210, Dec. 1990.

Index Terms:
Shape from shading, optimization, simulated annealing, multiresolution.
Citation:
Alain Crouzil, Xavier Descombes, Jean-Denis Durou, "A Multiresolution Approach for Shape from Shading Coupling Deterministic and Stochastic Optimization," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 25, no. 11, pp. 1416-1421, Nov. 2003, doi:10.1109/TPAMI.2003.1240116
Usage of this product signifies your acceptance of the Terms of Use.