Search NASA⌕ Search

SEARCH · Search NASA

Results for “Theoretical, Mathematical and Computational Physics”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Surrogate Modeling For Efficiently Accurately and Conservatively Estimating Measures of Risk

We present a surrogate modeling framework for conservatively estimating measures of risk from limited realizations of an expensive physical experiment or computational simulation. We adopt a probabilistic description of risk that assigns probabilities to consequences associated with an event and use risk measures, which combine objective evidence with the subjective values of decision makers, to quantify anticipated outcomes. Given a set of samples, we construct a surrogate model that produces estimates of risk measures that are always greater than their empirical estimates obtained from the training data. These surrogate models not only limit over-confidence in reliability and safety assessments, but produce estimates of risk measures that converge much faster to the true value than purely sample-based estimates. We first detail the construction of conservative surrogate models that can be tailored to the specific risk preferences of the stakeholder and then present an approach, based upon stochastic orders, for constructing surrogate models that are conservative with respect to families of risk measures. The surrogate models introduce a bias that allows them to conservatively estimate the target risk measures. We provide theoretical results that show that this bias decays at the same rate as the L 2 error in the surrogate model. Our numerical examples confirm that risk-aware surrogate models do indeed over-estimate the target risk measures while converging at the expected rate.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Static Subspace Approximation for Random Phase Approximation Correlation Energies: Implementation and Performance

Developing theoretical understanding of complex reactions and processes at interfaces requires using methods that go beyond semilocal density functional theory to accurately describe the interactions between solvent, reactants and substrates. Methods based on many-body perturbation theory, such as the random phase approximation (RPA), have previously been limited due to their computational complexity. However, this is now a surmountable barrier due to the advances in computational power available, in particular through modern GPU-based supercomputers. In this work, we describe the implementation of RPA calculations within BerkeleyGW and show its favorable computational performance on large complex systems relevant for catalysis and electrochemistry applications. Our implementation builds off of the static subspace approximation which, by employing a compressed representation of the frequency dependent polarizability, enables the evaluation of the RPA correlation energy with significant acceleration and systematically controllable accuracy. We find that the computational cost of calculating the RPA correlation energy scales only linearly with system size for systems containing up to 50 thousand bands, and is expected to scale quadratically thereafter. We also show excellent strong scaling results across several supercomputers, demonstrating the performance and portability of this implementation.

algorithmic development↗
DOE OSTI2023

QuDPy: A Python-based tool for computing ultrafast non-linear optical responses

Nonlinear Optical Spectroscopy is a well-developed field with theoretical and experimental advances that have benefited multiple disciplines, including chemistry, biology, and physics. However, for the accurate interpretation of the corresponding multi-dimensional spectra, there is a need for precise quantum dynamical simulations based on model Hamiltonians. In this article, we present the initial release of our code, QuDPy (Quantum Dynamics in Python), which provides a robust numerical platform for performing quantum dynamics simulations based on model systems, including open quantum systems. Furthermore, a distinguishing feature of our approach is the ability to specify various high-order optical response pathways in the form of double-sided Feynman diagrams through a straightforward input syntax. This syntax outlines the time-ordering of ket-sided or bra-sided optical interactions acting on the time-evolving density matrix of the system. We utilize the quantum dynamics capabilities of QuTip to simulate the spectral response of complex systems, allowing us to compute virtually any $n$-th order optical response of the model system. To illustrate the utility of our approach, we provide a series of example calculations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Explicit physics-informed neural networks for nonlinear closure: The case of transport in tissues

