Search NASA⌕ Search

SEARCH · Search NASA

Results for “Filtering 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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Quantum Machine-Learning for Eigenstate Filtration in Two-Dimensional Materials

Quantum machine-learning algorithms have emerged to be a promising alternative to their classical counterparts as they leverage the power of quantum computers. Such algorithms have been developed to solve problems like electronic structure calculations of molecular systems and spin models in magnetic systems. However, the discussion in all these recipes focuses specifically on targeting the ground state. Herein we demonstrate a quantum algorithm that can filter any energy eigenstate of the system based on either symmetry properties or a predefined choice of the user. The workhorse of our technique is a shallow neural network encoding the desired state of the system with the amplitude computed by sampling the Gibbs–Boltzmann distribution using a quantum circuit and the phase information obtained classically from the nonlinear activation of a separate set of neurons. We show that the resource requirements of our algorithm are strictly quadratic. To demonstrate its efficacy, we use state filtration in monolayer transition metal dichalcogenides which are hitherto unexplored in any flavor of quantum simulations. We implement our algorithm not only on quantum simulators but also on actual IBM-Q quantum devices and show good agreement with the results procured from conventional electronic structure calculations. We thus expect our protocol to provide a new alternative in exploring the band structures of exquisite materials to usual electronic structure methods or machine-learning techniques that are implementable solely on a classical computer.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Retrieving Top-k Hyperedge Triplets: Models and Applications

Complex systems frequently exhibit multi-way, rather than pairwise, interactions. These group interactions can- not be faithfully modeled as collections of pairwise interactions using graphs and instead require hypergraphs. However, methods that analyze hypergraphs directly, rather than via lossy graph reductions, remain limited. Hypergraph motifs hold promise in this regard, as motif patterns serve as building blocks for larger group interactions which are inexpressible by graphs. Recent work has focused on categorizing and counting hypergraph motifs based on the existence of nodes in hyperedge intersection regions. Here, we argue that the relative sizes of hyperedge inter- sections within motifs contain varied and valuable information. We propose a suite of efficient algorithms for finding top-k triplets of hyperedges based on optimizing the sizes of these intersection patterns. This formulation uncovers interesting local patterns of interaction, finding hyperedge triplets that either (1) are the least similar with each other, (2) have the highest pairwise but not groupwise correlation, or (3) are the most similar with each other. We formalize this as a combinatorial optimization problem and design efficient algorithms based on filtering hyperedges. Our comprehensive experimental evaluation shows that the resulting hyperedge triplets yield insightful information on real-world hypergraphs. Our approach is also orders of magnitude faster than a naive baseline implementation.

hypergraphs, motifs, Combinatorial Algorithms↗
NASA NTRS1978

A parameter estimation subroutine package

Linear least squares estimation and regression analyses continue to play a major role in orbit determination and related areas. In this report we document a library of FORTRAN subroutines that have been developed to facilitate analyses of a variety of estimation problems. Our purpose is to present an easy to use, multi-purpose set of algorithms that are reasonably efficient and which use a minimal amount of computer storage. Subroutine inputs, outputs, usage and listings are given along with examples of how these routines can be used. The following outline indicates the scope of this report: Section (1) introduction with reference to background material; Section (2) examples and applications; Section (3) subroutine directory summary; Section (4) the subroutine directory user description with input, output, and usage explained; and Section (5) subroutine FORTRAN listings. The routines are compact and efficient and are far superior to the normal equation and Kalman filter data processing algorithms that are often used for least squares analyses.

Bierman, G. J.↗
NASA NTRS1978

Algorithms for isolating worst case systematic data errors

Two separate algorithms are derived for testing filter sensitivity to systematic data errors. One algorithm provides the absolute minimum Euclidean norm data error for a given estimate component error. The second algorithm can be used to find the minimum norm data error which can be generated by restricted degree Legendre polynomials. A specific very long baseline interferometry (VLBI) baseline estimation is analyzed with the algorithm. It is found that the local vertical is the most sensitive component to error in the data space. The efficiency of a data error sequence linear in elevation angle is within 7% that of the absolute worst case sequence. Elevation angle dependent errors are explored and the special case of a mismodeled troposphere is treated.

Curkendall, D. W.↗
NASA NTRS1990

