PubMed Health⌕ Search

PubMed · 15766693

Task-based model/human observer evaluation of SPIHT wavelet compression with human visual system-based quantization.

Abstract

RATIONALE AND OBJECTIVE: The set partitioning in hierarchical trees (SPIHT) wavelet image compression algorithm with the human visual system (HVS) quantization matrix was investigated using x-ray coronary angiograms. We tested whether the HVS quantization matrix for the SPIHT wavelet compression improved computer model/human observer performance in a detection task with variable signals compared to performance with the default quantization matrix. We also tested the hypothesis of whether evaluating the rank order of the two quantization matrices (HVS versus default) based on performance of computer model observers in a signal known exactly but variable task (SKEV) generalized to model/human performance in the more clinically realistic signal known statistically task (SKS). MATERIALS AND METHODS: Nine hundred test images were created using real x-ray coronary angiograms as backgrounds and simulated arteries with filling defects (signals). The task for the model and human observer was to detect which one of the four computer simulated arterial segments contained the signal, four alternative-forced-choice (4 AFC). We obtained performance for four model observers (nonprewhitening matched filter with an eye filter, Hotelling, Channelized Hotelling, and Laguerre Gauss Hotelling model observers) for both the SKEV and SKS tasks with images compressed with and without the HVS quantization matrix. A psychophysical study measured performance from three human observers for the same conditions and tasks as the model observers. RESULTS: Performance for all four model observers improved with the use of the HVS quantization scheme. Improvements ranged from 5% (at compression ratio 7:1) to 50% (at compression ratio 30:1) for both the SKEV and SKS tasks. Human observer performance improvement averaged across observers ranged from 6% (at compression ratio 7:1) to 35% (at compression ratio 30:1) for the SKEV task and from 2% (at compression ratio 7:1) to 38% (at compression ratio 30:1) for the SKS task. Addition of internal noise to the model observers allowed for good prediction of human performance. CONCLUSIONS: Use of the HVS quantization scheme in the SPIHT wavelet compression led to improved model and human observer performance in clinically relevant detection tasks in x-ray coronary angiograms. Model observer performance can be reliably used to predict the human observer performance for the studied tasks as a function of SPIHT wavelet image compression. Our results further confirmed that model observer performance in the computationally more tractable SKEV task can be potentially used as a figure of merit for the more clinically realistic SKS task with real anatomic backgrounds.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yani Zhang, Binh T Pham, Miguel P Eckstein. 2005. Task-based model/human observer evaluation of SPIHT wavelet compression with human visual system-based quantization.. https://doi.org/10.1016/j.acra.2004.09.015

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↗