Recursive Green's function registration

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

This article is free to access.

Abstract

Non-parametric image registration is still among the most challenging problems in both computer vision and medical imaging. Here, one tries to minimize a joint functional that is comprised of a similarity measure and a regularizer in order to obtain a reasonable displacement field that transforms one image to the other. A common way to solve this problem is to formulate a necessary condition for an optimizer, which in turn leads to a system of partial differential equations (PDEs). In general, the most time consuming part of the registration task is to find a numerical solution for such a system. In this paper, we present a generalized and efficient numerical scheme for solving such PDEs simply by applying 1-dimensional recursive filtering to the right hand side of the system based on the Green's function of the differential operator that corresponds to the chosen regularizer. So in the end we come up with a general linear algorithm. We present the associated Green's function for the diffusive and curvature regularizers and show how one may efficiently implement the whole process by using recursive filter approximation. Finally, we demonstrate the capability of the proposed method on realistic examples. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Beuthien, B., Kamen, A., & Fischer, B. (2010). Recursive Green’s function registration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6362 LNCS, pp. 546–553). https://doi.org/10.1007/978-3-642-15745-5_67

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