Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Reconstruction 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 883 records · Page 49
All sourcesNASA NTRSDOE OSTI
NASA NTRS2003

An advanced model-based diagnosis engine

We have developed a new and powerful diagnosis engine that overcomes the limitations of the existing systematic methods of general diagnosis through a two-fold approach. First, we propose a novel and compact reconstruction of the General Diagnosis Engine, one of the most fundamental approaches to model-based diagnoses. We then present a novel algorithmic approach for calculation of minimal diagnosis set.

model-based diagnosis hitting set problem integer ↗
NASA NTRS2012

Resolution Enhancement of MODIS-Derived Water Indices for Studying Persistent Flooding

Monitoring coastal marshes for persistent flooding and salinity stress is a high priority issue in Louisiana. Remote sensing can identify environmental variables that can be indicators of marsh habitat conditions, and offer timely and relatively accurate information for aiding wetland vegetation management. Monitoring activity accuracy is often limited by mixed pixels which occur when areas represented by the pixel encompasses more than one cover type. Mixtures of marsh grasses and open water in 250m Moderate Resolution Imaging Spectroradiometer (MODIS) data can impede flood area estimation. Flood mapping of such mixtures requires finer spatial resolution data to better represent the cover type composition within 250m MODIS pixel. Fusion of MODIS and Landsat can improve both spectral and temporal resolution of time series products to resolve rapid changes from forcing mechanisms like hurricane winds and storm surge. For this study, using a method for estimating sub-pixel values from a MODIS time series of a Normalized Difference Water Index (NDWI), using temporal weighting, was implemented to map persistent flooding in Louisiana coastal marshes. Ordinarily NDWI computed from daily 250m MODIS pixels represents a mixture of fragmented marshes and water. Here, sub-pixel NDWI values were derived for MODIS data using Landsat 30-m data. Each MODIS pixel was disaggregated into a mixture of the eight cover types according to the classified image pixels falling inside the MODIS pixel. The Landsat pixel means for each cover type inside a MODIS pixel were computed for the Landsat data preceding the MODIS image in time and for the Landsat data succeeding the MODIS image. The Landsat data were then weighted exponentially according to closeness in date to the MODIS data. The reconstructed MODIS data were produced by summing the product of fractional cover type with estimated NDWI values within each cover type. A new daily time series was produced using both the reconstructed 250-m MODIS, with enhanced features, and the approximated daily 30-m high-resolution image based on Landsat data. The algorithm was developed and tested over the Calcasieu-Sabine Basin, which was heavily inundated by storm surge from Hurricane Ike to study the extent and duration of flooding following the storm. Time series for 2000-2009, covering flooding events by Hurricane Rita in 2005 and Hurricane Ike in 2008, were derived. High resolution images were formed for all days in 2008 between the first cloud free Landsat scene and the last cloud-free Landsat scene. To refine and validate flooding maps, each time series was compared to Louisiana Coastwide Reference Monitoring System (CRMS) station water levels adjusted to marsh to optimize thresholds for MODIS-derived time series of NDWI. Seasonal fluctuations were adjusted by subtracting ten year average NDWI for marshes, excluding the hurricane events. Results from different NDWI indices and a combination of indices were compared. Flooding persistence that was mapped with higher-resolution data showed some improvement over the original MODIS time series estimates. The advantage of this novel technique is that improved mapping of extent and duration of inundation can be provided.

Underwood, L. W.↗
DOE OSTI2024

Optimization-based, property-preserving algorithm for passive tracer transport

Here we present a new optimization-based property-preserving algorithm for passive tracer transport. The algorithm utilizes a semi-Lagrangian approach based on incremental remapping of the mass and the total tracer. However, unlike traditional semi-Lagrangian schemes, which remap the density and the tracer mixing ratio through monotone reconstruction or flux correction, we utilize an optimization-based remapping that enforces conservation and local bounds as optimization constraints. In so doing we separate accuracy considerations from preservation of physical properties to obtain a conservative, second-order accurate transport scheme that also has a notion of optimality. Moreover, we prove that the optimization-based algorithm preserves linear relationships between tracer mixing ratios. We illustrate the properties of the new algorithm using a series of standard tracer transport test problems in a plane and on a sphere.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A positivity-preserving and conservative intersection-distribution-based remapping algorithm for staggered ALE hydrodynamics on arbitrary meshes

