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 685 records · Page 38

The CMS trigger system

This paper describes the CMS trigger system and its performance during Run 1 of the LHC. The trigger system consists of two levels designed to select events of potential physics interest from a GHz (MHz) interaction rate of proton-proton (heavy ion) collisions. The first level of the trigger is implemented in hardware, and selects events containing detector signals consistent with an electron, photon, muon, τ lepton, jet, or missing transverse energy. A programmable menu of up to 128 object-based algorithms is used to select events for subsequent processing. The trigger thresholds are adjusted to the LHC instantaneous luminosity during data taking in order to restrict the output rate to 100 kHz, the upper limit imposed by the CMS readout electronics. The second level, implemented in software, further refines the purity of the output stream, selecting an average rate of 400 Hz for offline event storage. The objectives, strategy and performance of the trigger system during the LHC Run 1 are described.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

An Adaptive Multiparameter Penalty Selection Method for Multiconstraint and Multiblock ADMM

This work presents a new method for online selection of multiple penalty parameters for the alternating direction method of multipliers (ADMM) algorithm applied to optimization problems with multiple constraints or functions with block matrix components. ADMM is widely used for solving constrained optimization problems in a variety of fields, including signal and image processing. Implementations of ADMM often utilize a single hyperparameter, referred to as the penalty parameter, which needs to be tuned to control the rate of convergence. However, in problems with multiple constraints, ADMM may demonstrate slow convergence regardless of penalty parameter selection due to scale differences between constraints. Accounting for scale differences between constraints to improve convergence in these cases requires introducing a penalty parameter for each constraint. The proposed method is able to adaptively account for differences in scale between constraints, providing robustness with respect to problem transformations and initial selection of penalty parameters. It is also simple to understand and implement. Our numerical experiments demonstrate that the proposed method performs favorably compared to a variety of existing penalty parameter selection methods.

97 MATHEMATICS AND COMPUTING↗

TH-E-17A-01: Internal Respiratory Surrogate for 4D CT Using Fourier Transform and Anatomical Features

Purpose: To develop a novel algorithm to generate internal respiratory signals for sorting of four-dimensional (4D) computed tomography (CT) images. Methods: The proposed algorithm extracted multiple time resolved features as potential respiratory signals. These features were taken from the 4D CT images and its Fourier transformed space. Several low-frequency locations in the Fourier space and selected anatomical features from the images were used as potential respiratory signals. A clustering algorithm was then used to search for the group of appropriate potential respiratory signals. The chosen signals were then normalized and averaged to form the final internal respiratory signal. Performance of the algorithm was tested in 50 4D CT data sets and results were compared with external signals from the real-time position management (RPM) system. Results: In almost all cases, the proposed algorithm generated internal respiratory signals that visibly matched the external respiratory signals from the RPM system. On average, the end inspiration times calculated by the proposed algorithm were within 0.1 s of those given by the RPM system. Less than 3% of the calculated end inspiration times were more than one time frame away from those given by the RPM system. In 3 out of the 50 cases, the proposed algorithm generated internal respiratory signals that were significantly smoother than the RPM signals. In these cases, images sorted using the internal respiratory signals showed fewer artifacts in locations corresponding to the discrepancy in the internal and external respiratory signals. Conclusion: We developed a robust algorithm that generates internal respiratory signals from 4D CT images. In some cases, it even showed the potential to outperform the RPM system. The proposed algorithm is completely automatic and generally takes less than 2 min to process. It can be easily implemented into the clinic and can potentially replace the use of external surrogates.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Quantized Information in Spectral Cyberspace

The constant-Q Gabor atom is developed for spectral power, information, and uncertainty quantification from time–frequency representations. Stable multiresolution spectral entropy algorithms are constructed with continuous wavelet and Stockwell transforms. The recommended processing and scaling method will depend on the signature of interest, the desired information, and the acceptable levels of uncertainty of signal and noise features. Selected Lamb wave signatures and information spectra from the 2022 Tonga eruption are presented as representative case studies. Resilient transformations from physical to information metrics are provided for sensor-agnostic signal processing, pattern recognition, and machine learning applications.

74 ATOMIC AND MOLECULAR PHYSICS↗

