zbMATH — the first resource for mathematics

Regularized quadratic penalty methods for shape from shading. (English) Zbl 06802150
Summary: Shape from shading (SFS) denotes the problem of reconstructing a 3D surface, starting from a single shaded image which represents the surface itself. Minimization techniques are commonly used for solving the SFS problem, where the objective function is a weighted combination of the brightness error, plus one or more terms aiming to obtain a valid solution. We present a regularized quadratic penalty method where quadratic penalization is used to adaptively adjust the smoothing weights, and regularization improves the robustness and reliability of the procedure. A nonmonotone Barzilai-Borwein method is employed to efficiently solve the arising subproblems. Numerical results are provided showing the reliability of the proposed approach.
65N21 Numerical methods for inverse problems for boundary value problems involving PDEs
65C20 Probabilistic models, generic numerical methods in probability and statistics
65K05 Numerical mathematical programming methods
Full Text: DOI
[1] Birgin, E., Martínez, J., Raydan, M.: Spectral projected gradient methods: review and perspectives. J. Stat. Softw. 60, 1-21 (2014) · Zbl 0774.68140
[2] Camilli, F., Falcone, M.: An approximation scheme for the maximal solutions of the shape from shading model. In: Proceedings of the 3rd IEEE International Conference on Image Processing, Lausanne, Switzerland, vol. I, pp. 49-52 (1996) · Zbl 0754.65069
[3] Dai, YH; Fletcher, R, Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming, Numerische Mathematik, 100, 21-47, (2005) · Zbl 1068.65073
[4] Daniel, P., Durou, J.-D.: From deterministic to stochastic methods for shape from shading. In: Proceedings of the 4th Asian Conference on Computer Vision, Taipei, Taiwan, pp. 187-192 (2000) · Zbl 0898.90119
[5] Asmundis, R; Serafino, D; Riccio, F; Toraldo, G, On spectral properties of steepest descent methods, IMA J. Numer. Anal., 33, 1416-1435, (2013) · Zbl 1321.65095
[6] Asmundis, R; Serafino, D; Hager, W; Toraldo, G; Zhang, H, An efficient gradient method using the yuan steplength, Comput. Optim. Appl., 59, 541-563, (2014) · Zbl 1310.90082
[7] Durou, J-D; Falcone, M; Sagona, M, Numerical methods for shape-from-shading: a new survey with benchmarks, Comput. Vis. Image Underst., 109, 22-43, (2008)
[8] Durou, J.-D., Aujol, J.-F., Couteille, F.: Integrating the normal field of a surface in the presence of discontinuities. In: Cremers, D., Boykov, Y., Blake, A., Schmidt, F.R. (eds.) Energy Minimization Methods in Computer Vision and Pattern Recognition, Lecture Notes in Computer Science, vol. 5681, pp. 261-273. Springer, Berlin, Heidelberg (2009)
[9] Engl, H.W., Hanke, M., Neubauer, A.: Regularization of Inverse Problems. Kluwer Academic Publishers, Dordrecht (1996) · Zbl 0859.65054
[10] Falcone, M., Sagona, M., Seghini, A.: A scheme for the shape from shading model with “black shadows”. In: Brezzi, F., Buffa, A., Corsaro, S., Murli, A. (eds.) Numerical Mathematics and Advanced Applications. pp. 503-512. Springer, Milano (2003) · Zbl 1045.65099
[11] Fletcher, R; Qi, L (ed.); Teo, K (ed.); Yang, X (ed.); Pardalos, PM (ed.); Hearn, D (ed.), On the Barzilai-Borwein method, No. 96, 235-256, (2005), New York · Zbl 1118.90318
[12] Frankot, RT; Chellappa, R, A method for enforcing integrability in shape from shading algorithms, IEEE Trans. Pattern Anal. Mach. Intell., 10, 439-451, (1988) · Zbl 0669.65010
[13] Governi, L; Furferi, R; Puggelli, L; Volpe, Y, Improving surface reconstruction in shape from shading using easy-to-set boundary conditions, Int. J. Comput. Vis. Robot., 3, 225-247, (2013)
[14] Governi, L; Furferi, R; Carfagni, M; Puggelli, L; Volpe, Y, Digital bas-relief design: a novel shape from shading-based method, Comput. Aided Des. Appl., 11, 153-164, (2014)
[15] Horn, B.K.P.: Shape from Shading: A Method for Obtaining the Shape of a Smooth Opaque Object from One View, MAC-TR-79 and AI-TR-232. Massachusetts Institute of Technology, Artificial Intelligence Laboratory, Cambridge (1970)
[16] Horn, BKP; Winston, PH (ed.), Obtaining shape from shading, (1975), New York
[17] Horn, BKP, Height and gradient from shading, Int. J. Comput. Vis., 5, 37-75, (1990)
[18] Horn, BKP; Brooks, MJ, The variational approach to shape from shading, Comput. Vis. Graph. Image Proc., 33, 174-208, (1986) · Zbl 0629.65125
[19] Horn, B.K.P., Brooks, M.J.: Shape from Shading. MIT Press, Cambridge (1989) · Zbl 0629.65125
[20] Kozera, R, Uniqueness in shape from shading revisited, J. Math. Imaging Vis., 7, 123-138, (1997) · Zbl 0899.68117
[21] Leclerc, Y.G., Bobick, A.F.: The direct computation of height from shading. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Maui, HI, USA, pp. 552-558 (1991) · Zbl 0754.65069
[22] Nocedal, J., Wright, S.J.: Numerical Optimization. Series in Operations Research and Financial Engineering. Springer, New York (2006)
[23] Oliensis, J, Uniqueness in shape from shading, Int. J. Comput. Vis., 6, 75-104, (1991) · Zbl 0777.68094
[24] Raydan, M, The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem, SIAM J. Optim., 7, 26-33, (1997) · Zbl 0898.90119
[25] Rouy, E; Tourin, A, A viscosity solution approach to shape from shading, SIAM J. Numer. Anal., 29, 867-884, (1992) · Zbl 0754.65069
[26] Szelisi, R, Fast shape from shading, Comput. Vis. Graph. Image Proc. Image Underst., 53, 129-153, (1991) · Zbl 0774.68140
[27] Tozza, S., Falcone, M., Analysis and approximation of some shape-from-shading models for non-Lambertian surfaces. J. Math. Imaging Vis. 55, 153-178 (2016) · Zbl 1357.68255
[28] Wu, T., Sun, J., Tang, C., Shum, H.: Interactive normal reconstruction from a single image. ACM Trans. Graph. 27, 1-9 (2008). Article 119
[29] Worthington, PL; Hancock, ER, New constraints on data-closeness and needle map consistency for shape from shading, IEEE Trans. Pattern Anal. Mach. Intell., 21, 1250-1267, (1999)
[30] Zhang, R; Tsai, P-S; Cryer, JE; Shah, M, Shape-from-shading: a survey, IEEE Trans. Pattern Anal. Mach. Intell., 21, 690-706, (1999) · Zbl 1316.94019
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.