Abstract

A Pyramid: a hierarchy of Region Adjacency Graphs (RAG) has only one type of edge “to be neighbor with”. We want to add some new types of edge. The relation “to be inside” is already present as a special case of the neighborhood relation. We detail the difference between a neighborhood relation and an interior relation. Then we show that some new types of interior relations are compatible with the process of building a pyramid.

Keywords

Constraint Satisfaction Problem Dual Graph Interior Relation Neighborhood Relation Merging Process 
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.
    W. G. Kropatsch, Building Irregulars Pyramids by Dual Graph Contraction, IEE-Proc. Vis., Image and Signal Proc. Vol. 142 N∘ 6, 12/95, pp. 366–374.Google Scholar
  2. 2.
    J. P. Braquelaire, L. Brun, Image Segmentation with Topological Maps and Inter-pixel Representation, Journal of Visual Communication and Image Representation, 9, 1998, pp. 62–79.CrossRefGoogle Scholar
  3. 3.
    J.-G. Pailloncy, PhD “Contribution de la théorie des Grapohes à l’analyse d’image”, INSA de Lyon, Lyon, 01/12/1999Google Scholar
  4. 4.
    K. Shearer, H. Bunke, S. Venkatesh, D. Kieronska, Efficient Graph Matching for Video Indexing, Proc. of GbR’97, 1st IAPR Int. Workshop on Graph based Representations, Springer Verlag, Computing Suppl., 12, Lyon, France, 1998, ISBN 3-211-83121-5, pp. 53–62.Google Scholar
  5. 5.
    A. Deruyver, Y. Hodé, Constraint Satisfaction Problem with Bi-level Constraint: Application to Interpretation of Over-segmented Images, Artificial Intell., 93, 1997, pp. 321–335.MATHCrossRefGoogle Scholar
  6. 6.
    J.-G. Pailloncy, J-.M .Jolion, The Frontier-Region Graph: A topologically consistent representation for image analysis, suitable for parallel computers, Proc. of GbR’97, 1st IAPR Int. Workshop on Graph based Representations, Spring Verlag, Computing Suppl., 12, Lyon, France, 1998, ISBN 3-211-83121-5, pp. 123–134.MathSciNetGoogle Scholar
  7. 7.
    W. G. Kropatsch, Equivalent Contraction Kernels and The Domain of Dual Irregular Pyramids, Technical report PRIP-TR-42, Institute f. Automation 183/2, Dept. for Patt. Recognition and Image Proc., TU Wien, Austria, 17/12/95.Google Scholar
  8. 8.
    J.-M. Jolion, W. G. Kropatsch, Graph based Representation, Jean-Michel Jolion and Walter Kropatsch eds., Proc. of GbR’97, 1st IAPR Int. Workshop on Graph based Representations, Spring Verlag, Computing Suppl., 12, Lyon, France, ISBN 3-211-83121-5, 1998.Google Scholar
  9. 9.
    A. Deruyver, Y. Hodé, Constraint Satisfaction Problem with Bi-level Constraint: Application to Interpretation of Over-segmented Images, Artificial Intell., 93, 1997, pp. 321–335.MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Jean-Gérard Pailloncy
    • 1
  1. 1.Laboratoire LVRIUT de BourgesBourgesFrance

Personalised recommendations