Two Simple Yet Effective Strategies for Avoiding Over-Smoothing in SFS Problem
Monica Carfagni1, Rocco Furferi1, Lapo Governi1, Luca Puggelli1 & Yary Volpe1 Show affiliations
- University of Florence, Italy
Journal of Computer Science, Volume 12, Issue 3, pp. 128–140 · doi.org/10.3844/jcssp.2016.128.140
Abstract
Minimization techniques are widely used for retrieving a 3D surface starting from a single shaded image i.e., for solving the shape from shading problem. Such techniques are based on the assumption that expected surface to be retrieved coincides with the one that minimize a properly developed functional, consisting of several contributions. Among the possible contributes defining the functional, the so called “smoothness constraint” is always used since it guides the convergence of the minimization process towards a more accurate solution. Unfortunately, in areas where actually brightness changes rapidly, it also introduces an undesired over-smoothing effect. The present work proposes two simple yet effective strategies for avoiding the typical over-smoothing effect, with regards to the image regions in which this effect is particularly undesired (e.g., areas where surface details are to be preserved in the reconstruction). Tested against a set of case studies the strategies prove to outperform traditional SFS-based methods.
Licence and reuse
Open access. This article is licensed under a Creative Commons Attribution 3.0 Licence (CC BY 3.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.
How to reuse this articleResponses (0)
About this article
Carfagni, M., Furferi, R., Governi, L., Puggelli, L. & Volpe, Y. (2016). Two Simple Yet Effective Strategies for Avoiding Over-Smoothing in SFS Problem. Journal of Computer Science, 12(3), 128–140. https://doi.org/10.3844/jcssp.2016.128.140
- Licence
- CC BY 3.0
- Issue
- Volume 12, Issue 3
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
