Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Signal processing”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 739 records · Page 41

SU-D-210-05: The Accuracy of Raw and B-Mode Image Data for Ultrasound Speckle Tracking in Radiation Therapy

Purpose: For ultrasound speckle tracking there is some evidence that the envelope-detected signal (the main step in B-mode image formation) may be more accurate than raw ultrasound data for tracking larger inter-frame tissue motion. This study investigates the accuracy of raw radio-frequency (RF) versus non-logarithmic compressed envelope-detected (B-mode) data for ultrasound speckle tracking in the context of image-guided radiation therapy. Methods: Transperineal ultrasound RF data was acquired (with a 7.5 MHz linear transducer operating at a 12 Hz frame rate) from a speckle phantom moving with realistic intra-fraction prostate motion derived from a commercial tracking system. A normalised cross-correlation template matching algorithm was used to track speckle motion at the focus using (i) the RF signal and (ii) the B-mode signal. A range of imaging rates (0.5 to 12 Hz) were simulated by decimating the imaging sequences, therefore simulating larger to smaller inter-frame displacements. Motion estimation accuracy was quantified by comparison with known phantom motion. Results: The differences between RF and B-mode motion estimation accuracy (2D mean and 95% errors relative to ground truth displacements) were less than 0.01 mm for stable and persistent motion types and 0.2 mm for transient motion for imaging rates of 0.5 to 12 Hz. The mean correlation for all motion types and imaging rates was 0.851 and 0.845 for RF and B-mode data, respectively. Data type is expected to have most impact on axial (Superior-Inferior) motion estimation. Axial differences were <0.004 mm for stable and persistent motion and <0.3 mm for transient motion (axial mean errors were lowest for B-mode in all cases). Conclusions: Using the RF or B-mode signal for speckle motion estimation is comparable for translational prostate motion. B-mode image formation may involve other signal-processing steps which also influence motion estimation accuracy. A similar study for respiratory-induced motion would also be prudent. This work is support by Cancer Research UK Programme Grant C33589/A19727.

60 APPLIED LIFE SCIENCES↗

SU-G-BRA-01: A Real-Time Tumor Localization and Guidance Platform for Radiotherapy Using US and MRI

Purpose: To develop and validate a real-time motion management platform for radiotherapy that directly tracks tumor motion using ultrasound and MRI. This will be a cost-effective and non-invasive real-time platform combining the excellent temporal resolution of ultrasound with the excellent soft-tissue contrast of MRI. Methods: A 4D planar ultrasound acquisition during the treatment that is coupled to a pre-treatment calibration training image set consisting of a simultaneous 4D ultrasound and 4D MRI acquisition. The image sets will be rapidly matched using advanced image and signal processing algorithms, allowing the display of virtual MR images of the tumor/organ motion in real-time from an ultrasound acquisition. Results: The completion of this work will result in several innovations including: a (2D) patch-like, MR and LINAC compatible 4D planar ultrasound transducer that is electronically steerable for hands-free operation to provide real-time virtual MR and ultrasound imaging for motion management during radiation therapy; a multi- modal tumor localization strategy that uses ultrasound and MRI; and fast and accurate image processing algorithms that provide real-time information about the motion and location of tumor or related soft-tissue structures within the patient. Conclusion: If successful, the proposed approach will provide real-time guidance for radiation therapy without degrading image or treatment plan quality. The approach would be equally suitable for image-guided proton beam or heavy ion-beam therapy. This work is partially funded by NIH grant R01CA190298.

60 APPLIED LIFE SCIENCES↗

Structure of the immunoregulatory sialidase NEU1

Sialic acids linked to glycoproteins and glycolipids are important mediators of cell and protein recognition events. These sugar residues are removed by neuraminidases (sialidases). Neuraminidase-1 (sialidase-1 or NEU1) is a ubiquitously expressed mammalian sialidase located in lysosomes and on the cell membrane. Because of its modulation of multiple signaling processes, it is a potential therapeutic target for cancers and immune disorders. Genetic defects in NEU1 or in its protective protein cathepsin A (PPCA, CTSA) cause the lysosomal storage diseases sialidosis and galactosialidosis. To further our understanding of this enzyme’s function at the molecular level, we determined the three-dimensional structure of murine NEU1. The enzyme oligomerizes through two self-association interfaces and displays a wide substrate-binding cavity. A catalytic loop adopts an inactive conformation. We propose a mechanism of activation involving a conformational change in this loop upon binding to its protective protein. These findings may facilitate the development of selective inhibitor and agonist therapies.

