Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Adaptive sampling”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Dynamic PRA-Based Estimation of PWR Coping Time Using a Surrogate Model for Accident Tolerant Fuel

In this study, we propose an interpolation-based response surface surrogate methodology to manage a large number of scenarios in dynamic probabilistic risk assessment. It adopts the shape Dynamic Time Warping algorithm to cluster the interpolation neighborhood from time series sample data. The interpolation method was adapted from Taylor Kriging to allow a reduced-order model of the Taylor series. In order to demonstrate its applicability to complex issues in risk assessment for nuclear engineering, an example risk response surface to estimate emergency core cooling system (ECCS) criteria for triplex silicon carbide (SiC) accident-tolerant fuel was constructed. The response surface was exploited to estimate the cumulative failure probability of the fuel cladding structure due to the uncertainties in operator actions and safety systems. The functional failures were assessed based on a combination of individual layer failures computed by coupling Risk Analysis Virtual Environment software with a pressurized water reactor 1000-MW(electric) RELAP5 model and the in-house fuel performance assessment module. Results showed that SiC cladding failure probability spiked less than 1 min after a large-break loss-of- coolant accident whenever the current ECCS criteria for Zircaloy-4 (Zr-4) cladding was used. However, it still provides an increased safety margin of three orders of magnitude compared to Zr-4. This positive margin could be utilized to relax active ECCS requirements by allowing deviations of up to 450 s in its actuation time. The proposed surrogate methodology generated a response surface of SiC cladding failure probability reasonably well, with a significant savings of computation time. This methodology is expected to be useful in the analysis of system response with complex uncertainty sources.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Glacier ice archives nearly 15,000-year-old microbes and phages

Background Glacier ice archives information, including microbiology, that helps reveal paleoclimate histories and predict future climate change. Though glacier-ice microbes are studied using culture or amplicon approaches, more challenging metagenomic approaches, which provide access to functional, genome-resolved information and viruses, are under-utilized, partly due to low biomass and potential contamination. Results We expand existing clean sampling procedures using controlled artificial ice-core experiments and adapted previously established low-biomass metagenomic approaches to study glacier-ice viruses. Controlled sampling experiments drastically reduced mock contaminants including bacteria, viruses, and free DNA to background levels. Amplicon sequencing from eight depths of two Tibetan Plateau ice cores revealed common glacier-ice lineages including Janthinobacterium, Polaromonas, Herminiimonas, Flavobacterium, Sphingomonas, and Methylobacterium as the dominant genera, while microbial communities were significantly different between two ice cores, associating with different climate conditions during deposition. Separately, ~355- and ~14,400-year-old ice were subject to viral enrichment and low-input quantitative sequencing, yielding genomic sequences for 33 vOTUs. These were virtually all unique to this study, representing 28 novel genera and not a single species shared with 225 environmentally diverse viromes. Further, 42.4% of the vOTUs were identifiable temperate, which is significantly higher than that in gut, soil, and marine viromes, and indicates that temperate phages are possibly favored in glacier-ice environments before being frozen. In silico host predictions linked 18 vOTUs to co-occurring abundant bacteria (Methylobacterium, Sphingomonas, and Janthinobacterium), indicating that these phages infected ice-abundant bacterial groups before being archived. Functional genome annotation revealed four virus-encoded auxiliary metabolic genes, particularly two motility genes suggest viruses potentially facilitate nutrient acquisition for their hosts. Finally, given their possible importance to methane cycling in ice, we focused on Methylobacterium viruses by contextualizing our ice-observed viruses against 123 viromes and prophages extracted from 131 Methylobacterium genomes, revealing that the archived viruses might originate from soil or plants. Conclusions Together, these efforts further microbial and viral sampling procedures for glacier ice and provide a first window into viral communities and functions in ancient glacier environments. Such methods and datasets can potentially enable researchers to contextualize new discoveries and begin to incorporate glacier-ice microbes and their viruses relative to past and present climate change in geographically diverse regions globally.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2023

Adaptive estimation of quantum observables

