Numerical simulations examining the relationship between wall-roughness and fluid flow in rock fractures
Explore the source record for details and available documents.
SEARCH · Search NASA
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.
Explore the source record for details and available documents.
We perform the neutron computed tomography reconstruction problem via an inverse problem formulation with a total variation penalty. In the case of highly under-resolved angular measurements, the total variation penalty suppresses high-frequency artifacts which appear in filtered back projections. Here, in order to efficiently compute solutions for this problem, we implement a variation of the split Bregman algorithm; due to the error-forgetting nature of the algorithm, the computational cost of updating can be significantly reduced via very inexact approximate linear solvers. We present the effectiveness of the algorithm in the significantly low-angular sampling case using synthetic test problems as well as data obtained from a high flux neutron source. Finally, the algorithm removes artifacts and can even roughly capture small features when an extremely low number of angles are used.
PFLOTRAN leverages massively parallel, high performance computing to simulate large-scale non-isothermal multiphase flow, multicomponent reactive transport and electrical resistivity tomography (ERT) problems in the subsurface environment. Researchers have employed PFLOTRAN to simulate these Earth system processes on leadership class supercomputers for over two decades. The code is designed to predict the future estate of environmental systems and better inform stakeholders in the regulatory decision making process (e.g., fate of contaminants, long-term stewardship for nuclear waste, impact of climate change, etc.). A diverse team of scientists oversees PFLOTRAN development and maintenance under an open-source licensing agreement and manages contributions from an international community of researchers.
Generative models can be trained to reproduce low-dimensional projections of high-dimensional phase space distributions. Normalizing flows are generative models that parameterize invertible transformations, allowing exact probability density evaluation and sampling. Consequently, flows are unbiased entropy estimators and could be used to solve the high-dimensional maximum-entropy tomography (MENT) problem. In this work, we evaluate a flow-based MENT solver (MENT-Flow) against exact maximum-entropy solutions and Minerbo's iterative MENT algorithm in two dimensions.
Diffusion models have emerged as powerful priors for solving inverse problems in computed tomography (CT). In certain applications, such as neutron CT, it can be expensive to collect large amounts of measurements even for a single scan leading to sparse data sets from which it is challenging to obtain high quality reconstructions even with diffusion models. One strategy to mitigate this challenge is to leverage a complementary, easily available imaging modality; however, such approaches typically require retraining the diffusion model with large datasets. In this work, we propose incorporating an additional modality without retraining the diffusion prior, enabling accelerated imaging of costly modalities. We further examine the impact of imperfect side modalities on cross-modal guidance. Our method is evaluated on sparse-view neutron computed tomography, where reconstruction quality is substantially improved by incorporating X-ray computed tomography of the same samples.
In this paper, we address the problem of emission tomography spatial reconstruction in three dimensions following a Bayesian nonparametric approach. Our model makes use of a generalization of the Dirichlet process called Pitman-Yor process. The problem in this approach is to deal with the infinite representation of the distribution in the inference. So we propose an efficient Markov Chain Monte-Carlo sampling scheme which is able to generate samples from the posterior distribution of the activity distribution. An application to 3D-PET reconstruction is presented.
Cosmic ray radiation is mostly composed, at sea level, by high energy muons, which are highly penetrating particles capable of crossing kilometers of rock. The ubiquitous and steady presence at the Earth's surface and the high penetration capability have motivated the use of cosmic ray radiation also in fields beyond particle physics, from geology, archaeology, speleology to industrial applications and homeland security. In particular, in recent years, the novel technique of muon tomography has been proposed, with the aim of performing non invasive inspection of large non accessible volumes, material atomic number Z and density discrimination, and three dimension image reconstruction of the inspected volume. In the present paper, after a short recall of the physical principles and mathematical formalism on which muon tomography is based, a number of examples of application of the novel technique in industry and homeland security issues is given. Moreover, a new application of cosmic rays detection techniques in the field of civil engineering is proposed. The aim is the monitoring of the stability of large structures, in particular the static monitoring of historical buildings, where conservation constraints are more severe and the time evolution of the deformation phenomena under study may be of the order of months or years. The new technique may be seen, in some way, as the reverse problem of muon tomography. As a significant case study, the monitoring of the wooden vaulted roof of the Palazzo della Loggia in the town of Brescia, in Italy, has been considered. The feasibility as well as the performances and limitations of a monitoring system based on cosmic ray tracking have been studied by Monte Carlo simulation and discussed in comparison with more traditional monitoring systems. (authors)
We propose a novel multi-phase level set algorithm for solving the inverse problem of bioluminescence tomography. The distribution of unknown interior source is considered as piecewise constant and represented by using multiple level set functions. The localization of interior bioluminescence source is implemented by tracing the evolution of level set function. An alternate search scheme is incorporated to ensure the global optimal of reconstruction. Both numerical and physical experiments are performed to evaluate the developed level set reconstruction method. Reconstruction results show that the proposed method can stably resolve the interior source of bioluminescence tomography.
There is a serious problem in atom probe tomography of composite materials such as oxides that even from stoichiometric samples one observes non-stoichiometric ion yields. We present a quantitative model that explains the non-stoichiometry allowing a fit to experimental data of ion yields as a function of applied field to extract activation barriers and prefactors. The numbers are confirmed by density functional theory. We also show that for oxides the missing oxygen is thermally desorbed as neutral O{sub 2}, either directly or associatively. Finally, we suggest methods to improve the experimental setup.
This paper develops a novel limited-memory method to solve dynamic optimization problems. The memory requirements for such problems often present a major obstacle, particularly for problems with PDE constraints such as optimal flow control, full waveform inversion, and optical tomography. In these problems, PDE constraints uniquely determine the state of a physical system for a given control; the goal is to find the value of the control that minimizes an objective. While the control is often low dimensional, the state is typically more expensive to store. This paper suggests using randomized matrix approximation to compress the state as it is generated and shows how to use the compressed state to reliably solve the original dynamic optimization problem. Concretely, the compressed state is used to compute approximate gradients and to apply the Hessian to vectors. The approximation error in these quantities is controlled by the target rank of the sketch. This approximate first- and second-order information can readily be used in any optimization algorithm. As an example, we develop a sketched trust-region method that adaptively chooses the target rank using a posteriori error information and provably converges to a stationary point of the original problem. Numerical experiments with the sketched trust-region method show promising performance on challenging problems such as the optimal control of an advection-reaction-diffusion equation and the optimal control of fluid flow past a cylinder.
Four numerical methods for computing the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture are presented. Lanczos and subspace iteration-based methods for determining several of the largest singular triplets (singular values and corresponding left and right-singular vectors) for sparse matrices arising from two practical applications: information retrieval and seismic reflection tomography are emphasized. The target architectures for implementations are the CRAY-2S/4-128 and Alliant FX/80. The sparse SVD problem is well motivated by recent information-retrieval techniques in which dominant singular values and their corresponding singular vectors of large sparse term-document matrices are desired, and by nonlinear inverse problems from seismic tomography applications which require approximate pseudo-inverses of large sparse Jacobian matrices.
We apply methods of the representation theory, combinatorial algebra, and noncommutative geometry to various problems of quantum tomography. We introduce the algebra of projectors that satisfy a certain commutation relation, examine this relation by combinatorial methods, and develop the representation theory of this algebra. We also present a geometrical interpretation of our problem and apply the results obtained to the description of the Petrescu family of mutually unbiased bases in dimension 7.
The eikonal equation is instrumental in many applications in several fields ranging from computer vision to geoscience. This equation can be efficiently solved using the iterative Fast Sweeping (FS) methods and the direct Fast Marching (FM) methods. However, when used for a point source, the original eikonal equation is known to yield inaccurate numerical solutions, because of a singularity at the source. In this case, the factored eikonal equation is often preferred, and is known to yield a more accurate numerical solution. One application that requires the solution of the eikonal equation for point sources is travel time tomography. This inverse problem may be formulated using the eikonal equation as a forward problem. While this problem has been solved using FS in the past, the more recent choice for applying it involves FM methods because of the efficiency in which sensitivities can be obtained using them. However, while several FS methods are available for solving the factored equation, the FM method is available only for the original eikonal equation. In this paper we develop a Fast Marching algorithm for the factored eikonal equation, using both first and second order finite-difference schemes. Our algorithm follows the same lines as the original FM algorithm and requires the same computational effort. In addition, we show how to obtain sensitivities using this FM method and apply travel time tomography, formulated as an inverse factored eikonal equation. Numerical results in two and three dimensions show that our algorithm solves the factored eikonal equation efficiently, and demonstrate the achieved accuracy for computing the travel time. We also demonstrate a recovery of a 2D and 3D heterogeneous medium by travel time tomography using the eikonal equation for forward modeling and inversion by Gauss–Newton.
A method for estimating an unknown domain in elliptic boundary value problems is considered. The problem is formulated as an inverse problem of integral equations of the second kind. A computational method is developed using a splice collocation scheme. The results can be applied to the inverse problem of impedance computed tomography (ICT) for image reconstruction.
Reconstructing 4D or 6D phase space distributions from 1D or 2D measurements is a challenging inverse problem encountered in particle accelerators. Entropy maximization is an established method to incorporate prior information in the reconstruction, but it is typically infeasible in high-dimensional spaces. In this paper, I review two recent approaches to high-dimensional entropy maximization. The first approach utilizes differentiable simulations and a class of generative models known as normalizing flows, whereas the second approach employs the method of Lagrange multipliers and Markov Chain Monte Carlo (MCMC) sampling. My aim is to provide a short explanation of each method using a common notation. I conclude by mentioning several unsolved problems in phase space tomography.
Purpose: To develop a method to reconstruct an interior region-of-interest (ROI) image with sufficient accuracy that uses differentiated backprojection (DBP) projection onto convex sets (POCS) [H. Kudo et al., ''Tiny a priori knowledge solves the interior problem in computed tomography'', Phys. Med. Biol. 53, 2207-2231 (2008)] and a tiny knowledge that there exists a nearly piecewise constant subregion. Methods: The proposed method first employs filtered backprojection to reconstruct an image on which a tiny region P with a small variation in the pixel values is identified inside the ROI. Total variation minimization [H. Yu and G. Wang, ''Compressed sensing based interior tomography'', Phys. Med. Biol. 54, 2791-2805 (2009); W. Han et al., ''A general total variation minimization theorem for compressed sensing based interior tomography'', Int. J. Biomed. Imaging 2009, Article 125871 (2009)] is then employed to obtain pixel values in the subregion P, which serve as a priori knowledge in the next step. Finally, DBP-POCS is performed to reconstruct f(x,y) inside the ROI. Clinical data and the reconstructed image obtained by an x-ray computed tomography system (SOMATOM Definition; Siemens Healthcare) were used to validate the proposed method. The detector covers an object with a diameter of {approx}500 mm. The projection data were truncated either moderately to limit the detector coverage to diameter 350 mm of the object or severely to cover diameter 199 mm. Images were reconstructed using the proposed method. Results: The proposed method provided ROI images with correct pixel values in all areas except near the edge of the ROI. The coefficient of variation, i.e., the root mean square error divided by the mean pixel values, was less than 2.0% or 4.5% with the moderate or severe truncation cases, respectively, except near the boundary of the ROI. Conclusions: The proposed method allows for reconstructing interior ROI images with sufficient accuracy with a tiny knowledge that there exists a nearly piecewise constant subregion.
We consider a mathematical model for the determination of the temperature field in a layer that emits, absorbs, and scatters infrared radiation both in the volume and on the surface. Within the framework of the model, we formulate nonlinear direct and inverse problems of emission infrared tomography of the temperature field in the layer according to known space-and-angular distributions of the flows of infrared radiation emitted into the ambient medium. The iterative-variational methods are proposed for the solution of the indicated direct and inverse problems. As a specific example, we perform the numerical analysis of the developed algorithms.