Search NASA⌕ Search

SEARCH · Search NASA

Results for “Signal processing algorithms”

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 127 records · Page 7

On the Impact of Widening Vector Registers on Sequence Alignment

Vector extensions, such as SSE, have been part of the x86 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. In this paper, we demonstrate that the trend of widening vector registers adversely affects the state-of-the-art sequence alignment algorithm based on striped data layouts. We present a practically efficient SIMD implementation of a parallel scan based sequence alignment algorithm that can better exploit wider SIMD units. We conduct comprehensive workload and use case analyses to characterize the relative behavior of the striped and scan approaches and identify the best choice of algorithm based on input length and SIMD width.

Needleman-Wunsch↗

Land cover classification in multispectral imagery using clustering of sparse approximations over learned feature dictionaries

We present results from an ongoing effort to extend neuromimetic machine vision algorithms to multispectral data using adaptive signal processing combined with compressive sensing and machine learning techniques. Our goal is to develop a robust classification methodology that will allow for automated discretization of the landscape into distinct units based on attributes such as vegetation, surface hydrological properties, and topographic/geomorphic characteristics. We use a Hebbian learning rule to build spectral-textural dictionaries that are tailored for classification. We learn our dictionaries from millions of overlapping multispectral image patches and then use a pursuit search to generate classification features. Land cover labels are automatically generated using unsupervised clustering of sparse approximations (CoSA). We demonstrate our method on multispectral WorldView-2 data from a coastal plain ecosystem in Barrow, Alaska. We explore learning from both raw multispectral imagery and normalized band difference indices. We explore a quantitative metric to evaluate the spectral properties of the clusters in order to potentially aid in assigning land cover categories to the cluster labels. In this study, our results suggest CoSA is a promising approach to unsupervised land cover classification in high-resolution satellite imagery.

42 ENGINEERING↗

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↗

Wavelength-Shifting-Fiber Scintillation Detectors for Thermal Neutron Imaging at SNS

We have developed wavelength-Shifting-fiber Scintillator Detector (SSD) with 0.3 m2 area per module. Each module has 154 x 7 pixels and a 5 mm x 50 mm pixel size. Our goal is to design a large area neutron detector offering higher detection efficiency and higher count-rate capability for Time-Of-Flight (TOF) neutron diffraction in Spallation Neutron Source (SNS). A ZnS/6LiF scintillator combined with a novel fiber encoding scheme was used to record the neutron events. A channel read-out-card (CROC) based digital-signal processing electronics and position-determination algorithm was applied for neutron imaging. Neutron-gamma discrimination was carried out using pulse-shape discrimination (PSD). A sandwich flat-scintillator detector can have detection efficiency close to He-3 tubes (about 10 atm). A single layer flat-scintillator detector has count rate capability of 6,500 cps/cm2, which is acceptable for powder diffractometers at SNS.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

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↗

Lowering the Energy Threshold of the CUORE Experiment: Benefits in the Surface Alpha Events Reconstruction

CUORE is a tonne-scale cryogenic experiment located at the Laboratori Nazionali del Gran Sasso that exploits bolometric technique to search for neutrinoless double beta decay of 130 Te. Thanks to its very low background and large mass, CUORE is also a powerful tool to study a broad class of phenomena, such as solar axions and WIMP scattering. The ability to conduct such sensitive searches crucially depends on the energy threshold, which has to be kept as low as possible. Here, we show how the trigger algorithm affects the sensitivity to low-energy phenomena and the interpretation of the energy spectrum. In particular, we focus on the impact that the trigger algorithm has on the identification of the coincidence events among different crystals and, consequently, on the reconstruction of the background.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

PASTA: A Parallel Sparse Tensor Algorithm Benchmark Suite

Tensor methods have gained increasingly attention from various applications, including machine learning, quantum chemistry, healthcare analytics, social network analysis, data mining, and signal processing, to name a few. Sparse tensors and their algorithms become critical to further improve the performance of these methods and enhance the interpretability of their output. This work presents a sparse tensor algorithm benchmark suite (PASTA) for single- and multi-core CPUs. To the best of our knowledge, this is the first benchmark suite for sparse tensor world. PASTA targets on: 1) helping application users to evaluate different computer systems using its representative computational workloads; 2) providing insights to better utilize existed computer architecture and systems and inspiration for the future design. This benchmark suite will be publicly released.

