Hashing-Based Atlas Ranking and Selection for Multiple-Atlas Segmentation

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

This article is free to access.

Abstract

In this paper, we present a learning based, registration free, atlas ranking technique for selecting outperforming atlases prior to image registration and multi-atlas segmentation (MAS). To this end, we introduce ensemble hashing, where each data (image volume) is represented with ensemble of hash codes and a learnt distance metric is used to obviate the need for pairwise registration between atlases and target image. We then pose the ranking process as an assignment problem and solve it through two different combinatorial optimization (CO) techniques. We use 43 unregistered cardiac CT Angiography (CTA) scans and perform thorough validations to show the effectiveness and superiority of the presented technique against existing atlas ranking and selection methods.

Cite

CITATION STYLE

APA

Katouzian, A., Wang, H., Conjeti, S., Tang, H., Dehghan, E., Karargyris, A., … Navab, N. (2018). Hashing-Based Atlas Ranking and Selection for Multiple-Atlas Segmentation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11073 LNCS, pp. 543–551). Springer Verlag. https://doi.org/10.1007/978-3-030-00937-3_62

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