Invariant representative cocycles of cohomology generators using irregular graph pyramids

  • Authors:
  • Rocio Gonzalez-Diaz;Adrian Ion;Mabel Iglesias-Ham;Walter G. Kropatsch

  • Affiliations:
  • Applied Math Department, School of Computer Engineering, University of Seville, Reina Mercedes Avenue, CP: 41012 Seville, Spain;Pattern Recognition and Image Processing Group, Vienna University of Technology, Faculty of Informatics, Institute of Computer Aided Automation, Favoritenstr. 9/1832, A-1040 Vienna, Austria and In ...;Pattern Recognition and Image Processing Group, Vienna University of Technology, Faculty of Informatics, Institute of Computer Aided Automation, Favoritenstr. 9/1832, A-1040 Vienna, Austria and Pa ...;Pattern Recognition and Image Processing Group, Vienna University of Technology, Faculty of Informatics, Institute of Computer Aided Automation, Favoritenstr. 9/1832, A-1040 Vienna, Austria

  • Venue:
  • Computer Vision and Image Understanding
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide more refined algebraic invariants to a topological space than does homology. It assigns 'quantities' to the chains used in homology to characterize holes of any dimension. Graph pyramids can be used to describe subdivisions of the same object at multiple levels of detail. This paper presents cohomology in the context of structural pattern recognition and introduces an algorithm to efficiently compute representative cocycles (the basic elements of cohomology) in 2D using a graph pyramid. An extension to obtain scanning and rotation invariant cocycles is given.