HPC, sparse tensor, benchmark↗

Detecting multipartite classical states and their resemblances

We study various types of multipartite states lying near the quantum-classical boundary. The so-called classical states are precisely those in which each party can perfectly identify a locally held state without disturbing the global state, a task known as nondisruptive local state identification (NDLID). We show NDLID to be closely related local broadcasting, and we introduce a class of states called generalized classical states which allow for both NDLID and multipartite broadcasting when the most general quantum measurements are permitted. Simple analytical methods and a physical criterion are given for detecting whether a multipartite state is classical or generalized classical. For deciding the latter, a semidefinite programming algorithm is presented which may find use in other fields such as signal processing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Real-Time Distribution Feeder Performance Monitoring, Advisory Control, and Health Management System

New data collection system equipment was installed in Xcel Energy substations and data was collected from 6 substations and 20 feeders. During Phase I, ABB collected and analyzed 793 real-time events to date from 6 Xcel Energy substations and continues today. The development and integration of several applications was completed during the course of this project, including a model-based faulted segment identification algorithm, with very positive results validated with field-gathered data discussed and included in this report. For mostly underground feeders, the success rate is 90% and the overreach rate is 90%. For mostly overhead feeders, the success rate is 74% and the overreach rate is 50%. The developed method is producing very accurate results for mostly underground feeders. For mostly overhead feeders, due to the bad OMS data quality and varying fault resistance when arcing, the developed method is producing good results but with much room for improvement. One area where the algorithm can be improved is the accuracy for sub-cycle fault events. In these cases, the accuracy of the conventional signal processing methods suffers due to most of these methods being based on a one-cycle processing window. By improving the signal processing accuracy, the accuracy of the faulted segment identification algorithm will also improve significantly. ABB intends to devote research in this area in the near future to help solve this problem.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Random Forests and Networks Analysis