Performances Of Fixed-Lag Phase-Smoothing Algorithms

Report discusses performances of fixed-lag nonlinear smoothing algorithms applied to estimation of phase and frequency of sinusoidal carrier signal with process phase noise and additive observation phase noise. Algorithm of type considered functions as suboptimal filter operating on received signal. Algorithm developed for system in which signal sampled at discrete times. Process noise assumed to be Gaussian with zero mean and independent of observation noise. Nonlinear smoothing equations derived in customary matrix-and-vector forms.

Kumar, Rajendra↗
DOE OSTI2025

Tomographic Sparse View Selection Using the View Covariance Loss

Standard computed tomography (CT) reconstruction algorithms such as filtered back projection (FBP) and Feldkamp-Davis-Kress (FDK) require many views for producing high-quality reconstructions, which can slow image acquisition and increase cost in non-destructive evaluation (NDE) applications. Over the past 20 years, a variety of methods have been developed for computing high-quality CT reconstructions from sparse views. However, the problem of how to select the best views for CT reconstruction remains open. In this paper, we present a novel view covariance loss (VCL) function that measures the joint information of a set of views by approximating the normalized mean squared error (NMSE) of the reconstruction. We present fast algorithms for computing the VCL along with an algorithm for selecting a subset of views that approximately minimizes its value. Our experiments on simulated and measured data indicate that for a fixed number of views our proposed view covariance loss selection (VCLS) algorithm results in reconstructions with lower NRMSE, fewer artifacts, and greater accuracy than current alternative approaches.

Lin, Jingsong [Purdue University]↗
NASA NTRS1984

Digital processing considerations for extraction of ocean wave image spectra from raw synthetic aperture radar data

The digital processing requirements of several algorithms for extracting the spectrum of a detected synthetic aperture radar (SAR) image from the raw SAR data are described and compared. The most efficient algorithms for image spectrum extraction from raw SAR data appear to be those containing an intermediate image formation step. It is shown that a recently developed compact formulation of the image spectrum in terms of the raw data is computationally inefficient when evaluated directly, in comparison with the classical method where matched-filter image formation is an intermediate result. It is also shown that a proposed indirect procedure for digitally implementing the same compact formulation is somewhat more efficient than the classical matched-filtering approach. However, this indirect procedure includes the image formation process as part of the total algorithm. Indeed, the computational savings afforded by the indirect implementation are identical to those obtained in SAR image formation processing when the matched-filtering algorithm is replaced by the well-known 'dechirp-Fourier transform' technique. Furthermore, corrections to account for slant-to-ground range conversion, spherical earth, etc., are often best implemented in the image domain, making intermediate image formation a valuable processing feature.

Lahaie, I. J.↗
DOE OSTI2023

Indoor Occupancy Sensing via Networked Nodes (2012–2022): A Review

In the past decade, different sensing mechanisms and algorithms have been developed to detect or estimate indoor occupancy. One of the most recent advancements is using networked sensor nodes to create a more comprehensive occupancy detection system where multiple sensors can identify human presence within more expansive areas while delivering enhanced accuracy compared to a system that relies on stand-alone sensor nodes. The present work reviews the studies from 2012 to 2022 that use networked sensor nodes to detect indoor occupancy, focusing on PIR-based sensors. Methods are compared based on pivotal ADPs that play a significant role in selecting an occupancy detection system for applications such as Health and Safety or occupant comfort. These parameters include accuracy, information requirement, maximum sensor failure and minimum observation rate, and feasible detection area. We briefly describe the overview of occupancy detection criteria used by each study and introduce a metric called “sensor node deployment density” through our analysis. This metric captures the strength of network-level data filtering and fusion algorithms found in the literature. It is hinged on the fact that a robust occupancy estimation algorithm requires a minimal number of nodes to estimate occupancy. This review only focuses on the occupancy estimation models for networked sensor nodes. It thus provides a standardized insight into networked nodes’ occupancy sensing pipelines, which employ data fusion strategies, network-level machine learning algorithms, and occupancy estimation algorithms. This review thus helps determine the suitability of the reviewed methods to a standard set of application areas by analyzing their gaps.

Emad-Ud-Din, Muhammad (ORCID:0000000279515538)↗
NASA NTRS1991

Signal processing techniques for clutter filtering and wind shear detection

