A scale-space approach to landmark constrained image registration

8Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Adding external knowledge improves the results for ill-posed problems. In this paper we present a new multi-level optimization framework for image registration when adding landmark constraints on the transformation. Previous approaches are based on a fixed discretization and lack of allowing for continuous landmark positions that are not on grid points. Our novel approach overcomes these problems such that we can apply multi-level methods which have been proven being crucial to avoid local minima in the course of optimization. Furthermore, for our numerical method we are able to use constraint elimination such that we trace back the landmark constrained problem to a unconstrained optimization leading to an efficient algorithm. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Haber, E., Heldmann, S., & Modersitzki, J. (2009). A scale-space approach to landmark constrained image registration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5567 LNCS, pp. 612–623). https://doi.org/10.1007/978-3-642-02256-2_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free