A Levenberg–Marquardt Scheme for Nonlinear Image Registration

Author: Henn S.

Source: Bit Numerical Mathematics, Volume 43, Number 4, December 2003 , pp. 743-759(17)

Publisher: Springer

Buy & download fulltext article:

OR

Price: $47.00 plus tax (Refund Policy)

Abstract:

This paper presents a Levenberg–Marquardt scheme to obtain a displacement vector field u(x)=(u1(x),u2(x))t, which matches two images recorded with the same imaging machinery. The displacement vector should transform the image location x=(x1,x2)t of an image t, such that the grey level are equal to another image R. The so-called mono-modal image registration problem leads to minimize the nonlinear least squares functional D(u(x))=R(x)-t(x-u(x))2.

To apply the Levenberg–Marquardt method, we replace the nonlinear functional D by its linearization around a current approximation. The resulting quadratic minimization problem is ill-posed, due to the fact that determining the unknown components of the displacements merely from the images is an underdetermined problem. We use an auxiliary Lagrange term borrowed from linear elasticity theory, which incorporates smoothness constraints to the displacement field. Finally, numerical experiments demonstrate the robustness and effectiveness of the proposed approach.

Keywords: Levenberg–Marquardt method; nonlinear least squares; image processing; physically regularization

Document Type: Research article

DOI: http://dx.doi.org/10.1023/B:BITN.0000009940.58397.98

Affiliations: 1: Mathematisches Institut, Heinrich-Heine Universität Düsseldorf, Universitätsstraße 1, D-40225 Düsseldorf, Germany., Email: henn@am.uni-duesseldorf.de

Publication date: 2003-12-01

Related content

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page