An extended Prony algorithm applicable to signal processing techniques for clutter filtering and windshear detection is discussed. The algorithm is based upon modelling the radar return as a time series, and appears to offer potential for improving hazard factor estimates in the presence of strong clutter returns.

Baxa, Ernest G., Jr.↗
NASA NTRS2010

Multi-Stage System for Automatic Target Recognition

A multi-stage automated target recognition (ATR) system has been designed to perform computer vision tasks with adequate proficiency in mimicking human vision. The system is able to detect, identify, and track targets of interest. Potential regions of interest (ROIs) are first identified by the detection stage using an Optimum Trade-off Maximum Average Correlation Height (OT-MACH) filter combined with a wavelet transform. False positives are then eliminated by the verification stage using feature extraction methods in conjunction with neural networks. Feature extraction transforms the ROIs using filtering and binning algorithms to create feature vectors. A feedforward back-propagation neural network (NN) is then trained to classify each feature vector and to remove false positives. The system parameter optimizations process has been developed to adapt to various targets and datasets. The objective was to design an efficient computer vision system that can learn to detect multiple targets in large images with unknown backgrounds. Because the target size is small relative to the image size in this problem, there are many regions of the image that could potentially contain the target. A cursory analysis of every region can be computationally efficient, but may yield too many false positives. On the other hand, a detailed analysis of every region can yield better results, but may be computationally inefficient. The multi-stage ATR system was designed to achieve an optimal balance between accuracy and computational efficiency by incorporating both models. The detection stage first identifies potential ROIs where the target may be present by performing a fast Fourier domain OT-MACH filter-based correlation. Because threshold for this stage is chosen with the goal of detecting all true positives, a number of false positives are also detected as ROIs. The verification stage then transforms the regions of interest into feature space, and eliminates false positives using an artificial neural network classifier. The multi-stage system allows tuning the detection sensitivity and the identification specificity individually in each stage. It is easier to achieve optimized ATR operation based on its specific goal. The test results show that the system was successful in substantially reducing the false positive rate when tested on a sonar and video image datasets.

Chao, Tien-Hsin↗
DOE OSTI2021

Exploring the contamination of the DES-Y1 cluster sample with SPT-SZ selected clusters

ABSTRACT We perform a cross validation of the cluster catalogue selected by the red-sequence Matched-filter Probabilistic Percolation algorithm (redMaPPer) in Dark Energy Survey year 1 (DES-Y1) data by matching it with the Sunyaev–Zel’dovich effect (SZE) selected cluster catalogue from the South Pole Telescope SPT-SZ survey. Of the 1005 redMaPPer selected clusters with measured richness $\hat{\lambda }\gt 40$ in the joint footprint, 207 are confirmed by SPT-SZ. Using the mass information from the SZE signal, we calibrate the richness–mass relation using a Bayesian cluster population model. We find a mass trend λ ∝ MB consistent with a linear relation (B ∼ 1), no significant redshift evolution and an intrinsic scatter in richness of σλ = 0.22 ± 0.06. By considering two error models, we explore the impact of projection effects on the richness–mass modelling, confirming that such effects are not detectable at the current level of systematic uncertainties. At low richness SPT-SZ confirms fewer redMaPPer clusters than expected. We interpret this richness dependent deficit in confirmed systems as due to the increased presence at low richness of low-mass objects not correctly accounted for by our richness-mass scatter model, which we call contaminants. At a richness $\hat{\lambda }=40$, this population makes up ${\gt}12{{\ \rm per\ cent}}$ (97.5 percentile) of the total population. Extrapolating this to a measured richness $\hat{\lambda }=20$ yields ${\gt}22{{\ \rm per\ cent}}$ (97.5 percentile). With these contamination fractions, the predicted redMaPPer number counts in different plausible cosmologies are compatible with the measured abundance. The presence of such a population is also a plausible explanation for the different mass trends (B ∼ 0.75) obtained from mass calibration using purely optically selected clusters. The mean mass from stacked weak lensing (WL) measurements suggests that these low-mass contaminants are galaxy groups with masses ∼3–5 × 1013 M⊙ which are beyond the sensitivity of current SZE and X-ray surveys but a natural target for SPT-3G and eROSITA.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

