Advertisement

Journal of Computer Science and Technology

, Volume 31, Issue 3, pp 450–462 | Cite as

Improving Shape from Shading with Interactive Tabu Search

  • Jing Wu
  • Paul L. Rosin
  • Xianfang Sun
  • Ralph R. Martin
Regular Paper

Abstract

Optimisation based shape from shading (SFS) is sensitive to initialization: errors in initialization are a significant cause of poor overall shape reconstruction. In this paper, we present a method to help overcome this problem by means of user interaction. There are two key elements in our method. Firstly, we extend SFS to consider a set of initializations, rather than to use a single one. Secondly, we efficiently explore this initialization space using a heuristic search method, tabu search, guided by user evaluation of the reconstruction quality. Reconstruction results on both synthetic and real images demonstrate the effectiveness of our method in providing more desirable shape reconstructions.

Keywords

shape from shading user interaction tabu search 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Horn B K P, Brooks M J. The variational approach to shape from shading. Computer Vision, Graphics, and Image Processing, 1986, 33(2): 174–208.CrossRefzbMATHGoogle Scholar
  2. [2]
    Ramachandran V S. Perceiving shape from shading. Scientific American, 1988, 259(2): 76–83.CrossRefGoogle Scholar
  3. [3]
    Belhumeur P N, Kriegman D J, Yuille A L. The basrelief ambiguity. International Journal of Computer Vision, 2001, 35: 1040–1046.Google Scholar
  4. [4]
    Worthington P L, Hancock E R. New constraints on data-closeness and needle map consistency for shape-fromshading. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1999, 21(12): 1250–1267.CrossRefGoogle Scholar
  5. [5]
    Huang R, Smith W A P. Structure-preserving regularisation constraints for shape-from-shading. In Proc. the 13th International Conference on Computer Analysis of Images and Patterns, Sept. 2009, pp.865-872.Google Scholar
  6. [6]
    Durou J D, Falconeb M, Sagonab M. Numerical methods for shape-from-shading: A new survey with benchmarks. Computer Vision and Image Understanding, 2008, 109(1): 22–43.CrossRefGoogle Scholar
  7. [7]
    Zhang R, Tsai P S, Cryer J E, Shah M. Shape from shading: A survey. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1999, 21(8): 690–706.CrossRefzbMATHGoogle Scholar
  8. [8]
    Zeng G, Matsushita Y, Quan L, Shum H Y. Interactive shape from shading. In Proc. IEEE Computer Society Conference on Computer Vision and Pattern Recognition, June 2005, pp.343-350.Google Scholar
  9. [9]
    Meyer A, Briceno H M, Bouakaz S. User-guided shape from shading to reconstruct fine details from a single photograph. In Proc. the 8th Asian Conference on Computer Vision, Nov. 2007, pp.738-747.Google Scholar
  10. [10]
    Wu T P, Sun J, Tang C K, Shum H Y. Interactive normal reconstruction from a single image. ACM Transactions on Graphics, 2008, 27(5): Article No. 119.Google Scholar
  11. [11]
    Governi L, Furferi R, Puggelli L, Volpe Y. Improving surface reconstruction in shape from shading using easy-to-set boundary conditions. International Journal of Computational Vision and Robotics, 2013, 3(3): 225–247.CrossRefGoogle Scholar
  12. [12]
    Saito H, Usami K. Shape from shading using genetic algorithm. In Proc. IECON, Nov. 1993, pp.1620-1625.Google Scholar
  13. [13]
    Crouzil A, Descombes X, Durou J D. A multiresolution approach for shape from shading coupling deterministic and stochastic optimization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2003, 25(11): 1416-1421.CrossRefGoogle Scholar
  14. [14]
    Sinclair M. Comparison of the performance of modern heuristics for combinatorial optimization on real data. Computers & Operations Research, 1993, 20(7): 687–695.CrossRefzbMATHGoogle Scholar
  15. [15]
    Huang R, SmithWA P. Shape-from-shading under complex natural illumination. In Proc. the 18th IEEE International Conference on Image Processing, Sept. 2011, pp.13-16.Google Scholar
  16. [16]
    Meyer F. Topographic distance and watershed lines. Signal Processing, 1994, 38(1): 113–125.CrossRefzbMATHGoogle Scholar
  17. [17]
    Frankot R T, Chellappa R. A method for enforcing integrability in shape from shading algorithms. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1988, 10(4): 439–451.CrossRefzbMATHGoogle Scholar
  18. [18]
    Basri R, Jacobs D W. Lambertian reflectance and linear subspaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2003, 25(2): 218–233.CrossRefGoogle Scholar
  19. [19]
    Tomasi C, Manduchi R. Bilateral filtering for gray and color images. In Proc. IEEE International Conference on Computer Vision, Jan. 1998, pp.839-846.Google Scholar
  20. [20]
    Xu L, Lu C, Xu Y, Jia J. Image smoothing via L0 gradient minimization. ACM Transactions on Graphics, 2011, 30(6): Article No. 174.Google Scholar
  21. [21]
    Glover F. Tabu search — Part 1. ORSA Journal on Computing, 1989, 1(3): 190–206.CrossRefzbMATHGoogle Scholar
  22. [22]
    Glover F. Tabu search — Part 2. ORSA Journal on Computing, 1990, 2(1): 4–32.CrossRefzbMATHGoogle Scholar
  23. [23]
    Daniel P, Durou J D. From deterministic to stochastic methods for shape from shading. In Proc. the 4th Asian Conference on Computer Vision, Jan. 2000, pp.187-192.Google Scholar
  24. [24]
    Falcone M, Sagona M. An algorithm for the global solution of the shape-from-shading model. In Proc. the 9th International Conference on Image Analysis and Processing, Sept. 1997, pp.596-603.Google Scholar
  25. [25]
    Tsai P S, Shah M. Shape from shading using linear approximation. Image and Vision Computing, 1994, 12(8): 487–498.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Jing Wu
    • 1
  • Paul L. Rosin
    • 1
  • Xianfang Sun
    • 1
  • Ralph R. Martin
    • 1
  1. 1.School of Computer Science and InformaticsCardiff UniversityCardiffU.K.

Personalised recommendations