Location Registration and Recognition (LRR) for longitudinal evaluation of corresponding regions in CT volumes

8Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The algorithm described in this paper takes (a) two temporally-separated CT scans, I 1 and I 2, and (b) a series of locations in I 1, and it produces, for each location, an affine transformation mapping the locations and their immediate neighborhood from I 1 to I 2. It does this without deformable registration by using a combination of feature extraction, indexing, refinement and decision processes. Together these essentially "recognize" the neighborhoods. We show on lung CT scans that this works at near interactive speeds, and is at least as accurate as the Diffeomorphic Demons algorithm [1]. The algorithm may be used both for diagnosis and treatment monitoring. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Sofka, M., & Stewart, C. V. (2008). Location Registration and Recognition (LRR) for longitudinal evaluation of corresponding regions in CT volumes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5242 LNCS, pp. 989–997). Springer Verlag. https://doi.org/10.1007/978-3-540-85990-1_119

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