Skip to main content

Discrete surface signal processing: The polygon as the surface element

  • Conference paper
  • First Online:
Object Representation in Computer Vision (ORCV 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 994))

Included in the following conference series:

Abstract

Smooth surfaces are approximated by polyhedral surfaces both for display, and for other computational purposes. This is probably the most common surface representation in computer graphics, because polygons are what the current generation of graphics hardware can display efficiently. In computer vision this representation has not been very popular for a long time, probably because it was not seen as very appropriate for object recognition and positioning applications. But it is now being used in more applications, particularly in the medical domain, where polyhedral surface approximations of unknown surfaces are routinely generated with iso-surface construction algorithms. We look at polyhedral surfaces as a generalization of digital images, where the polygon takes the place of the pixel. The polygon is the fundamental surface element. Digital images are functions defined at the nodes of a regular rectangular grid. Discrete surface signals are functions defined at the vertices of a polyhedral surface of arbitrary topology. Signal processing operations, and Fourier analysis in particular, are the fundamental tools of low level computer vision. The lack of regularity and self-similarity of arbitrary polyhedral surface meshes, as opposed to the regular rectangular grids of digital images, complicates the analysis and processing of digital surface signals. Nevertheless, in this paper we generalize Fourier analysis to discrete surface signals. As a first application of this theory we consider the problem of surface smoothing, which corresponds to low-pass filtering within this framework. As in the classical cases of one-dimensional signals, and of digital images, the analysis of discrete surface signals is reduced to matrix analysis, and matrix computation techniques are used to achieve fast discrete surface signal processing operations. We intend to continue along this line of research in the near future, extending higher level computer vision operations to arbitrary polyhedral surfaces.

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.

References

  1. H. Baker. Building surfaces of evolution: The weaving wall. International Journal of Computer Vision, 3:51–71, 1989.

    Google Scholar 

  2. P.J. Davis. Circulant Matrices. John Wiley & Sons, 1975.

    Google Scholar 

  3. J.D. Foley, A. van Dam, S.K. Feiner, and J.F. Hughes. Computer Graphics, Principles and Practice. Addison-Wesley, Reading, MA, second edition, 1992.

    Google Scholar 

  4. G. Golub and CF. Van Loan. Matrix Computations. John Hopkins University Press, 1983.

    Google Scholar 

  5. A. Guéziec and R. Hummel. The wrapper algorithm: Surface extraction and simplification. In IEEE Workshop on Biomedical Image Analysis, pages 204–213, Seattle, WA, June 24–25 1994.

    Google Scholar 

  6. A.D. Kalvin. Segmentation and Surface-Based Modeling of Objects in Three-Dimensional Biomedical Images. PhD thesis, New York University, New York, March 1991.

    Google Scholar 

  7. T. Lindeberg. Scale-space for discrete signals. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12(3):234–254, March 1990.

    Google Scholar 

  8. W. Lorenson and H. Cline. Marching cubes: A high resolution 3d surface construction algorithm. Computer Graphics, pages 163–169, July 1987. (Proceedings SIGGRAPH).

    Google Scholar 

  9. J. Oliensis. Local reproducible smoothing without shrinkage. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15(3):307–312, March 1993.

    Google Scholar 

  10. E. Seneta. Non-Negative Matrices, An Introduction to Theory and Applications. John Wiley & Sons, New York, 1973.

    Google Scholar 

  11. G. Taubin. Curve and surface smoothing without shrinkage. Technical Report RC-19536, IBM Research, April 1994.

    Google Scholar 

  12. A.P. Witkin. Scale-space filtering. In Proceedings, 8th. International Joint Conference on Artificial Intelligence (IJCAI), pages 1019–1022, Karlsruhe, Germany, August 1983.

    Google Scholar 

  13. C.T. Zahn and R.Z. Roskies. Fourier descriptors for plane closed curves. IEEE Transactions on Computers, 21(3):269–281, March 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Martial Hebert Jean Ponce Terry Boult Ari Gross

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Taubin, G. (1995). Discrete surface signal processing: The polygon as the surface element. In: Hebert, M., Ponce, J., Boult, T., Gross, A. (eds) Object Representation in Computer Vision. ORCV 1994. Lecture Notes in Computer Science, vol 994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60477-4_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-60477-4_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60477-8

  • Online ISBN: 978-3-540-47526-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics