Task-optimal registration cost functions

6Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we propose a framework for learning the parameters of registration cost functions - such as the tradeoff between the regularization and image similiarity term - with respect to a specific task. Assuming the existence of labeled training data, we specialize the framework for the task of localizing hidden labels via image registration. We learn the parameters of the weighted sum of squared differences (wSSD) image similarity term that are optimal for the localization of Brodmann areas (BAs) in a new subject based on cortical geometry. We demonstrate state-of-the-art localization of V1, V2, BA44 and BA45. © 2009 Springer-Verlag.

Cite

CITATION STYLE

APA

Yeo, B. T. T., Sabuncu, M., Golland, P., & Fischl, B. (2009). Task-optimal registration cost functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5761 LNCS, pp. 598–606). https://doi.org/10.1007/978-3-642-04268-3_74

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