In upscaling methods, closures for nonlinear problems present a well-known challenge. While a number of theoretical methods have been proposed for handling such closures, nonlinearities still remain a significant obstacle for many problems. In this work, we use a combination of formal upscaling and data-driven machine learning for explicitly closing a nonlinear transport and reaction process in multiscale tissues. The classical effectiveness factor model is used to formulate the macroscale reaction kinetics. We train a multilayer perceptron network using training data generated by direct numerical simulations over microscale examples. Once trained, the network is used in an algorithm for numerically solving the upscaled (coarse-grained) differential equation describing mass transport and reaction in two example tissues. The network is described as being explicit in the sense that the network is trained using macroscale concentrations and gradients of concentration as components of the feature space rather than incorporating them as part of a constraint in the optimization process. Network training and solutions to the macroscale transport equations were computed for two different tissues. The two tissue types (brain and liver) exhibit markedly different geometrical complexity and spatial scale (cell size and sample size). The upscaled solutions for the average concentration are compared with numerical solutions derived from the microscale concentration fields by a posteriori averaging. There are three outcomes of this work of particular note. 1) Our overall approach results in an upscaled nonlinear PDE. The PDE is closed using a neural network, and our approach results in the definition of the classical effectiveness factor for effecting closure. 2) We identify particular source terms for the closure problem that are important for representing the structure of the closure. These source terms involve macroscale concentrations and their gradients. We adopt these source terms to use as explicit features in the learning algorithm. We find the trained networks that include the macroscale source terms generate models that are able to predict the correction factor with increased fidelity over those that do not. 3) We find that the trained network exhibits good generalizability, and it is able to predict the effectiveness factor with high fidelity for realistically-structured tissues despite the significantly different scale and geometrical complexity of the two example tissue types. This latter result emphasizes our purposeful connection between conventional averaging methods with the use of machine learning for closure; this contrasts with some machine learning methods for upscaling where the exact form of the macroscale equation remains unknown.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Conditional Pseudo-Reversible Normalizing Flow for Surrogate Modeling in Quantifying Uncertainty Propagation

We introduce a conditional pseudo-reversible normalizing flow (PR-NF) that directly learns conditional probability distributions from noisy physical models to efficiently quantify both forward and inverse uncertainty propagation. Traditional surrogate modeling approaches approximate only the deterministic component of physical models, requiring separate noise characterization and computationally expensive sampling methods for inverse problems. Here, in this work, we develop the conditional PR-NF model to directly learn and efficiently generate samples from the conditional probability density functions (PDFs). The training process utilizes dataset consisting of input-output pairs without requiring prior knowledge about the noise and the function. Once trained, our model efficiently generates samples from conditional PDFs for any input within the training domain. Moreover, the pseudo-reversibility feature allows for the use of fully connected neural network architectures, which simplifies the implementation and enables theoretical analysis. We provide a rigorous convergence analysis of the conditional PR-NF model, showing its ability to converge to the target conditional PDF using the Kullback−Leibler divergence. To demonstrate the effectiveness of our method, we apply it to several benchmark tests and a real-world geologic carbon storage problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Risk-Adaptive Experimental Design for High-Consequence Systems: LDRD Final Report

Constructing accurate statistical models of critical system responses typically requires an enormous amount of data from physical experiments or numerical simulations. Unfortunately, data generation is often expensive and time consuming. To streamline the data generation process, optimal experimental design determines the 'best' allocation of experiments with respect to a criterion that measures the ability to estimate some important aspect of an assumed statistical model. While optimal design has a vast literature, few researchers have developed design paradigms targeting tail statistics, such as quantiles. In this project, we tailored and extended traditional design paradigms to target distribution tails. Our approach included (i) the development of new optimality criteria to shape the distribution of prediction variances, (ii) the development of novel risk-adapted surrogate models that provably overestimate certain statistics including the probability of exceeding a threshold, and (iii) the asymptotic analysis of regression approaches that target tail statistics such as superquantile regression. To accompany our theoretical contributions, we released implementations of our methods for surrogate modeling and design of experiments in two complementary open source software packages, the ROL/OED Toolkit and PyApprox.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Classical optimization with imaginary-time block encoding on quantum computers: The MaxCut problem

Optimization problems in finance, physics, and computer science are typically very hard to tackle in classical computing; quantum computing could help speed up computations and provide efficient methods for tackling large problems. Typically, to treat a problem with a quantum computer, the optimal solution is cast as the ground state of a diagonal Hamiltonian. Here, we develop a method, called imaginary-time evolution block encoding (ITE-BE), based on a recent imaginary-time algorithm, which requires no variational parameter optimization, as all parameters can be derived analytically from the target Hamiltonian. We also demonstrate that our method can be successfully combined with other quantum algorithms such as the quantum approximate optimization algorithm (QAOA). For illustration, here we study the MaxCut problem. We find that the QAOA ansatz increases the postselection success of ITE-BE, and shallow QAOA circuits, when boosted with ITE-BE, achieve better performance than deeper QAOA circuits. For the special case of the transverse initial state, we adapt our block-encoding scheme to allow for a deterministic application of the first layer of the circuit.