Control Software for a High-Performance Telerobot

A computer program for controlling a high-performance, force-reflecting telerobot has been developed. The goal in designing a telerobot-control system is to make the velocity of the slave match the master velocity, and the environmental force on the master match the force on the slave. Instability can arise from even small delays in propagation of signals between master and slave units. The present software, based on an impedance-shaping algorithm, ensures stability even in the presence of long delays. It implements a real-time algorithm that processes position and force measurements from the master and slave and represents the master/slave communication link as a transmission line. The algorithm also uses the history of the control force and the slave motion to estimate the impedance of the environment. The estimate of the impedance of the environment is used to shape the controlled slave impedance to match the transmission-line impedance. The estimate of the environmental impedance is used to match the master and transmission-line impedances and to estimate the slave/environment force in order to present that force immediately to the operator via the master unit.

Kline-Schoder, Robert J.↗

Electronics Systems for the Gamma Ray Energy Tracking Nuclear Array (GRETA)

The Gamma Ray Energy Tracking Nuclear Array (GRETA), a 4-π germanium detector system capable of measuring energy and position (within better than 2mm rms) of gamma-ray interaction points and tracking multiple gamma-ray interactions, is being designed. GRETA is composed of 30 detector modules, each with four high purity germanium crystals. Four electronics modules will support the operation of the detectors: the Digitizer Module, the Signal Filter Board and the Trigger and Timing Modules. The Digitizer Module converts the analog information with analog to digital converters operating at 100 MS/s and sends the conversions through fiber optics to the Signal Filter Board. The Signal Filter Board digitally processes the data to determine the energy and timing information of the gamma interactions within a crystal. The Digitizer and Signal Filter Board send trigger information to the Trigger System. Different trigger algorithms for trigger decision are planned for the Trigger System. The Timing System provides the clock for the electronics systems and auxiliary detectors. In this paper we review the details of the planned GRETA Electronics System.

data acquisition↗

Enhanced Ionization Charge Identification in the Short-Baseline Neutrino Program Neutrino Detectors with Deep Neural Networks

We present a deep neural net-based region of interest detection method (DNN ROI) for signal processing in the liquid argon time projection chambers of the Short-Baseline Neutrino (SBN) Program, SBND and ICARUS. DNN ROI addresses limitations of the traditional wire-by-wire thresholding algorithm by leveraging the full two-dimensional detector readout and cross-plane matching information. To account for detector performance variations, we explore training with augmented samples. We find that DNN ROI outperforms the traditional method in both low-level ROI identification performance and high-level reconstruction metrics for high-energy cosmic and accelerator neutrino interaction products, while also being more robust against detector variations, with or without sample augmentation.

Abratenko, P. [Tufts U.]↗

Demonstration and performance of an online data selection algorithm for liquid argon time projection chambers using MicroBooNE

The MicroBooNE detector is a liquid argon time projection chamber (LArTPC) that produces three-dimensional images of particle interactions using ionization charge collected by anode wire plane arrays and scintillation light collected by a light detection system. In addition to testing long-standing experimental neutrino anomalies and performing measurements of neutrino interactions with argon nuclei using the Fermilab Booster Neutrino Beam, MicroBooNE aims to develop methodologies for rare beyond the Standard Model and off-beam physics searches. Looking ahead to the upcoming Deep Underground Neutrino Experiment (DUNE), with MicroBooNE serving as a valuable testbed, achieving high sensitivity and livetime for off-beam physics while satisfying data processing and storage constraints will require data-driven, intelligent, and online or real-time data selection techniques. These techniques are essential for reducing data rates and preserving rare signals with high accuracy. In this paper, we describe a fast data selection algorithm suitable for online execution to identify electrons from stopping cosmic ray muons in the MicroBooNE detector utilizing ionization charge information, and present its performance. This represents the first demonstration of online data selection in a LArTPC using real data and charge information exclusively and provides an important proof-of-principle for applying such techniques to other LArTPC experiments such as the Short-Baseline Near Detector and DUNE.

Abratenko, P. [Tufts U. (main)]↗

Scanning ARM Cloud Radars. Part II: Data Quality Control and Processing

