The Euler-Lagrange equation for interpolating sequence of landmark datasets

Mirza Faisal Beg; Michael Miller; Alain Trouvé; Laurent Younes

doi:10.1007/978-3-540-39903-2_112

The Euler-Lagrange equation for interpolating sequence of landmark datasets

Mirza Faisal Beg, Michael Miller, Alain Trouvé, Laurent Younes

Research output: Contribution to journal › Conference article › peer-review

Abstract

Non-rigid registration of landmarked datasets is an important problem that finds many applications in medical image analysis. In this paper, we present a method for interpolating a sequence of landmarks. The sequence of landmarks may be a model of growth, where anatomical object boundaries are parametrized by landmarks and the growth processes generate a landmarked sequence in time. In a variational optimization framework, the matching diffeomorphism for this problem is generated from a gradient algorithm based on the Euler-Lagrange equation of a cost framed in the inexact matching setting.

Original language	English (US)
Pages (from-to)	918-925
Number of pages	8
Journal	Lecture Notes in Computer Science
Volume	2879
Issue number	PART 2
DOIs	https://doi.org/10.1007/978-3-540-39903-2_112
State	Published - 2003
Externally published	Yes
Event	Medical Image Computing and Computer-Assisted Intervention, MICCAI 2003 - 6th International Conference Proceedings - Montreal, Que., Canada Duration: Nov 15 2003 → Nov 18 2003

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-540-39903-2_112

Cite this

@article{e58c52c0519347d5bb796433bdedd807,

title = "The Euler-Lagrange equation for interpolating sequence of landmark datasets",

abstract = "Non-rigid registration of landmarked datasets is an important problem that finds many applications in medical image analysis. In this paper, we present a method for interpolating a sequence of landmarks. The sequence of landmarks may be a model of growth, where anatomical object boundaries are parametrized by landmarks and the growth processes generate a landmarked sequence in time. In a variational optimization framework, the matching diffeomorphism for this problem is generated from a gradient algorithm based on the Euler-Lagrange equation of a cost framed in the inexact matching setting.",

author = "Beg, {Mirza Faisal} and Michael Miller and Alain Trouv{\'e} and Laurent Younes",

year = "2003",

doi = "10.1007/978-3-540-39903-2_112",

language = "English (US)",

volume = "2879",

pages = "918--925",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Verlag",

number = "PART 2",

note = "Medical Image Computing and Computer-Assisted Intervention, MICCAI 2003 - 6th International Conference Proceedings ; Conference date: 15-11-2003 Through 18-11-2003",

}

TY - JOUR

T1 - The Euler-Lagrange equation for interpolating sequence of landmark datasets

AU - Beg, Mirza Faisal

AU - Miller, Michael

AU - Trouvé, Alain

AU - Younes, Laurent

PY - 2003

Y1 - 2003

N2 - Non-rigid registration of landmarked datasets is an important problem that finds many applications in medical image analysis. In this paper, we present a method for interpolating a sequence of landmarks. The sequence of landmarks may be a model of growth, where anatomical object boundaries are parametrized by landmarks and the growth processes generate a landmarked sequence in time. In a variational optimization framework, the matching diffeomorphism for this problem is generated from a gradient algorithm based on the Euler-Lagrange equation of a cost framed in the inexact matching setting.

AB - Non-rigid registration of landmarked datasets is an important problem that finds many applications in medical image analysis. In this paper, we present a method for interpolating a sequence of landmarks. The sequence of landmarks may be a model of growth, where anatomical object boundaries are parametrized by landmarks and the growth processes generate a landmarked sequence in time. In a variational optimization framework, the matching diffeomorphism for this problem is generated from a gradient algorithm based on the Euler-Lagrange equation of a cost framed in the inexact matching setting.

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

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

U2 - 10.1007/978-3-540-39903-2_112

DO - 10.1007/978-3-540-39903-2_112

M3 - Conference article

AN - SCOPUS:11244348936

SN - 0302-9743

VL - 2879

SP - 918

EP - 925

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

IS - PART 2

T2 - Medical Image Computing and Computer-Assisted Intervention, MICCAI 2003 - 6th International Conference Proceedings

Y2 - 15 November 2003 through 18 November 2003

ER -

The Euler-Lagrange equation for interpolating sequence of landmark datasets

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this