Search NASA⌕ Search

SEARCH · Search NASA

Results for “Inverse problem”

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 577 records · Page 32

Inferring Atmospheric Release Characteristics in a Large Computer Experiment using Bayesian Adaptive Splines

An atmospheric release of hazardous material, whether accidental or intentional, can be catastrophic for those in the path of the plume. Predicting the path of a plume based on characteristics of the release (location, amount and duration) and meteorological conditions is an active research area highly relevant for emergency and long-term response to these releases. As a result, researchers have developed particle dispersion simulators to provide plume path predictions that incorporate release characteristics and meteorological conditions. However, since release characteristics and meteorological conditions are often unknown, the inverse problem is of great interest, that is, based on all the observations of the plume so far, what can be inferred about the release characteristics? This is the question we seek to answer using plume observations from a controlled release at the Diablo Canyon Nuclear Power Plant in Central California. With access to a large number of evaluations of a computationally expensive particle dispersion simulator that includes continuous and categorical inputs and spatio-temporal output, building a fast statistical surrogate model (or emulator) presents many statistical challenges, but is an essential tool for inverse modeling and sensitivity analysis. We achieve accurate emulation using Bayesian adaptive splines to model weights on empirical orthogonal functions. Here, we use this emulator as well as appropriately identifiable simulator discrepancy and observational error models to calibrate the simulator, thus finding a posterior distribution of characteristics of the release. Since the release was controlled, these characteristics are known, making it possible to compare our findings to the truth.

54 ENVIRONMENTAL SCIENCES↗

On the Strong Convergence of Forward-Backward Splitting in Reconstructing Jointly Sparse Signals

We consider the problem of reconstructing an infinite set of sparse, finite-dimensional vectors, that share a common sparsity pattern, from incomplete measurements. This is in contrast to the work (Daubechies et al., Pure Appl. Math. 57(11), 1413–1457, 2004), where the single vector signal can be infinite-dimensional, and (Fornasier and Rauhut, SIAM J. Numer. Anal. 46(2), 577613, 2008), which extends the aforementioned work to the joint sparse recovery of finite number of infinite-dimensional vectors. In our case, to take account of the joint sparsity and promote the coupling of nonvanishing components, we employ a convex relaxation approach with mixed norm penalty ℓ 2,1 . This paper discusses the computation of the solutions of linear inverse problems with such relaxation by a forward-backward splitting algorithm. However, since the solution matrix possesses infinitely many columns, the arguments of Daubechies et al. (Pure Appl. Math. 57(11), 1413–1457, 2004) no longer apply. As such, we establish new strong convergence results for the algorithm, in particular when the set of jointly sparse vectors is infinite.

97 MATHEMATICS AND COMPUTING↗

An approach to characterizing spatial aspects of image system blur

Quantitative X-ray radiographic imaging systems that utilize a charged couple device (CCD) camera connected to a thick, monolithic scintillator can exhibit blur that varies spatially across the field of view, especially for thick scintillators used in pulse-power radiography of dynamically compressed objects. Here, a three-point approach to estimating and accounting for this effect is demonstrated by (a) using a local estimation technique to measure the effect of blurring a calibration object at key locations across the field of view, (b) combining each of the local estimates into a spatially varying blurring function via partitions of unity interpolation, and (c) resolving the effects of that blur on the image by solving an ill-posed inverse problem using a spatially varying regularization term. The technique is demonstrated on synthetic examples and actual radiographs collected at the Naval Research Laboratory’s (NRL)Mercury pulsed power facility.

97 MATHEMATICS AND COMPUTING↗

Sequential optimal positioning of mobile sensors using mutual information

Source localization, such as detecting a nuclear source in an urban area or ascertaining the origin of a chemical plume, is generally regarded as a well-documented inverse problem; however, optimally placing sensors to collect data for such problems is a more challenging task. In particular, optimal sensor placement—that is, measurement locations resulting in the least uncertainty in the estimated source parameters—depends on the location of the source, which is typically unknown a priori. Mobile sensors are advantageous because they have the flexibility to adapt to any given source position. While most mobile sensor strategies designate a trajectory for sensor movement, we instead employ mutual information, based on Shannon entropy, to choose the next measurement location from a discrete set of design conditions.

