PubMed Health⌕ Search

PubMed · 12589715

Lumbar spine visualisation based on kinematic analysis from videofluoroscopic imaging.

Abstract

Low back pain is a significant problem and its cost is enormous to society. However, diagnosis of the underlying causes remains problematic despite extensive study. Reasons for this arise from the deep-rooted situation of the spine and also from its structural complexity. Clinicians have to mentally convert 2-D image information into a 3-D form to gain a better understanding of structural integrity. Therefore, visualisation and animation may be helpful for understanding, diagnosis and for guiding therapy. Some low back pain originates from mechanical disorders, and study of the spine kinematics may provide an insight into the source of the problem. Digital videofluoroscopy was used in this study to provide 2-D image sequences of the spine in motion, but the images often suffer due to noise, exacerbated by the very low radiation dosage. Thus determining vertebrae position within the image sequence presents a considerable challenge. This paper describes a combination of spine kinematic measurements with a solid model of the human lumbar spine for visualisation of spine motion. Since determination of the spine kinematics provides the foundation and vertebral extraction is at the core, this is discussed in detail. Edge detection is a key feature of segmentation and it is shown that phase congruency performs better than most established methods with the rather low-grade image sequences from fluoroscopy. The Hough transform is then applied to determine the positions of vertebrae in each frame of a motion sequence. In the Hough transform, Fourier descriptors are used to represent the vertebral shapes. The results show that the Hough transform is a very promising technique for vertebral extraction from videofluoroscopic images. A dynamic visualisation package has been developed in order to view the moving lumbar spine from any angle and viewpoint. Wire frame models of the vertebrae were built by using CT images from the Visible Human Project and these models are scaled to match the fluoroscopic image data. For animation, the spinal kinematic data from the motion study is incorporated.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Y Zheng, M S Nixon, R Allen. 2003. Lumbar spine visualisation based on kinematic analysis from videofluoroscopic imaging.. https://doi.org/10.1016/s1350-4533(02)00182-0

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↗