Fast shape-based nearest-neighbor search for brain MRIs using hierarchical feature matching

7Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a fast method for quantifying shape differences/similarities between pairs of magnetic resonance (MR) brain images. Most shape comparisons in the literature require some kind of deformable registration or identification of exact correspondences. The proposed approach relies on an optimal matching of a large collection of features, using a very fast, hierarchical method from the literature, called spatial pyramid matching (SPM). This paper shows that edge-based image features in combination with SPM results in a fast similarity measure that captures relevant anatomical information in brain MRI. We present extensive comparisons against known methods for shape-based, k-nearest-neighbor lookup to evaluate the performance of the proposed method. Finally, we show that the method compares favorably with more computation-intensive methods in the construction of local atlases for use in brain MR image segmentation. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Zhu, P., Awate, S. P., Gerber, S., & Whitaker, R. (2011). Fast shape-based nearest-neighbor search for brain MRIs using hierarchical feature matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6892 LNCS, pp. 484–491). https://doi.org/10.1007/978-3-642-23629-7_59

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