2011
DOI: 10.1007/978-3-642-23629-7_59
|View full text |Cite
|
Sign up to set email alerts
|

Fast Shape-Based Nearest-Neighbor Search for Brain MRIs Using Hierarchical Feature Matching

Abstract: 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 co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
2
2
2

Relationship

2
4

Authors

Journals

citations
Cited by 7 publications
(7 citation statements)
references
References 13 publications
(22 reference statements)
0
7
0
Order By: Relevance
“…Aljabar et al (2008) derived image similarities from anatomical segmentation overlaps. Zhu et al (2011) find nearest neighbors by combining edge extraction with spatial pyramid matching. BrainPrint relates to these approaches because it provides a measure of brain similarity.…”
Section: Introductionmentioning
confidence: 99%
“…Aljabar et al (2008) derived image similarities from anatomical segmentation overlaps. Zhu et al (2011) find nearest neighbors by combining edge extraction with spatial pyramid matching. BrainPrint relates to these approaches because it provides a measure of brain similarity.…”
Section: Introductionmentioning
confidence: 99%
“…

The database can be organized using a hierarchical groupwise nonlinear-diffeomorphic registration scheme [31], [32] that produces several optimal mean templates for multiple classes of images within the database. A target can be mapped first to all the mean templates to determine the most similar classes and then the target can be registered to templates only within the similar classes.

We can use fast approximate searches for similar templates relying on affine registration followed by spatial pyramid matching on coded geometry-capturing features, e.g., canny edges clustered and coded based on orientation and curvature [23]. The approximate search can be used to select a number of templates larger than the required k *( M ) (e.g., twice or thrice) k *( M ), after which the selected templates can be nonlinearly registered to the target.
…”
Section: Resultsmentioning
confidence: 99%
“…The experiments in this paper use an isotropic patch of size 21 3 mm 3 . The proposed framework indeed allows the usage of more sophisticated Mercer kernels such as the pyramid match kernel [21] and the spatial pyramid kernel [22] that was used for multiatlas segmentation in [13], [23]. …”
Section: Methodsmentioning
confidence: 99%
“…However, multiatlas approaches require only a few most-similar templates ( k in k NN) and registration between the target and thousands of templates in a large database can be very expensive. Thus, this paper uses an extremely-fast approximate search for similar templates relying on affine registration followed by spatial pyramid matching on coded geometry-capturing features (canny edges clustered and coded based on orientation and curvature) [18]. This implicitly induces a distance metric in the space of deformed images f , underlying k NN regression.…”
Section: Experiments and Results On A Clinical Databasementioning
confidence: 99%
“…This has lead to multiatlas , nonparametric atlas, or label-fusion approaches [1,2,5,10,11,13,15,16] to segmentation that leverage information in the entire database of atlases. Multiatlas approaches can exploit methods for fast selection [18] of a small subset of templates that are most similar to the target. They independently register the selected templates to the target and, then, deform database segmentations to the target space.…”
Section: Introductionmentioning
confidence: 99%