环形信念传播的稀疏更新:大状态空间的快速密集配准

Pengdong Xiao, N. Barnes, P. Lieby, T. Caetano
{"title":"环形信念传播的稀疏更新:大状态空间的快速密集配准","authors":"Pengdong Xiao, N. Barnes, P. Lieby, T. Caetano","doi":"10.1109/DICTA.2010.97","DOIUrl":null,"url":null,"abstract":"A dense point-based registration is an ideal starting point for detailed comparison between two neuroanatomical objects. This paper presents a new algorithm for global dense point-based registration between anatomical objects without assumptions about their shape. We represent mesh models of the surfaces of two similar 3D anatomical objects using a Markov Random Field and seek correspondence pairs between points in each shape. However, for densely sampled objects the set of possible point by point correspondences is very large. We solve the global non-rigid matching problem between the two objects in an efficient manner by applying loopy belief propagation. Typically loopy belief propagation is of order m^3 for each iteration, where m is the number of nodes in a mesh. By avoiding computation of probabilities of configurations that cannot occur in practice, we reduce this to order m^2. We demonstrate the method and its performance by registering hippocampi from a population of individuals aged 60-69. We find a corresponding rigid registration, and compare the results to a state-of-the-art technique and show comparable accuracy. Our method provides a global registration without prior information about alignment, and handles arbitrary shapes of spherical topology.","PeriodicalId":246460,"journal":{"name":"2010 International Conference on Digital Image Computing: Techniques and Applications","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Sparse Update for Loopy Belief Propagation: Fast Dense Registration for Large State Spaces\",\"authors\":\"Pengdong Xiao, N. Barnes, P. Lieby, T. Caetano\",\"doi\":\"10.1109/DICTA.2010.97\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A dense point-based registration is an ideal starting point for detailed comparison between two neuroanatomical objects. This paper presents a new algorithm for global dense point-based registration between anatomical objects without assumptions about their shape. We represent mesh models of the surfaces of two similar 3D anatomical objects using a Markov Random Field and seek correspondence pairs between points in each shape. However, for densely sampled objects the set of possible point by point correspondences is very large. We solve the global non-rigid matching problem between the two objects in an efficient manner by applying loopy belief propagation. Typically loopy belief propagation is of order m^3 for each iteration, where m is the number of nodes in a mesh. By avoiding computation of probabilities of configurations that cannot occur in practice, we reduce this to order m^2. We demonstrate the method and its performance by registering hippocampi from a population of individuals aged 60-69. We find a corresponding rigid registration, and compare the results to a state-of-the-art technique and show comparable accuracy. Our method provides a global registration without prior information about alignment, and handles arbitrary shapes of spherical topology.\",\"PeriodicalId\":246460,\"journal\":{\"name\":\"2010 International Conference on Digital Image Computing: Techniques and Applications\",\"volume\":\"84 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Digital Image Computing: Techniques and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DICTA.2010.97\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Digital Image Computing: Techniques and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DICTA.2010.97","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

密集的基于点的配准是两个神经解剖对象之间详细比较的理想起点。提出了一种不考虑物体形状的全局密集点配准算法。我们使用马尔可夫随机场表示两个相似的三维解剖物体表面的网格模型,并在每个形状中寻找点之间的对应对。然而,对于密集采样的对象,可能的点对点对应的集合非常大。采用循环信念传播的方法,有效地解决了两目标间的全局非刚性匹配问题。典型的循环信念传播是每次迭代的m^3阶,其中m是网格中的节点数。为了避免在实际中不可能出现的配置概率的计算,我们将其降低到m^2阶。我们通过登记来自60-69岁人群的海马来证明该方法及其性能。我们找到了相应的刚性配准,并将结果与最先进的技术进行比较,并显示出相当的准确性。我们的方法提供了一种全局配准,不需要预先的对准信息,并且可以处理任意形状的球面拓扑。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Sparse Update for Loopy Belief Propagation: Fast Dense Registration for Large State Spaces
A dense point-based registration is an ideal starting point for detailed comparison between two neuroanatomical objects. This paper presents a new algorithm for global dense point-based registration between anatomical objects without assumptions about their shape. We represent mesh models of the surfaces of two similar 3D anatomical objects using a Markov Random Field and seek correspondence pairs between points in each shape. However, for densely sampled objects the set of possible point by point correspondences is very large. We solve the global non-rigid matching problem between the two objects in an efficient manner by applying loopy belief propagation. Typically loopy belief propagation is of order m^3 for each iteration, where m is the number of nodes in a mesh. By avoiding computation of probabilities of configurations that cannot occur in practice, we reduce this to order m^2. We demonstrate the method and its performance by registering hippocampi from a population of individuals aged 60-69. We find a corresponding rigid registration, and compare the results to a state-of-the-art technique and show comparable accuracy. Our method provides a global registration without prior information about alignment, and handles arbitrary shapes of spherical topology.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信