The Scanning ARM Cloud Radars (SACR’s) are the primary instruments for documenting the four-dimensional structure and evolution of clouds within a 20-30 km radius from the ARM fixed and mobile sites. Here, the post-processing of the calibrated SACR measurements is discussed. First, a feature mask algorithm that objectively determines the presence of significant radar returns is described. The feature mask algorithm is based on the statistical properties of radar receiver noise. It accounts for atmospheric emission and is applicable even for SACR profiles with few or no signal-free range gates. Using the nearest-in-time atmospheric sounding, the SACR radar reflectivities are corrected for gaseous attenuation (water vapor and oxygen) using a line-by-line absorption model. Despite having a high pulse repetition frequency, the SACR has a narrow Nyquist velocity limit and thus Doppler velocity folding is commonly observed. An unfolding algorithm that makes use of a first guess for the true Doppler velocity using horizontal wind measurements from the nearest sounding is described. The retrieval of the horizontal wind profile from the HS-RHI SACR scan observations and/or nearest sounding is described. The retrieved horizontal wind profile can be used to adaptively configure SACR scan strategies that depend on wind direction. Several remaining challenges are discussed, including the removal of insect and second-trip echoes. The described algorithms significantly enhance SACR data quality and constitute an important step towards the utilization of SACR measurements for cloud research.

climate↗

Mapping Diffuse Seismicity for Geothermal Reservoir Management with Matched Field Processing: Year 2 Report

Detecting and locating seismic events in managed underground geothermal reservoirs can become increasingly difficult during certain reservoir management operations. For example, during fluid injection procedures, large numbers of microearthquakes frequently occur during a relatively short amount of time. On seismic records, these events can overlap or have poor signal-to-noise ratios (SNR). This can obscure the onset of smaller signals and complicate the picking of seismic phases needed for earthquake location algorithms. To accurately illuminate the active areas of the underground reservoir through time however, a complete earthquake catalog down to very small magnitudes is necessary. To aid in the seismic characterization of reservoir fracture networks, we propose to complement traditional earthquake detection and location techniques with the empirical matched field processing (MFP) method. The principle of the empirical MFP method is to calculate propagation from source to receivers for pre-existing events, also called master templates. Then MFP matches the spatial structure of incoming seismicity observed by a network of sensors to master templates keyed to potential event locations. We demonstrate that empirical MFP can complement existing catalogs and techniques by using archived seismic information to increase earthquake catalog completeness. We identify and construct representative master templates using the Southern California Earthquake Data Center (SCEDC) earthquake catalog and archived waveform data of events originating within the Salton Sea Geothermal Field (SSGF). We identify 231 master events that have good quality seismic records at four or more seismic stations. We apply the empirical MFP method to continuous seismic data collected at the SSGF between November 2009 and December 2010. The MFP method successfully identified 5357 local events, while the original catalog only reported 1536 events. This increase in the number of events allows us to better determine the active fractures of the geothermal reservoir. We model the Coulomb stress change due to events between M2 – M3.5 that occurred during the January 2010 seismic swarm. Our results show a good correlation between regions of increased Coulomb stress change due to double-couple shear events on faults and the locations of subsequent microseismicity. In addition, we investigate the lower event detection magnitude threshold of our surface network using the MFP method. It clearly shows the event detection threshold is extended to include many smaller earthquakes with magnitudes down to M0.0. Therefore, we believe that the empirical MFP method, when combined with conventional methods, significantly improves network detection capabilities.

15 GEOTHERMAL ENERGY↗

TU-CD-BRB-10: 18F-FDG PET Image-Derived Tumor Features Highlight Altered Pathways Identified by Trancriptomic Analysis in Head and Neck Cancer

