2008
DOI: 10.1016/j.media.2008.01.002
|View full text |Cite
|
Sign up to set email alerts
|

An efficient locally affine framework for the smooth registration of anatomical structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
54
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 60 publications
(54 citation statements)
references
References 39 publications
0
54
0
Order By: Relevance
“…Polyaffine transformations were introduced in Arsigny et al (2005) to fuse locally rigid and affine transformations into a diffeomorphism, and revisited in Arsigny et al (2009) to obtain faster numerical algorithms. An efficient registration algorithm using approximations of polyaffine transformations was presented in Commowick et al (2008). In Martín-Fernández et al (2009) an extension to articulated structures was presented, which considers weights (defining the influence of each region) fixed at landmark positions along a manually defined skeleton.…”
Section: Methodological Frameworkmentioning
confidence: 99%
See 1 more Smart Citation
“…Polyaffine transformations were introduced in Arsigny et al (2005) to fuse locally rigid and affine transformations into a diffeomorphism, and revisited in Arsigny et al (2009) to obtain faster numerical algorithms. An efficient registration algorithm using approximations of polyaffine transformations was presented in Commowick et al (2008). In Martín-Fernández et al (2009) an extension to articulated structures was presented, which considers weights (defining the influence of each region) fixed at landmark positions along a manually defined skeleton.…”
Section: Methodological Frameworkmentioning
confidence: 99%
“…In practice, this results in computations of these logarithms via matrix logarithms. The practical relevance of this theoretical reformulation of the problem was exploited in Commowick et al (2008). In a first step, block-matching was used to estimate each affine transformation for a predefined region.…”
Section: Projection Of Stationary Velocity Fields Onto the Linear Spamentioning
confidence: 99%
“…Registration using locally affine transformations is an attractive registration alternative for applications where a single global affine transformation cannot provide enough accuracy, while a nonrigid registration would incorrectly affect the local topology due to the large shape variability of the heart anatomy [23]- [26]. An affine transformation is also challenged to provide a good initialization of substructures of the heart for a nonrigid registration with high degrees of freedom (DOFs).…”
Section: A Larm: Locally Affine Registration Methodsmentioning
confidence: 99%
“…In t r from one coor mation matrice es, so that lines nsional compu tient registratio e image with th registration of cquisitions, wit key aspects on d [2] . In particul urgical instrum ng them (see Fi [8,9] and smart are potentially u intelligence ha for different p mage fusion be ent rigid regist uation works ha d because of th stration algorit CT to MRI) [16] natomy placed o d. In general, u of applications s been reporte tion in space an ra-operative ra ue is represente n the early futu ugmented reality the first case, th rdinates system s for 3D to 3D s are mapped to ted tomograph on the goal is to he correspondi f virtual pre-op th real intra-op which effectiv ar, the registra ments) allows igure 1) [3][4][5][6][7] , s mechatronics d useful in terms ave been devel positioning of t etween the sour tration is used ave been perfo he not-rigid nat thms produce g . Their applica on the surgical using intra-ope s that do not req d by Hawkes e nd also in time, adiological sca ed by the low a ure at least for system at work J he distance bet m to another.…”
Section: Introductionmentioning
confidence: 99%