Fast FEM-Based Non-Rigid Registration

K. Popuri, Dana Cobzas, Martin Jägersand
{"title":"Fast FEM-Based Non-Rigid Registration","authors":"K. Popuri, Dana Cobzas, Martin Jägersand","doi":"10.1109/CRV.2010.56","DOIUrl":null,"url":null,"abstract":"In this paper, we present a fast and accurate implementation of the diffusion-based non-rigid registration algorithm. Traditionally, finite differences are used to implement registration algorithms due to their ease of implementation. However, finite differences are sensitive to noise, and they have a narrow numerical stability range. Further, finite differences employ a uniform grid. This is often not desirable in the case of registration, as finer resolution is needed to capture the displacement field in regions that have a high number of image features, as opposed to homogeneous regions with fewer features. On the other hand, the less explored Finite Element Methods are ideal for the non-rigid registration task, as they use a non-uniform discretization of the image domain, placing points based on the local image-feature information. We present such an FEM-based implementation of a popular diffusion-based registration algorithm~\\cite{stefanescu04}. Originally, this algorithm was implemented using finite differences. Experimentally, we show that our implementation is much faster than the corresponding finite difference implementation, and that it achieves this In this paper, we present a fast and accurate implementation of the diffusion-based non-rigid registration algorithm. Traditionally, finite differences are used to implement registration algorithms due to their ease of implementation. However, finite differences are sensitive to noise, and they have a narrow numerical stability range. Further, finite differences employ a uniform grid. This is often not desirable in the case of registration, as finer resolution is needed to capture the displacement field in regions that have a high number of image features, as opposed to homogeneous regions with fewer features. On the other hand, the less explored Finite Element Methods are ideal for the non-rigid registration task, as they use a non-uniform discretization of the image domain, placing points based on the local image-feature information. We present such an FEM-based implementation of a popular diffusion-based registration algorithm [8]. Originally, this algorithm was implemented using finite differences. Experimentally, we show that our implementation is much faster than the corresponding finite difference implementation, and that it achieves this computational speed without compromising the accuracy of the non-rigid registration results. computational speed without compromising the accuracy of the non-rigid registration results. [8] R. Stefanescu, X. Pennec, and N. Ayache, \"Grid powered nonlinear image registration with locally adaptive regularization\", Medical Image Analysis, 8(3):325–342, 2004.","PeriodicalId":358821,"journal":{"name":"2010 Canadian Conference on Computer and Robot Vision","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Canadian Conference on Computer and Robot Vision","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CRV.2010.56","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

In this paper, we present a fast and accurate implementation of the diffusion-based non-rigid registration algorithm. Traditionally, finite differences are used to implement registration algorithms due to their ease of implementation. However, finite differences are sensitive to noise, and they have a narrow numerical stability range. Further, finite differences employ a uniform grid. This is often not desirable in the case of registration, as finer resolution is needed to capture the displacement field in regions that have a high number of image features, as opposed to homogeneous regions with fewer features. On the other hand, the less explored Finite Element Methods are ideal for the non-rigid registration task, as they use a non-uniform discretization of the image domain, placing points based on the local image-feature information. We present such an FEM-based implementation of a popular diffusion-based registration algorithm~\cite{stefanescu04}. Originally, this algorithm was implemented using finite differences. Experimentally, we show that our implementation is much faster than the corresponding finite difference implementation, and that it achieves this In this paper, we present a fast and accurate implementation of the diffusion-based non-rigid registration algorithm. Traditionally, finite differences are used to implement registration algorithms due to their ease of implementation. However, finite differences are sensitive to noise, and they have a narrow numerical stability range. Further, finite differences employ a uniform grid. This is often not desirable in the case of registration, as finer resolution is needed to capture the displacement field in regions that have a high number of image features, as opposed to homogeneous regions with fewer features. On the other hand, the less explored Finite Element Methods are ideal for the non-rigid registration task, as they use a non-uniform discretization of the image domain, placing points based on the local image-feature information. We present such an FEM-based implementation of a popular diffusion-based registration algorithm [8]. Originally, this algorithm was implemented using finite differences. Experimentally, we show that our implementation is much faster than the corresponding finite difference implementation, and that it achieves this computational speed without compromising the accuracy of the non-rigid registration results. computational speed without compromising the accuracy of the non-rigid registration results. [8] R. Stefanescu, X. Pennec, and N. Ayache, "Grid powered nonlinear image registration with locally adaptive regularization", Medical Image Analysis, 8(3):325–342, 2004.
基于快速有限元法的非刚性配准
本文提出了一种快速准确的基于扩散的非刚性配准算法。传统上,有限差分被用来实现配准算法,因为它们易于实现。然而,有限差分对噪声很敏感,且数值稳定范围窄。此外,有限差分采用均匀网格。在配准的情况下,这通常是不可取的,因为需要更精细的分辨率来捕获具有大量图像特征的区域的位移场,而不是具有较少特征的均匀区域。另一方面,较少探索的有限元方法对于非刚性配准任务是理想的,因为它们使用图像域的非均匀离散化,根据局部图像特征信息放置点。我们提出了一种流行的基于扩散的配准算法\cite{stefanescu04}的基于fem的实现。最初,该算法是使用有限差分来实现的。实验表明,我们的实现比相应的有限差分实现要快得多,并且实现了这一目标。在本文中,我们提出了一种快速准确的基于扩散的非刚性配准算法。传统上,有限差分被用来实现配准算法,因为它们易于实现。然而,有限差分对噪声很敏感,且数值稳定范围窄。此外,有限差分采用均匀网格。在配准的情况下,这通常是不可取的,因为需要更精细的分辨率来捕获具有大量图像特征的区域的位移场,而不是具有较少特征的均匀区域。另一方面,较少探索的有限元方法对于非刚性配准任务是理想的,因为它们使用图像域的非均匀离散化,根据局部图像特征信息放置点。我们提出了一种流行的基于扩散的配准算法的基于fem的实现[8]。最初,该算法是使用有限差分来实现的。实验表明,我们的实现比相应的有限差分实现要快得多,并且在不影响非刚性配准结果精度的情况下达到了这种计算速度。计算速度快,但不影响非刚性配准结果的准确性。[8]张建军,张建军,张建军,等。基于网格的非线性图像配准方法研究[j] .中国图象科学与技术,2016,33(3):334 - 344。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信