The accurate estimation of quantum observables is a critical task in science. With progress on the hardware, measuring a quantum system will become increasingly demanding, particularly for variational protocols that require extensive sampling. Here, we introduce a measurement scheme that adaptively modifies the estimator based on previously obtained data. Our algorithm, which we call AEQuO, continuously monitors both the estimated average and the associated error of the considered observable, and determines the next measurement step based on this information. We allow both for overlap and non-bitwise commutation relations in the subsets of Pauli operators that are simultaneously probed, thereby maximizing the amount of gathered information. AEQuO comes in two variants: a greedy bucket-filling algorithm with good performance for small problem instances, and a machine learning-based algorithm with more favorable scaling for larger instances. The measurement configuration determined by these subroutines is further post-processed in order to lower the error on the estimator. We test our protocol on chemistry Hamiltonians, for which AEQuO provides error estimates that improve on all state-of-the-art methods based on various grouping techniques or randomized measurements, thus greatly lowering the toll of measurements in current and future quantum applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Evaluation of a high-throughput method for processing sponge-stick samples to detect viable, non-spore-forming biothreat agents

After a bioterrorism incident, surface sampling is often used to determine the extent of contamination and exposure, guiding decontamination efforts and decisions for re-occupancy of affected sites. The sponge-stick (SS) is a preferred and commonly used device for sample collection to detect both spore-forming and non-spore-forming biothreat agents from non-porous surfaces. Here, in this study, a recently developed high-throughput method (HTM) for processing SS samples to detect viable Bacillus anthracis spores was adapted for detection of non-spore-forming biothreat agents, Yersinia pestis and Francisella tularensis. The scalable HTM was used to process up to 20 SS samples simultaneously, compared to the current stomacher-based method which processes one SS at a time. Comparisons of the HTM and the stomacher-based method were statistically indistinguishable for most experiments (P > 0.05) with HTM recoveries of 37–60 % for Y. pestis inoculated at 102–103 cells/SS and held 48 h at 4 °C to mimic sample transport/storage. The HTM was integrated with Rapid Viability-Polymerase Chain Reaction (RV-PCR) analysis to detect viable Y. pestis in the presence of particulate contamination (Arizona Test Dust, ATD). This approach detected Y. pestis inoculated at 20 cells/SS and ATD did not impact detection (P > 0.05). F. tularensis showed significantly lower recoveries between no-hold time and 48-h hold time (4 °C, P < 0.05) using the HTM, which further testing showed could be due to toxicity of the neutralizing buffer used for SS pre-wetting. With modifications, this method could enhance throughput capacity while maintaining similar recovery efficiencies to current methods for other non-spore-forming bacterial pathogens.

Biological and medical sciences↗
DOE OSTI2024

Adaptive Scalpel Scanning Probe Microscopy for Enhanced Volumetric Sensing in Tomographic Analysis

Controlling nanoscale tip‐induced material removal is crucial for achieving atomic‐level precision in tomographic sensing with atomic force microscopy (AFM). While advances have enabled volumetric probing of conductive features with nanometer accuracy in solid‐state devices, materials, and photovoltaics, limitations in spatial resolution and volumetric sensitivity persist. This work identifies and addresses in‐plane and vertical tip‐sample junction leakage as sources of parasitic contrast in tomographic AFM, hindering real‐space 3D reconstructions. Novel strategies are proposed to overcome these limitations. First, the contrast mechanisms analyzing nanosized conductive features are explored when confining current collection purely to in‐plane transport, thus allowing reconstruction with a reduction in the overestimation of the lateral dimensions. Furthermore, an adaptive tip‐sample biasing scheme is demonstrated for the mitigation of a class of artefacts induced by the high electric field inside the thin oxide when volumetrically reduced. This significantly enhances vertical sensitivity by approaching the intrinsic limits set by quantum tunneling processes, allowing detailed depth analysis in thin dielectrics. The effectiveness of these methods is showcased in tomographic reconstructions of conductive filaments in valence change memory, highlighting the potential for application in nanoelectronics devices and bulk materials and unlocking new limits for tomographic AFM.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Implementation of a practical Markov chain Monte Carlo sampling algorithm in PyBioNetFit