59 BASIC BIOLOGICAL SCIENCES↗

Terahertz stimulated parametric downconversion of a magnon mode in an antiferromagnet

Parametric amplification, where one signal is enhanced by the action of another, offers both practical utility for boosting weak signals and fundamental insights into the nonlinear coupling between degrees of freedom. In condensed matter systems, interactions between collective modes offer avenues for nonlinear coherent manipulation of coupled excitations and quantum phases. Antiferromagnets, with inherently coupled magnon modes, provide a promising platform for nonlinear control of spin waves and magnetization. However, nonlinear magnon-magnon interactions have been only partially elaborated, leaving key gaps in the prospects for potential ultrahigh-bandwidth magnonic signal processing. Here, we excite two distinct coherent magnon modes in an antiferromagnet and find that the magnon mode with a lower frequency undergoes amplification when the higher-frequency mode is driven. We unveil the nonlinear excitation pathways of this stimulated parametric downconversion process by using polarization-selective two-dimensional terahertz spectroscopy. Our work provides fundamental insights into nonlinear magnonics in antiferromagnets, laying the groundwork for forthcoming spintronic and magnonic devices.

Science & Technology - Other Topics↗

Investigation of the maximum accessible kinetic energy of fragments in the neutron-induced fission of {sup 238}U nuclei

The masses, total kinetic energies (TKE), and emission angles of fragments originating from the fission of {sup 238}U nuclei that was induced by 5- and 6.5-MeV neutrons were measured by using digital methods for processing signals. A detailed analysis of the shape of digital signals made it possible to reduce substantially the contribution of fragments whose TKE values were distorted because of a superimposition of signals from recoil protons and from alpha particles produced in the spontaneous decay of uranium. The total statistics exceeded two million events for either neutron energy, and this permitted performing a detailed analysis of fission-fragment yields in the region of the highest attainable TKE values. An analysis of fragment yields made it possible to draw specific conclusions on the structure of the potential surface of fissile nuclei.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Efficient Parallel Sparse Symmetric Tucker Decomposition for High-Order Tensors

Tensor based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making it an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTMc) in general sparse tensors, the Sparse Symmetric Tensor Times Same Matrix chain (S3TTMc) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. In this work, we present a novel compressed storage format CSS for sparse symmetric tensors, along with an efficient parallel algorithm for the S3TTMc operation. We theoretically establish that S3TTMc on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations. We demonstrate experimental findings that confirm these results and achieve up to 2.9× speedup on synthetic and real datasets.

Shivakumar, Shruti↗

Efficient Projection onto the $\ell_{\infty,1}$ Mixed-Norm Ball Using a Newton Root Search Method

Mixed norms that promote structured sparsity have numerous applications in signal processing and machine learning problems. Here, we present a new algorithm, based on a Newton root search technique, for computing the projection onto the $\ell_{\infty,1}$ ball, which has found application in cognitive neuroscience and classification tasks. Numerical simulations show that our proposed method is between 8 and 10 times faster on average, and up to 20 times faster for very sparse solutions, than the previous state of the art. Lastly, tests on real functional magnetic resonance image data show that, for some data distributions, our algorithm can obtain speed improvements by a factor of between 10 and 100, depending on the implementation.

97 MATHEMATICS AND COMPUTING↗

Computationally Efficient Decompositions of Oblique Projection Matrices

Oblique projection matrices arise in problems in weighted least squares, signal processing, and optimization. While these matrices can be potentially very large, their low-rank structure can be exploited for efficient computation. Here, we propose fast and scalable algorithms for computing their eigendecomposition and singular value decomposition (SVD). Numerical experiments that compare our proposed approaches to existing methods, including randomized SVD, are presented. In addition, we test their accuracy on linear systems from equality constrained optimization problems.

