Directly computing the generators of image homology using graph pyramids

作     者：Peltier, Samuel Ion, Adrian Kropatsch, Walter G. Damiand, Guillaume Haxhimusa, Yll 

作者机构：Vienna Univ Technol Pattern Recognit & Image Proc Grp Fac Informat A-1040 Vienna Austria Univ Lyon CNRS LIRIS UMR5205 F-69622 Villeurbanne France Purdue Univ Dept Psychol Sci W Lafayette IN 47907 USA 

出 版 物：《IMAGE AND VISION COMPUTING》 (Image Vision Comput)

年 卷 期：2009年第27卷第7期

页      面：846-853页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 0702[理学-物理学] 

基　　金：Air Force Office of Scientific Research, AFOSR Austrian Science Fund, FWF, (P18716-N13, S9103-N04) 

主　　题：Homology generators 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. 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. The produced generators fit on the object boundaries. A unique set of generators called the minimal set, is defined and its computation is discussed. We show that the new method produces valid homology generators and present some experimental results. (C) 2008 Elsevier B.V. All rights reserved.