In this study, we introduce new intersection-distribution-based remapping tools for indirect staggered arbitrary Lagrangian-Eulerian (ALE) simulations of multi-material shock hydrodynamics on arbitrary meshes. In addition to conserving momentum and total energy, the three-stage remapper proposed in this work preserves non-negativity of the internal energy. At the first stage, we construct slope-limited piecewise-linear reconstructions of all conserved quantities on zones of the source mesh and perform intersection-based remap to obtain bound-preserving zonal quantities on the target mesh. At the second stage, we define bound-preserving nodal quantities of the staggered ALE discretization as convex combinations of corner quantities. The nodal internal energy is corrected in a way which keeps it non-negative, while providing exact conservation of total energy. At the final stage, we distribute the non-negative nodal internal energy to corners, zones and materials using non-negative weights. Proofs of positivity preservation are provided for each stage. This work is a natural extension of our paper [14] in which a similar intersection-distribution-based remapping procedure was employed. The original version used a nodal kinetic energy fix which did not provably ensure positivity preservation for the zonal internal energy after the final distribution stage. The new algorithm cures this potential drawback by using ‘coordinated’ limiters for piecewise-linear reconstructions, remapping the internal energy to nodes and correcting it before redistribution. The effectiveness of the new nodal fix is illustrated by numerical examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Performance evaluation of cosmic ray muon trajectory estimation algorithms

Muons, being elementary particles with minimal interaction with nuclear materials and abundant at sea level, have sparked interest in utilizing them for imaging various applications, such as mining [Borselli et al., Sci. Rep. 12, 22329 (2022)], volcano imaging [Nagamine et al., Nucl. Instrum. Meth. A, 356, 585(1995)], and underground tunnel detection [Guardincerri et al., Pure Appl. Geophys. 174, 2133 (2017)]. Recently, their use in nuclear nonproliferation and safeguard verification has gained attention, particularly in cargo screening for nuclear waste smuggling [Baesso et al., J. Instrum. 9, C10041 (2014)], source localization [L. J. Schultz et al., Nucl. Instrum. Meth. A 519, 687 (2004)], and locating nuclear fuel debris in reactors [Borozdin et al., Phys. Rev. Let. 109, 152501 (2012)]. However, the resolution of muon image reconstruction techniques is limited due to multiple Coulomb scattering (MCS) within the target object. To achieve robust muon tomography, it is crucial to develop efficient and flexible physics-based algorithms that can model the MCS process accurately and estimate the most probable trajectory of muons as they pass through the target object. To address this limitation, in this study, a novel algorithmic approach utilizing the Bayesian probability theory and Gaussian approximation of MCS is chosen. Different energy levels, materials, and target sizes were considered in the evaluations. The results demonstrate that the Generalized Muon Trajectory Estimation (GMTE) algorithm offers significant improvements over currently used algorithms. Across all test scenarios, the GMTE algorithm demonstrated ~50% and 38% increase in precision compared to Straight Line Path (SLP) and Point of Closest Approach (PoCA) algorithms, respectively. Furthermore, it exhibited 10%–35% and 10%–15% increases in muon flux utilization for high and medium Z materials, respectively, compared to the PoCA algorithm. In conclusion, the extensive simulations confirm the enhanced performance and efficiency of the GMTE algorithm, offering improved resolution and reduced measurement time for cosmic ray muon imaging compared to the current SLP and PoCA algorithms.

79 ASTRONOMY AND ASTROPHYSICS↗
NASA NTRS1994

Advanced technology development multi-color holography

Several key aspects of multi-color holography and some non-conventional ways to study the holographic reconstructions are considered. The error analysis of three-color holography is considered in detail with particular example of a typical triglycine sulfate crystal growth situation. For the numerical analysis of the fringe patterns, a new algorithm is introduced with experimental verification using sugar-water solution. The role of the phase difference among component holograms is also critically considered with examples of several two- and three-color situations. The status of experimentation on two-color holography and fabrication of a small breadboard system is also reported. Finally, some successful demonstrations of unconventional ways to study holographic reconstructions are described. These methods are deflectometry and confocal optical processing using some Spacelab III holograms.

Vikram, Chandra S.↗
DOE OSTI2022