Fast Local Spatial Verification for Feature-Agnostic Large-Scale Image Retrieval

Images from social media can reflect diverse viewpoints, heated arguments, and expressions of creativity, adding new complexity to retrieval tasks. Researchers working on Content-Based Image Retrieval (CBIR) have traditionally tuned their algorithms to match filtered results with user search intent. However, we are now bombarded with composite images of unknown origin, authenticity, and even meaning. With such uncertainty, users may not have an initial idea of what the search query results should look like. For instance, hidden people, spliced objects, and subtly altered scenes can be difficult for a user to detect initially in a meme image, but may contribute significantly to its composition. It is pertinent to design systems that retrieve images with these nuanced relationships in addition to providing more traditional results, such as duplicates and near-duplicates — and to do so with enough efficiency at large scale. In this work, we propose a new approach for spatial verification that aims at modeling object-level regions using image keypoints retrieved from an image index, which is then used to accurately weight small contributing objects within the results, without the need for costly object detection steps. We call this method the Objects in Scene to Objects in Scene (OS2OS) score, and it is optimized for fast matrix operations, which can run quickly on either CPUs or GPUs. It performs comparably to state-of-the-art methods on classic CBIR problems (Oxford 5K, Paris 6K, and Google-Landmarks), and outperforms them in emerging retrieval tasks such as image composite matching in the NIST MFC2018 dataset and meme-style imagery from Reddit.

42 ENGINEERING↗
DOE OSTI2022

Toward improved urban earthquake monitoring through deep-learning-based noise suppression

Earthquake monitoring in urban settings is essential but challenging, due to the strong anthropogenic noise inherent to urban seismic recordings. Here, we develop a deep-learning-based denoising algorithm, UrbanDenoiser, to filter out urban seismological noise. UrbanDenoiser strongly suppresses noise relative to the signals, because it was trained using waveform datasets containing rich noise sources from the urban Long Beach dense array and high signal-to-noise ratio (SNR) earthquake signals from the rural San Jacinto dense array. Application to the dense array data and an earthquake sequence in an urban area shows that UrbanDenoiser can increase signal quality and recover signals at an SNR level down to ~0 dB. Earthquake location using our denoised Long Beach data does not support the presence of mantle seismicity beneath Los Angeles but suggests a fault model featuring shallow creep, intermediate locking, and localized stress concentration at the base of the seismogenic zone.

58 GEOSCIENCES↗
NASA NTRS1977

ALTKAL: An optimum linear filter for GEOS-3 altimeter data

ALTKAL is a computer program designed to smooth sea surface height data obtained from the GEOS 3 altimeter, and to produce minimum variance estimates of sea surface height and sea surface slopes, along with their standard derivations. The program operates by processing the data through a Kalman filter in both the forward and backward directions, and optimally combining the results. The sea surface height signal is considered to have a geoid signal, modeled by a third order Gauss-Markov process, corrupted by additive white noise. The governing parameters for the signal and noise processes are the signal correlation length and the signal-to-noise ratio. Mathematical derivations of the filtering and smoothing algorithms are presented. The smoother characteristics are illustrated by giving the frequency response, the data weighting sequence and the transfer function of a realistic steady-state smoother example. Based on nominal estimates for geoidal undulation amplitude and correlation length, standard deviations for the estimated sea surface height and slope are 12 cm and 3 arc seconds, respectively.

Fang, B. T.↗
NASA NTRS1977

Range validation using Kalman filter techniques

Range pseudo-residuals may be improved to the level required for data validation by a measurement updating process which utilizes Bierman's adaptation of the Kalman filter measurement updating algorithms together with process noise compensation to account for model errors. This algorithm involves combining the currently available range predictions and measurements to produce an updated range residual measurement whose accuracy is constrained by the range data quality and by the estimated error in the prediction. The algorithm is compact and fast, and is thus suitable for on-line applications in network control or at the station.

Madrid, G. A.↗
NASA NTRS1981

An adaptive filter for smoothing noisy radar images

A spatial domain adaptive Wiener filter for smoothing radar images corrupted by multiplicative noise is presented. The filter is optimum in a minimum mean squared error sense, computationally efficient, and preserves edges in the image better than other filters. The proposed algorithm can also be used for processing optical images with illumination variations that have a multiplicative effect.

Frost, V. S.↗