Skip to main content
Book cover

ICAOS '96 pp 225–237Cite as

Coiflets for range image segmentation

  • Image Segmentation
  • Conference paper
  • First Online:
  • 215 Accesses

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 219))

Abstract

In this paper, we propose a method for accelerating range image segmentation process which uses techniques of region-growing based on functions approximation and local neighborhood property. This method uses multiresolution wavelet transforms, where the used wavelets are Coiflets. The interesting property of this kind of wavelets is the interpolating characteristic of their associated scaling functions. This characteristic is due to the fact that both Coiflets and their scaling functions moments vanish. An overview on the proposed segmentation scheme gives the following description. First, input data is compressed to a fixed lower resolution (LR), then the partitioning process is applied on the compressed image. The result of this process is “projected” to the initial resolution (IR) and a global error criterion (GEC) is evaluated. The required result is obtained by increasing LR -if necessary- until the GEC is respected. Encouraging results are obtained for several range images.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. N. Abdelmalek (1990): Surface Curvatures and 3-D range images segmentation, Pattern Recognition, Vol. 23, No. 8, pp. 807–817.

    Google Scholar 

  2. P. J. Besl and R. C. Jain (1988): Segmentation Through Variable-Order Surface Fitting, IEEE Trans. Pattern Anal. and Mach. Intell. Vol. 10, No. 2, pp. 167–192.

    Google Scholar 

  3. S. Mallat (1989): A theory for multiresolution signal decomposition: The wavelet representation, IEEE Trans. Pattern Anal. and Mach. Intell, Vol. 11, No. 7, pp. 674–693.

    Google Scholar 

  4. S. Tanimoto and T. Pavlidis (1975): A hierarchical data structure for picture processing, CGIP, 4, 2, pp. 104–119.

    Google Scholar 

  5. H. P. Moravee (1977): Towards automatic visual obstacle avoidance, Proc. 5th IJCAL, pp. 584.

    Google Scholar 

  6. M. D. Levine (1978): Acknowledge-based computer vision system in CVS.

    Google Scholar 

  7. A. R. Hanson and E. M. Riseman (Eds) (1978): Computer vision systems (CVS), New York: Academic Press.

    Google Scholar 

  8. I. Daubechies (1993): Orthonormal bases of compactly supported wavelets. II. Variations on a theme, SIAM J. MATH. ANAL., Vol. 24, No. 2, pp. 499–519.

    Google Scholar 

  9. G. Beylkin, R. Coifman and V. Rokhlin (1991): Fast Wavelet Transforms and Numerical Algorithms I, Communication on Pure and Applied Mathematics, Vol. XLIV, pp. 141–183.

    Google Scholar 

  10. K. Melkemi (1995): Ondelette sur l'intervalle, Memoire de DEA, Lab. LMCIMAG, Universite Joseph Fourier Grenoble1.

    Google Scholar 

  11. M. Djebali M. Melkemi and D. Vandorpe (1996): Segmentation d'Images de profondeur basée sur les Coiflets, Technical Repport, Lab. LIGIM, Universite Claude Bernard Lyon1.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marie-Odile Berger Rachid Deriche Isabelle Herlin Jérome Jaffré Jean-Michel Morel

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag London Limited

About this paper

Cite this paper

Djebali, M., Melkemi, K., Melkemi, M., Vandorpe, D. (1996). Coiflets for range image segmentation. In: Berger, MO., Deriche, R., Herlin, I., Jaffré, J., Morel, JM. (eds) ICAOS '96. Lecture Notes in Control and Information Sciences, vol 219. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-76076-8_136

Download citation

  • DOI: https://doi.org/10.1007/3-540-76076-8_136

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76076-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics