8 December 2017 Localizing landmark sets in head CTs using random forests and a heuristic search algorithm for registration initialization
Author Affiliations +
Abstract
Cochlear implants (CIs) use electrode arrays that are surgically inserted into the cochlea to stimulate frequency-mapped nerve endings to treat patients with hearing loss. CIs are programmed postoperatively by audiologists using behavioral tests without information on electrode–cochlea spatial relationship. We have recently developed techniques to segment the intracochlear anatomy and to localize individual contacts in clinically acquired computed tomography (CT) images. Using this information, we have proposed a programming strategy that we call image-guided CI programming (IGCIP), and we have shown that it significantly improves outcomes for both adult and pediatric recipients. One obstacle to large-scale deployment of this technique is the need for manual intervention in some processing steps. One of these is the rough registration of images prior to the use of automated intensity-based algorithms. Although seemingly simple, the heterogeneity of our image set makes this task challenging. We propose a solution that relies on the automated random forest-based localization of multiple landmarks used to estimate an initial transformation with a point-based registration method. Results show that it produces results that are equivalent to a manual initialization. This work is an important step toward the full automation of IGCIP.
© 2017 Society of Photo-Optical Instrumentation Engineers (SPIE)
Dongqing Zhang, Yuan Liu, Jack H. Noble, Benoit M. Dawant, "Localizing landmark sets in head CTs using random forests and a heuristic search algorithm for registration initialization," Journal of Medical Imaging 4(4), 044007 (8 December 2017). https://doi.org/10.1117/1.JMI.4.4.044007 . Submission: Received: 6 June 2017; Accepted: 13 November 2017
Received: 6 June 2017; Accepted: 13 November 2017; Published: 8 December 2017
JOURNAL ARTICLE
10 PAGES


SHARE
Back to Top