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 415 records · Page 23

Detection of Modified Matrix Encoding Using Machine Learning and Compressed Sensing

In recent years, driven by the development of steganalysis methods, steganographic algorithms have been evolved rapidly with the ultimate goal of an unbreakable embedding procedure, resulting in recent steganographic algorithms with minimum distortions, exemplified by the recent family of Modified Matrix Encoding (MME) algorithms, which has shown to be most difficult to be detected. In this paper we propose a compressed sensing based on approach for intrinsic steganalysis to detect MME stego messages. Compressed sensing is a recently proposed mathematical framework to represent an image (in general, a signal) using a sparse representation relative to an overcomplete dictionary by minimizing the l1-norm of resulting coefficients. Here we first learn a dictionary from a training set so that the performance will be optimized using the KSVD algorithm; since JPEG images are processed by 8x8 blocks, the training examples are 8x8 patches, rather than the entire images and this increases the generalization of compressed sensing. For each 8x8 block, we compute its sparse representation using OMP (orthogonal matching pursuit) algorithm. Using computed sparse representations, we train a support vector machine (SVM) to classify 8x8 blocks into stego and non-stego classes. Then given an input image, we first divide it into 8x8 blocks. For each 8x8 block, we compute its sparse representation and classify it using the trained SVM. After all the 8x8 blocks are classified, the entire image is classified based on the majority rule of 8x8 block classification results. This allows us to achieve a robust decision even when 8x8 blocks can be classified only with relatively low accuracy. We have tested the proposed algorithm on two datasets (Corel-1000 dataset and a remote sensing image dataset) and have achieved 100% accuracy on classifying images, even though the accuracy of classifying 8x8 blocks is only 80.89%. Key Words Compressed Sensing, Sparcity, Data Dictionary, Steganography, steganalysis

Allen, Josef D↗

Development of a pattern recognition algorithm for reconstructing multi-particle events in the Mu2e detector

Mu2e is an upcoming experiment at Fermilab and its main goal is to search for the Charged Lepton Flavor Violation (CLFV) in the coherent transition of a muon into an electron on an Al target. In Mu2e, multi-particle events can occur simultaneously within the same time region and it is crucial to accurately identify each particle track, including signals, to improve the robustness of track finding methods and enhance reconstruction efficiency. ¯p annihilation is one of the background events and produces multiple particles that can mimic signal events. Additionally, photons from radiative pion captures can produce a γ → $e+e−$ pair, which can be used to calibrate the Mu2e momentum scale and the resolution. The Mu2e track reconstruction sequence begins by grouping hits produced in the tracker based on time and z coordinate information, called TimeCluster, and selected hits are processed to reconstruct helices and determine their momentum. The current pattern recognition algorithms identify a single helix per TimeCluster for single track events. A new pattern recognition algorithm is being developed to reconstruct multi-particle events and its features for finding multiple tracks and the current evaluation results are reported.

Kitagawa, H. [Pisa U.]↗

Bayesian K-SVD Using Fast Variational Inference

Recent work in signal processing in general and image processing in particular deals with sparse representation related problems. Two such problems are of paramount importance: an overriding need for designing a well-suited overcomplete dictionary containing a redundant set of atoms— i.e., basis signals—and how to find a sparse representation of a given signal with respect to the chosen dictionary. Dictionary learning techniques, among which we find the popular K-singular value decomposition algorithm, tackle these problems by adapting a dictionary to a set of training data. A common drawback of such techniques is the need for parameter-tuning. In order to overcome this limitation, we propose a fullyautomated Bayesian method that considers the uncertainty of the estimates and produces a sparse representation of the data without prior information on the number of non-zeros in each representation vector. We follow a Bayesian approach that uses a three-tiered hierarchical prior to enforce sparsity on the representations and develop an efficient variational inference framework that reduces computational complexity. Furthermore, we describe a greedy approach that speeds up the whole process. Lastly, we present experimental results that show superior performance on two different applications with real images: denoising and inpainting.

97 MATHEMATICS AND COMPUTING↗

Automated Classification of Vehicle Movements at Signalized Intersections Using Vehicle Trajectories

Accurate vehicle movement classification through signalized intersections is of paramount importance to the analysis of intersection performance and the optimization of traffic control strategies. Conventional techniques for tracking vehicle turning movements depend on infrastructure-based strategies like human counts, loop detectors, and video analytics, all of which are costly, prone to errors, and spatially constrained. High-frequency trajectory data can be utilized to determine vehicle movement patterns in a scalable and infrastructure-independent method due to the adoption of connected vehicles (CVs). In recent years, several studies have utilized connected vehicle data to generate performance measures. Most of the trajectory-based performance measures approaches, however, require map matching-i.e., extracting geospatial references from maps to identify the movements that individual vehicles make at a signalized intersection. These approaches are often time-consuming and hinder scalability since geographic features need to be provided for an analysis to be conducted. Map matching methods are prone to errors as different map versions change these geographic features. This research presents a novel automatic classification pipeline that uses CV trajectory data to classify vehicle movements at signalized crossings, specifically pass-through left-turn and right-turn maneuvers. The process starts by filtering trips that cross a spatial bounding box that has been defined at the target intersection. Approach and departure headings for each trajectory crossing the boundary are computed and are clustered together to identify dominant movements. The proposed algorithm is used to classify the movement of vehicles at 10 intersections in the state of California, and the results indicate that the algorithm can classify movements at these intersections with varying traffic volumes and road network configurations, all in a map-less framework with no need for conflation of vehicle trajectories to a digital base map.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Investigation of a digitizer for the plastic scintillation detectors of time-of-flight mass measurements

A CAEN DT5742 digitizer has been investigated to process the fast signals from the photomultiplier tubes of the time-of-flight detectors for fast ion beams. A test setup consisting of two plastic scintillation detectors and a pulsed laser source provided signals which were recorded by the digitizer and systematically analyzed with different algorithms to derive the amplitude, rise time and arrival time of the detection signal. To obtain the best amplitude and time resolutions, various optimization techniques including peak fitting and signal smoothing, interpolation improvement, and time-walk correction by amplitude and rise time have been performed and compared in detail. Here we compared the time resolutions obtained by three digital algorithms of leading-edge, zero-crossing constant-fraction (ZC-CFD) and direct constant-fraction discriminations. Finally, we found that the best time-of-flight resolution between two PMTs can be achieved as 12 ps by the method using sample minimum for peak location and using the time-walk-resistant ZC-CFD with 4-point interpolation for timing.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Coincidence ion imaging with a fast frame camera

A new time- and position-sensitive particle detection system based on a fast frame CMOS (complementary metal-oxide semiconductors) camera is developed for coincidence ion imaging. The system is composed of four major components: a conventional microchannel plate/phosphor screen ion imager, a fast frame CMOS camera, a single anode photomultiplier tube (PMT), and a high-speed digitizer. The system collects the positional information of ions from a fast frame camera through real-time centroiding while the arrival times are obtained from the timing signal of a PMT processed by a high-speed digitizer. Multi-hit capability is achieved by correlating the intensity of ion spots on each camera frame with the peak heights on the corresponding time-of-flight spectrum of a PMT. Efficient computer algorithms are developed to process camera frames and digitizer traces in real-time at 1 kHz laser repetition rate. We demonstrate the capability of this system by detecting a momentum-matched co-fragments pair (methyl and iodine cations) produced from strong field dissociative double ionization of methyl iodide.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Essential Signal Simulation Enabled by Netlist Transforms (ESSENT) v1.0

Hardware simulation is an indispensable tool for designing chips as well as researching future architectures. Unfortunately, the slow rate of simulation can often bottleneck the design process, as designers must wait to see the results of a simulation before changing the design and starting a new simulation. The Essential Signal Simulation Enabled by Netlist Transforms (ESSENT) is a tool designed to accelerate hardware simulations. ESSENT takes in a design, uses graph algorithms to identify opportunities for conditional execution, and generates a simulator that leverages these opportunities. The generated simulator produces the exact same simulation results that would be returned by an unoptimized simulator, but in substantially less time. For input, ESSENT takes in designs formatted in FIRRTL (an open format).

Beamer, Scott↗

Infinite quantum signal processing

Quantum signal processing (QSP) represents a real scalar polynomial of degree d using a product of unitary matrices of size 2 × 2 , parameterized by ( d + 1 ) real numbers called the phase factors. This innovative representation of polynomials has a wide range of applications in quantum computation. When the polynomial of interest is obtained by truncating an infinite polynomial series, a natural question is whether the phase factors have a well defined limit as the degree d → ∞ . While the phase factors are generally not unique, we find that there exists a consistent choice of parameterization so that the limit is well defined in the ℓ 1 space. This generalization of QSP, called the infinite quantum signal processing, can be used to represent a large class of non-polynomial functions. Our analysis reveals a surprising connection between the regularity of the target function and the decay properties of the phase factors. Our analysis also inspires a very simple and efficient algorithm to approximately compute the phase factors in the ℓ 1 space. The algorithm uses only double precision arithmetic operations, and provably converges when the ℓ 1 norm of the Chebyshev coefficients of the target function is upper bounded by a constant that is independent of d . This is also the first numerically stable algorithm for finding phase factors with provable performance guarantees in the limit d → ∞ .

Dong, Yulong [Department of Mathematics, Universit↗

Liquid argon TPC signal formation, signal processing and reconstruction techniques

This document describes a reconstruction chain that was developed for the ArgoNeuT and MicroBooNE experiments at Fermilab. These experiments study accelerator neutrino interactions that occur in a Liquid Argon Time Projection Chamber. Reconstructing the properties of particles produced in these interactions benefits from the knowledge of the micro-physics processes that affect the creation and transport of ionization electrons to the readout system. A wire signal deconvolution technique was developed to convert wire signals to a standard form for hit reconstruction, to remove artifacts in the electronics chain and to remove coherent noise. A unique clustering algorithm reconstructs line-like trajectories and vertices in two dimensions which are then matched to create of 3D objects. In conclusion, these techniques and algorithms are available to all experiments that use the LArSoft suite of software.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Abridged spectral matrix inversion: parametric fitting of X-ray fluorescence spectra following integrative data reduction

Recent improvements in both X-ray detectors and readout speeds have led to a substantial increase in the volume of X-ray fluorescence data being produced at synchrotron facilities. This in turn results in increased challenges associated with processing and fitting such data, both temporally and computationally. Herein an abridging approach is described that both reduces and partially integrates X-ray fluorescence (XRF) data sets to obtain a fivefold total improvement in processing time with negligible decrease in quality of fitting. The approach is demonstrated using linear least-squares matrix inversion on XRF data with strongly overlapping fluorescent peaks. This approach is applicable to any type of linear algebra based fitting algorithm to fit spectra containing overlapping signals wherein the spectra also contain unimportant (non-characteristic) regions which add little (or no) weight to fitted values, e.g. energy regions in XRF spectra that contain little or no peak information.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A Method to Extract the Charge Distribution Arriving at the TPC Wire Planes in MicroBooNE

In this technote, we describe the concept and general strategy of LArTPC drifted-charge extraction, which converts the raw digitized TPC waveform to the number of ionized electrons passing through the wire plane at a given time. The proper recovery of the number of ionized electrons from all wire planes is important to the success of the subsequent reconstruction algorithms. A number of building blocks for the processing algorithm are described and characterized. An example of implementation of the algorithm was realized inside the Wire-Cell reconstruction package. The performance was qualitatively illustrated on MicroBooNE data with event display pictures, which shows significant improvements. Some metrics to evaluate the performance of the TPC signal extraction procedure are described. Next steps towards the quantification of the effect of the proposed concept and optimization of the procedure are outlined.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Method of detecting system function by measuring frequency response

Real-time battery impedance spectrum is acquired using a one-time record. Fast Summation Transformation (FST) is a parallel method of acquiring a real-time battery impedance spectrum using a one-time record that enables battery diagnostics. An excitation current to a battery is a sum of equal amplitude sine waves of frequencies that are octave harmonics spread over a range of interest. A sample frequency is also octave and harmonically related to all frequencies in the sum. The time profile of this signal has a duration that is a few periods of the lowest frequency. The voltage response of the battery, average deleted, is the impedance of the battery in the time domain. Since the excitation frequencies are known and octave and harmonically related, a simple algorithm, FST, processes the time record by rectifying relative to the sine and cosine of each frequency. Another algorithm yields real and imaginary components for each frequency.

25 ENERGY STORAGE↗

Method, system and computer-readable media for measuring impedance of an energy storage device

Real-time battery impedance spectrum is acquired using a one-time record. Fast Summation Transformation (FST) is a parallel method of acquiring a real-time battery impedance spectrum using a one-time record that enables battery diagnostics. An excitation current to a battery is a sum of equal amplitude sine waves of frequencies that are octave harmonics spread over a range of interest. A sample frequency is also octave and harmonically related to all frequencies in the sum. A time profile of this sampled signal has a duration that is a few periods of the lowest frequency. A voltage response of the battery, average deleted, is an impedance of the battery in a time domain. Since the excitation frequencies are known and octave and harmonically related, a simple algorithm, FST, processes the time profile by rectifying relative to sine and cosine of each frequency. Another algorithm yields real and imaginary components for each frequency.

25 ENERGY STORAGE↗

An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations

We propose an efficient block-encoding technique for the implementation of the Linear Combination of Hamiltonian Simulations (LCHS) for simulating dissipative initial-value problems. This algorithm approximates a target nonunitary operator as a weighted sum of Hamiltonian evolutions, thereby emulating a dissipative problem by mixing various time scales. We introduce an efficient encoding of the LCHS into a quantum circuit based on a simple coordinate transformation that turns the dependence on the summation index into a trigonometric function. Classically, this method is equivalent to the use of a highly accurate Fejér-Clenshaw-Curtis quadrature formula. Quantumly, this significantly simplifies block-encoding of a dissipative problem and allows one to perform an exponential number of Hamiltonian simulations by a single Quantum Signal Processing (QSP) circuit. The resulting LCHS circuit has high success probability and the selector scales logarithmically with the number of terms in the LCHS sum and linearly with time. Careful analysis of error convergence proves that this method is more efficient than other LCHS circuits that have recently appeared in the literature. We verify the quantum circuit and its scaling by simulating it on a digital emulator of fault-tolerant quantum computers and, as a test problem, solve the advection-diffusion equation. The proposed algorithm can be used for simulating a wide class of nonunitary initial-value problems including the Liouville equation with added dissipation and linear embeddings of nonlinear systems, such as the Koopman-von Neumann and Carleman embeddings.

Novikau, I [Lawrence Livermore National Laboratory↗

Enhancement of THz generation by feedback-optimized wavefront manipulation

Here, we apply active feedback optimization methods to pyroelectric measurements of a THz signal generated by four wave mixing in air using 1 mJ to 12 mJ, 35 fs laser pulses operating at 1/2 kHz repetition rate. A genetic algorithm, using the THz signal as a figure of merit, determines the voltage settings to a deformable mirror and results in up to a 6 fold improvement in the THz signal compared with settings optimized for the best focus. It is possible to optimize for different THz generation processes using this technique.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SU-E-I-92: Is Photon Starvation Preventing Metal Artifact Reduction Algorithm From Working in KVCT?

Purpose: High density/high atomic number metallic objects create shading and streaking metal artifacts in the CT image that can cause inaccurate delineation of anatomical structures or inaccurate radiation dose calculation. A modified iterative maximum-likelihood polychromatic algorithm for CT (mIMPACT) that models the energy response of detectors, photon interaction processes and beam polychromaticity has successfully reduced metal artifacts in MVCT. Our extension of mIMPACT in kVCT did not significantly reduce metal artifacts for high density metal like steel. We hypothesize that photon starvation may result in the measured data in a commercial kVCT imaging beam. Methods: We measured attenuation of a range of steel plate thicknesses, sandwiched between two 12cm thick solid water blocks, using a Phillips Big Bore CTTM scanner in scout acquisition mode with 120kVp and 200mAs. The transmitted signal (y) was normalized to the air scan signal (y{sub 0}) to get attenuation [i.e., ln(y/y{sub 0})] data for a detector. Results: Below steel plate thickness of 13.4mm, the variations in measured attenuation as a function of view number are characterized by a quantum noise and show increased attenuation with metal thickness. On or above this thickness the attenuation shows discrete levels in addition to the quantum noise. Some views have saturated attenuation value. The histograms of the measured attenuation for up to 36.7mm of steel show this trend. The detector signal is so small that the quantization levels in the analog to digital (A-to-D) converter are visible, a clear indication of photon starvation. Conclusion: Photons reaching the kVCT detector after passing through a thick metal plate are either so low in number that the signal measured has large quantum noise, or are completely absorbed inside the plate creating photon starvation. This is un-interpretable by the mIMPACT algorithm and cannot reduce metal artifacts in kVCT for certain realistic thicknesses of steel hip implants. Moti Raj Paudel is supported by the Vanier Canada Graduate Scholarship, the Endowed Graduate Scholarship in Oncology and the Dissertation Fellowship at the University of Alberta. The authors acknowledge the CIHR operating grant number MOP 53254.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Separating gravitational wave signals from instrument artifacts

Central to the gravitational wave detection problem is the challenge of separating features in the data produced by astrophysical sources from features produced by the detector. Matched filtering provides an optimal solution for Gaussian noise, but in practice, transient noise excursions or ''glitches'' complicate the analysis. Detector diagnostics and coincidence tests can be used to veto many glitches which may otherwise be misinterpreted as gravitational wave signals. The glitches that remain can lead to long tails in the matched filter search statistics and drive up the detection threshold. Here we describe a Bayesian approach that incorporates a more realistic model for the instrument noise allowing for fluctuating noise levels that vary independently across frequency bands, and deterministic glitch fitting using wavelets as glitch templates, the number of which is determined by a transdimensional Markov chain Monte Carlo algorithm. We demonstrate the method's effectiveness on simulated data containing low amplitude gravitational wave signals from inspiraling binary black-hole systems, and simulated nonstationary and non-Gaussian noise comprised of a Gaussian component with the standard LIGO/Virgo spectrum, and injected glitches of various amplitude, prevalence, and variety. Glitch fitting allows us to detect significantly weaker signals than standard techniques.

79 ASTRONOMY AND ASTROPHYSICS↗