Spectral function for 4 He using the Chebyshev expansion in coupled-cluster theory

Here, we compute spectral function for 4 He by combining coupled-cluster theory with an expansion of integral transforms into Chebyshev polynomials. Our method allows us to estimate the uncertainty of spectral reconstruction. The properties of the Chebyshev polynomials make the procedure numerically stable and considerably lower in memory usage than the typically employed Lanczos algorithm. We benchmark our predictions with other calculations in the literature and with electron-scattering data in the quasi-elastic peak. The spectral function formalism allows one to extend ab initio lepton-nucleus cross sections into the relativistic regime. This makes it a promising tool for modeling this process at higher-energy transfers. The results we present open the door for studies of heavier nuclei, important for the neutrino oscillation programs.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

BioXTAS RAW 2 : new developments for a free open-source program for small-angle scattering data reduction and analysis

BioXTAS RAW is a free open-source program for reduction, analysis and modelling of biological small-angle scattering data. Here, the new developments in RAW version 2 are described. These include improved data reduction using pyFAI ; updated automated Guinier fitting and D max finding algorithms; automated series ( e.g. size-exclusion chromatography coupled small-angle X-ray scattering or SEC-SAXS) buffer- and sample-region finding algorithms; linear and integral baseline correction for series; deconvolution of series data using regularized alternating least squares ( REGALS ); creation of electron-density reconstructions using electron density via solution scattering ( DENSS ); a comparison window showing residuals, ratios and statistical comparisons between profiles; and generation of PDF reports with summary plots and tables for all analysis. Furthermore, there is now a RAW API, which can be used without the graphical user interface (GUI), providing full access to all of the functionality found in the GUI. In addition to these new capabilities, RAW has undergone significant technical updates, such as adding Python 3 compatibility, and has entirely new documentation available both online and in the program.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Tau-Jet Matching and Tag-and-Probe Tau Tagging Efficiencies for HH→bbτ+τ− Searches Using Run 3 CMS Scouting Data

We are studying tau-jet matching efficiency and tau tagging efficiency for the search for Higgs boson pair production in the HH→bbτ+τ− decay channel using Run 3 CMS scouting data. Collision events in the CMS detector produce many particle candidates, so jets are clustered using the anti-kT algorithm to identify possible tau signatures. In Monte Carlo simulation, tau-jet matching efficiency can be measured by comparing generated taus to reconstructed jets. In actual collision data, however, generated taus are not available, so we use a tag-and-probe method with Z→τ+τ− candidate events. In this method, one tau candidate is used as the tag and the other as the probe. The invariant mass of the tau-pair candidates is plotted and fitted with signal and background functions to estimate the number of real tau events and determine the tagging efficiency. By comparing efficiencies in data and Monte Carlo simulation, this work helps evaluate the performance of scouting-based tau reconstruction and tau tagging for future HH→bbτ+τ− searches.

Bellot, Annella [North Central Coll.; Fermilab]↗
DOE OSTI2026

Tau-Jet Matching and Tag-and-Probe Tau Tagging Efficiencies for HH→bbτ+τ− Searches Using Run 3 CMS Scouting Data

We are studying tau-jet matching efficiency and tau tagging efficiency for the search for Higgs boson pair production in the HH→bbτ+τ− decay channel using Run 3 CMS scouting data. Collision events in the CMS detector produce many particle candidates, so jets are clustered using the anti-kT algorithm to identify possible tau signatures. In Monte Carlo simulation, tau-jet matching efficiency can be measured by comparing generated taus to reconstructed jets. In actual collision data, however, generated taus are not available, so we use a tag-and-probe method with Z→τ+τ− candidate events. In this method, one tau candidate is used as the tag and the other as the probe. The invariant mass of the tau-pair candidates is plotted and fitted with signal and background functions to estimate the number of real tau events and determine the tagging efficiency. By comparing efficiencies in data and Monte Carlo simulation, this work helps evaluate the performance of scouting-based tau reconstruction and tau tagging for future HH→bbτ+τ− searches.

Bellot, Annella [North Central Coll.; Fermilab]↗
NASA NTRS1989

Image gathering and restoration - Information and visual quality

