PubMed Health⌕ Search

PubMed · 15217231

Nonlinear elasticity imaging: theory and phantom study.

Abstract

In tissue the Young's modulus cannot be assumed constant over a wide deformation range. For example, direct mechanical measurements on human prostate show up to a threefold increase in Young's modulus over a 10% deformation. In conventional elasticity imaging, these effects produce strain-dependent elastic contrast. Ignoring these effects generally leads to suboptimal contrast (stiffer tissues at lower strain are contrasted against softer tissues at higher strain), but measuring the nonlinear behavior results in enhanced tissue differentiation. To demonstrate the methods extracting nonlinear elastic properties, both simulations and measurements were performed on an agar-gelatin phantom. Multiple frames of phase-sensitive ultrasound data are acquired as the phantom is deformed by 12%. All interframe displacement data are brought back to the geometry of the first frame to form a three-dimensional (3-D) data set (depth, lateral, and preload dimensions). Data are fit to a 3-D second order polynomial model for each pixel that adjusts for deformation irregularities. For the phantom geometry and elastic properties considered in this paper, reconstructed frame-to-frame strain images using this model result in improved contrast to noise ratios (CNR) at all preload levels, without any sacrifice in spatial resolution. From the same model, strain hardening at all preload levels can be extracted. This is an independent contrast mechanism. Its maximum CNR occurs at 5.13% preload, and it is a 54% improvement over the best case (preload 10.6%) CNR for frame-to-frame strain reconstruction. Actual phantom measurements confirm the essential features of the simulation. Results show that modeling of the nonlinear elastic behavior has the potential to both increase detectability in elasticity imaging and provide a new independent mechanism for tissue differentiation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ramon Q Erkamp, Stanislav Y Emelianov, Andrei R Skovoroda, Matthew O'Donnell. 2004. Nonlinear elasticity imaging: theory and phantom study.. https://pubmed.ncbi.nlm.nih.gov/15217231/

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↗