97 MATHEMATICS AND COMPUTING↗

Variational Dirichlet Blur Kernel Estimation

Blind image deconvolution involves two key objectives: 1) latent image and 2) blur estimation. For latent image estimation, we propose a fast deconvolution algorithm, which uses an image prior of nondimensional Gaussianity measure to enforce sparsity and an undetermined boundary condition methodology to reduce boundary artifacts. For blur estimation, a linear inverse problem with normalization and nonnegative constraints must be solved. However, the normalization constraint is ignored in many blind image deblurring methods, mainly because it makes the problem less tractable. In this paper, we show that the normalization constraint can be very naturally incorporated into the estimation process by using a Dirichlet distribution to approximate the posterior distribution of the blur. Making use of variational Dirichlet approximation, we provide a blur posterior approximation that considers the uncertainty of the estimate and removes noise in the estimated kernel. Furthermore, experiments with synthetic and real data demonstrate that the proposed method is very competitive to the state-of-the-art blind image restoration methods.

97 MATHEMATICS AND COMPUTING↗

Accelerating a fluvial incision and landscape evolution model with parallelism

Solving inverse problems, performing sensitivity analyses, and achieving statistical rigour in landscape evolution models require running many model realizations. Parallel computation is necessary to achieve this in a reasonable time. However, no previous landscape evolution algorithm is able to leverage modern parallelism. In this report, I describe an algorithm that can utilize the parallel potential of GPUs and many-core processors, in addition to working well in serial. The new algorithm runs 43× faster (70 s vs. 3000 s on a 10,000×10,000 input) than the previous state-of-the-art and exhibits sublinear scaling with input size. I also identify key techniques for multiple flow direction routing and quickly eliminating landscape depressions and local minima. Complete, well-commented, easily adaptable source code for all versions of the algorithm is available on Github and Zenodo.

58 GEOSCIENCES↗

A gradient-based optimization approach for the detection of partially connected surfaces using vibration tests

The integrity of engineering structures is often compromised by embedded surfaces that result from incomplete bonding during the manufacturing process, or initiation of damage from fatigue or impact processes. Examples include delaminations in composite materials, incomplete weld bonds when joining two components, and internal crack planes that may form when a structure is damaged. In many cases the areas of the structure in question may not be easily accessible, thus precluding the direct assessment of structural integrity. In this paper, we present a gradient-based, partial differential equation (PDE)-constrained optimization approach for solving the inverse problem of interface detection in the context of steady-state dynamics. An objective function is defined that represents the difference between the model predictions of structural response at a set of spatial locations, and the experimentally measured responses. One of the contributions of our work is a novel representation of the design variables using a density field that takes values in the range [0, 1] and raised to an integer exponent that promotes solutions to be near the extrema of the range. The density field is combined with the penalty method for enforcing a zero gap condition and realizing partially bonded surfaces. Furthermore the use of the penalty method with a density field representation leads to objective functions that are continuously differentiable with respect to the unknown parameters, enabling the use of efficient gradient-based optimization algorithms. Numerical examples of delaminated plates are presented to demonstrate the feasibility of the approach.

42 ENGINEERING↗

Off-Axis Nulling Transfer Function Measurement: A First Assessment

We want to study a polychromatic inverse problem method with nulling interferometers to obtain information on the structures of the exozodiacal light. For this reason, during the first semester of 2013, thanks to the support of the consortium PERSEE, we launched a campaign of laboratory measurements with the nulling interferometric test bench PERSEE, operating with 9 spectral channels between J and K bands. Our objective is to characterise the transfer function, i.e. the map of the null as a function of wavelength for an off-axis source, the null being optimised on the central source or on the source photocenter. We were able to reach on-axis null depths better than 10(exp −4). This work is part of a broader project aiming at creating a simulator of a nulling interferometer in which typical noises of a real instrument are introduced. We present here our first results.

interferometric test bench PERSEE↗

Multi-fidelity Bayesian neural networks: Algorithms and applications

