PubMed Health⌕ Search

PubMed · 9372567

Preliminary study in differential contrast echography.

Abstract

Microbubble-based contrast agents have backscattering properties that differ greatly from those of soft tissues. These agents exhibit nonlinear scattering properties in response to incident acoustic energy, causing harmonic components in reflected energy. Even in linear scattering conditions, an important difference is observed in the frequency dependence of their backscatter coefficient, when compared to that of tissues. In this situation, any such differential behaviour can be exploited by imaging instrumentation to enhance the detection of agent-containing vessels against background tissue. The resulting B-mode image brightness (or pixel level) can thus be the representation of a local parameter computed from radio frequency (rf) signal processing of the raw echoes. The object of this article is to report on parametric imaging studies performed with Sonovue (formerly code named BR1, Bracco Research SA), aimed at assessing the contrast-enhancing potential of spectral rf signal processing. The technique used, termed here "differential contrast echography" (DCE), is applicable in real-time B-mode imaging. It is based on an on-line subtractive approach, using dual-channel signal processing to implement differential filtering and demodulation. In this preliminary work, DCE was implemented off-line, on rf echo signals digitised from commercial B-mode scanners. Data acquisition, DCE processing and complete B-mode image reconstruction were programmed on a personal computer. The images presented were produced from test phantoms as well as animal phased array scanning. The phantom included a flow channel, background scattering material, fixed echogenic targets and echo-free regions. Animal scanning was performed on rabbit liver. The results obtained from DCE show promising contrast-enhancing properties. The regions containing no contrast agent are significantly suppressed from the image, preferentially leaving the regions perfused by the contrast agent. This property was favourable to experimenting with image-overlay presentations, superimposing colour-coded DCE imaging with standard log-compressed grey-scale B-mode, in a way analogous to duplex imaging combining colour Doppler and B-mode.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

M Arditi, T Brenier, M Schneider. 1997. Preliminary study in differential contrast echography.. https://doi.org/10.1016/s0301-5629(97)00116-6

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↗