Purpose: Several quantitative features can be extracted from 18F-FDG PET images, such as standardized uptake values (SUVs), metabolic tumor volume (MTV), shape characterization (SC) or intra-tumor radiotracer heterogeneity quantification (HQ). Some of these features calculated from baseline 18F-FDG PET images have shown a prognostic and predictive clinical value. It has been hypothesized that these features highlight underlying tumor patho-physiological processes at smaller scales. The objective of this study was to investigate the ability of recovering alterations of signaling pathways from FDG PET image-derived features. Methods: 52 patients were prospectively recruited from two medical centers (Brest and Poitiers). All patients underwent an FDG PET scan for staging and biopsies of both healthy and primary tumor tissues. Biopsies went through a transcriptomic analysis performed in four spates on 4×44k chips (Agilent™). Primary tumors were delineated in the PET images using the Fuzzy Locally Adaptive Bayesian algorithm and characterized using 10 features including SUVs, SC and HQ. A module network algorithm followed by functional annotation was exploited in order to link PET features with signaling pathways alterations. Results: Several PET-derived features were found to discriminate differentially expressed genes between tumor and healthy tissue (fold-change >2, p<0.01) into 30 co-regulated groups (p<0.05). Functional annotations applied to these groups of genes highlighted associations with well-known pathways involved in cancer processes, such as cell proliferation and apoptosis, as well as with more specific ones such as unsaturated fatty acids. Conclusion: Quantitative features extracted from baseline 18F-FDG PET images usually exploited only for diagnosis and staging, were identified in this work as being related to specific altered pathways and may show promise as tools for personalizing treatment decisions.

60 APPLIED LIFE SCIENCES↗

DFTT report for Signal Analysis (2023)

The Detection Framework Testbed and Toolkit (DFTT) is a database and associated java programs intended to facilitate the development and testing of algorithms for operating suites of correlation and subspace detectors. This framework is a generalization of the system described in Harris and Dodge (2011) and Dodge and Harris (2016). DFTT allows retrospective processing of sequences of data using various system configurations. Results are saved in a database, so it is easy to compare the results obtained using different configurations of the system. The principal software components of DFTT are the ConfigCreator, the framework_runner and the Builder program. ConfigCreator assembles the files necessary to define a particular configuration used for processing. The framework_runner operates suites of detectors and saves the results in an Oracle™ database. Builder allows visual examination of templates and detected signals and allows editing and creation of detectors. In addition, there are tools for importing continuous data into the database. DFTT is licensed under the MIT license and has LLNL release number LLNL-CODE-801881. In the current fiscal year DFTT has been used in two different projects. The first (NTL-funded) project investigates the feasibility of screening nuisance detections using correlation detectors. The second (GNEM-funded) project seeks to extend the results of Harris and Dodge (2021) to 3- D sources and multiple stations. Each of these efforts required that additional functionality be added to DFTT. In this report I will summarize the enhancements to DFTT in the context of the relevant research effort.

58 GEOSCIENCES↗

A general framework of noise suppression in material decomposition for dual-energy CT

Purpose: As a general problem of dual-energy CT (DECT), noise amplification in material decomposition severely reduces the signal-to-noise ratio on the decomposed images compared to that on the original CT images. In this work, the authors propose a general framework of noise suppression in material decomposition for DECT. The method is based on an iterative algorithm recently developed in their group for image-domain decomposition of DECT, with an extension to include nonlinear decomposition models. The generalized framework of iterative DECT decomposition enables beam-hardening correction with simultaneous noise suppression, which improves the clinical benefits of DECT. Methods: The authors propose to suppress noise on the decomposed images of DECT using convex optimization, which is formulated in the form of least-squares estimation with smoothness regularization. Based on the design principles of a best linear unbiased estimator, the authors include the inverse of the estimated variance–covariance matrix of the decomposed images as the penalty weight in the least-squares term. Analytical formulas are derived to compute the variance–covariance matrix for decomposed images with general-form numerical or analytical decomposition. As a demonstration, the authors implement the proposed algorithm on phantom data using an empirical polynomial function of decomposition measured on a calibration scan. The polynomial coefficients are determined from the projection data acquired on a wedge phantom, and the signal decomposition is performed in the projection domain. Results: On the Catphan{sup ®}600 phantom, the proposed noise suppression method reduces the average noise standard deviation of basis material images by one to two orders of magnitude, with a superior performance on spatial resolution as shown in comparisons of line-pair images and modulation transfer function measurements. On the synthesized monoenergetic CT images, the noise standard deviation is reduced by a factor of 2–3. By using nonlinear decomposition on projections, the authors’ method effectively suppresses the streaking artifacts of beam hardening and obtains more uniform images than their previous approach based on a linear model. Similar performance of noise suppression is observed in the results of an anthropomorphic head phantom and a pediatric chest phantom generated by the proposed method. With beam-hardening correction enabled by their approach, the image spatial nonuniformity on the head phantom is reduced from around 10% on the original CT images to 4.9% on the synthesized monoenergetic CT image. On the pediatric chest phantom, their method suppresses image noise standard deviation by a factor of around 7.5, and compared with linear decomposition, it reduces the estimation error of electron densities from 33.3% to 8.6%. Conclusions: The authors propose a general framework of noise suppression in material decomposition for DECT. Phantom studies have shown the proposed method improves the image uniformity and the accuracy of electron density measurements by effective beam-hardening correction and reduces noise level without noticeable resolution loss.

