A Super Fast Registration Algorithm

Bernd Fischer; Jan Modersitzki

doi:10.1007/978-3-642-56714-8_30

A Super Fast Registration Algorithm

Institute of Mathematics

Abstract

Image registration is an often encountered problem in digital imaging, in particular in medical imaging. In most applications simple rigid deformations are not satisfactory and complex, non-rigid and non-linear deformations must be employed. A large class of non-rigid, parameter-free, matching techniques minimizes the distance of the given images subject to a regularizing term. In this note we propose a novel scheme for automatic registration by introducing a specific regularizing term. We show that the complexity of its implementation is linear with respect to the size of the images and demonstrate its performance. Moreover, we draw a connection to Thirion's demon based approach.

Original language	English
Title of host publication	Bildverarbeitung für die Medizin 2001
Editors	Heinz Handels, Alexander Horsch, Thomas Lehmann, Hans-Peter Meinzer
Number of pages	5
Place of Publication	Berlin, Heidelberg
Publisher	Springer Berlin Heidelberg
Publication date	01.03.2001
Pages	169-173
ISBN (Print)	978-3-540-41690-6
ISBN (Electronic)	978-3-642-56714-8
DOIs	https://doi.org/10.1007/978-3-642-56714-8_30
Publication status	Published - 01.03.2001
Event	Workshop on Bildverarbeitung fur die Medizin 2001 - Lübeck, Germany Duration: 04.03.2001 → 06.03.2001

Access to Document

10.1007/978-3-642-56714-8_30

Cite this

@inproceedings{49604759b08f40d7814169b13d30b960,

title = "A Super Fast Registration Algorithm",

abstract = "Image registration is an often encountered problem in digital imaging, in particular in medical imaging. In most applications simple rigid deformations are not satisfactory and complex, non-rigid and non-linear deformations must be employed. A large class of non-rigid, parameter-free, matching techniques minimizes the distance of the given images subject to a regularizing term. In this note we propose a novel scheme for automatic registration by introducing a specific regularizing term. We show that the complexity of its implementation is linear with respect to the size of the images and demonstrate its performance. Moreover, we draw a connection to Thirion's demon based approach.",

author = "Bernd Fischer and Jan Modersitzki",

year = "2001",

month = mar,

day = "1",

doi = "10.1007/978-3-642-56714-8_30",

language = "English",

isbn = "978-3-540-41690-6",

series = " Informatik aktuell ",

publisher = "Springer Berlin Heidelberg",

pages = "169--173",

editor = "Heinz Handels and Alexander Horsch and Thomas Lehmann and Hans-Peter Meinzer",

booktitle = "Bildverarbeitung f{\"u}r die Medizin 2001",

note = "Workshop on Bildverarbeitung fur die Medizin 2001 ; Conference date: 04-03-2001 Through 06-03-2001",

}

Fischer, B & Modersitzki, J 2001, A Super Fast Registration Algorithm. in H Handels, A Horsch, T Lehmann & H-P Meinzer (eds), Bildverarbeitung für die Medizin 2001. Informatik aktuell , Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 169-173, Workshop on Bildverarbeitung fur die Medizin 2001, Lübeck, Schleswig-Holstein, Germany, 04.03.01. https://doi.org/10.1007/978-3-642-56714-8_30

A Super Fast Registration Algorithm. / Fischer, Bernd; Modersitzki, Jan.
Bildverarbeitung für die Medizin 2001. ed. / Heinz Handels; Alexander Horsch; Thomas Lehmann; Hans-Peter Meinzer. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. p. 169-173 ( Informatik aktuell ).

Research output: Chapters in Books/Reports/Conference Proceedings › Conference contribution › peer-review

TY - GEN

T1 - A Super Fast Registration Algorithm

AU - Fischer, Bernd

AU - Modersitzki, Jan

PY - 2001/3/1

Y1 - 2001/3/1

N2 - Image registration is an often encountered problem in digital imaging, in particular in medical imaging. In most applications simple rigid deformations are not satisfactory and complex, non-rigid and non-linear deformations must be employed. A large class of non-rigid, parameter-free, matching techniques minimizes the distance of the given images subject to a regularizing term. In this note we propose a novel scheme for automatic registration by introducing a specific regularizing term. We show that the complexity of its implementation is linear with respect to the size of the images and demonstrate its performance. Moreover, we draw a connection to Thirion's demon based approach.

AB - Image registration is an often encountered problem in digital imaging, in particular in medical imaging. In most applications simple rigid deformations are not satisfactory and complex, non-rigid and non-linear deformations must be employed. A large class of non-rigid, parameter-free, matching techniques minimizes the distance of the given images subject to a regularizing term. In this note we propose a novel scheme for automatic registration by introducing a specific regularizing term. We show that the complexity of its implementation is linear with respect to the size of the images and demonstrate its performance. Moreover, we draw a connection to Thirion's demon based approach.

U2 - 10.1007/978-3-642-56714-8_30

DO - 10.1007/978-3-642-56714-8_30

M3 - Conference contribution

SN - 978-3-540-41690-6

T3 - Informatik aktuell

SP - 169

EP - 173

BT - Bildverarbeitung für die Medizin 2001

A2 - Handels, Heinz

A2 - Horsch, Alexander

A2 - Lehmann, Thomas

A2 - Meinzer, Hans-Peter

PB - Springer Berlin Heidelberg

CY - Berlin, Heidelberg

T2 - Workshop on Bildverarbeitung fur die Medizin 2001

Y2 - 4 March 2001 through 6 March 2001

ER -

A Super Fast Registration Algorithm

Abstract

Access to Document

Fingerprint

Cite this