Wilson (Proceedings of the twenty-eight annual acm symposium on the theory of computing, pp. 296–303, 1996) in the 1990s described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a powerful tool in analyzing structures on networks and along this line of thinking, in recent works (Avena and Gaudillière in A proof of the transfer-current theorem in absence of reversibility, in Stat. Probab. Lett. 142, 17–22 (2018); Avena and Gaudillière in J Theor Probab, 2017. https://doi.org/10.1007/s10959-017-0771-3 ; Avena et al. in Approximate and exact solutions of intertwining equations though random spanning forests, 2017. arXiv:1702.05992v1 ; Avena et al. in Intertwining wavelets or multiresolution analysis on graphs through random forests, 2017. arXiv:1707.04616 , to appear in ACHA (2018)) we focused on applications of spanning rooted forests on finite graphs. The resulting main conclusions are reviewed in this paper by collecting related theorems, algorithms, heuristics and numerical experiments. A first foundational part on determinantal structures and efficient sampling procedures is followed by four main applications: (1) a random-walk-based notion of well-distributed points in a graph, (2) a framework to describe metastable-like dynamics in finite settings by means of Markov intertwining dualities, (3) coarse graining schemes for networks and associated processes, (4) wavelets-like pyramidal algorithms for graph signals.

97 MATHEMATICS AND COMPUTING↗

Online Power System Event Detection via Bidirectional Generative Adversarial Networks

Accurate and speedy detection of power system events is critical to enhancing the reliability and resiliency of power systems. Although supervised deep learning algorithms show great promise in identifying power system events, they require a large volume of high-quality event labels for training. This paper develops a bidirectional anomaly generative adversarial network (GAN)-based algorithm to detect power system events using streaming PMU data, which does not rely on a huge amount of event labels. By introducing conditional entropy constraint in the objective function of GAN and graph signal processing-based PMU sorting technique, our proposed algorithm significantly outperforms state-of-the-art event detection algorithms in terms of accuracy. To facilitate the adoption of the proposed algorithm, a prototype online platform is also developed using Apache Hadoop, Kafka, and Spark to enable real-time event detection. Here, the accuracy and computational efficiency of the proposed algorithm are validated using a large-scale real-world PMU dataset from the Eastern Interconnection of the United States.

24 POWER TRANSMISSION AND DISTRIBUTION↗

X-ray scatter correction method for dedicated breast computed tomography

Purpose: To improve image quality and accuracy in dedicated breast computed tomography (BCT) by removing the x-ray scatter signal included in the BCT projections. Methods: The previously characterized magnitude and distribution of x-ray scatter in BCT results in both cupping artifacts and reduction of contrast and accuracy in the reconstructions. In this study, an image processing method is proposed that estimates and subtracts the low-frequency x-ray scatter signal included in each BCT projection postacquisition and prereconstruction. The estimation of this signal is performed using simple additional hardware, one additional BCT projection acquisition with negligible radiation dose, and simple image processing software algorithms. The high frequency quantum noise due to the scatter signal is reduced using a noise filter postreconstruction. The dosimetric consequences and validity of the assumptions of this algorithm were determined using Monte Carlo simulations. The feasibility of this method was determined by imaging a breast phantom on a BCT clinical prototype and comparing the corrected reconstructions to the unprocessed reconstructions and to reconstructions obtained from fan-beam acquisitions as a reference standard. One-dimensional profiles of the reconstructions and objective image quality metrics were used to determine the impact of the algorithm. Results: The proposed additional acquisition results in negligible additional radiation dose to the imaged breast ({approx}0.4% of the standard BCT acquisition). The processed phantom reconstruction showed substantially reduced cupping artifacts, increased contrast between adipose and glandular tissue equivalents, higher voxel value accuracy, and no discernible blurring of high frequency features. Conclusions: The proposed scatter correction method for dedicated breast CT is feasible and can result in highly improved image quality. Further optimization and testing, especially with patient images, is necessary to characterize its impact on clinical performance.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A concept for non-invasive temperature measurement during injection moulding processes

Current models of the injection moulding process insufficiently consider the thermal interactions between melt, solidified material and the mould. A detailed description requires a deep understanding of the underlying processes and a precise observation of the temperature. Because todays measurement concepts do not allow a non-invasive analysis it is necessary to find new measurement techniques for temperature measurements during the manufacturing process. In this work we present the idea of a set up for a tomographic ultrasound measurement of the temperature field inside a plastics melt. The goal is to identify a concept that can be installed on a specialized mould for the injection moulding process. The challenges are discussed and the design of a prototype is shown. Special attention is given to the spatial arrangement of the sensors. Besides the design of a measurement set up a reconstruction strategy for the ultrasound signals is required. We present an approach in which an image processing algorithm can be used to calculate a temperature distribution from the ultrasound scans. We discuss a reconstruction strategy in which the ultrasound signals are converted into a spartial temperature distribution by using pvT curves that are obtained by dilatometer measurements.

42 ENGINEERING↗

State Estimation in Low-Observable Distribution Systems Using Matrix Completion: Preprint

The need for distribution system state estimation is on the rise because of the increased penetration of distributed energy resources and flexible load. To manage the distribution systems in real time, operators need to first overcome the challenge of low observability in distribution systems. Also, because of the amount of data present from smart meters, distributed generation measurements, switches, etc., the ideal distribution state estimation methods need to be able to process heterogeneous data. In this paper, an algorithm is developed for voltage phasor estimation in low-observability distribution systems. The algorithm is based on the matrix completion approach from signal processing. The traditional matrix completion formulation is augmented with power-flow constraints to improve results while requiring less data. This method can also use all types of measurements (voltage magnitude, voltage angle, real power, reactive power) to complete the state matrix.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Extinction Monitoring of Pulsed Proton Beams Using FPGA-Based Peak Detection

The Mu2e experiment at Fermilab imposes stringent requirements on the elimination of out-of-time beam in its pulsed proton beam - a requirement known as "extinction". We present a method to measure the out-of-time particle rates to calculate the level of extinction in the inter-pulse gaps. The proposed method utilizes an array of quartz Cherenkov radiators and photomultiplier tubes to detect particles scattered from a vacuum chamber in the M4 transfer beamline at Fermilab.The measurement will employ a new μTCA-based FPGA system for data acquisition and signal processing, utilizing real-time peak detection algorithms to count scattered beam particles. By integrating data over many transfers, the time profile of the out-of-time beam will be resolved to fractional levels relative to that of the in-time beam. These results are compared with G4beamline simulations to validate models of beam transport, dynamics, and extinction, providing critical input for optimizing beam delivery to Mu2e.

Hensley, Ryan [UC, Davis]↗

Improving ICARUS track reconstruction algorithms

The ICARUS experiment is part of the Short-Baseline Neutrino program at Fermilab. Its primary objective is to explore the possible existence of sterile neutrinos in the O(1 eV) mass range and to clarify the anomalies observed in the Liquid Scintillator Neutrino Detector and MiniBooNE experiments. The ICARUS-T600 detector is a Liquid Argon Time Projection Chamber, capable of producing high-resolution 3D images and precise calorimetric measurements of ionizing particles. This technology allows for a detailed study of neutrino interactions across a broad energy range, from a few keV to several hundred GeV. The track reconstruction is achieved through a software framework that applies a series of pattern recognition algorithms, transforming raw detector signals into fully reconstructed event topologies. This process involves identifying interaction vertices, particle tracks, and electromagnetic showers within the TPC. However, in certain cases, these algorithms may mistakenly break a single particle track into several shorter segments, interpreting each as a distinct particle. Since track length is used to estimate the particle's energy, such fragmentation can result in an energy underestimation of several hundred MeV. Furthermore, when a track is split into multiple segments, the particle identification (which relies on analyzing the energy loss as a function of the residual range) may fail, potentially leading to the loss of the entire event. To mitigate this problem, we have developed a dedicated algorithm designed to identify and reconnect (“stitch”) the tracks that were erroneously divided into multiple segments.

Ricci, Alessandro Maria [Pisa U.; INFN, Pisa] (ORC↗

Data Selection Improvement For MicroBooNE

Data selection is an extremely important part of data analysis for any experiment. Finding a physics result is often the result of sifting through a massive amount of data, keeping data that we believe to be signal, and throwing out data we do not. This process is called data selection. Creating a selection algorithm is an intensive process that must balance keeping enough data to have statistics and maximizing the signal purity of that data. We also need to choose the right reconstruction method, a tool to take raw data from the detector and convert it into physics results. In this study, we used three different reconstruction tools, Pandora, WireCell, and LANTERN, for the MicroBooNE experiment in conjunction to improve the selection algorithm for analysis. For the case of this study, we look into the charged current N proton 0 pions (CCNp0$\pi$) interaction channel. This is the dominant channel for the Short Baseline Neutrino (SBN) program and is expected to be a large contributor to the Deep Underground Neutrino Experiment (DUNE). We first investigated each of the three tools to find out more about their strengths and weaknesses as reconstructions, and compared them to the truth information directly from the MicroBooNE simulation pipeline. We then put together a direct comparison of the three methods to find which method or combination of methods would return the best result for us. While the study is ongoing, we have learned a lot about data selection for the experiment and the differences between the reconstruction tools.

Dillon, Brayden [Fermilab]↗

Semantic embedding for quantum algorithms

The study of classical algorithms is supported by an immense understructure, founded in logic, type, and category theory, that allows an algorithmist to reason about the sequential manipulation of data irrespective of a computation’s realizing dynamics. As quantum computing matures, a similar need has developed for an assurance of the correctness of high-level quantum algorithmic reasoning. Parallel to this need, many quantum algorithms have been unified and improved using quantum signal processing (QSP) and quantum singular value transformation (QSVT), which characterize the ability, by alternating circuit ansätze, to transform the singular values of sub-blocks of unitary matrices by polynomial functions. However, while the algebraic manipulation of polynomials is simple (e.g., compositions and products), the QSP/QSVT circuits realizing analogous manipulations of their embedded polynomials are non-obvious. This work constructs and characterizes the runtime and expressivity of QSP/QSVT protocols where circuit manipulation maps naturally to the algebraic manipulation of functional transforms (termed semantic embedding). In this way, QSP/QSVT can be treated and combined modularly, purely in terms of the functional transforms they embed, with key guarantees on the computability and modularity of the realizing circuits. We also identify existing quantum algorithms whose use of semantic embedding is implicit, spanning from distributed search to proofs of soundness in quantum cryptography. The methods used, based in category theory, establish a theory of semantically embeddable quantum algorithms, and provide a new role for QSP/QSVT in reducing sophisticated algorithmic problems to simpler algebraic ones.

Physics↗