PubMed Health⌕ Search

PubMed · 16752580

Intercomparison of methods for image quality characterization. I. Modulation transfer function.

Abstract

The modulation transfer function (MTF) and the noise power spectrum (NPS) are widely recognized as the most relevant metrics of resolution and noise performance in radiographic imaging. These quantities have commonly been measured using various techniques, the specifics of which can have a bearing on the accuracy of the results. As a part of a study aimed at comparing the relative performance of different techniques, in this paper we report on a comparison of two established MTF measurement techniques: one using a slit test device [Dobbins et al., Med. Phys. 22, 1581-1593 (1995)] and another using a translucent edge test device [Samei et al., Med. Phys. 25, 102-113 (1998)], with one another and with a third technique using an opaque edge test device recommended by a new international standard (IEC 62220-1, 2003). The study further aimed to substantiate the influence of various acquisition and processing parameters on the estimated MTF. The slit test device was made of 2 mm thick Pb slabs with a 12.5 microm opening. The translucent edge test device was made of a laminated and polished Pt(0.9)Ir(0.1). alloy foil of 0.1 mm thickness. The opaque edge test device was made of a 2 mm thick W slab. All test devices were imaged on a representative indirect flat-panel digital radiographic system using three published beam qualities: 70 kV with 0.5 mm Cu filtration, 70 kV with 19 mm Al filtration, and 74 kV with 21 mm Al filtration (IEC-RQA5). The latter technique was also evaluated in conjunction with two external beam-limiting apertures (per IEC 62220-1), and with the tube collimator limiting the beam to the same area achieved with the apertures. The presampled MTFs were deduced from the acquired images by Fourier analysis techniques, and the results analyzed for relative values and the influence of impacting parameters. The findings indicated that the measurement technique has a notable impact on the resulting MTF estimate, with estimates from the overall IEC method 4.0% +/- 0.2% lower than that of Dobbins et al. and 0.7% +/- 0.4% higher than that of Samei et al. averaged over the zero to cutoff frequency range. Over the same frequency range, keeping beam quality and limitation constant, the average MTF estimate obtained with the edge techniques differed by up to 5.2% +/- 0.2% from that of the slit, with the opaque edge providing lower MTF estimates at lower frequencies than those obtained with the translucent edge or slit. The beam quality impacted the average estimated MTF by as much as 3.7% +/- 0.9% while the use of beam limiting devices alone increased the average estimated MTF by as much as 7.0% +/- 0.9%. While the slit method is inherently very sensitive to misalignment, both edge techniques were found to tolerate misalignments by as much as 6 cm. The results suggest the use of the opaque edge test device and the tube internal collimator for beam limitation in order to achieve an MTF result most reflective of the overall performance of the imaging system and least susceptible to misalignment and scattered radiation. Careful attention to influencing factors is warranted to achieve accurate results.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ehsan Samei, Nicole T Ranger, James T Dobbins, Ying Chen. 2006. Intercomparison of methods for image quality characterization. I. Modulation transfer function.. https://doi.org/10.1118/1.2188816

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↗