Volume preserving image registration

11Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we discuss image registration techniques with a focus on volume preserving constraints. These constraints can reduce the non-uniqueness of the registration problem significantly. Our implementation is based on a constrained optimization formulation. To solve the problem we use a variant of the Sequential Quadratic Programming method. Moreover, we present results on synthetic as well as on real-life data. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Haber, E., & Modersitzki, J. (2004). Volume preserving image registration. In Lecture Notes in Computer Science (Vol. 3216, pp. 591–598). Springer Verlag. https://doi.org/10.1007/978-3-540-30135-6_72

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