Advertisement

Receptive Fields within the Combinatorial Pyramid Framework

  • Luc Brun
  • Walter G. Kropatsch
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2301)

Abstract

A hierarchical structure is a stack of successively reduced image representations. Each basic element of a hierarchical structure is the father of a set of elements in the level below. The transitive closure of this father-child relationship associates to each element of the hierarchy a set of basic elements in the base level image representation. Such a set, called a receptive field, defines the embedding of one element of the hierarchy on the original image. Using the father-child relationship, global properties of a receptive field may be computed in O(log(m)) parallel processing steps where m is the diameter of the receptive field. Combinatorial pyramids are defined as a stack of successively reduced combinatorial maps, each combinatorial map being defined by two permutations acting on a set of half edges named darts. The basic element of a combinatorial pyramid is thus the dart. This paper defines the receptive field of each dart within a combinatorial pyramid and study the main properties of these sets.

Keywords

Receptive Field Construction Scheme Double Edge Contraction Operation Adjacency Relationship 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    E. Ahronovitz, J. Aubert, and C. Fiorio. The star-topology: a topology for image analysis. In 5th DGCI Proceedings, pages 107–116, 1995.Google Scholar
  2. [2]
    Y. Bertrand, G. Damiand, and C. Fiorio. Topological map: Minimal encoding of 3d segmented images. In J. M. Jolion, W. Kropatsch, and M. Vento, editors, 3rd Workshop on Graph-based Representations in Pattern Recognition, pages 64–73, Ischia(Italy), May 2001. IAPR-TC15, CUEN.Google Scholar
  3. [3]
    Y. Bertrand and J. Dufourd. Algebraic specification of a 3D-modeler based on hypermaps. CVGIP: Graphical Models and Image Processing, 56(1):29–60, Jan. 1994.CrossRefGoogle Scholar
  4. [4]
    M. Bister, J. Cornelis, and A. Rosenfeld. A critical view of pyramid segmentation algorithms. Pattern Recognit Letter., 11(9):605–617, Sept. 1990.zbMATHCrossRefGoogle Scholar
  5. [5]
    J. P. Braquelaire and L. Brun. Image segmentation with topological maps and inter-pixel representation. Journal of Visual Communication and Image representation, 9(1), 1998.Google Scholar
  6. [6]
    J. P. Braquelaire, P. Desbarats, and J. P. Domenger. 3d split and merge with 3-maps. In J. M. Jolion, W. Kropatsch, and M. Vento, editors, 3rd Workshop on Graph-based Representations in Pattern Recognition, pages 32–43, Ischia(Italy), May 2001. IAPR-TC15, CUEN.Google Scholar
  7. [7]
    L. Brun and W. Kropatsch. Pyramids with combinatorial maps. Technical Report PRIP-TR-057, PRIP, TU Wien, 1999.Google Scholar
  8. [8]
    L. Brun and W. Kropatsch. The construction of pyramids with combinatorial maps. Technical Report 63, Institute of Computer Aided Design, Vienna University of Technology, lstr. 3/1832,A-1040 Vienna AUSTRIA, June 2000.Google Scholar
  9. [9]
    L. Brun and W. Kropatsch. Contraction kernels and combinatorial maps. In J. M. Jolion, W. Kropatsch, and M. Vento, editors, 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition, pages 12–21, Ischia Italy, May 2001. IAPR-TC15, CUEN.Google Scholar
  10. [10]
    L. Brun and W. G. Kropatsch. Dual contraction of combinatorial maps. In W. G. Kropatsch and J.-M. Jolion, editors, 2nd IAPR-TC-15 Workshop on Graph-based Representations, volume 126, pages 145–154, Haindorf, Austria, May 1999. Österreichische Computer Gesellschaft.Google Scholar
  11. [11]
    P. Burt, T.-H. Hong, and A. Rosenfeld. Segmentation and estimation of image region properties through cooperative hierarchial computation. IEEE Transactions on Sustems, Man and Cybernetics, 11(12):802–809, December 1981.CrossRefGoogle Scholar
  12. [12]
    J. Edmonds. A combinatorial representation for polyhedral surfaces. Notices American Society, 7, 1960.Google Scholar
  13. [13]
    J. Jolion and A. Montanvert. The adaptative pyramid: A framework for 2d image analysis. Computer Vision, Graphics, and Image Processing, 55(3):339–348, May 1992.zbMATHGoogle Scholar
  14. [14]
    W. G. Kropatsch. Building Irregular Pyramids by Dual Graph Contraction. IEE-Proc. Vision, Image and Signal Processing, Vol. 142(No. 6):pp. 366–374, December 1995.Google Scholar
  15. [15]
    P. Lienhardt. Topological models for boundary representations: a comparison with n-dimensional generalized maps. Computer-Aided Design, 23(1):59–82, 1991.zbMATHCrossRefGoogle Scholar
  16. [16]
    P. Meer. Stochastic image pyramids. Computer Vision Graphics Image Processing, 45:269–294, 1989.CrossRefGoogle Scholar
  17. [17]
    A. Montanvert, P. Meer, and A. Rosenfeld. Hierarchical image analysis using irregular tessellations. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(4):307–316, APRIL 1991.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Luc Brun
    • 1
  • Walter G. Kropatsch
    • 2
  1. 1.Laboratoire d’Études et de Recherche en Informatique (EA 2618)Université de ReimsFrance
  2. 2.Institute for Computer-aided Automation Pattern Recognition and Image Processing GroupVienna Univ. of TechnologyAustria

Personalised recommendations