Computing Homology Group Generators of Images Using Irregular Graph Pyramids

We introduce a method for computing homology groups and their generators of a 2D image, using a hierarchical structure i.e. irregular graph pyramid. Starting from an image, a hierarchy of the image is built, by two operations that preserve homology of each region. Instead of computing homology generators in the base where the number of entities (cells) is large, we first reduce the number of cells by a graph pyramid. Then homology generators are computed efficiently on the top level of the pyramid, since the number of cells is small, and a top down process is then used to deduce homology generators in any level of the pyramid, including the base level i.e. the initial image. We show that the new method produces valid homology generators and present some experimental results.

• Type: Conference
• Year: 2007
• Where: GBRPR
• Authors: Samuel Peltier, Adrian Ion, Yll Haxhimusa, Walter G. Kropatsch, Guillaume Damiand
• Keywords: GBRPR 2007, Graph Pyramid, Homology Generators, Homology Groups