Streak artifact reduction in filtered backprojection using a level line-based interpolation method.

P P Bruyant; J Sau; J J Mallet

Home/Archive/PubMed

PubMed · 11079504

Streak artifact reduction in filtered backprojection using a level line-based interpolation method.

P P Bruyant·J Sau·J J Mallet

View original source ↗Export metadata ↓

Abstract

UNLABELLED: Because of the limited number of projections, the mathematic reconstruction formula of the filtered backprojection (FBP) algorithm may create an artifact that streaks reconstructed images. This artifact can be imperfectly removed by replacing the ramp filter of the FBP with an ad hoc low-pass filter, the cost being the loss of contrast and definition. In this study, a solution was proposed to increase, by computational means, the number of projections to reduce the artifact at a lower cost. The cost was a postacquisition process, which was reasonably time consuming. METHODS: The process was called interpolation of projections by contouring (IPC). First, level lines were plotted on the sinogram to delimit isocount regions; then, the regions containing the interpolated points were found, and to each point was assigned the intensity of its isocount region. Using this process, the data could be resampled, allowing an increase in the number of projections or the number of pixels by projections. A phantom study of bone scintigraphy was performed to compare the slices obtained with and without the IPC process with the true image. A clinical case was also presented. RESULTS: The phantom study showed that with the IPC process, the reconstructed slice was closer to the model, inside and outside the body, when the sinogram was resampled to multiply by 2 or 3 the number of projections, with the same number of pixels per projection. In the clinical study, the streak artifact was reduced, especially outside the body, although only a ramp filter was used. CONCLUSION: The IPC process succeeded in reducing the streak artifact. This process did not require any modification in acquisition and was not operator dependent. The increase in the number of projections is likely a necessary but not a sufficient condition to reduce the streak artifact: if not corrected, the attenuation could be a limiting factor in the removal of this artifact when the number of projections increases.

Explore related subjects

Algorithms Artifacts Bone Neoplasms Bone and Bones Computer Simulation Humans Image Processing, Computer-Assisted Male Middle Aged Phantoms, Imaging Radionuclide Imaging Radiopharmaceuticals Technetium Tc 99m Medronate Journal Article

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

P P Bruyant, J Sau, J J Mallet. 2000. Streak artifact reduction in filtered backprojection using a level line-based interpolation method.. https://pubmed.ncbi.nlm.nih.gov/11079504/

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

KEEP EXPLORING

Related citations

PubMed2026

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↗

PubMed2026

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↗

PubMed2026

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↗