close
Skip to main content

Extracting Surface Representations from Rim Curves

  • Conference paper
Computer Vision – ACCV 2006 (ACCV 2006)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 3852))

Included in the following conference series:

  • 2243 Accesses

  • 2 Citations

Abstract

In this paper, we design and implement a novel method for constructing a mixed triangle/quadrangle mesh from the 3D space curves (rims) estimated from the profiles of an object in an image sequence without knowing the original 3D topology of the object. To this aim, a contour data structure for representing visual hull, which is different from that for CT/MRI, is introduced. In this paper, we (1) solve the “branching structure” problem by introducing some additional “directed edge”, and (2) extract a triangle/quadrangle closed mesh from the contour structure with an algorithm based on dynamic programming. Both theoretical demonstration and real world results show that our proposed method has sufficient robustness with respect to the complex topology of the object, and the extracted mesh is of high quality.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Liang, C., Wong, K.-Y.K.: Complex 3d shape recovery using a dual-space approach. In: Proc. IEEE International Conference on Computer Vision and Pattern Recognition, vol. 2, pp. 878–884 (2005)

    Google Scholar 

  2. Boyer, E., Berger, M.: 3d surface reconstruction using occluding contours. International Journal on Computer Vision 22, 219–233 (1997)

    Article  Google Scholar 

  3. Vaillant, R., Faugeras, O.: Using extremal boundaries for 3-d object modeling. IEEE Trans. Pattern Analysis and Machine Intelligence 14, 157–173 (1992)

    Article  Google Scholar 

  4. Cong, G., Parvin, B.: Surface recovery from planar sectional contours. In: Proc. International Conference on Pattern Recognition, vol. IV, pp. 106–109 (2000)

    Google Scholar 

  5. Boissonnat, J.: Shape reconstruction from planar cross sections. Computer Vision Graphics and Image Processing 44, 1–29 (1988)

    Article  Google Scholar 

  6. O’Neill, B.: Elementary Differential Geometry, 2nd edn. Academic Press, London (1966)

    MATH  Google Scholar 

  7. Devillers, O.: On deletion in delaunay triangulations. In: Proc. 15th Annual Symposium on Computational Geometry, pp. 181–188 (1999)

    Google Scholar 

  8. Schaefer, S., Warren, J.: On c2 triangle/quad subdivision. ACM Trans. Graph. 24, 28–36 (2005)

    Article  Google Scholar 

  9. Stam, J., Loop, C.: Quad/triangle subdivision. Computer Graphics Forum 22, 79–85 (2003)

    Article  Google Scholar 

  10. Bresler, Y., Fessler, J., Macovski, A.: A bayesian approach to reconstruction from incomplete projections of a multiple object 3d domain. IEEE Trans. Pattern Analysis and Machine Intelligence 11, 840–858 (1989)

    Article  Google Scholar 

  11. Meyers, D., Skinner, S., Sloan, K.: Surfaces from contours. ACM Trans. Graph. 11, 228–258 (1992)

    Article  MATH  Google Scholar 

  12. Wong, K.-Y.K., Cipolla, R.: Structure and motion from silhouettes. In: Proc. 8th IEEE International Conference on Computer Vision, vol. II, pp. 217–222 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, H., Wong, KY.K., Liang, C., Chen, Y. (2006). Extracting Surface Representations from Rim Curves. In: Narayanan, P.J., Nayar, S.K., Shum, HY. (eds) Computer Vision – ACCV 2006. ACCV 2006. Lecture Notes in Computer Science, vol 3852. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11612704_73

Download citation

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Publish with us

Policies and ethics