A method is investigated for optimizing the end-to-end performance of image gathering and restoration for visual quality. To achieve this objective, one must inevitably confront the problems that the visual quality of restored images depends on perceptual rather than mathematical considerations and that these considerations vary with the target, the application, and the observer. The method adopted in this paper is to optimize image gathering informationally and to restore images interactively to obtain the visually preferred trade-off among fidelity resolution, sharpness, and clarity. The results demonstrate that this method leads to significant improvements in the visual quality obtained by the traditional digital processing methods. These traditional methods allow a significant loss of visual quality to occur because they treat the design of the image-gathering system and the formulation of the image-restoration algorithm as two separate tasks and fail to account for the transformations between the continuous and the discrete representations in image gathering and reconstruction.

Mccormick, Judith A.↗
NASA NTRS1990

Solution algorithms for the two-dimensional Euler equations on unstructured meshes

The objective of the study was to analyze implicit techniques employed in structured grid algorithms for solving two-dimensional Euler equations and extend them to unstructured solvers in order to accelerate convergence rates. A comparison is made between nine different algorithms for both first-order and second-order accurate solutions. Higher-order accuracy is achieved by using multidimensional monotone linear reconstruction procedures. The discussion is illustrated by results for flow over a transonic circular arc.

Whitaker, D. L.↗
NASA NTRS2007

POD Model Reconstruction for Gray-Box Fault Detection

Proper orthogonal decomposition (POD) is the mathematical basis of a method of constructing low-order mathematical models for the "gray-box" fault-detection algorithm that is a component of a diagnostic system known as beacon-based exception analysis for multi-missions (BEAM). POD has been successfully applied in reducing computational complexity by generating simple models that can be used for control and simulation for complex systems such as fluid flows. In the present application to BEAM, POD brings the same benefits to automated diagnosis. BEAM is a method of real-time or offline, automated diagnosis of a complex dynamic system.The gray-box approach makes it possible to utilize incomplete or approximate knowledge of the dynamics of the system that one seeks to diagnose. In the gray-box approach, a deterministic model of the system is used to filter a time series of system sensor data to remove the deterministic components of the time series from further examination. What is left after the filtering operation is a time series of residual quantities that represent the unknown (or at least unmodeled) aspects of the behavior of the system. Stochastic modeling techniques are then applied to the residual time series. The procedure for detecting abnormal behavior of the system then becomes one of looking for statistical differences between the residual time series and the predictions of the stochastic model.

Park, Han↗
DOE OSTI2020

Large Scale Tensor Factorization via Parallel Sketches

Tensor factorization methods have recently gained increased popularity. A key feature that renders tensors attractive is the ability to directly model multi-relational data. In this work, we propose ParaSketch, a parallel tensor factorization algorithm that enables massive parallelism, to deal with large tensors. The idea is to compress the large tensor into multiple small tensors, decompose each small tensor in parallel, and combine the results to reconstruct the desired latent factors. Prior art in this direction entails potentially very high complexity in the (Gaussian) compression and final combining stages. Adopting sketching matrices for compression, the proposed method enjoys a dramatic reduction in compression complexity, and features a much lighter combining step. Moreover, theoretical analysis shows that the compressed tensors inherit latent identifiability under mild conditions, hence establishing correctness of the overall approach. Numerical experiments corroborate the theory and demonstrate the effectiveness of the proposed algorithm.

block term decomposition↗
DOE OSTI2021

Implementation and analysis of quantum computing application to Higgs boson reconstruction at the large Hadron Collider

With the advent of the High-Luminosity Large Hadron Collider (HL-LHC) era, high energy physics (HEP) event selection will require new approaches to rapidly and accurately analyze vast databases. The current study addresses the enormity of HEP databases in an unprecedented manner—a quantum search using Grover’s Algorithm (GA) on an unsorted database, ATLAS Open Data, from the ATLAS detector. A novel method to identify rare events at 13 TeV in CERN’s LHC using quantum computing (QC) is presented. As indicated by the Higgs boson decay channel H→ZZ*→4l , the detection of four leptons in one event may be used to reconstruct the Higgs boson and, more importantly, evince Higgs boson decay to some new phenomena, such as H→ZZ d →4l . Searching the dataset for collisions resulting in detection of four leptons using a Jupyter Notebook, a classical simulation of GA, and several quantum computers with multiple qubits, the current application was found to make the proper selection in the unsorted dataset. Quantum search efficacy was analyzed for the incoming HL-LHC by implementing the QC method on multiple classical simulators and IBM’s quantum computers with the IBM Qiskit Open Source Software. The current QC application provides a novel, high-efficiency alternative to classical database searches, demonstrating its potential utility as a rapid and increasingly accurate search method in HEP.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Graphical Optimization of Spectral Shift Reconstructions for Optical Backscatter Reflectometry