Zhong, Dawei [University of Southern California, L↗
DOE OSTI2024

TNet: A Model-Constrained Tikhonov Network Approach for Inverse Problems

Deep learning (DL), in particular deep neural networks, by default is purely data-driven and in general does not require physics. This is the strength of DL but also one of its key limitations when applied to science and engineering problems in which underlying physical properties—such as stability, conservation, and positivity—and accuracy are required. DL methods in their original forms are often not capable of respecting the underlying mathematical models or achieving desired accuracy even in big-data regimes. On the other hand, many data-driven science and engineering problems, such as inverse problems, typically have limited experimental or observational data, and DL would overfit the data in this case. Leveraging information encoded in the underlying mathematical models, we argue, not only compensates for missing information in low data regimes but also provides opportunities to equip DL methods with the underlying physics, hence promoting better generalization. This paper develops a model-constrained DL approach and its variant TNet—a Tikhonov neural network—which are capable of learning not only information hidden in the training data but also in the underlying mathematical models to solve inverse problems governed by partial differential equations in low data regimes. We provide the constructions and some theoretical results for the proposed approaches for both linear and nonlinear inverse problems. Since TNet is designed to learn inverse solutions with Tikhonov regularization, it is interpretable: in fact it recovers Tikhonov solutions for linear cases while potentially approximating Tikhonov solutions for nonlinear inverse problems. We also prove that data randomization can enhance not only the smoothness of the networks but also their generalizations. Comprehensive numerical results confirm the theoretical findings and show that with even as little as 1 training data sample for one-dimensional (1D) deconvolution, 5 for an inverse 2D heat conductivity problem, 100 for inverse initial conditions for a time-dependent 2D Burgers’s equation, and 50 for inverse initial conditions for 2D Navier–Stokes equations, TNet solutions can be as accurate as Tikhonov solutions while being several orders of magnitude faster. Furthermore, this is possible owing to the model-constrained term, replications, and randomization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Trajectory Ensemble Methods Provide Single-Molecule Statistics for Quantum Dynamical Systems

The emergence of experiments capable of probing quantum dynamics at the single-molecule level requires the development of new theoretical tools capable of simulating and analyzing these dynamics beyond an ensemble-averaged description. In this article, we present an efficient method for sampling and simulating the dynamics of the individual quantum systems that make up an ensemble and apply it to study the nonequilibrium dynamics of the ubiquitous spin-boson model. We generate an ensemble of single-system trajectories, and we analyze this trajectory ensemble using tools from classical statistical mechanics. Our results demonstrate that the dynamics of quantum coherence is highly heterogeneous at the single-system level due to variations in the initial bath configuration, which significantly affects the transient exchange of coherence between the system and its bath. Here, we observe that single systems tend to retain coherence over time scales longer than that of the ensemble. We also compute a novel thermodynamic entanglement entropy that quantifies a thermodynamic driving force favoring system–bath entanglement.

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

Capturing many-body correlation effects with quantum and classical computing

Theoretical descriptions of excited states of molecular systems in high-energy regimes are crucial for supporting and driving many experimental efforts at light source facilities. However, capturing their complicated correlation effects requires formalisms that provide a hierarchical infrastructure of approximations. These approximations lead to an increased overhead in classical computing methods and, therefore, decisions regarding the ranking of approximations and the quality of results must be made on purely numerical grounds. The emergence of quantum computing methods has the potential to change this situation. Here, in this study, we demonstrate the efficiency of the quantum phase estimator (QPE) in identifying core-level states relevant to x-ray photoelectron spectroscopy. We compare and validate the QPE predictions with exact diagonalization and real-time equation-of-motion coupled-cluster formulations, which are some of the most accurate methods for states dominated by collective correlation effects.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2026

Identifying Differential Equations in Fourier Domain (FourierIdent)

We investigate identifying differential equations in the frequency domain. Fourier analysis is an important tool in theoretical analysis and numerical solvers of differential equations, yet there is limited work in exploring this connection in the identification of differential equations. This paper aims to identify the underlying differential equation in the frequency domain, from a given single realization of the differential equation perturbed by noise. Such setting imposes difficulties which are different from other identification methods where computation is carried out in the physical domain. We propose several ways to mitigate the challenges arising from noise in data and large differences in the magnitudes of frequency responses. The main takeaways are that identifying differential equations solely in the frequency domain is challenging, the method we propose is based on a form of domain partitions in the frequency domain, and this method shows benefits for complex data even with high level of noise. We introduce a Fourier feature denoising, and define the meaningful data region and the core regions of features to reduce the effect of noise in the frequency domain and to enhance the accuracy in coefficient identification. The proposed method is tested on various differential equations with linear, nonlinear, and high-order derivative feature terms, and shows advantages on complex data with many frequency modes, even under high level of noise.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Ab Initio Methods for L-edge X-ray Absorption Spectroscopy

The theoretical prediction of X-ray absorption spectra (XAS) has become common- place in electronic structure theory. The ability to better model and understand L-edge spectra is of great interest in the study of transition metal complexes and a wide variety of solid state materials. However, until recently few rst-principles works have mod- eled L-edge XAS due to the presence of strong spin-orbit coupling in the 2p orbitals which splits the observed peaks into multiple groups of features. Therefore, a proper description of spin-orbit coupling is vital for the successful prediction of L-edge spectra. A number of new approaches that incorporate spin-orbit coupling have recently made advances in the computation of L-edge spectra. In this review, we describe recent work in computational L-edge XAS and how these methods may continue to improve in the future. Comparison of the advantages and disadvantages of the various approaches are considered, with special attention to not only the computational cost of the level of theory, but also the various approaches that can be used to compute the absorption spectra with a large number of high energy excited states.

Kasper, Joseph M.↗
DOE OSTI2021

Maximum bound principle preserving integrating factor Runge–Kutta methods for semilinear parabolic equations

A large class of semilinear parabolic equations satisfy the maximum bound principle (MBP) in the sense that the time-dependent solution preserves for any time a uniform pointwise bound imposed by its initial and boundary conditions. Here, the MBP plays a crucial role in understanding the physical meaning and the well-posedness of the mathematical model. Investigation on numerical algorithms with preservation of the MBP has attracted increasingly attentions in recent years, especially for the temporal discretizations, since the violation of MBP may lead to nonphysical solutions or even blow-ups of the algorithms. In this paper, we study high-order MBP-preserving time integration schemes by means of the integrating factor Runge-Kutta (IFRK) method. Beginning with the space-discrete system of semilinear parabolic equations, we present the IFRK method in general form and derive the sufficient conditions for the method to preserve the MBP. In particular, we show that the classic four-stage, fourth-order IFRK scheme is MBP preserving for some typical semilinear systems although not strong stability preserving, which can be instantly applied to the Allen-Cahn type of equations. To our best knowledge, this is the first time to present a fourth-order linear numerical method preserving the MBP. In addition, convergence of these numerical schemes is proved theoretically and verified numerically, as well as their efficiency by simulations of 2D and 3D long-time evolutional behaviors. Numerical experiments are also carried out for a model which is not a typical gradient flow as the Allen-Cahn type of equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Flow instabilities in helical-coil steam generators for small modular reactors: A review

Here, this study covers the research and discoveries in two-phase flow-boiling instabilities available in the literature—specifically for a helical-coil steam generator (HCSG), including experimental findings, theoretical research, computational models, and system code analyses—supporting research and development of representative small modular reactors (SMRs). Like other new and advanced reactor systems, water-cooled SMRs require experimental data from both integral and separate thermal-hydraulics test facilities for the verification and validation (V&V) of the computational models and computer codes in order to design and obtain regulatory approval. The complex dynamics of two-phase flow-boiling instabilities includes flow regimes physics phenomena, flow-channel geometries, heat-transfer behavior, and interactions among the solid–liquid-gas within the system boundary, all of which are pivotal for understanding the design and operational challenges of SMRs. This study focuses on identifying the relevant knowledge gaps on boiling instabilities—specifically for a HCSG—and provides insights about future research direction optimizing the transport of thermal energy, mass-flow rates, and boundary conditions that ensure the adequate heat-transfer performance, operational stability, and safety associated with SMR systems.

20 FOSSIL-FUELED POWER PLANTS↗
DOE OSTI2025

2020 Budget Request for the DOE Computational Science Graduate Fellowship (CSGF) Grant

The Department of Energy Computational Science Graduate Fellowship (DOE CSGF) is essential for addressing the increasingly complex national workforce demands stemming from the growth of computational science and engineering challenges. Computational science and engineering (CSE) takes a multidisciplinary approach that utilizes scientific computing to tackle practical problems and provide technical tools across the spectrum of scientific discovery. The DOE CSGF specifically highlights high-performance computing (HPC) as a critical enabling technology in CSE, driving advancements in science and engineering that are vital to both the DOE and the broader economy. Over the past half-century, HPC has been an essential tool for DOE’s success. During this period, important missions, such as nuclear stockpile stewardship, have turned to HPC as an essential technology. Entire science disciplines have been transformed through the augmentation of scientific observation via HPC. At government laboratories, academic institutions, and in industry, DOE CSGF alumni are helping push traditional HPC boundaries while contributing to discoveries in high-energy physics, quantum information systems, fusion-reactor design, machine learning, additive manufacturing, nano materials for next-generation batteries and transistors, and advanced nuclear reactor modeling. In addition, HPC is used to address national health needs that will eventually point to cures both by helping cancer researchers manage and analyze huge troves of data, by simulating biological mechanisms, and by accelerating drug development. A 2023 report from the ASCAC Subcommittee on American Competitiveness and Innovation to the ASCR office, “Can the United States Maintain Its Leadership in High-Performance Computing?” says of the Program, “The CSGF program provides a barometer for disciplines that will be of interest to future DOE computing. Computational biology, machine learning, and quantum computing are among the subjects that began to swell in the ranks of CSGF applicants before the labs were hiring as high a percentage of employees in these categories.” The explosion of scientific and technological data has heightened the demand for advanced high-performance computing (HPC) to transform these data into meaningful scientific insights. As access to vast amounts of data increases, the fields of Machine Learning and Artificial Intelligence are experiencing a resurgence, enhancing the established practices of computational modeling and simulation. In its September 2020 subcommittee report on "AI/ML, Data Intensive Science, and High-Performance Computing," the DOE Advanced Scientific Computing Advisory Committee (ASCAC) specifically called for a fellowship program to train computational and data scientists to address exascale and data-intensive computing challenges. This integration of empirical and theoretical modeling will increasingly guide federal policymakers in making decisions that impact American society and future generations. It demands a workforce of highly skilled and intellectually agile computational scientists capable of navigating the rapid advancements in scientific computing within the DOE National Laboratory research environment. The DOE CSGF program has consistently addressed this critical need.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Path integral Monte Carlo approach to the structural properties and collective excitations of liquid $$^3{\text {He}}$$ without fixed nodes

Abstract Due to its nature as a strongly correlated quantum liquid, ultracold helium is characterized by the nontrivial interplay of different physical effects. Bosonic $$^4{\text {He}}$$ 4 He exhibits superfluidity and Bose-Einstein condensation. Its physical properties have been accurately determined on the basis of ab initio path integral Monte Carlo (PIMC) simulations. In contrast, the corresponding theoretical description of fermionic $$^3{\text {He}}$$ 3 He is severely hampered by the notorious fermion sign problem, and previous PIMC results have been derived by introducing the uncontrolled fixed-node approximation. In this work, we present extensive new PIMC simulations of normal liquid $$^3{\text {He}}$$ 3 He without any nodal constraints. This allows us to to unambiguously quantify the impact of Fermi statistics and to study the effects of temperature on different physical properties like the static structure factor $$S({\mathbf {q}})$$ S ( q ) , the momentum distribution $$n({\mathbf {q}})$$ n ( q ) , and the static density response function $$\chi ({\mathbf {q}})$$ χ ( q ) . In addition, the dynamic structure factor $$S({\mathbf {q}},\omega )$$ S ( q , ω ) is rigorously reconstructed from imaginary-time PIMC data. From simulations of $$^3{\text {He}}$$ 3 He , we derived the familiar phonon–maxon–roton dispersion function that is well-known for $$^4{\text {He}}$$ 4 He and has been reported previously for two-dimensional $$^3{\text {He}}$$ 3 He films (Nature 483:576–579 (2012)). The comparison of our new results for both $$S({\mathbf {q}})$$ S ( q ) and $$S({\mathbf {q}},\omega )$$ S ( q , ω ) with neutron scattering measurements reveals an excellent agreement between theory and experiment.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Development and Validation of Physics-Based Sub-Models of High-Pressure Supercritical Fuel Injection at Diesel Conditions Insert

The project sought to develop and validate accurate, physics-based, numerical submodels and implement them in computational fluid dynamics (CFD) software codes to enable accurate predictions of diesel sprays at pressures higher than the current systems. The combined experimental-computational effort has four main objectives: (1) acquire spatially and temporally resolved scalar measurements of fuel-oxidizer mixing in the near field of the fuel jet, (2) develop software modules to calculate thermo-physical properties of diesel surrogates and their mixtures with oxidizer of interest in real-gas operating regime, (3) integrate the real-fluid model into a commercial and an open-source CFD code to simulate fuel-air mixing in high-pressure diesel sprays, and (4) assess the robustness, accuracy, and uncertainty of the integrated CFD solvers in computing diesel sprays. Project accomplishments are consistent with the original goals of the project. Although we acquired spatially and temporally resolved scalar measurements, they were limited to refractive index difference and not to thermodynamic properties such as temperature and equivalence ratio. However, we successfully developed the theoretical background needed to acquire such measurements at diesel conditions and demonstrated the capability of the RSD for scalar measurements in a canonical turbulent jet flow replicating features of the diesel jet. Additional work will be needed to implement these procedures at high-pressure, high-temperature engine-like conditions of the CPFR. Mainly, we did not anticipate the need to find the liquid boundary and its statistical features or the state relationships between refractive index and thermodynamic properties, assuming the widely known Dale-Gladstone equation would suffice. Still, efforts devoted to these tasks were essential to fulfil the goals of the project and serves as the foundation on which many of the conclusions and key contributions of this project are based. Further assessment and application of the developed CFD codes is recommended to fully realize the benefits of this research.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2024

Super Resolving Unrolled Neural Networks for Remote Sensing

In remote sensing systems, the capabilities of the system are constrained by the complex interactions between size, weight, and power (SWAP) of potential designs. In electro-optical (EO) systems, examples of these critical parameters include the system’s sensitivity and resolution. Those parameters can be increased by ever larger optical apertures and focal planes but at the cost of more SWAP. Multi-image super resolution (MISR) techniques allow resolution to be enhanced via computation rather than more sophisticated optical hardware. These algorithms combine multiple images together into a single, higher resolution image, trading temporal resolution and computation for spatial resolution. Fielded MISR techniques, such as Drizzle, can require several hundred images to create a single super resolved image, implying reduced temporal resolution, increased data acquisition load, and limiting mission applications. Iterative techniques, such as model-based image reconstruction and compressive sensing, have been shown to create super resolved images using fewer images than Drizzle. They do this by posing an optimization problem that balances accuracy between a highly accurate physical model and an image model. In the case of super resolution, the physical model is defined by the relation between low resolution input images and the desired high resolution output image. The image model encodes some assumptions about the super resolved image. These assumptions are meant to suppress reconstruction artifacts that arise due to deterministic physical model error, stochastic measurement noise, and potential undersampling. In practice, the performance of iterative methods are limited by imaging models compatible with optimization. Deep learning-based methods can effectively learn image models of arbitrary complexity, but lack the theoretical explainability and robustness of iterative techniques. Consensus equilibrium (CE) generalizes the iterative techniques beyond optimization, enabling blackbox algorithms such as traditional and neural image denoisers to be used as the image model. CE-based approaches retain much of the explainability and robustness of iterative techniques while allowing the expressiveness of machine learning image models to be used. Additionally, by unrolling iterations of CE with an embedded image denoiser, the image denoiser can be further trained and specialized to the specific application with potentially higher quality reconstructions. Under this project, we demonstrated the feasibility of training an unrolled neural network based upon CE. While we didn’t train one, we showed that the CE process is differentiable and its gradient can be tractably computed. We also explored the usage of a variants of CE akin to generative neural works. Most importantly, we applied the CE framework to a number of problems including non-blind deconvolution, upsampling, single-image super resolution, MISR, event-based sensing, and saturated deconvolution. Our MISR prototype creates high quality reconstructions with an order of magnitude fewer images than previous approaches and, critically, produces these reconstructions fast enough for practical usage.

47 OTHER INSTRUMENTATION↗