Abstract Summary Bayesian inference in biological modeling commonly relies on Markov chain Monte Carlo (MCMC) sampling of a multidimensional and non-Gaussian posterior distribution that is not analytically tractable. Here, we present the implementation of a practical MCMC method in the open-source software package PyBioNetFit (PyBNF), which is designed to support parameterization of mathematical models for biological systems. The new MCMC method, am, incorporates an adaptive move proposal distribution. For warm starts, sampling can be initiated at a specified location in parameter space and with a multivariate Gaussian proposal distribution defined initially by a specified covariance matrix. Multiple chains can be generated in parallel using a computer cluster. We demonstrate that am can be used to successfully solve real-world Bayesian inference problems, including forecasting of new Coronavirus Disease 2019 case detection with Bayesian quantification of forecast uncertainty. Availability and implementation PyBNF version 1.1.9, the first stable release with am, is available at PyPI and can be installed using the pip package-management system on platforms that have a working installation of Python 3. PyBNF relies on libRoadRunner and BioNetGen for simulations (e.g. numerical integration of ordinary differential equations defined in SBML or BNGL files) and Dask.Distributed for task scheduling on Linux computer clusters. The Python source code can be freely downloaded/cloned from GitHub and used and modified under terms of the BSD-3 license (https://github.com/lanl/pybnf). Online documentation covering installation/usage is available (https://pybnf.readthedocs.io/en/latest/). A tutorial video is available on YouTube (https://www.youtube.com/watch?v=2aRqpqFOiS4&t=63s). Supplementary information Supplementary data are available at Bioinformatics online.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Bayesian sparse learning with preconditioned stochastic gradient MCMC and its applications

Deep neural networks have been successfully employed in an extensive variety of research areas, including solving partial differential equations. Despite its significant success, there are some challenges in effectively training DNN, such as avoiding overfitting in over-parameterized DNNs and accelerating the optimization in DNNs with pathological curvature. Here, we propose a Bayesian type sparse deep learning algorithm. The algorithm utilizes a set of spike-and-slab priors for the parameters in the deep neural network. The hierarchical Bayesian mixture will be trained using an adaptive empirical method. That is, one will alternatively sample from the posterior using preconditioned stochastic gradient Langevin Dynamics (PSGLD), and optimize the latent variables via stochastic approximation. The sparsity of the network is achieved while optimizing the hyperparameters with adaptive searching and penalizing. A popular SG-MCMC approach is Stochastic gradient Langevin dynamics (SGLD). However, considering the complex geometry in the model parameter space in nonconvex learning, updating parameters using a universal step size in each component as in SGLD may cause slow mixing. To address this issue, we apply a computationally manageable preconditioner in the updating rule, which provides a step-size parameter to adapt to local geometric properties. Moreover, by smoothly optimizing the hyperparameter in the preconditioning matrix, our proposed algorithm ensures a decreasing bias, which is introduced by ignoring the correction term in the preconditioned SGLD. According to the existing theoretical framework, we show that the proposed algorithm can asymptotically converge to the correct distribution with a controllable bias under mild conditions. Numerical tests are performed on both synthetic regression problems and learning solutions of elliptic PDE, which demonstrate the accuracy and efficiency of the present work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Enabling dynamic 3D coherent diffraction imaging via adaptive latent space tuning of generative autoencoders

Abstract Coherent diffraction imaging (CDI) is an advanced non-destructive 3D X-ray imaging technique for measuring a sample’s electron density. The main challenge of CDI is loss of phase information in diffraction intensity measurements, resulting in lengthy iterative reconstruction processes that can return non-unique solutions, which pose challenges for experiments attempting to track dynamic sample evolution through multiple states. As the increased brightness of fourth-generation light sources enables faster sample measurements and drives operando experiments with Bragg CDI, there is a growing need for faster reconstruction techniques that can keep pace. We have developed an adaptive generative autoencoder approach for uniquely tracking a sample’s electron density as it dynamically evolves. Our approach adaptively tunes the low-dimensional latent embedding of a generative autoencoder, enabling a computationally efficient manner to account for time-varying shifting distributions in real-time. Analytic proof of convergence is provided as well as numerical demonstration of sample tracking with noisy measurements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Understanding the Impacts of Stellar Companions on Planet Formation and Evolution: A Survey of Stellar and Planetary Companions within 25 pc

We explore the impact of outer stellar companions on the occurrence rate of giant planets detected with radial velocities. We searched for stellar and planetary companions to a volume-limited sample of solar-type stars within 25 pc. Using adaptive optics imaging observations from the Lick 3 m and Palomar 200″ Telescopes, we characterized the multiplicity of our sample stars, down to the bottom of the main sequence. With these data, we confirm field star multiplicity statistics from previous surveys. We additionally combined three decades of radial velocity (RV) data from the California Planet Search with newly collected RV data from Keck/HIRES and the Automated Planet Finder/Levy Spectrometer to search for planetary companions in these same systems. Using an updated catalog of both stellar and planetary companions, as well as detailed injection/recovery tests to determine our sensitivity and completeness, we measured the occurrence rate of planets among the single- and multiple-star systems. We found that planets with masses in the range of 0.1–10 M {sub J} and with semimajor axes of 0.1–10 au have an occurrence rate of 0.18{sub −0.03}{sup +0.04} planets per star when they orbit single stars and an occurrence rate of 0.12 ± 0.04 planets per star when they orbit a star in a binary system. Breaking the sample down by the binary separation, we found that only one planet-hosting binary system had a binary separation <100 au, and none had a separation <50 au. These numbers yielded planet occurrence rates of 0.20{sub −0.06}{sup +0.07} planets per star for binaries with separation a {sub B} > 100 au and 0.04{sub −0.02}{sup +0.04} planets per star for binaries with separation a {sub B} < 100 au. The similarity in the planet occurrence rate around single stars and wide primaries implies that wide binary systems should actually host more planets than single-star systems, since they have more potential host stars. We estimated a system-wide planet occurrence rate of 0.3 planets per wide binary system for binaries with separations a {sub B} > 100 au. Finally, we found evidence that giant planets in binary systems have a different semimajor-axis distribution than their counterparts in single-star systems. The planets in the single-star sample had a significantly higher occurrence rate outside of 1 au than inside 1 au by nearly 4σ, in line with expectations that giant planets are most common near the snow line. However, the planets in the wide binary systems did not follow this distribution, but rather had equivalent occurrence rates interior and exterior to 1 au. This may point to binary-mediated planet migration acting on our sample, even in binaries wider than 100 au.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2026

Protonation Dynamics of Confined Ethanol–Water Mixtures in H-ZSM-5 from Machine Learning-Driven Metadynamics

Zeolites are indispensable heterogeneous catalysts in industrial chemical processes, valued for their strong Brønsted acidity, well-defined microporous frameworks, and tunable pore structures. Their catalytic activity arises primarily from Brønsted acid sites (BAS), typically present as bridging hydroxyl groups (Si–OH–Al). Under aqueous reaction conditions, these protons interact dynamically with water and alcohol molecules, leading to complex solvation and protonation behavior within confined pores. In this study, we investigate the protonation equilibrium occurring between ethanol and water at the BAS of acidic zeolites under varying hydration levels, i.e., C2H5OH–(H2O)n, n=1–4. Local structure was analyzed through an adaptive-learning global optimization algorithm, while enhanced sampling molecular dynamics simulations with Well-Tempered Metadynamics (WMetaD) and machine learning interatomic potentials (MLPs) provide free-energy surfaces (FES) at variable hydration levels. The results reveal a strong dependence of proton localization on the degree of hydration. At low hydration (1 water molecule), the proton resides predominantly on ethanol; with 2 water molecules, it shifts toward water, and at higher hydration (3 or more water molecules), it becomes extensively delocalized over the water cluster. These findings underscore the critical role of solvation in modulating acid site behavior and suggest that a minimum of three water molecules is necessary to fully stabilize the proton on water within the zeolite framework. This solvation threshold has significant implications for catalytic processes, particularly in biomass conversion reactions where alcohol protonation is a key step in dehydration mechanisms.

machine learning↗
DOE OSTI2026

A simple wire-coil resistive heater for high temperature radial x-ray diffraction in a diamond anvil cell

Diamond anvil cells are commonly used at synchrotron x-ray diffraction beamlines to study structural and thermoelastic properties of materials at high pressures. In a radial geometry, where the x-ray probe is oriented perpendicular to the axis of force, the deformation and strength of materials can be measured in situ. Because the anelastic and failure properties of materials depend strongly on temperature, many applications would benefit from the ability to measure high pressure radial diffraction in elevated and accurately controlled thermal environments. Previous work to introduce high temperature to radial diamond anvil cells has been largely limited to laser heating, with relatively scant efforts to resistively heat the sample. Here, we report a relatively straightforward adaptation of a simple wire coil heater, with in situ high-temperature radial diffraction performed on tungsten carbide up to 573 K at beamline 12.2.2 of the Advanced Light Source. In conclusion, the results demonstrate that the differential stress supported by WC decreases with increasing temperature: the differential stress on the basal (001) and pyramidal (101) planes decreased 6.6% and 5.5%, respectively, while the (100) plane only saw a 2.7% decrease, in agreement with previous studies.

Diamond anvil cells↗
DOE OSTI2026

F-Hash: Feature-Based Hash Design for Time-Varying Volume Visualization via Multi-Resolution Tesseract Encoding

Interactive time-varying volume visualization is challenging due to its complex spatiotemporal features and sheer size of the dataset. Recent works transform the original discrete time-varying volumetric data into continuous Implicit Neural Representations (INR) to address the issues of compression, rendering, and super-resolution in both spatial and temporal domains. However, training the INR takes a long time to converge, especially when handling large-scale time-varying volumetric datasets. In this work, we proposed F-Hash, a novel feature-based multi-resolution Tesseract encoding architecture to greatly enhance the convergence speed compared with existing input encoding methods for modeling time-varying volumetric data. The proposed design incorporates multi-level collision-free hash functions that map dynamic 4D multi-resolution embedding grids without bucket waste, achieving high encoding capacity with compact encoding parameters. Our encoding method is agnostic to time-varying feature detection methods, making it a unified encoding solution for feature tracking and evolution visualization. Experiments show the F-Hash achieves state-of-the-art convergence speed in training various time-varying volumetric datasets for diverse features. We also proposed an adaptive ray marching algorithm to optimize the sample streaming for faster rendering of the time-varying neural representation.

deep learning↗
DOE OSTI2025

Detecting outbreaks using a spatial latent field

In this paper, we present a method for estimating the infection-rate of a disease as a spatial-temporal field. Our data comprises time-series case-counts of symptomatic patients in various areal units of a region. We extend an epidemiological model, originally designed for a single areal unit, to accommodate multiple units. The field estimation is framed within a Bayesian context, utilizing a parameterized Gaussian random field as a spatial prior. We apply an adaptive Markov chain Monte Carlo method to sample the posterior distribution of the model parameters condition on COVID-19 case-count data from three adjacent counties in New Mexico, USA. Our results suggest that the correlation between epidemiological dynamics in neighboring regions helps regularize estimations in areas with high variance (i.e., poor quality) data. Using the calibrated epidemic model, we forecast the infection-rate over each areal unit and develop a simple anomaly detector to signal new epidemic waves. Our findings show that anomaly detector based on estimated infection-rates outperforms a conventional algorithm that relies solely on case-counts.

Safta, Cosmin [Sandia National Laboratories (SNL-C↗
DOE OSTI2020

Fracture Shearing in the Eau Claire Formation

This data set consists of Computed Tomographic (CT) data for five sheared Eau Claire Formation core samples with complex and heterogeneous lithology. Each sample was prefractured, housed in a specially adapted core holder, and sheared in incremental fashion. CT scans were taken before and after each shearing event.

Computed Tomography↗
DOE OSTI2020

Detector Tilt Considerations in Bragg Coherent Diffraction Imaging: A Simulation Study

This paper addresses the three-dimensional signal distortion and image reconstruction issues in X-ray Bragg coherent diffraction imaging (BCDI) in the event of a general non-orthogonal orientation of the area detector with respect to the diffracted beam. Growing interest in novel BCDI adaptations at fourth-generation synchrotron light sources has necessitated improvisations in the experimental configuration and the subsequent data analysis. One such possibly unavoidable improvisation that is envisioned in this paper is a photon-counting area detector whose face is tilted away from the perpendicular to the Bragg-diffracted beam during the acquisition of the coherent diffraction signal. We describe a likely circumstance in which one would require such a detector configuration, along with the experimental precedent at third-generation synchrotrons. Using physically accurate diffraction simulations from synthetic scatterers in the presence of such tilted detectors, we analyze the general nature of the observed signal distortion qualitatively and quantitatively and provide a prescription to correct for it during image reconstruction. Our simulations and reconstructions are based on an adaptation of the known theory of BCDI sampling geometry, as well as the recently developed projection-based methods of wavefield propagation. Such configurational modifications and their numerical remedies are potentially valuable in realizing unconventional coherent diffraction measurement geometries, eventually paving the way for the integration of BCDI into new material characterization experiments at next-generation light sources.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Beyond Point Estimates: Benchmarking Uncertainty Quantification Methods on the AION-1 Astronomical Foundation Model

Foundation models for astronomical surveys offer powerful learned representations that can be transferred to downstream regression tasks such as galaxy property estimation. However, point predictions alone are insufficient for scientific inference; reliable uncertainty quantification (UQ) is essential. We compare seven UQ methods on galaxy property regression using frozen AION-1 foundation-model embeddings, predicting redshift, stellar mass, stellar-population age, gas-phase metallicity, and specific star-formation rate, from Legacy Survey photometry/imaging and DESI spectra, with PROVABGS-derived labels. Distribution-free conformal methods achieve marginal coverage within $\sim$1 pp of the nominal 90% across all properties, while non-conformal baselines (Deep Ensembles, MC~Dropout) fail to calibrate reliably. Among conformal approaches, Conformalized Quantile Regression (CQR) delivers the best coverage in the bin with the poorest model predictions. More importantly, only the Locally Valid and Discriminative (LVD) framework -- particularly when operating on AION-1 embeddings -- also provides finite-sample \emph{local validity}, producing intervals that adapt to each galaxy's local prediction difficulty rather than relying on marginal guarantees alone. These results establish conformal prediction, and LVD in particular, as the preferred UQ framework for uncertainty-aware inference on foundation-model embeddings in astrophysics.

Tame-Narvaez, Karla [Fermilab] (ORCID:000000022249↗
DOE OSTI2026

Predicting Adaptively Chosen Observables in Quantum Systems

Recent advances have demonstrated that 𝒪⁡(log 𝑀) measurements suffice to predict 𝑀 properties of arbitrarily large quantum many-body systems. However, these remarkable findings assume that the properties to be predicted are chosen independently of the data. This assumption can be violated in practice, where scientists adaptively select properties after looking at previous predictions. This work investigates the adaptive setting for three classes of observables: local, Pauli, and bounded-Frobenius-norm observables. We prove that Ω⁡(√𝑀) samples of an arbitrarily large unknown quantum state are necessary to predict expectation values of 𝑀 adaptively chosen local and Pauli observables, where the system size scales exponentially and polynomially in 𝑀, respectively. We also present computationally efficient algorithms that achieve this information-theoretic lower bound. In contrast, for bounded-Frobenius-norm observables, we devise an algorithm requiring only 𝒪⁡(log 𝑀) samples, independent of system size. These results highlight the potential pitfalls of adaptivity in analyzing data from quantum experiments and provide algorithmic tools to safeguard against erroneous predictions in quantum experiments.

Machine learning↗
DOE OSTI2024

Data-Driven Computation of Probabilistic Marching Cubes for Efficient Visualization of Level-Set Uncertainty

Uncertainty visualization is an important emerging research area. Being able to visualize data uncertainty can help scientists improve trust in analysis and decision-making. However, visualizing uncertainty can add computational overhead, which can hinder the efficiency of analysis. In this paper, we propose novel data-driven techniques to reduce the computational requirements of the probabilistic marching cubes (PMC) algorithm. PMC is an uncertainty visualization technique that studies how uncertainty in data affects level-set positions. However, the algorithm relies on expensive Monte Carlo (MC) sampling for the multivariate Gaussian uncertainty model because no closed-form solution exists for the integration of multivariate Gaussian. In this work, we propose the eigenvalue decomposition and adaptive probability model techniques that reduce the amount of MC sampling in the original PMC algorithm and hence speed up the computations. Our proposed methods produce results that show negligible differences compared with the original PMC algorithm demonstrated through metrics, including root mean squared error, maximum error, and difference images. We demonstrate the performance and accuracy evaluations of our data-driven methods through experiments on synthetic and real datasets.

Athawale, Tushar↗