• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

利用移位整数格和立方体复形改进近似Rips过滤

Improved approximate rips filtrations with shifted integer lattices and cubical complexes.

作者信息

Choudhary Aruni, Kerber Michael, Raghvendra Sharath

机构信息

Institut für Informatik, Freie Universität Berlin, Berlin, Germany.

Institut für Geometrie, Technische Universität Graz, Graz, Austria.

出版信息

J Appl Comput Topol. 2021;5(3):425-458. doi: 10.1007/s41468-021-00072-4. Epub 2021 May 15.

DOI:10.1007/s41468-021-00072-4
PMID:34722862
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC8549989/
Abstract

Rips complexes are important structures for analyzing topological features of metric spaces. Unfortunately, generating these complexes is expensive because of a combinatorial explosion in the complex size. For points in , we present a scheme to construct a 2-approximation of the filtration of the Rips complex in the -norm, which extends to a -approximation in the Euclidean case. The -skeleton of the resulting approximation has a total size of . The scheme is based on the integer lattice and simplicial complexes based on the barycentric subdivision of the -cube. We extend our result to use cubical complexes in place of simplicial complexes by introducing between complexes. We get the same approximation guarantee as the simplicial case, while reducing the total size of the approximation to only (cubical) cells. There are two novel techniques that we use in this paper. The first is the use of for proving our approximation result. In our application, these are maps which relate the Rips complex and the approximation in a relatively simple manner and greatly reduce the complexity of showing the approximation guarantee. The second technique is what we refer to as , which is a simple trick to improve the approximation ratio under certain conditions.

摘要

黎普斯复形是分析度量空间拓扑特征的重要结构。不幸的是,由于复形规模的组合爆炸,生成这些复形成本高昂。对于(\mathbb{R}^d)中的点,我们提出一种方案,用于构造(\ell_p)范数下黎普斯复形过滤的2 - 近似,在欧几里得情形下可扩展为(O(\log n)) - 近似。所得近似的(k) - 骨架的总规模为(O(n^k))。该方案基于整数格以及基于(d) - 立方体重心细分的单纯复形。通过在复形之间引入(\delta),我们将结果扩展为使用立方体复形代替单纯复形。我们得到与单纯情形相同的近似保证,同时将近似的总规模减少到仅(O(n^k))(立方体)单元。本文使用了两种新技术。第一种是使用(\varphi) - 映射来证明我们的近似结果。在我们的应用中,这些映射以相对简单的方式关联黎普斯复形和近似,极大地降低了证明近似保证的复杂度。第二种技术是我们所谓的(\delta) - 技巧,这是在某些条件下提高近似比率的一个简单技巧。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a8c0/8549989/984aad0aaa82/41468_2021_72_Fig6_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a8c0/8549989/3ed1b645dd09/41468_2021_72_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a8c0/8549989/4881e9dfeb9a/41468_2021_72_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a8c0/8549989/64b3bcd4af8a/41468_2021_72_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a8c0/8549989/bb2737c6a12f/41468_2021_72_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a8c0/8549989/37ee2e3e01e6/41468_2021_72_Fig5_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a8c0/8549989/984aad0aaa82/41468_2021_72_Fig6_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a8c0/8549989/3ed1b645dd09/41468_2021_72_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a8c0/8549989/4881e9dfeb9a/41468_2021_72_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a8c0/8549989/64b3bcd4af8a/41468_2021_72_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a8c0/8549989/bb2737c6a12f/41468_2021_72_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a8c0/8549989/37ee2e3e01e6/41468_2021_72_Fig5_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/a8c0/8549989/984aad0aaa82/41468_2021_72_Fig6_HTML.jpg

相似文献

1
Improved approximate rips filtrations with shifted integer lattices and cubical complexes.利用移位整数格和立方体复形改进近似Rips过滤
J Appl Comput Topol. 2021;5(3):425-458. doi: 10.1007/s41468-021-00072-4. Epub 2021 May 15.
2
Persistent homology in graph power filtrations.图幂过滤中的持久同调
R Soc Open Sci. 2016 Oct 26;3(10):160228. doi: 10.1098/rsos.160228. eCollection 2016 Oct.
3
Barcodes of Towers and a Streaming Algorithm for Persistent Homology.塔的条形码与持久同调的流算法
Discrete Comput Geom. 2019;61(4):852-879. doi: 10.1007/s00454-018-0030-0. Epub 2018 Oct 1.
4
Object-oriented Persistent Homology.面向对象的持久同调
J Comput Phys. 2016 Jan 15;305:276-299. doi: 10.1016/j.jcp.2015.10.036.
5
New Tools and Connections for Exponential-Time Approximation.指数时间近似的新工具与联系
Algorithmica. 2019;81(10):3993-4009. doi: 10.1007/s00453-018-0512-8. Epub 2018 Sep 5.
6
On the detection of simple points in higher dimensions using cubical homology.关于使用立方体同调在高维空间中检测简单点
IEEE Trans Image Process. 2006 Aug;15(8):2462-9. doi: 10.1109/tip.2006.877309.
7
The Multi-Cover Persistence of Euclidean Balls.欧几里得球的多重覆盖持久性
Discrete Comput Geom. 2021;65(4):1296-1313. doi: 10.1007/s00454-021-00281-9. Epub 2021 Mar 31.
8
Persistent homology of tumor CT scans is associated with survival in lung cancer.肿瘤 CT 扫描的持久同调与肺癌患者的生存相关。
Med Phys. 2021 Nov;48(11):7043-7051. doi: 10.1002/mp.15255. Epub 2021 Oct 11.
9
Homological percolation and the Euler characteristic.同调渗流与欧拉示性数。
Phys Rev E. 2020 Mar;101(3-1):032304. doi: 10.1103/PhysRevE.101.032304.
10
Dory: Computation of persistence diagrams up to dimension two for Vietoris-Rips filtrations of large data sets.多莉:大数据集的Vietoris-Rips过滤的二维以内持久图的计算。
J Comput Sci. 2024 Jul;79. doi: 10.1016/j.jocs.2024.102290. Epub 2024 Apr 20.

引用本文的文献

1
Predicting Affinity Through Homology (PATH): Interpretable binding affinity prediction with persistent homology.通过同源性预测亲和力(PATH):利用持久同源性进行可解释的结合亲和力预测。
PLoS Comput Biol. 2025 Jun 27;21(6):e1013216. doi: 10.1371/journal.pcbi.1013216. eCollection 2025 Jun.
2
Visualizing radiological data bias through persistence images.通过持久性图像可视化放射学数据偏差。
Oncotarget. 2024 Nov 12;15:787-789. doi: 10.18632/oncotarget.28670.

本文引用的文献

1
Barcodes of Towers and a Streaming Algorithm for Persistent Homology.塔的条形码与持久同调的流算法
Discrete Comput Geom. 2019;61(4):852-879. doi: 10.1007/s00454-018-0030-0. Epub 2018 Oct 1.