Search NASA⌕ Search

SEARCH · Search NASA

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 487 records · Page 27
All sourcesNASA NTRSDOE OSTI
NASA NTRS1998

Developing Information Power Grid Based Algorithms and Software

This exploratory study initiated our effort to understand performance modeling on parallel systems. The basic goal of performance modeling is to understand and predict the performance of a computer program or set of programs on a computer system. Performance modeling has numerous applications, including evaluation of algorithms, optimization of code implementations, parallel library development, comparison of system architectures, parallel system design, and procurement of new systems. Our work lays the basis for the construction of parallel libraries that allow for the reconstruction of application codes on several distinct architectures so as to assure performance portability. Following our strategy, once the requirements of applications are well understood, one can then construct a library in a layered fashion. The top level of this library will consist of architecture-independent geometric, numerical, and symbolic algorithms that are needed by the sample of applications. These routines should be written in a language that is portable across the targeted architectures.

Dongarra, Jack↗
DOE OSTI2024

Online randomized interpolative decomposition with a posteriori error estimator for temporal PDE data reduction

Traditional low-rank approximation is a powerful tool for compressing large data matrices that arise in simulations of partial differential equations (PDEs), but suffers from high computational cost and requires several passes over the PDE data. The compressed data may also lack interpretability thus making it difficult to identify feature patterns from the original data. Here, to address these issues, we present an online randomized algorithm to compute the interpolative decomposition (ID) of large-scale data matrices in situ. Compared to previous randomized IDs that used the QR decomposition to determine the column basis, we adopt a streaming ridge leverage score-based column subset selection algorithm that dynamically selects proper basis columns from the data and thus avoids an extra pass over the data to compute the coefficient matrix of the ID. In particular, we adopt a single-pass error estimator based on the non-adaptive Hutch++ algorithm to provide real-time error approximation for determining the best coefficients. As a result, our approach only needs a single pass over the original data and thus is suitable for large and high-dimensional matrices stored outside of core memory or generated in PDE simulations. A strategy to improve the accuracy of the reconstructed data gradient, when desired, within the ID framework is also presented. We provide numerical experiments on turbulent channel flow and ignition simulations, and on the NSTX Gas Puff Image dataset, comparing our algorithm with the offline ID algorithm to demonstrate its utility in real-world applications.

Column subset selection↗
DOE OSTI2026

Two datasets are better than one: method of double moments for 3D reconstruction in cryo-EM

Cryo-electron microscopy is a powerful imaging technique for reconstructing three-dimensional molecular structures from noisy tomographic projection images of randomly oriented particles. We introduce a new data fusion framework, termed the method of double moments, which reconstructs molecular structures from two instances of the second-order moment of projection images obtained under distinct orientation distributions: one uniform, the other non-uniform and unknown. We prove that these moments generically uniquely determine the underlying structure, up to a global rotation and reflection, and we develop a convex-relaxation-based algorithm that achieves accurate recovery using only second-order statistics. Our results demonstrate the advantage of collecting and modeling multiple datasets under different experimental conditions, illustrating that leveraging dataset diversity can substantially enhance reconstruction quality in computational imaging tasks.

Kam’s method↗
NASA NTRS2019

Land ice height-retrieval algorithm for NASA's ICESat-2 photon-counting laser altimeter

The Ice, Cloud, and land Elevation Satellite-2 (ICESat-2) and its sole scientific instrument, the Advanced Topographic Laser Altimeter System (ATLAS), was launched on 15 September 2018 with a primary goal of measuring changes in the surface of the Earth's land ice (glaciers and ice sheets). ATLAS is a photon-counting laser altimeter, which records the transit time of individual photons in order to reconstruct surface height along track. The ground-track pattern repeats every 91 days such that changes in ice sheet surface height can be estimated through time. In this paper, we describe the set of algorithms that have been developed for ICESat-2 to retrieve ice sheet surface height from the geolocated photons for the Land Ice Along-Track Height Product (ATL06), and demonstrate their output and performance using a synthetic dataset over various land-ice surfaces and under different cloud conditions. We show that the ATL06 algorithm is expected to perform at the level required to meet the ICESat-2 science objectives for land ice.

ICESat-2↗
NASA NTRS2009

Trajectory Reconstruction of the ST-9 Sounding Rocket Experiment Using IMU and Landmark Data

This paper presents trajectory reconstruction of the ST-9 sounding rocket experiment using the onboard IMU data and descent imagery. The raw IMU accelerometer measurements are first converted into inertial acceleration and then used in trajectory integration. The descent images are pre-processed using a map-matching algorithm and unique landmarks for each image are created. Using the converted IMU data and descent images, the result from dead-reckoning and the kinematic-fix approaches are first compared with the GPS measurements. Then, both the IMU data and landmarks are processed together using a batch least-squares filter and the position, velocity, stochastic acceleration, and camera orientation of each image are estimated. The reconstructed trajectory is compared with the GPS data and the corresponding formal uncertainties are presented. The result shows that IMU data and descent images processed with a batch filter algorithm provide the trajectory accuracy required for pin-point landing.

Park, Ryan S.↗
DOE OSTI2026

Improving unfolding and systematic uncertainty estimation using generative diffusion networks (Final Technical Report)

This final technical report summarizes the key accomplishments on the unfolding using diffusion model project, a DOE award received by PI Pierre-Hugues Beauchemin at Tufts University. This project main goal was to investigate the potential of diffusion models for unfolding experimental High Energy Physics data from detector effects while controlling systematics uncertainties. The project accomplished its goals by completing the following objectives: 1) Performing an object-by-object, event-by-event unfolding of various kinematic distributions reconstructed from detector data in HEP in a way that keeps correlations between unfolded observables while demonstrating competitive performance compared to standard algorithms used in the field; 2) Address the generalization problem by developing an unfolding algorithm capable to correctly infer the underlying distributions of observables and processes never seen before, while controlling the dominant theoretical uncertainties affecting the process, therefore increasing the effectiveness, the precision, and the applicability of the developed algorithm; 3) Understand the theoretical foundations between the developed algorithm so to extend it to applications beyond experimental HEP, for broader benefits to the society. This report provides an overview of the accomplishments related to each of these key objectives.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
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.↗
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 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↗
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↗
NASA NTRS1975

On the effect of timing errors in run length codes

Many redundancy removal algorithms employ some sort of run length code. Blocks of timing words are coded with synchronization words inserted between blocks. The probability of incorrectly reconstructing a sample because of a channel error in the timing data is a monotonically nondecreasing function of time since the last synchronization word. In this paper we compute the 'probability that the accumulated magnitude of timing errors equal zero' as a function of time since the last synchronization word for a zero-order predictor (ZOP). The result is valid for any data source that can be modeled by a first-order Markov chain and any digital channel that can be modeled by a channel transition matrix. An example is presented.

Wilkins, L. C.↗
DOE OSTI2026

Boosted decision tree reweighting of simulated neutrino interactions for O ( 1 ) GeV neutrino cross-section measurements

This paper illustrates a generic method for multidimensional reweighting of O ( 1 ) GeV neutrino interaction Monte Carlo samples. The reweighting is based on a boosted decision tree algorithm trained on high-dimensional space in detector final-state observables. This enables one generator’s events to be reweighted so that its reconstructed particle content and kinematics distributions, as well as detector efficiency, match those of a target model. The approach establishes an efficient way to reuse legacy Monte Carlo data, avoiding regeneration. As an example, we test its use in a measurement of transverse kinematic imbalance of the μ - and proton in charged-current quasielastic like ν μ events from the MINERvA experiment.

Lin, Z. [Rochester U.] (ORCID:0009000188903698)↗