• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

使用通勤时间进行聚类和嵌入。

Clustering and embedding using commute times.

作者信息

Qiu Huaijun John, Hancock Edwin R

机构信息

Queen Mary Vision Laboratory, Department of Computer Science, Queen Mary, University of London, London, UK E1 4NS.

出版信息

IEEE Trans Pattern Anal Mach Intell. 2007 Nov;29(11):1873-90. doi: 10.1109/TPAMI.2007.1103.

DOI:10.1109/TPAMI.2007.1103
PMID:17848771
Abstract

This paper exploits the properties of the commute time between nodes of a graph for the purposes of clustering and embedding, and explores its applications to image segmentation and multi-body motion tracking. Our starting point is the lazy random walk on the graph, which is determined by the heatkernel of the graph and can be computed from the spectrum of the graph Laplacian. We characterize the random walk using the commute time (i.e. the expected time taken for a random walk to travel between two nodes and return) and show how this quantity may be computed from the Laplacian spectrum using the discrete Green's function. Our motivation is that the commute time can be anticipated to be a more robust measure of the proximity of data than the raw proximity matrix. In this paper, we explore two applications of the commute time. The first is to develop a method for image segmentation using the eigenvector corresponding to the smallest eigenvalue of the commute time matrix. We show that our commute time segmentation method has the property of enhancing the intra-group coherence while weakening inter-group coherence and is superior to the normalized cut. The second application is to develop a robust multi-body motion tracking method using an embedding based on the commute time. Our embedding procedure preserves commute time, and is closely akin to kernel PCA, the Laplacian eigenmap and the diffusion map. We illustrate the results both on synthetic image sequences and real world video sequences, and compare our results with several alternative methods.

摘要

本文利用图中节点间通勤时间的性质进行聚类和嵌入,并探索其在图像分割和多体运动跟踪中的应用。我们的出发点是图上的懒惰随机游走,它由图的热核决定,并且可以从图拉普拉斯算子的谱中计算得出。我们使用通勤时间(即随机游走在两个节点之间往返所需的预期时间)来刻画随机游走,并展示如何使用离散格林函数从拉普拉斯谱计算这个量。我们的动机是,与原始的邻近矩阵相比,通勤时间有望成为衡量数据邻近程度的更稳健的指标。在本文中,我们探索了通勤时间的两种应用。第一种是使用通勤时间矩阵最小特征值对应的特征向量开发一种图像分割方法。我们表明,我们的通勤时间分割方法具有增强组内一致性同时减弱组间一致性的性质,并且优于归一化割。第二种应用是使用基于通勤时间的嵌入开发一种稳健的多体运动跟踪方法。我们的嵌入过程保留了通勤时间,并且与核主成分分析、拉普拉斯特征映射和扩散映射密切相关。我们在合成图像序列和真实世界视频序列上展示了结果,并将我们的结果与几种替代方法进行了比较。

相似文献

1
Clustering and embedding using commute times.使用通勤时间进行聚类和嵌入。
IEEE Trans Pattern Anal Mach Intell. 2007 Nov;29(11):1873-90. doi: 10.1109/TPAMI.2007.1103.
2
Random walks for image segmentation.用于图像分割的随机游走算法
IEEE Trans Pattern Anal Mach Intell. 2006 Nov;28(11):1768-83. doi: 10.1109/TPAMI.2006.233.
3
Weighted graph cuts without eigenvectors a multilevel approach.无需特征向量的加权图割:一种多级方法。
IEEE Trans Pattern Anal Mach Intell. 2007 Nov;29(11):1944-57. doi: 10.1109/TPAMI.2007.1115.
4
Dynamic characterization of cluster structures for robust and inductive support vector clustering.用于稳健和归纳支持向量聚类的簇结构动态表征
IEEE Trans Pattern Anal Mach Intell. 2006 Nov;28(11):1869-74. doi: 10.1109/TPAMI.2006.225.
5
Graph embedding and extensions: a general framework for dimensionality reduction.图嵌入与扩展:降维的通用框架
IEEE Trans Pattern Anal Mach Intell. 2007 Jan;29(1):40-51. doi: 10.1109/TPAMI.2007.12.
6
Model-based tracking by classification in a tiny discrete pose space.在微小离散姿态空间中基于分类的模型跟踪。
IEEE Trans Pattern Anal Mach Intell. 2007 Jun;29(6):976-89. doi: 10.1109/TPAMI.2007.1088.
7
Segmentation by fusion of histogram-based k-means clusters in different color spaces.通过融合不同颜色空间中基于直方图的k均值聚类进行分割。
IEEE Trans Image Process. 2008 May;17(5):780-7. doi: 10.1109/TIP.2008.920761.
8
Pattern vectors from algebraic graph theory.来自代数图论的模式向量。
IEEE Trans Pattern Anal Mach Intell. 2005 Jul;27(7):1112-24. doi: 10.1109/TPAMI.2005.145.
9
LEGClust- a clustering algorithm based on layered entropic subgraphs.LEGClust——一种基于分层熵子图的聚类算法。
IEEE Trans Pattern Anal Mach Intell. 2008 Jan;30(1):62-75. doi: 10.1109/TPAMI.2007.1142.
10
Fast agglomerative clustering using a k-nearest neighbor graph.使用k近邻图的快速凝聚聚类
IEEE Trans Pattern Anal Mach Intell. 2006 Nov;28(11):1875-81. doi: 10.1109/TPAMI.2006.227.

引用本文的文献

1
Can a Quantum Walk Tell Which Is Which?A Study of Quantum Walk-Based Graph Similarity.量子游走能区分彼此吗?基于量子游走的图相似性研究。
Entropy (Basel). 2019 Mar 26;21(3):328. doi: 10.3390/e21030328.
2
FctClus: A Fast Clustering Algorithm for Heterogeneous Information Networks.FctClus:一种用于异构信息网络的快速聚类算法。
PLoS One. 2015 Jun 19;10(6):e0130086. doi: 10.1371/journal.pone.0130086. eCollection 2015.
3
Heat-passing framework for robust interpretation of data in networks.用于网络中数据稳健解释的传热框架。
PLoS One. 2015 Feb 10;10(2):e0116121. doi: 10.1371/journal.pone.0116121. eCollection 2015.
4
Integration of biological data by kernels on graph nodes allows prediction of new genes involved in mitotic chromosome condensation.通过图节点上的核进行生物数据整合,能够预测参与有丝分裂染色体凝聚的新基因。
Mol Biol Cell. 2014 Aug 15;25(16):2522-36. doi: 10.1091/mbc.E13-04-0221. Epub 2014 Jun 18.
5
Functional Geometry Alignment and Localization of Brain Areas.脑区的功能几何对齐与定位
Adv Neural Inf Process Syst. 2010;1:1225-1233.
6
Tree preserving embedding.树保护嵌入。
Proc Natl Acad Sci U S A. 2011 Oct 11;108(41):16916-21. doi: 10.1073/pnas.1018393108. Epub 2011 Sep 26.
7
Enriching PubMed related article search with sentence level co-citations.利用句子级共引对PubMed相关文章搜索进行优化。
AMIA Annu Symp Proc. 2009 Nov 14;2009:650-4.
8
Spectral affinity in protein networks.蛋白质网络中的光谱亲和力。
BMC Syst Biol. 2009 Nov 29;3:112. doi: 10.1186/1752-0509-3-112.
9
Graph-partitioned spatial priors for functional magnetic resonance images.功能磁共振图像的图划分空间先验
Neuroimage. 2008 Dec;43(4):694-707. doi: 10.1016/j.neuroimage.2008.08.012. Epub 2008 Aug 23.