97 MATHEMATICS AND COMPUTING↗

Managing the Performance/Error Tradeoff of Floating-point Intensive Applications

Modern embedded systems are becoming more reliant on real-valued arithmetic as they employ mathematically complex vision algorithms and sensor signal processing. Double-precision floating point is the most commonly used precision in computer vision algorithm implementations. A single-precision floating point can provide a performance boost due to less memory transfers, less cache occupancy, and relatively faster mathematical operations on some architectures. However, adopting it can result in loss of accuracy. Identifying which parts of the program can run in single-precision floating point with low impact on error is a manual and tedious process. In this paper, we propose an automatic approach to identify parts of the program that have a low impact on error using shadow-value analysis. Our approach provides the user with a performance/error tradeoff, using which the user can decide how much accuracy can be sacrificed in return for performance improvement. We illustrate the impact of the approach using a well known implementation of Apriltag detection used in robotics vision. In conclusion, we demonstrate that an average 1.3x speedup can be achieved with no impact on tag detection, and a 1.7x speedup with only 4% false negatives.

97 MATHEMATICS AND COMPUTING↗

A Sparse Tensor Benchmark Suite for CPUs and GPUs

Tensor computations present significant performance chal- lenges that impact a wide spectrum of applications ranging from machine learning, healthcare analytics, social network analysis, data mining to quantum chemistry and signal processing. Efforts to improve the perfor- mance of tensor computations include exploring data layout, execution scheduling, and parallelism in common tensor kernels. This work presents a benchmark suite for arbitrary-order sparse tensor kernels using state- of-the-art tensor formats: coordinate (COO) and hierarchical coordinate (HiCOO) on CPUs and GPUs. It presents a set of reference tensor kernel implementations that are compatible with real-world tensors and power law tensors extended from synthetic graph generation techniques. We also propose Roofline performance models for these kernels to provide insights of computer platforms from sparse tensor view. This benchmark suite along with the synthetic tensor generator is publicly available.

Li, Jiajia↗

Assessing the Effects of Data Compression in Simulations Using Physically Motivated Metrics

This paper examines whether lossy compression can be used effectively in physics simulations as a possible strategy to combat the expected data-movement bottleneck in future high performance computing architectures. We show that, for the codes and simulations we tested, compression levels of 3–5X can be applied without causing significant changes to important physical quantities. Rather than applying signal processing error metrics, we utilize physics-based metrics appropriate for each code to assess the impact of compression. We evaluate three different simulation codes: a Lagrangian shock-hydrodynamics code, an Eulerian higher-order hydrodynamics turbulence modeling code, and an Eulerian coupled laser-plasma interaction code. We compress relevant quantities after each time-step to approximate the effects of tightly coupled compression and study the compression rates to estimate memory and disk-bandwidth reduction. We find that the error characteristics of compression algorithms must be carefully considered in the context of the underlying physics being modeled.

Laney, Daniel↗

Dynamic Control of Synaptic Adhesion and Organizing Molecules in Synaptic Plasticity

Synapses play a critical role in establishing and maintaining neural circuits, permitting targeted information transfer throughout the brain. A large portfolio of synaptic adhesion/organizing molecules (SAMs) exists in the mammalian brain involved in synapse development and maintenance. SAMs bind protein partners, forming trans -complexes spanning the synaptic cleft or cis -complexes attached to the same synaptic membrane. SAMs play key roles in cell adhesion and in organizing protein interaction networks; they can also provide mechanisms of recognition, generate scaffolds onto which partners can dock, and likely take part in signaling processes as well. SAMs are regulated through a portfolio of different mechanisms that affect their protein levels, precise localization, stability, and the availability of their partners at synapses. Interaction of SAMs with their partners can further be strengthened or weakened through alternative splicing, competing protein partners, ectodomain shedding, or astrocytically secreted factors. Given that numerous SAMs appear altered by synaptic activity, in vivo, these molecules may be used to dynamically scale up or scale down synaptic communication. Many SAMs, including neurexins, neuroligins, cadherins, and contactins, are now implicated in neuropsychiatric and neurodevelopmental diseases, such as autism spectrum disorder, schizophrenia, and bipolar disorder and studying their molecular mechanisms holds promise for developing novel therapeutics.