Here we propose a new class of Bayesian neural networks (BNNs) that can be trained using noisy data of variable fidelity, and we apply them to learn function approximations as well as to solve inverse problems based on partial differential equations (PDEs). These multi-fidelity BNNs consist of three neural networks: The first is a fully connected neural network, which is trained following the maximum a posteriori probability (MAP) method to fit the low-fidelity data; the second is a Bayesian neural network employed to capture the cross-correlation with uncertainty quantification between the low- and high-fidelity data; and the last one is the physics-informed neural network, which encodes the physical laws described by PDEs. For the training of the last two neural networks, we first employ the mean-field variational inference (VI) to maximize the evidence lower bound (ELBO) to obtain informative prior distributions for the hyperparameters in the BNNs, and subsequently we use the Hamiltonian Monte Carlo (HMC) method to estimate accurately the posterior distributions for the corresponding hyperparameters. We demonstrate the accuracy of the present method using synthetic data as well as real measurements. Specifically, we first approximate a one- and four-dimensional function, and then infer the reaction rates in one- and two-dimensional diffusion-reaction systems. Moreover, we infer the sea surface temperature (SST) in the Massachusetts and Cape Cod Bays using satellite images and in-situ measurements. Taken together, our results demonstrate that the present method can capture both linear and nonlinear correlation between the low- and high-fidelity data adaptively, identify unknown parameters in PDEs, and quantify uncertainties in predictions, given a few scattered noisy high-fidelity data. Finally, we demonstrate that we can effectively and efficiently reduce the uncertainties and hence enhance the prediction accuracy with an active learning approach, using as examples a specific one-dimensional function approximation and an inverse PDE problem.

97 MATHEMATICS AND COMPUTING↗

Closed-Form Approximation of the Total Variation Proximal Operator

Total variation (TV) is a widely used function for regularizing imaging inverse problems that is particularly appropriate for images whose underlying structure is piecewise constant. TV regularized optimization problems are typically solved using proximal methods, but the way in which they are applied is constrained by the absence of a closed-form expression for the proximal operator of the TV function. A closed-form approximation of the TV proximal operator has previously been proposed, but its accuracy was not theoretically explored in detail. Here, we address this gap by making several new theoretical contributions, proving that the approximation leads to a proximal operator of some convex function, it is equivalent to a gradient descent step on a smoothed version of TV, and that its error can be fully characterized and controlled with its scaling parameter. We experimentally validate our theoretical results on image denoising and sparse-view computed tomography (CT) image reconstruction.

97 MATHEMATICS AND COMPUTING↗

Advancing the Frontiers of Deep Learning for Low-Dose 3D Cone-Beam CT Reconstruction

X-ray computed tomography (CT) is an important noninvasive medical imaging modality for studying the structural details of internal organs. Image reconstruction in CT is an inverse problem of recovering an object's internal structure from the absorption profile of X-ray beams (sinogram) measured using a detector. The classical variational approach for CT reconstruction minimizes an energy functional using an appropriate iterative algorithm. Motivated by the success of deep learning (DL), researchers have begun to leverage training data and enhanced computing capabilities in recent years to produce high-fidelity reconstructed images. Nonetheless, much of the academic research in DL algorithms for CT has focused primarily on the two-dimensional setting (with simplified forward operators and noise model) for proofs-of-concept, and a comprehensive benchmarking of various classical and data-driven CT reconstruction approaches has not beenundertaken. The key objective of our CT reconstruction grand challenge was to promote methodological advancements for both classical and DL-based approaches for clinical CT with a reasonably accurately simulated 3D CT forward operator and noise model. We have utilized the publicly available LIDC-IDRI dataset and simulated sinograms and FDK images corresponding to two dose levels (clinical- and low-dose, constituting two tracks of the challenge) starting from the normal-dose images as the ground truth. In this paper, we summarize the motivation, context, and results of our challenge, and highlight the future research directions in DL for clinical CT.

X-ray tomography↗

Wave tilt sounding of multilayered structures

The relationship between the wave tilt and the electrical parameters of a multilayered structure is investigated. Particular emphasis is placed on the inverse problem associated with the sounding planetary surfaces. An inversion technique, based on multifrequency wave tilt, is proposed and demonstrated with several computer models. It is determined that there is close agreement between the electrical parameters used in the models and those in the inversion values.

Warne, L.↗

On domain symmetry and its use in homogenization