60 APPLIED LIFE SCIENCES↗

Roadmap for unconventional computing with nanotechnology

Abstract In the ‘Beyond Moore’s Law’ era, with increasing edge intelligence, domain-specific computing embracing unconventional approaches will become increasingly prevalent. At the same time, adopting a variety of nanotechnologies will offer benefits in energy cost, computational speed, reduced footprint, cyber resilience, and processing power. The time is ripe for a roadmap for unconventional computing with nanotechnologies to guide future research, and this collection aims to fill that need. The authors provide a comprehensive roadmap for neuromorphic computing using electron spins, memristive devices, two-dimensional nanomaterials, nanomagnets, and various dynamical systems. They also address other paradigms such as Ising machines, Bayesian inference engines, probabilistic computing with p-bits, processing in memory, quantum memories and algorithms, computing with skyrmions and spin waves, and brain-inspired computing for incremental learning and problem-solving in severely resource-constrained environments. These approaches have advantages over traditional Boolean computing based on von Neumann architecture. As the computational requirements for artificial intelligence grow 50 times faster than Moore’s Law for electronics, more unconventional approaches to computing and signal processing will appear on the horizon, and this roadmap will help identify future needs and challenges. In a very fertile field, experts in the field aim to present some of the dominant and most promising technologies for unconventional computing that will be around for some time to come. Within a holistic approach, the goal is to provide pathways for solidifying the field and guiding future impactful discoveries.

Finocchio, Giovanni (ORCID:0000000210433876)↗

Automated flaw detection scheme for cast austenitic stainless steel weld specimens using Hilbert-Huang transform of ultrasonic phased array data

The objective of this work is to develop processing algorithms to detect and localize flaws using ultrasonic phased-array data. Data was collected on cast austenitic stainless stell (CASS) weld specimens onloan from the U.S. nuclear power industry' Pressurized Walter Reactor Owners Group (PWROG) traveling specimen set. Each specimen consists of a centrifugally cast stainless stell (CCSS) pipe section welded to a statically cst(SCSS) or wrought (WRSS) section. The paper presents a novel automated flaw detection and localization scheme using low frequency ultrasonic phased array inspection singals from the weld and heat affected zone of the based materials. The major steps of the overall scheme are preprocessing and region of interest (ROI) detection followed by the Hilbert-Huang transform (HHT) of A-scans in the detected ROIs. HHT offers time-frequency-energy distribution for each ROI. The Accumulation of energy in a particular frequency band is used as a classification feature for the particular ROI.

36 MATERIALS SCIENCE↗

Cloud properties derived from two lidars over the ARM SGP site

