0


用不规则图金字塔计算图像的同源群生成器

Computing Homology Group Generators of Images Using Irregular Graph Pyramids
课程网址: http://videolectures.net/gbr07_peltier_chgg/  
主讲教师: Samuel Peltier
开课单位: 维也纳技术大学
开课时间: 2007-07-12
课程语种: 英语
中文简介:
我们介绍了一种使用分层结构(即不规则图形金字塔)计算2D图像的同源组及其生成器的方法。从图像开始,通过两个保持每个区域的同源性的操作构建图像的层次结构。我们首先通过图金字塔减少单元格的数量,而不是在实体(单元格)数量很大的基础中计算同源生成器。然后在金字塔的顶层有效地计算同源发生器,因为单元的数量很小,然后使用自上而下的过程来推导金字塔的任何级别中的同源发生器,包括基级,即初始图像。我们证明了新方法产生了有效的同源发生器并提出了一些实验结果。
课程简介: 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.
关 键 词: 分层结构; 2D图像; 生成器
课程来源: 视频讲座网
最后编审: 2019-04-16:lxf
阅读次数: 96