Delineating Homology Generators in Graph Pyramids

  • Authors:
  • Mabel Iglesias;Adrian Ion;Walter G. Kropatsch;Edel B. García

  • Affiliations:
  • Pattern Recognition Department, Advanced Technologies Application Center, Havana, Cuba and Pattern Recognition and Image Processing Group, Faculty of Informatics, Vienna University of Technology, ...;Pattern Recognition and Image Processing Group, Faculty of Informatics, Vienna University of Technology, Austria;Pattern Recognition and Image Processing Group, Faculty of Informatics, Vienna University of Technology, Austria;Pattern Recognition Department, Advanced Technologies Application Center, Havana, Cuba

  • Venue:
  • CIARP '08 Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Computation of homology generators using a graph pyramid can significantly increase performance, compared to the classical methods. First results in 2D exist and show the advantages of the method. Generators are computed on the upper level of a graph pyramid. Top-level graphs may contain self loops and multiple edges, as a side product of the contraction process. Using straight lines to draw these edges would not show the full information: self loops disappear, parallel edges collapse. This paper presents a novel algorithm for correctly visualizing graph pyramids, including multiple edges and self loops which preserves the geometry and the topology of the original image. New insights about the top-down delineation of homology generators in graph pyramids are given.