PubMed Health⌕ Search
Home/Archive/PubMed

PubMed · 15280096

Flow visualization tools for image analysis of capillary networks.

Shruti A Japee·Christopher G Ellis·Roland N Pittman
View original source ↗Export metadata ↓

Abstract

OBJECTIVE: Video recordings of red blood cell (RBC) flow through capillary networks contain a considerable amount of information pertaining to oxygen transport through the microcirculation. Image analysis of these video recordings has been widely used to determine RBC dynamics (velocity, lineal density and supply rate) and oxygenation (Brunner et al., 2000; Ellis et al., 1990, 1992; Ellsworth et al., 1987; Klyscz et al., 1997; Pries 1988). However, not all capillaries in a given field of view are suitable for image analysis. Typically, capillary segments that are relatively straight and in sharp focus, and exhibit flow of individual RBCs that are well separated by plasma gaps, are good candidates for analysis. We have developed several image processing tools to aid in the selection of such capillaries for analysis and to obtain quick overviews of RBC flow through the microcirculation. METHODS: Burgess et al. (Microcirc. 2:75, 1995) and Burkell et al. (Annals Biomed. Eng. 24:1, 1996; J. Vasc. Res. 35:2, 1998) have previously introduced mean and variance images to aid in the selection of capillaries for analysis. We have extended their concept and developed similar two dimensional visualization techniques for studies of RBC flow through capillary networks. RESULTS: Five new methods of processing video data were developed. The minimum image highlights all capillaries containing RBCs in a given field of view. The maximum image identifies capillaries that exhibit high lineal density or stopped flow. The range image represents the difference between the maximum and minimum light intensity values that occur at a given pixel over a given time period, and helps to identify capillary segments that are in good focus and are perfused by RBCs and plasma. The difference image represents the cumulative sum of the square of differences in intensity values between consecutive frames and gives an indication of the frequency of passage of RBCs separated by plasma gaps. The transition image represents the number of times the intensity at a given pixel crosses a predefined threshold and indicates the number of RBCs (or trains of RBCs) that passes a given location during the observation period. CONCLUSIONS: The above flow visualization techniques are valuable tools to aid in the study of image focus, network geometry, RBC flow paths and dynamics, that can then be used in identifying capillaries for subsequent (separate) detailed analysis to provide quantitative information about RBC flow.

Explore related subjects

AlgorithmsAnimalsCapillariesDiagnostic ImagingElectronic Data ProcessingErythrocytesMicrocirculationMicroscopy, VideoModels, TheoreticalRatsJournal ArticleResearch Support, Non-U.S. Gov'tResearch Support, U.S. Gov't, P.H.S.

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shruti A Japee, Christopher G Ellis, Roland N Pittman. Flow visualization tools for image analysis of capillary networks.. https://doi.org/10.1080/10739680490266171

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↗