60 APPLIED LIFE SCIENCES↗

Pairwise Sequence Alignment Library

Vector extensions, such as SSE, have been part of the x86 CPU since the 1990s, with applications in graphics, signal processing, and scientific applications. Although many algorithms and applications can naturally benefit from automatic vectorization techniques, there are still many that are difficult to vectorize due to their dependence on irregular data structures, dense branch operations, or data dependencies. Sequence alignment, one of the most widely used operations in bioinformatics workflows, has a computational footprint that features complex data dependencies. The trend of widening vector registers adversely affects the state-of-the-art sequence alignment algorithm based on striped data layouts. Therefore, a novel SIMD implementation of a parallel scan-based sequence alignment algorithm that can better exploit wider SIMD units was implemented as part of the Parallel Sequence Alignment Library (parasail). Parasail features: Reference implementations of all known vectorized sequence alignment approaches. Implementations of Smith Waterman (SW), semi-global (SG), and Needleman Wunsch (NW) sequence alignment algorithms. Implementations across all modern CPU instruction sets including AVX2 and KNC. Language interfaces for C/C++ and Python.

Jeff Daily, PNNL↗

PetaVision version 2.0

PetaVision is an open source, object oriented neural simulation toolbox optimized for high-performance multi-core, multi-node computer architectures. PetaVision is intended for computational neuroscientists who seek to apply neuromorphic models to hard signal processing problems; both to improve on the performance of existing algorithms and/or to gain insight into the computational mechanisms underlying biological neural processing. Please note that this assertion and ESTSC deposit are only for the portions of PetaVision which have been funded and written by LANL developers.

Lundquist, Sheng↗

Sidekiq DSP v. 0.4

This is a follow on to a subset of SCR#2291.0, and represents a set of FPGA and Linux driver software that serves to enhance the Epiq Solutions Sidekiq line of products with very standard and well defined digital signal processing capabilities that are found on other such software defined radio hardware. This includes timed command support, sub-band tuners, and other generic DSP capabilities. SAND2019-3719 M

Knee, PeterA↗

Bedrock v1.0

Bedrock is a code set of firmware libraries written in Verilog used by LBNL for accelerator controls and other applications. A set of commonly used building blocks in DSP (Digital Signal Processing) are present such as a CORDIC implementation, CIC filters, etc. Other useful functions include an in-fabric Ethernet core implementation to communicate with FPGAs over the network and support drivers for components such as ADCs and DACs we have used in our designs. The code base is intended to serve as a support library for HDL designs.

Doolittle, Lawrence↗

Genten: Software for Generalized Tensor Decompositions v. 1.0.0

Tensors, or multidimensional arrays, are a powerful mathematical means of describing multiway data. This software provides computational means for decomposing or approximating a given tensor in terms of smaller tensors of lower dimension, focusing on decomposition of large, sparse tensors. These techniques have applications in many scientific areas, including signal processing, linear algebra, computer vision, numerical analysis, data mining, graph analysis, neuroscience and more. The software is designed to take advantage of parallelism present emerging computer architectures such has multi-core CPUs, many-core accelerators such as the Intel Xeon Phi, and computation-oriented GPUs to enable efficient processing of large tensors.

Phipps, EricT.↗

DataXray

Lab experiments involving digital signal processing tend to capture heterogeneous data that is binned into individual files. The structure of the whole experiment tends to get lost in this process, generating a "mess" of data that is difficult to summarize, and even more difficult to analyze in a consistent way. DataXray is a set of python routines that wraps publicly available open-source codes to create a consistent workflow for data and experiments, involving imaging, spectral and hyperspectral data. Routines are provided for data translation, slicing, visualization, multivariate statistics, integral transforms, feature extraction and reporting in the form of publication-grade figures.

Maksymovych, Petro↗