2012
DOI: 10.1007/978-3-642-33418-4_21
|View full text |Cite
|
Sign up to set email alerts
|

Automated Diffeomorphic Registration of Anatomical Structures with Rigid Parts: Application to Dynamic Cervical MRI

Abstract: Abstract. We propose an iterative two-step method to compute a diffeomorphic non-rigid transformation between images of anatomical structures with rigid parts, without any user intervention or prior knowledge on the image intensities. First we compute spatially sparse, locally optimal rigid transformations between the two images using a new block matching strategy and an efficient numerical optimiser (BOBYQA). Then we derive a dense, regularised velocity field based on these local transformations using matrix … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
4
3

Relationship

4
3

Authors

Journals

citations
Cited by 21 publications
(29 citation statements)
references
References 15 publications
(24 reference statements)
0
29
0
Order By: Relevance
“…However, one of the primary motivations for this work was to demonstrate that typical approaches, which are often highly successful on oft-studied structures (e.g., the brain), are problematic when applied to new, highly difficult structures (i.e., structures exhibiting large imaging and anatomical variability). As a result, reasonable segmentation of the spinal cord’s internal structures through 3-D deformable registrations often require (1) a priori structural information, (2) a highly-tuned application-specific registration framework – e.g.,(Commowick et al, 2012b), or (3) a multi-contrast cost function (e.g., using Tl- and T2*-weighted images). Additionally, and potentially most importantly, pairwise 3-D non-rigid registration algorithms can often take upwards of an hour to perform each individual registration on a modern cpu.…”
Section: Discussionmentioning
confidence: 99%
“…However, one of the primary motivations for this work was to demonstrate that typical approaches, which are often highly successful on oft-studied structures (e.g., the brain), are problematic when applied to new, highly difficult structures (i.e., structures exhibiting large imaging and anatomical variability). As a result, reasonable segmentation of the spinal cord’s internal structures through 3-D deformable registrations often require (1) a priori structural information, (2) a highly-tuned application-specific registration framework – e.g.,(Commowick et al, 2012b), or (3) a multi-contrast cost function (e.g., using Tl- and T2*-weighted images). Additionally, and potentially most importantly, pairwise 3-D non-rigid registration algorithms can often take upwards of an hour to perform each individual registration on a modern cpu.…”
Section: Discussionmentioning
confidence: 99%
“…We adapt this approach to a block-matching algorithm [23], [24] by constraining the transformation to be aligned with the PED as assumed in the distortion model. The block-matching algorithm enables a simple and effective incorporation of this constraint on the deformation field.…”
Section: B Block-matching For Distortion Correctionmentioning
confidence: 99%
“…This extrapolation aims at computing a dense field of transformation logarithmsR .,i (i = 1, ..., M representing each voxel) from the sparse .,j . This is performed utilizing an Msmoothing algorithm in the log-Euclidean space on affine transformations [30] as proposed in [24]:…”
Section: Transformation Extrapolation and Compositionmentioning
confidence: 99%
See 2 more Smart Citations