PubMed Health⌕ Search

PubMed · 9214804

Unwrapping Cochlear implants by spiral CT.

Abstract

Multielectrode, intracochlear implants were designed for individuals with profound sensorineural hearing loss who derive little or no benefit form acoustic hearing aids. Determination of each electrode's position in a patient's inner ear may improve speech processor programming to maximize speech recognition. In this paper, an approach is described to use as input a volumetric spiral computed tomography (CT) image of the Nucleus electrode array (Cochlear Pty. Ltd, Lane Cove, NSW, Australia) to unwrap it, and to measure its implanted length given starting and end points. Representative curvilinear structures were digitally synthesized in image volumes of isotropic 0.1-mm voxels. The electrode array was spirally CT-scanned in vitro and in vivo, and reconstructed on an isotropic grid in 0.1-mm steps. Two algorithms were constructed to track and measure these curvilinear structures. The first algorithm is Karhunen-Loeve (K-L)-transform based, in which the K-L transform is locally applied at a current main axis position to determine the eigenvectors of the main axis voxels, the next main axis position is estimated from the current position along the principal eigendirection, adjusted to the mass center of the orthogonal cross section passing through the estimated position, and then scaled to have a prespecified step. The second algorithm is similar to the first one but avoids use of the K-L transform. In the second algorithm, the next position is directly estimated along the local direction and then processed with the same correction and scaling operations. With user-specified starting and end points as well as a local direction at the starting point, a curvilinear structure can be automatically tracked using either of the algorithms. The first algorithm is more robust, while the second one is more efficient. In the numerical and in vitro studies, the lengths of the curvilinear structures were accurately measured. Given local directions determined in the tracking process, an electrode array image can be unwrapped into a linear array with the central electrode axis as the abscissa. The unwrapping approach allows longitudinally and cross-sectionally accurate measurement and better visualization of cochlear implant images. With preimplantation knowledge of length, width, and center electrode distance, the position of individual electrodes can be estimated after unwrapping.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

G Wang, M W Vannier, M W Skinner, W A Kalender, A Polacin, D R Ketten. 1996. Unwrapping Cochlear implants by spiral CT.. https://doi.org/10.1109/10.532123

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