Skip to main content

Fast computation of 3-D geometric moments using a discrete Gauss' theorem

  • Posters
  • Conference paper
  • First Online:
Computer Analysis of Images and Patterns (CAIP 1995)

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

Included in the following conference series:

Abstract

A discrete Gauss' theorem is presented. Using a fast surface tracking algorithm and the discrete Gauss' theorem, we design a new method to compute the Cartesian geometric moments of 3-D objects. Compared to previous methods to compute such moments, the new method reduces the computational complexity significantly.

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. Cyganski, D., Kreda, S. J., Orr, J. A.: Solving for the general linear transformation relating 3-D objects from the minimum moments. Proc. SPIE Vol. 1002, Intelligent Robots and Computer Vision VII (1988) 204–211

    Google Scholar 

  2. Gordon, D., Udupa, J. K.: Fast surface tracking in three-dimensional binary images. Comput. Vision Graph. Image Process. 45 (1989) 196–214

    Google Scholar 

  3. Hatamian, M.: A real-time two-dimensional moment generating algorithm and its single chip implementation. IEEE Trans. ASSP 34 (1986) 546–553

    Google Scholar 

  4. Li, B.-C., Ma, S. D.: Efficient computation of 3D moments. Proc. 12th Int. Conf. Pattern Recogn., Vol. I (1994) 22–26

    Google Scholar 

  5. Li, B.-C., Shen, J.: Fast computation of moment invariants. Pattern Recogn. 24 (1991) 807–813

    Google Scholar 

  6. Li, B.-C., Shen, J.: Pascal triangle transform approach to the calculation of 3D moments. CVGIP: Graphical Models and Image Processing 54 (1992) 301–307

    Google Scholar 

  7. Lo, C.-H., Don, H.-S.: 3-D moment forms: their construction and application to object identification and positioning. IEEE Trans. Pattern Anal. Machine Intell. 11 (1989) 1053–1064

    Google Scholar 

  8. Pei, S.-C., Liou, L.-G.: Using moments to acquire the motion parameters of a deformable object without correspondences. Image and Vision Computing 12 (1994) 475–485

    Google Scholar 

  9. Yang, L., Albregtsen, F.: Fast computation of invariant geometric moments: a new method giving correct results. Proc. 12th Int. Conf. Pattern Recognition, Vol. I (1994) 201–204

    Google Scholar 

  10. Yang, L., Albregtsen, F.: Fast and exact computation of Cartesian geometric moments using discrete Green's theorem. Submitted to Pattern Recogn. (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Václav Hlaváč Radim Šára

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, L., Albregtsen, F., Taxt, T. (1995). Fast computation of 3-D geometric moments using a discrete Gauss' theorem. In: Hlaváč, V., Šára, R. (eds) Computer Analysis of Images and Patterns. CAIP 1995. Lecture Notes in Computer Science, vol 970. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60268-2_359

Download citation

  • DOI: https://doi.org/10.1007/3-540-60268-2_359

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60268-2

  • Online ISBN: 978-3-540-44781-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics