Skip to main content

Grouping of Non-connected Structures by an Irregular Graph Pyramid

  • Conference paper
Pattern Recognition and Image Analysis (IbPRIA 2005)

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

Included in the following conference series:

  • 1589 Accesses

Abstract

Motivated by claims to ‘bridge the representational gap between image and model features’ and by the growing importance of topological properties we discuss several extensions to dual graph pyramids: structural simplification should preserve important topological properties and content abstraction could be guided by an external knowledge base. We review multilevel graph hierarchies under the special aspect of their potential for abstraction and grouping.

Supported by the Austrian Science Foundation under grant FSP-S9103-N04.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

  1. Bertrand, Y., Fiorio, C., Pennaneach, Y.: Border Map: A Topological Representation for nD Image Analysis. In: Bertrand, G., Couprie, M., Perroton, L. (eds.) DGCI 1999. LNCS, vol. 1568, pp. 242–257. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  2. Bister, M., Cornelis, J., Rosenfeld, A.: A Critical View of Pyramid Segmentation Algorithms. Pattern Recognition Letters 11(9), 605–617 (1990)

    Article  MATH  Google Scholar 

  3. Brun, L., Kropatsch, W.G.: Introduction to Combinatorial Pyramids. Dig. and Im. Geom., 108–128 (2001)

    Google Scholar 

  4. Burt, P.J., Adelson, E.H.: The Laplacian Pyramid as a Compact Image Code. IEEE Trans. on Commun. 31(4), 532–540 (1983)

    Article  Google Scholar 

  5. Crowley, J.L., Coutaz, J., Rey, G., Reignier, P.: Perceptual Components for Context Aware Computing. In: Int. Conf. on Ubiq. Comp., pp. 117–143 (2002)

    Google Scholar 

  6. Dakin, S.C., Bex, P.: Local and Global Visual Grouping: Tuning for Spatial Frequency and Contrast. J. of Vis., 99–111 (2001)

    Google Scholar 

  7. Damiand, G.: Définition et Étude d’un Modèle Topologique Minimal de Représentation D’images 2d et 3d. PhD thesis, LIRMM, Uni. de Montpellier (2001)

    Google Scholar 

  8. Hartley, R.L.: Multi–Scale Models in Image Analysis. PhD thesis, Uni. of Maryland, CSC (1984)

    Google Scholar 

  9. van Haxhimusa, Y., Kropatsch, W.G.: Hierarchy of partitions with dual graph contraction. In: Michaelis, B., Krell, G. (eds.) DAGM 2003. LNCS, vol. 2781, pp. 338–345. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  10. Jolion, J.-M., Rosenfeld, A.: A Pyramid Framework for Early Vision. Kluwer, Dordrecht (1994)

    Google Scholar 

  11. Keselman, Y., Dickinson, S.: Generic model abstraction from examples. In: CVPR, Hawaii, pp. 856–863 (2001)

    Google Scholar 

  12. Kropatsch, W.G.: Preserving Contours in Dual Pyramids. In: ICPR, pp. 563–565 (1988)

    Google Scholar 

  13. Kropatsch, W.G.: From EquivalentWeighting Functions to Equivalent Contraction Kernels. In: DIP and CG2. SPIE, vol. 3346, pp. 310–320 (1998)

    Google Scholar 

  14. Kropatsch, W.G.: Abstraction pyramids on discrete representations. In: Braquelaire, A., Lachaud, J.-O., Vialard, A. (eds.) DGCI 2002. LNCS, vol. 2301, pp. 1–21. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  15. Kropatsch, W.G., Leonardis, A., Bischof, H.: Hierarchical, Adaptive and Robust Methods for Image Understanding. Sur. on Math. for Ind. 9, 1–47 (1999)

    MATH  MathSciNet  Google Scholar 

  16. Mallat, S.G.: A Theory for Multiresolution Signal Decomposition: The Wavelet Representation. IEEE Trans. PAMI 11(7), 674–693 (1989)

    MATH  Google Scholar 

  17. Meer, P., Sher, C.A., Rosenfeld, A.: The Chain Pyramid: Hierarchical Contour Processing. IEEE Trans. PAMI 12(4), 363–376 (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kropatsch, W.G., Haxhimusa, Y. (2005). Grouping of Non-connected Structures by an Irregular Graph Pyramid. In: Marques, J.S., Pérez de la Blanca, N., Pina, P. (eds) Pattern Recognition and Image Analysis. IbPRIA 2005. Lecture Notes in Computer Science, vol 3523. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11492542_14

Download citation

  • DOI: https://doi.org/10.1007/11492542_14

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics