Skip to main content

Dynamic Confinement, Classification, and Imaging

  • Conference paper
Classification in the Information Age

Abstract

The problem of matching two images of the same objects but after movements or slight deformations arises in medical imaging, but also in the microscopic analysis of physical or biological structures. We present a new matching strategy consisting of two steps. We consider the grey level function (modulo a normalization) as a probability density function. First, we apply a density based clustering method in order to obtain a tree or more generally a hierarchy which classifies the points on which the grey level function is defined. Secondly, we use the identification of the hierarchical representation of the two images to guide the image matching or to define a distance between the images for object recognition. The transformation invariance properties of the representations, that we will demonstrate, permit to extract invariant image points. But in addition, using the identification of the hierarchical structures, they permit also to find the correspondence between invariant points even if these have moved locally. Finally, we mention possibilities to construct hierarchies which integrate more geometrical information. The method’s results on real images will be discussed.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • BARROW, H.G. and POPPELESTONE, R.J. (1971): Relational Descriptions in Picture Processing. Machine Intelligence, 6, 377–396.

    Google Scholar 

  • BARTHELEMY, J.-P. and GUENOCHE, A. (1988): Les arbres et les reprĂ©sentations des proximitĂ©s. Masson, Paris.

    Google Scholar 

  • CANNY, J. (1986): A computional approach to edge detection. IEEE Trans. PAMI, 8, 679–698.

    Article  Google Scholar 

  • DEMONGEOT, J. and JACOB, C. (1990): Confiners, Stochastic Equivalents of Attractors. In: Tautu, P. (Ed.): Workshop on Stochastic Modelling in Biology in Heidelberg, 1988, World Scientific, Singapore, 309–327.

    Google Scholar 

  • FARRIS, J. S. (1969): A successive approximations approach to character weighting. J. Syst. Zool., 18, 374–385.

    Article  Google Scholar 

  • GAAL, S.A. (1964): Point set topology. Academic Press, New York.

    Google Scholar 

  • HARTIGAN, J.A. (1975): Clustering algorithms. Wiley, New York.

    Google Scholar 

  • HARTIGAN, J.A. (1985): Statistical theory in clustering. J. of Classification, 2, 63–76.

    Article  Google Scholar 

  • LAVALLEE, S., CINQUIN, P. and TROCCAZ. J. (1997): Computer integrated surgery and therapy: State of the art. In: ROUX, C., COATRIEUX, J.-L. (Eds.): Contemporary Perspectives in Three–Dimensional Biomedical Imaging, IOS Press, Amsterdam, 239–311.

    Google Scholar 

  • LEU, J.G. and HUANG, I.N. (1988): Planar shape matching based on binary tree shape representation. Pattern Recognition, 21, 607–622.

    Article  Google Scholar 

  • LU, S.-Y. (1979): A tree-to-tree distance and its application to cluster analysis. IEEE Trans. PAMI, 1, 210–224.

    Google Scholar 

  • MONGA, O., BENAYOUN, S. and AYACHE, N. (1992): From partial derivatives of 3D density images to ridge lines. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR’92). Champaign, Illinois, 354–359.

    Google Scholar 

  • NOLAN, D. (1991): The excess-mass ellipsoid. J. Multivariate Anal., 39, 348–371.

    Google Scholar 

  • PAVLIDIS, T. (1968): Analysis of set patterns. Pattern Recognition, 1.

    Article  Google Scholar 

  • RASTALL, J.S. (1969): Graph family matching. Research Memorandum, MIPR-62. Departement of Machine Intelligence and Perception Edinburgh.

    Google Scholar 

  • SHASHA, D., WANG, J.T.-L., ZHANG, K. and SHIH, F.Y. (1994): Exact and approximate algorithms for unordered tree matching. Pattern Recognition, 1.

    Google Scholar 

  • SILVERMAN, B.W. (1986): Density estimation for statistics and data analysis. Chapman and Hall, London.

    Google Scholar 

  • THIRION, J.-P. (1996): New feature points based on geometric invariants for 3D image registration. International Journal of Computer Vision, 18, 121–137.

    Google Scholar 

  • WISHART, D. (1969): Mode analysis: A generalization of the nearest neighbor which reduces chaining effects. In: COLE, A.J. (Ed.): Numerical Taxonomy. Academic Press, London, 282–319.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Mattes, J., Demongeot, J. (1999). Dynamic Confinement, Classification, and Imaging. In: Gaul, W., Locarek-Junge, H. (eds) Classification in the Information Age. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60187-3_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-60187-3_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65855-9

  • Online ISBN: 978-3-642-60187-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics