Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 145 records · Page 8

Stack filter classifiers

Just as linear models generalize the sample mean and weighted average, weighted order statistic models generalize the sample median and weighted median. This analogy can be continued informally to generalized additive modeels in the case of the mean, and Stack Filters in the case of the median. Both of these model classes have been extensively studied for signal and image processing but it is surprising to find that for pattern classification, their treatment has been significantly one sided. Generalized additive models are now a major tool in pattern classification and many different learning algorithms have been developed to fit model parameters to finite data. However Stack Filters remain largely confined to signal and image processing and learning algorithms for classification are yet to be seen. This paper is a step towards Stack Filter Classifiers and it shows that the approach is interesting from both a theoretical and a practical perspective.

99 GENERAL AND MISCELLANEOUS↗

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↗

K-space algorithmic reconstruction (KAREN): a robust statistical methodology to separate Bragg and diffuse scattering

Diffuse scattering occurring in the Bragg diffraction pattern of a long-range-ordered structure represents local deviation from the governing regular lattice. However, interpreting the real-space structure from the diffraction pattern presents a significant challenge because of the dramatic difference in intensity between the Bragg and diffuse components of the total scattering function. In contrast to the sharp Bragg diffraction, the diffuse signal has generally been considered to be a weak expansive or continuous background signal. In this paper, using 1D and 2D models, it is demonstrated that diffuse scattering in fact consists of a complex array of high-frequency features that must not be averaged into a low-frequency background signal. To evaluate the actual diffuse scattering effectively, an algorithm has been developed that uses robust statistics and traditional signal processing techniques to identify Bragg peaks as signal outliers which can be removed from the overall scattering data and then replaced by statistically valid fill values. This method, described as a 'K-space algorithmic reconstruction' (KAREN), can identify Bragg reflections independent of prior knowledge of a system's unit cell. KAREN does not alter any data other than that in the immediate vicinity of the Bragg reflections, and reconstructs the diffuse component surrounding the Bragg peaks without introducing discontinuities which induce Fourier ripples or artifacts from underfilling `punched' voids. The KAREN algorithm for reconstructing diffuse scattering provides demonstrably better resolution than can be obtained from previously described punch-and-fill methods. The superior structural resolution obtained using the KAREN method is demonstrated by evaluating the complex ordered diffuse scattering observed from the neutron diffraction of a single plastic crystal of CBr 4 using pair distribution function analysis.

36 MATERIALS SCIENCE↗

Global- and Local-Scale High-Resolution Event Catalogs for Algorithm Testing

During the development of new seismic data processing methods, the verification of potential events and associated signals can present a nontrivial obstacle to the assessment of algorithm performance, especially as detection thresholds are lowered, resulting in the inclusion of significantly more anthropogenic signals. Here, we present two 14 day seismic event catalogs, a local–scale catalog developed using data from the University of Utah Seismograph Stations network, and a global–scale catalog developed using data from the International Monitoring System. Each catalog was built manually to comprehensively identify events from all sources that were locatable using phase arrival timing and directional information from seismic network stations, resulting in significant increases compared to existing catalogs. Here, the new catalogs additionally contain challenging event sequences (prolific aftershocks and small events at the detection and location threshold) and novel event types and sources (e.g., infrasound only events and long–wall mining events) that make them useful for algorithm testing and development, as well as valuable for the unique tectonic and anthropogenic event sequences they contain.

58 GEOSCIENCES↗

Test models for improving filtering with model errors through stochastic parameter estimation

The filtering skill for turbulent signals from nature is often limited by model errors created by utilizing an imperfect model for filtering. Updating the parameters in the imperfect model through stochastic parameter estimation is one way to increase filtering skill and model performance. Here a suite of stringent test models for filtering with stochastic parameter estimation is developed based on the Stochastic Parameterization Extended Kalman Filter (SPEKF). These new SPEKF-algorithms systematically correct both multiplicative and additive biases and involve exact formulas for propagating the mean and covariance including the parameters in the test model. A comprehensive study is presented of robust parameter regimes for increasing filtering skill through stochastic parameter estimation for turbulent signals as the observation time and observation noise are varied and even when the forcing is incorrectly specified. The results here provide useful guidelines for filtering turbulent signals in more complex systems with significant model errors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An uncertainty-focused database approach to extract spatiotemporal trends from qualitative and discontinuous lake-status histories

Changes in lake status are often interpreted as palaeoclimate indicators due to their dependence on precipitation and evaporation. The Global Lake Status Database (GLSDB) has since long provided a standardised synopsis of qualitative lake status over the last 30,000 14C years. Potential sources of uncertainty however are not recorded in the GLSDB. Here we present an updated and improved relational-database framework that incorporates uncertainty in both chronology and the interpretation of palaeoenvironmental data. The database uses peer-reviewed palaeolimnological studies to produce a consensus on qualitative lake-status histories, whose chronologies are revised and standardized through the recalibration of radiocarbon dates and the application of Bayesian age-depth modelling for stratigraphic archives. Quantitative information on absolute water-level elevation is preserved if available from geomorphological sources. We also propose a new probabilistic analytical framework that accounts for these uncertainties to reconstruct synoptic, integrated environmental signals. The process is based on a Monte Carlo algorithm that iteratively samples individual lake-status histories within the limits of their uncertainties to produce many possible scenarios. We then use Recursively-Subtracted Empirical Orthogonal Function analysis to extract dominant patterns of lake-status variability from these scenarios. As a proof of concept, we apply this framework to 67 sites in eastern and southern Africa whose lake-status histories cover part of the late Pleistocene and/or Holocene. We show that, despite the sometimes large temporal and interpretation uncertainties, and the inclusion of highly discontinuous lake-status time series, identifying the major known millennial-scale climatic phases during the last 20,000 years is possible. Our framework was also able to identify an antiphased response between the lake basins in eastern and interior southern Africa to these changes. Here, we propose that our new database and methodology framework serves as a template for efficient lake-status data synthesis, encourages the incorporation of lake-status data in palaeoclimate syntheses, and expands the possibilities for the use of such data in the evaluation of climate models.

58 GEOSCIENCES↗

Colors of Irregular Satellites of Saturn with the Dark Energy Camera

We report g – r and r – i new colors for 21 Saturn Irregular Satellites; among them, four previously unreported. This is the highest number of Saturn Irregular satellites reported in a single survey. These satellites were measured by "stacking" their observations to increase their signal without trailing. This work describes a novel processing algorithm that enables the detection of faint sources under significant background noise and in front of a severely crowded field. Our survey shows these new color measurements of Saturn Irregular Satellites are consistent with other Irregular Satellites populations as found in previous works and reinforcing the observation that the lack of ultrared objects among the irregular satellites is a real feature that separates them from the trans-Neptunian objects (their posited source population).

79 ASTRONOMY AND ASTROPHYSICS↗

Spectroscopic analysis and control

Apparatus for spectroscopic analysis which includes a tunable diode laser spectrometer having a digital output signal and a digital computer for receiving the digital output signal from the spectrometer, the digital computer programmed to process the digital output signal using a multivariate regression algorithm. In addition, a spectroscopic method of analysis using such apparatus. Finally, a method for controlling an ethylene cracker hydrogenator.

36 MATERIALS SCIENCE↗

Singular value decomposition utilizing parallel algorithms on graphical processors

One of the current challenges in underwater acoustic array signal processing is the detection of quiet targets in the presence of noise. In order to enable robust detection, one of the key processing steps requires data and replica whitening. This, in turn, involves the eigen-decomposition of the sample spectral matrix, Cx = 1/K xKX(k)XH(k) where X(k) denotes a single frequency snapshot with an element for each element of the array. By employing the singular value decomposition (SVD) method, the eigenvectors and eigenvalues can be determined directly from the data without computing the sample covariance matrix, reducing the computational requirements for a given level of accuracy (van Trees, Optimum Array Processing). (Recall that the SVD of a complex matrix A involves determining V, , and U such that A = U VH where U and V are orthonormal and is a positive, real, diagonal matrix containing the singular values of A. U and V are the eigenvectors of AAH and AHA, respectively, while the singular values are the square roots of the eigenvalues of AAH.) Because it is desirable to be able to compute these quantities in real time, an efficient technique for computing the SVD is vital. In addition, emerging multicore processors like graphical processing units (GPUs) are bringing parallel processing capabilities to an ever increasing number of users. Since the computational tasks involved in array signal processing are well suited for parallelization, it is expected that these computations will be implemented using GPUs as soon as users have the necessary computational tools available to them. Thus, it is important to have an SVD algorithm that is suitable for these processors. This work explores the effectiveness of two different parallel SVD implementations on an NVIDIA Tesla C2050 GPU (14 multiprocessors, 32 cores per multiprocessor, 1.15 GHz clock - peed). The first algorithm is based on a two-step algorithm which bidiagonalizes the matrix using Householder transformations, and then diagonalizes the intermediate bidiagonal matrix through implicit QR shifts. This is similar to that implemented for real matrices by Lahabar and Narayanan ("Singular Value Decomposition on GPU using CUDA", IEEE International Parallel Distributed Processing Symposium 2009). The implementation is done in a hybrid manner, with the bidiagonalization stage done using the GPU while the diagonalization stage is done using the CPU, with the GPU used to update the U and V matrices. The second algorithm is based on a one-sided Jacobi scheme utilizing a sequence of pair-wise column orthogonalizations such that A is replaced by AV until the resulting matrix is sufficiently orthogonal (that is, equal to U ). V is obtained from the sequence of orthogonalizations, while can be found from the square root of the diagonal elements of AH A and, once is known, U can be found from column scaling the resulting matrix. These implementations utilize CUDA Fortran and NVIDIA's CUB LAS library. The primary goal of this study is to quantify the comparative performance of these two techniques against themselves and other standard implementations (for example, MATLAB). Considering that there is significant overhead associated with transferring data to the GPU and with synchronization between the GPU and the host CPU, it is also important to understand when it is worthwhile to use the GPU in terms of the matrix size and number of concurrent SVDs to be calculated.

99 GENERAL AND MISCELLANEOUS↗

Automated Reconstruction, Signal Processing and Particle Identification in DUNE

Liquid Argon TPC (LArTPC) technology is increasingly prevalent in large-scale detectors de- signed to observe neutrino scattering events induced by accelerators or by natural sources. LArTPCs consist of a very high fraction of active detector material with spatial resolutions on the order of a few millimeters. Three-dimensional interactions are imaged in multiple two- dimensional views by the process of projection onto planes of wires. The goal of automated reconstruction is to correctly classify each neutrino scattering event by the flavor of the incoming neutrino, to separate charged-current events from neutral-current and other backgrounds, and to measure the energies of the incoming neutrinos. Detection of neutrinos from supernova bursts and also searching for nucleon decay are important uses of automated reconstruction algorithms. Be- cause the amount of spatial detail is high and the amount of scattering is high, this reconstruction presents many challenges that are now being investigated with sophisticated techniques. Signal processing, track and shower identification, particle identification, and event classification by a variety of innovative algorithms are reviewed

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Perturbative model of noisy quantum signal processing

Recent progress in quantum signal processing (QSP) and its generalization, quantum singular value transformation, has led to a grand unification of quantum algorithms. However, inherent experimental noise in quantum devices severely limits the length of realizable QSP sequences. Here, we consider a model of QSP with generic perturbative noise in the signal processing basis and present a diagrammatic notation useful for analyzing such errors. To demonstrate our technique, we study a specific coherent error, that of under- or overrotation of the signal processing operator parametrized by ε<<1. For this coherent error model, it is shown that while Pauli Z errors are not recoverable without additional resources, Pauli X and Y errors can be arbitrarily suppressed by coherently appending a noisy recovery QSP without the use of additional resources or ancillas. Furthermore, through a careful accounting of errors using our diagrammatic tools, we provide an upper and lower bound on the length of this recovery QSP operator. We anticipate that the perturbative technique and the diagrammatic notation proposed here will facilitate future study of generic noise in QSP and quantum algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-jet Merging with NLO Matrix Elements

In the algorithm presented here, the ME+PS approach to merge samples of tree-level matrix elements into inclusive event samples is combined with the POWHEG method, which includes exact next-to-leading order matrix elements in the parton shower. The advantages of the method are discussed and the quality of its implementation in SHERPA is exemplified by results for e{sup +}e{sup -} annihilation into hadrons at LEP, for deep-inelastic lepton-nucleon scattering at HERA, for Drell-Yan lepton-pair production at the Tevatron and for W{sup +}W{sup -}-production at LHC energies. The simulation of hard QCD radiation in parton-shower Monte Carlos has seen tremendous progress over the last years. It was largely stimulated by the need for more precise predictions at LHC energies where the large available phase space allows additional hard QCD radiation alongside known Standard Model processes or even signals from new physics. Two types of algorithms have been developed, which allow to improve upon the soft-collinear approximations made in the parton shower, such that hard radiation is simulated according to exact matrix elements. In the ME+PS approach [1] higher-order tree-level matrix elements for different final-state jet multiplicity are merged with each other and with subsequent parton shower emissions to generate an inclusive sample. Such a prescription is invaluable for analyses which are sensitive to final states with a large jet multiplicity. The only remaining deficiency of such tree-level calculations is the large uncertainty stemming from scale variations. The POWHEG method [2] solves this problem for the lowest multiplicity subprocess by combining full NLO matrix elements with the parton shower. While this leads to NLO accuracy in the inclusive cross section and the exact radiation pattern for the first emission, it fails to describe higher-order emissions with improved accuracy. Thus it is not sufficient if final states with high jet multiplicities are considered. With the complementary advantages of these two approaches, the question arises naturally whether it would be possible to combine them into an even more powerful one. Such a combined algorithm was independently developed in [5] and [6]. Here a summary of the algorithm is given and predictions from corresponding Monte-Carlo predictions are presented.

43 PARTICLE ACCELERATORS↗

Self-adaptive sampling rate data acquisition in JET's correlation reflectometer

Data acquisition systems with self-adaptive sampling rate capabilities have been proposed as a solution to reduce the shear amount of data collected in every discharge of present fusion devices. This paper discusses the design of such a system for its use in the KG8B correlation reflectometer at JET. The system, which is based on the ITMS platform, continuously adapts the sample rate during the acquisition depending on the signal bandwidth. Data are acquired continuously at the expected maximum sample rate and transferred to a memory buffer in the host processor. Thereafter the rest of the process is based on software. Data are read from the memory buffer in blocks and for each block an intelligent decimation algorithm is applied. The decimation algorithm determines the signal bandwidth for each block in order to choose the optimum sample rate for that block, and from there the decimation factor to be used. Memory buffers are used to adapt the throughput of the three main software modules (data acquisition, processing, and storage) following a typical producer-consumer architecture. The system optimizes the amount of data collected while maintaining the same information. Design issues are discussed and results of performance evaluation are presented.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Enhancing Camera Calibration for Traffic Surveillance with an Integrated Approach of Genetic Algorithm and Particle Swarm Optimization

Recent advancements in sensor technologies, coupled with signal processing and machine learning, have enabled real-time traffic control systems to effectively adapt to changing traffic conditions. Cameras, as sensors, offer a cost-effective means to determine the number, location, type, and speed of vehicles, aiding decision-making at traffic intersections. However, the effective use of cameras for traffic surveillance requires proper calibration. This paper proposes a new optimization-based method for camera calibration. In this approach, initial calibration parameters are established using the Direct Linear Transformation (DLT) method. Then, optimization algorithms are applied to further refine the calibration parameters for the correction of nonlinear lens distortions. A significant enhancement in the optimization process is achieved through the integration of the Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) into a combined Integrated GA and PSO (IGAPSO) technique. The effectiveness of this method is demonstrated through the calibration of eleven roadside cameras at three different intersections. The experimental results show that when compared to the baseline DLT method, the vehicle localization error is reduced by 22.30% with GA, 22.31% with PSO, and 25.51% with IGAPSO.

47 OTHER INSTRUMENTATION↗