Jacobians for Lebesgue registration for a range of similarity measures

Jon Sporring; Sune Darkner

Jacobians for Lebesgue registration for a range of similarity measures

Department of Computer Science

Abstract

In [Darkner and Sporring, 2011] was presented a framework based on locally orderless images and Lebesgue integration resulting in a fast algorithm for registration using normalized mutual information as dissimilarity measure. This report extends the algorithm to arbitrary complex similarity measures and supplies the full derivatives of a range of common dissimilarity measures as well as their obvious extensions.

Original language	English

Publisher	Department of Computer Science, University of Copenhagen
Number of pages	8
Publication status	Published - 2011

Series	Koebenhavns Universitet. Datalogisk Institut. Rapport
Number	04/2011
ISSN	0107-8283

Cite this

@book{6e801ec99f944dcfa39d0a042d03d157,

title = "Jacobians for Lebesgue registration for a range of similarity measures",

abstract = "In [Darkner and Sporring, 2011] was presented a framework based on locally orderless images and Lebesgue integration resulting in a fast algorithm for registration using normalized mutual information as dissimilarity measure. This report extends the algorithm to arbitrary complex similarity measures and supplies the full derivatives of a range of common dissimilarity measures as well as their obvious extensions.",

author = "Jon Sporring and Sune Darkner",

year = "2011",

language = "English",

series = "Koebenhavns Universitet. Datalogisk Institut. Rapport",

number = "04/2011",

publisher = "Department of Computer Science, University of Copenhagen",

}

TY - RPRT

T1 - Jacobians for Lebesgue registration for a range of similarity measures

AU - Sporring, Jon

AU - Darkner, Sune

PY - 2011

Y1 - 2011

N2 - In [Darkner and Sporring, 2011] was presented a framework based on locally orderless images and Lebesgue integration resulting in a fast algorithm for registration using normalized mutual information as dissimilarity measure. This report extends the algorithm to arbitrary complex similarity measures and supplies the full derivatives of a range of common dissimilarity measures as well as their obvious extensions.

AB - In [Darkner and Sporring, 2011] was presented a framework based on locally orderless images and Lebesgue integration resulting in a fast algorithm for registration using normalized mutual information as dissimilarity measure. This report extends the algorithm to arbitrary complex similarity measures and supplies the full derivatives of a range of common dissimilarity measures as well as their obvious extensions.

M3 - Report

T3 - Koebenhavns Universitet. Datalogisk Institut. Rapport

BT - Jacobians for Lebesgue registration for a range of similarity measures

PB - Department of Computer Science, University of Copenhagen

ER -