PubMed Health⌕ Search

PubMed · 12542239

ATMTN: a telemammography network architecture.

Abstract

One of the goals of the National Cancer Institute (NCI) to reach more than 80% of eligible women in mammography screening by the year 2000 yet remains as a challenge. In fact, a recent medical report reveals that while other types of cancer are experiencing negative growth, breast cancer has been the only one with a positive growth rate over the last few years. This is primarily due to the fact that 1) examination process is a complex and lengthy one and 2) it is not available to the majority of women who live in remote sites. Currently for mammography screening, women have to go to doctors or cancer centers/hospitals annually while high-risk patients may have to visit more often. One way to resolve these problems is by the use of advanced networking technologies and signal processing algorithms. On one hand, software modules can help detect, with high precision, true negatives (TN), while marking true positives (TP) for further investigation. Unavoidably, in this process some false negatives (FN) will be generated that are potentially life threatening; however, inclusion of the detection software improves the TP detection and, hence, reduces FNs drastically. Since TNs are the majority of examinations on a randomly selected population, this first step reduces the load on radiologists by a tremendous amount. On the other hand, high-speed networking equipment can accelerate the required clinic-lab connection and make detection, segmentation, and image enhancement algorithms readily available to the radiologists. This will bring the breast cancer care, caregiver, and the facilities to the patients and expand diagnostics and treatment to the remote sites. This research describes asynchronous transfer mode telemammography network (ATMTN) architecture for real-time, online screening, detection and diagnosis of breast cancer. ATMTN is a unique high-speed network integrated with automatic robust computer-assisted diagnosis-detection/digital signal processing (CAD/DSP) methods for mass detection, region of interest (ROI) compression algorithms using Digital Imaging and Communications in Medicine (DICOM) 3.0 medical image standard. While ATMTN has the advantage of higher penetration for cancer screening, it provides the diagnosis with higher efficiency, better accuracy and potentially lower cost. This paper presents the development of the infrastructure and algorithm design for ATMTN-based telemammography. The research goals involved: 1) networking stations for telemammography to demonstrate, evaluate, and validate technologies and methods for delivering mammography screening services via high-speed (155 MB/s) links, performing real-time network-transmitted, high-resolution mammograms for immediate diagnosis as a "second opinion" strategy; 2) development of object-oriented compression methods for storage, retrieval and transmission of mammograms; 3) inclusion and optimization of detection algorithms for identification of normal images in different resolutions to increase the speed and effectiveness of telemammography as a "second opinion" strategy; 4) resolving the compatibility issues between images from different equipment (DICOM standards); and 5) optimization of an integrated ATMTN with adaptive CAD/DSP methods that are robust for large image databases and input sources.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ehsan O Sheybani, Ravi Sankar. 2002. ATMTN: a telemammography network architecture.. https://doi.org/10.1109/tbme.2002.805556

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↗