The present study focuses on solving partial differential equations in domains exhibiting symmetries and periodic boundary conditions for the purpose of homogenization. We show in a systematic manner how the symmetry can be exploited to significantly reduce the complexity of the problem and the computational burden. This is especially relevant in inverse problems, when one needs to solve the partial differential equation (the primal problem) many times in an optimization algorithm. The main motivation of our study is inverse homogenization used to design architected composite materials with novel properties which are being fabricated at ever increasing rates thanks to recent advances in additive manufacturing. For example, one may optimize the morphology of a two-phase composite unit cell to achieve isotropic homogenized properties with maximal bulk modulus and minimal Poisson ratio. Typically, the isotropy is enforced by applying constraints to the optimization problem. However, in two dimensions, one can alternatively optimize the morphology of an equilateral triangle and then rotate and reflect the triangle to form a space filling D 3 symmetric hexagonal unit cell that necessarily exhibits isotropic homogenized properties. One can further use this D 3 symmetry to reduce the computational expense by performing the “unit strain” periodic boundary condition simulations on the single triangle symmetry sector rather than the six fold larger hexagon. In this paper we use group representation theory to derive the necessary periodic boundary conditions on the symmetry sectors of unit cells. The developments are done in a general setting, and specialized to the two-dimensional dihedral symmetries of the abelian D 2 , i.e. orthotropic, square unit cell and nonabelian D 3 , i.e. trigonal, hexagon unit cell. We then demonstrate how this theory can be applied by evaluating the homogenized properties of a two-phase planar composite over the triangle symmetry sector of a D 3 symmetric hexagonal unit cell.

36 MATERIALS SCIENCE↗

Regularization for Atmospheric Temperature Retrieval Problems

Passive remote sensing of the atmosphere is used to determine the atmospheric state. A radiometer measures microwave emissions from earth's atmosphere and surface. The radiance measured by the radiometer is proportional to the brightness temperature. This brightness temperature can be used to estimate atmospheric parameters such as temperature and water vapor content. These quantities are of primary importance for different applications in meteorology, oceanography, and geophysical sciences. Depending on the range in the electromagnetic spectrum being measured by the radiometer and the atmospheric quantities to be estimated, the retrieval or inverse problem of determining atmospheric parameters from brightness temperature might be linear or nonlinear. In most applications, the retrieval problem requires the inversion of a Fredholm integral equation of the first kind making this an ill-posed problem. The numerical solution of the retrieval problem requires the transformation of the continuous problem into a discrete problem. The ill-posedness of the continuous problem translates into ill-conditioning or ill-posedness of the discrete problem. Regularization methods are used to convert the ill-posed problem into a well-posed one. In this paper, we present some results of our work in applying different regularization techniques to atmospheric temperature retrievals using brightness temperatures measured with the SSM/T-1 sensor. Simulation results are presented which show the potential of these techniques to improve temperature retrievals. In particular, no statistical assumptions are needed and the algorithms were capable of correctly estimating the temperature profile corner at the tropopause independent of the initial guess.

Velez-Reyes, Miguel↗

On the Derivation of Quasi-Newton Formulas for Optimization in Function Spaces

Newton’s method is usually preferred when solving optimization problems due to its superior convergence properties compared to gradient-based or derivative-free optimization algorithms. However, deriving and computing second-order derivatives needed by Newton’s method often is not trivial and, in some cases, not possible. In such cases quasi-Newton algorithms are a great alternative. In this paper, we provide a new derivation of well-known quasi-Newton formulas in an infinite-dimensional Hilbert space setting. Furthermore, it is known that quasi-Newton update formulas are solutions to certain variational problems over the space of symmetric matrices. In this paper, we formulate similar variational problems over the space of bounded symmetric operators in Hilbert spaces. By changing the constraints of the variational problem we obtain updates (for the Hessian and Hessian inverse) not only for the Broyden-Fletcher-Goldfarb-Shanno (BFGS) quasi-Newton method but also for Davidon–Fletcher–Powell (DFP), Symmetric Rank One (SR1), and Powell-Symmetric-Broyden (PSB). In addition, for an inverse problem governed by a partial differential equation (PDE), we derive DFP and BFGS “structured” secant formulas that explicitly use the derivative of the regularization and only approximates the second derivative of the misfit term. We show numerical results that demonstrate the desired mesh-independence property and superior performance of the resulting quasi-Newton methods.

97 MATHEMATICS AND COMPUTING↗