首页> 外文会议>Conference on Mobile Multimedia/Image Processing, Security, and Applications >Persistent Homology features and multiple topologies for image analysis
【24h】

Persistent Homology features and multiple topologies for image analysis

机译:持久同源性功能和用于图像分析的多种拓扑

获取原文

摘要

Analysis of point cloud records, in any dimension, have been shown to benefit from analysing the topological invariants of simplicial (or cell) complex shapes obtained with these points as vertices. This approach is based on rapid advances in computational algebraic topology that underpin the Topological Data Analysis (TDA) innovative paradigm. Simplicial complexes (SCs) of a given point cloud are constructed by connecting vertices to their next nearest neighbours and gluing to the interiors of real k-simplexes (k>2) to each set of pairwise connected (k+1) vertices. This process is often done iteratively, in terms of an increasing sequence of distance thresholds, to generate a nested sequence of SCs. The Persistent Homology (PH) of such nested sequence of SCs records the lifespan of the homology invariants (No. of connected components, 2D holes, 3D tunnels, etc.) over the sequence of thresholds. Despite numerous success stories of TDA and its PH tool for computer vision and image classification, its deployment is lagging well behind the exponentially growing Deep Learning Convolutional Neural Networks (CNN) schemes. Excessive computational cost of extracting PH features beyond small size images, is widely reported as a major contributor to this shortcoming of TDA. Many methods have been proposed to mitigate this problem but only modestly for large size images, due to the way images are represented by very large point clouds rather than the computational cost of PH extractions. We shall propose an innovative approach of representing images by point clouds consisting of small sets of texture image landmarks, and thereby create a large number of efficiently extractible PH features for image analysis. We shall demonstrate the success of this approach for different image classification tasks as case studies.
机译:已经显示,从任何角度对点云记录进行分析都受益于分析以这些点为顶点而获得的简单(或单元)复杂形状的拓扑不变量。这种方法基于计算代数拓扑的快速发展,这些发展为拓扑数据分析(TDA)创新范例奠定了基础。给定点云的单纯复形(SC)是通过将顶点连接到它们的下一个最近邻点并将胶粘到实数k个单纯形的内部(k> 2)到每对成对连接的(k + 1)个顶点的集合而构造的。就增加距离阈值序列而言,此过程通常是迭代进行的,以生成嵌套的SC序列。这种嵌套的SC序列的Persistent Homology(PH)记录阈值序列上同源不变性(连接组件的数量,2D孔,3D隧道等)的寿命。尽管TDA及其用于计算机视觉和图像分类的PH工具取得了许多成功的故事,但它的部署仍远远落后于指数级增长的深度学习卷积神经网络(CNN)方案。据广泛报道,提取超出小尺寸图像的PH特征的计算成本过高,是导致TDA缺陷的主要原因。已经提出了许多方法来减轻这个问题,但是对于大尺寸的图像仅适度地解决,这是由于图像由非常大的点云表示的方式而不是PH提取的计算成本。我们将提出一种创新的方法,通过由少量纹理图像地标组成的点云来表示图像,从而创建大量可有效提取的PH特征以进行图像分析。我们将通过案例研究证明这种方法对于不同的图像分类任务的成功。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号