[1] Active remote sensors such as lidars or radars can be used with other data to quantify the cloud properties at regional scale and at global scale (Dupont et al., 2009). Relative to radar, lidar remote sensing is sensitive to very thin and high clouds but has a significant limitation due to signal attenuation in the ability to precisely quantify the properties of clouds with a 20 cloud optical thickness larger than 3. In this study, 10-years of backscatter lidar signal data are analysed by a unique algorithm called STRucture of ATmosphere (STRAT, Morille et al., 2007). We apply the STRAT algorithm to data from both the collocated Micropulse lidar (MPL) and a Raman lidar (RL) at the Atmospheric Radiation Measurement (ARM) Southern Great Plains (SGP) site between 1998 and 2009. Raw backscatter lidar signal is processed and 25 corrections for detector deadtime, afterpulse, and overlap are applied. (Campbell et al.) The cloud properties for all levels of clouds are derived and distributions of cloud base height (CBH), top height (CTH), physical cloud thickness (CT), and optical thickness (COT) from local statistics are compared. The goal of this study is (1) to establish a climatology of macrophysical and optical properties for all levels of clouds observed over the ARM SGP site 30 and (2) to estimate the discrepancies induced by the two remote sensing systems (pulse energy, sampling, resolution, etc.). Our first results tend to show that the MPLs, which are the primary ARM lidars, have a distinctly limited range where all of these cloud properties are detectable, especially cloud top and cloud thickness, but even actual cloud base especially during summer daytime period. According to the comparisons between RL and MPL, almost 50% of situations show a signal to noise ratio too low (smaller than 3) for the MPL in order to detect clouds higher than 7km during daytime period in summer. Consequently, the MPLderived annual cycle of cirrus cloud base (top) altitude is biased low, especially for daylight periods, compared with those derived from the RL data, which detects 5 cloud base ranging from 7.5 km in winter to 9.5 km in summer (and tops ranging from 8.6 to 10.5 km). The optically thickest cirrus clouds (COT>0.3) reach 50% of the total population for the Raman lidar and only 20% for the Micropulse lidar due to the difference of pulse energy and the effect of solar irradiance contamination. A complementary study using the cloud fraction 10 derived from the Micropulse lidar for clouds below 5 km and from the Raman lidar for cloud above 5 km allows for better estimation of the total cloud fraction between the ground and the top of the atmosphere. This study presents the diurnal cycle of cloud fraction for each season in comparisons with the Long et al. (2006) cloud fraction calculation derived from radiative flux analysis.

54 ENVIRONMENTAL SCIENCES↗

Signal discrimination for neutron-antineutron oscillation sensitivity study at DUNE

The Deep Underground Neutrino Experiment (DUNE) aims to measure neutrino oscillations as well as search for beyond the standard model physics such as baryon number violating (BNV) processes. DUNE will use a 70 kt Liquid Argon Time Projection Chamber (LArTPC) located more than 1 km underground. A promising BNV process is neutron-antineutron oscillation $\left(n\rightarrow\bar{n}\right)$ which, if discovered, would offer unique insight into the baryon asymmetry of the universe. We are developing a classification algorithm that separates $n\rightarrow\bar{n}$ events from major background atmospheric neutrino interactions using DUNE far detector simulations. We will perform the classification of signals and backgrounds by analyzing key features such as the multiplicity, isotropy, and kinematics of the reconstructed events. In the future, this algorithm can be used to obtain the sensitivity of the DUNE detectors to the neutron-antineutron oscillation lifetime.

Wheeler, Justin↗

MONACO: accurate biological network alignment through optimal neighborhood matching between focal nodes

Motivation: Alignment of protein–protein interaction networks can be used for the unsupervised prediction of functional modules, such as protein complexes and signaling pathways, that are conserved across different species. To date, various algorithms have been proposed for biological network alignment, many of which attempt to incorporate topological similarity between the networks into the alignment process with the goal of constructing accurate and biologically meaningful alignments. Especially, random walk models have been shown to be effective for quantifying the global topological relatedness between nodes that belong to different networks by diffusing node-level similarity along the interaction edges. However, these schemes are not ideal for capturing the local topological similarity between nodes. Results: Here, we propose MONACO, a novel and versatile network alignment algorithm that finds highly accurate pairwise and multiple network alignments through the iterative optimal matching of ‘local’ neighborhoods around focal nodes. Extensive performance assessment based on real networks as well as synthetic networks, for which the ground truth is known, demonstrates that MONACO clearly and consistently outperforms all other state-of-the-art network alignment algorithms that we have tested, in terms of accuracy, coherence and topological quality of the aligned network regions. Furthermore, despite the sharply enhanced alignment accuracy, MONACO remains computationally efficient and it scales well with increasing size and number of networks.

97 MATHEMATICS AND COMPUTING↗