Optical backscatter reflectometry (OBR) is an interferometric technique that can be used to measure local changes in temperature and mechanical strain based on spectral analyses of backscattered light from a singlemode optical fiber. The technique uses Fourier analyses to resolve spectra resulting from reflections occurring over a discrete region along the fiber. These spectra are cross-correlated with reference spectra to calculate the relative spectral shifts between measurements. The maximum of the cross-correlated spectra—termed quality—is a metric that quantifies the degree of correlation between the two measurements. Recently, this quality metric was incorporated into an adaptive algorithm to (1) selectively vary the reference measurement until the quality exceeds a predefined threshold and (2) calculate incremental spectral shifts that can be summed to determine the spectral shift relative to the initial reference. Using a graphical (network) framework, this effort demonstrated the optimal reconstruction of distributed OBR measurements for all sensing locations using a maximum spanning tree (MST). By allowing the reference to vary as a function of both time and sensing location, the MST and other adaptive algorithms could resolve spectral shifts at some locations, even if others can no longer be resolved.

47 OTHER INSTRUMENTATION↗
NASA NTRS2001

A New Ensemble Canonical Correlation Prediction Scheme for Seasonal Precipitation

Department of Mathematical Sciences, University of Alberta, Edmonton, Canada This paper describes the fundamental theory of the ensemble canonical correlation (ECC) algorithm for the seasonal climate forecasting. The algorithm is a statistical regression sch eme based on maximal correlation between the predictor and predictand. The prediction error is estimated by a spectral method using the basis of empirical orthogonal functions. The ECC algorithm treats the predictors and predictands as continuous fields and is an improvement from the traditional canonical correlation prediction. The improvements include the use of area-factor, estimation of prediction error, and the optimal ensemble of multiple forecasts. The ECC is applied to the seasonal forecasting over various parts of the world. The example presented here is for the North America precipitation. The predictor is the sea surface temperature (SST) from different ocean basins. The Climate Prediction Center's reconstructed SST (1951-1999) is used as the predictor's historical data. The optimally interpolated global monthly precipitation is used as the predictand?s historical data. Our forecast experiments show that the ECC algorithm renders very high skill and the optimal ensemble is very important to the high value.

Kim, Kyu-Myong↗
DOE OSTI2026

Direct estimation of the density of states for fermionic systems

Simulating time evolution is one of the most natural applications of quantum computers and is thus one of the most promising prospects for achieving practical quantum advantage. Here, we develop quantum algorithms to extract thermodynamic properties by estimating the density of states (DOS), which is a central object in quantum statistical mechanics. We introduce several key innovations that significantly improve the practicality and extend the generality of previous techniques. First, our approach allows one to estimate the DOS only for a specific subspace of the full Hilbert space. This is crucial for fermionic systems, since both canonical and grand canonical ensemble thermal equilibrium properties depend on subspaces of fixed number. Second, in our approach, by time evolving very simple, random initial states, such as randomly chosen computational basis states, we can exactly recover the DOS on average. Third, due to circuit-depth limitations, we only reconstruct the DOS up to a convolution with a Gaussian window—thus all imperfections that shift the energy levels by less than the width of the convolution window will not significantly affect the estimated DOS. For these reasons, we find the approach is a promising candidate for early quantum advantage as even short-time, noisy dynamics can yield a semiquantitative reconstruction of the DOS (convolution with a broad Gaussian window), while early fault-tolerant devices will likely enable higher-resolution DOS reconstruction through longer time evolutions. We demonstrate the practicality of our approach in representative Fermi-Hubbard and spin models and indeed find that our approach is highly robust against algorithmic errors in the time evolution and against gate noise. We further demonstrate that our approach is compatible with noisy intermediate-scale quantum (NISQ) computing NISQ-friendly variational techniques, introducing and leveraging a technique for variational time evolution.

97 MATHEMATICS AND COMPUTING↗