Efficient large deformation registration via geodesics on a learned manifold of images.

Jihun Hamm, Christos Davatzikos, Ragini Verma

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Geodesic registration methods have been used to solve the large deformation registration problems, which are hard to solve with conventional registration methods. However, analytically defined geodesics may not coincide with anatomically optimal paths of registration. In this paper we propose a novel and efficient method for large deformation registration by learning the underlying structure of the data using a manifold learning technique. In this method a large deformation between two images is decomposed into a series of small deformations along the shortest path on the graph that approximates the metric structure of data. Furthermore, the graph representation allows us to estimate the optimal group template by minimizing geodesic distances. We demonstrate the advantages of the proposed method with synthetic 2D images and real 3D mice brain volumes.

Original languageEnglish (US)
Title of host publicationMedical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention
Pages680-687
Number of pages8
Volume12
EditionPt 1
StatePublished - 2009
Externally publishedYes

Fingerprint

Learning
Brain

ASJC Scopus subject areas

  • Medicine(all)

Cite this

Hamm, J., Davatzikos, C., & Verma, R. (2009). Efficient large deformation registration via geodesics on a learned manifold of images. In Medical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention (Pt 1 ed., Vol. 12, pp. 680-687)

Efficient large deformation registration via geodesics on a learned manifold of images. / Hamm, Jihun; Davatzikos, Christos; Verma, Ragini.

Medical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention. Vol. 12 Pt 1. ed. 2009. p. 680-687.

Research output: Chapter in Book/Report/Conference proceedingChapter

Hamm, J, Davatzikos, C & Verma, R 2009, Efficient large deformation registration via geodesics on a learned manifold of images. in Medical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention. Pt 1 edn, vol. 12, pp. 680-687.
Hamm J, Davatzikos C, Verma R. Efficient large deformation registration via geodesics on a learned manifold of images. In Medical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention. Pt 1 ed. Vol. 12. 2009. p. 680-687
Hamm, Jihun ; Davatzikos, Christos ; Verma, Ragini. / Efficient large deformation registration via geodesics on a learned manifold of images. Medical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention. Vol. 12 Pt 1. ed. 2009. pp. 680-687
@inbook{98180a88ccd042c8b90cc6f72ca79950,
title = "Efficient large deformation registration via geodesics on a learned manifold of images.",
abstract = "Geodesic registration methods have been used to solve the large deformation registration problems, which are hard to solve with conventional registration methods. However, analytically defined geodesics may not coincide with anatomically optimal paths of registration. In this paper we propose a novel and efficient method for large deformation registration by learning the underlying structure of the data using a manifold learning technique. In this method a large deformation between two images is decomposed into a series of small deformations along the shortest path on the graph that approximates the metric structure of data. Furthermore, the graph representation allows us to estimate the optimal group template by minimizing geodesic distances. We demonstrate the advantages of the proposed method with synthetic 2D images and real 3D mice brain volumes.",
author = "Jihun Hamm and Christos Davatzikos and Ragini Verma",
year = "2009",
language = "English (US)",
volume = "12",
pages = "680--687",
booktitle = "Medical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention",
edition = "Pt 1",

}

TY - CHAP

T1 - Efficient large deformation registration via geodesics on a learned manifold of images.

AU - Hamm, Jihun

AU - Davatzikos, Christos

AU - Verma, Ragini

PY - 2009

Y1 - 2009

N2 - Geodesic registration methods have been used to solve the large deformation registration problems, which are hard to solve with conventional registration methods. However, analytically defined geodesics may not coincide with anatomically optimal paths of registration. In this paper we propose a novel and efficient method for large deformation registration by learning the underlying structure of the data using a manifold learning technique. In this method a large deformation between two images is decomposed into a series of small deformations along the shortest path on the graph that approximates the metric structure of data. Furthermore, the graph representation allows us to estimate the optimal group template by minimizing geodesic distances. We demonstrate the advantages of the proposed method with synthetic 2D images and real 3D mice brain volumes.

AB - Geodesic registration methods have been used to solve the large deformation registration problems, which are hard to solve with conventional registration methods. However, analytically defined geodesics may not coincide with anatomically optimal paths of registration. In this paper we propose a novel and efficient method for large deformation registration by learning the underlying structure of the data using a manifold learning technique. In this method a large deformation between two images is decomposed into a series of small deformations along the shortest path on the graph that approximates the metric structure of data. Furthermore, the graph representation allows us to estimate the optimal group template by minimizing geodesic distances. We demonstrate the advantages of the proposed method with synthetic 2D images and real 3D mice brain volumes.

UR - http://www.scopus.com/inward/record.url?scp=79551685631&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79551685631&partnerID=8YFLogxK

M3 - Chapter

VL - 12

SP - 680

EP - 687

BT - Medical image computing and computer-assisted intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention

ER -