Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “total variation regularization”

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 19 records

Domain Decomposition for Integer Optimal Control with Total Variation Regularization

Total variation integer optimal control problems admit solutions and necessary optimality conditions via geometric variational analysis. In spite of the existence of said solutions, algorithms which solve the discretized objective suffer from high numerical cost associated with the combinatorial nature of integer programming. Hence, such methods are often limited to small and medium-sized problems. We propose a globally convergent, coordinate descent–inspired algorithm that allows tractable subproblem solutions restricted to a partition of the domain. Our decomposition method solves relatively small trust-region subproblems that modify the control variable on a subdomain only. Given nontrivial subdomain overlap, we prove that a global first-order necessary optimality condition is equivalent to a first-order necessary optimality condition per subdomain. We additionally show that a sufficient decrease is achieved on a single subdomain by way of a trust-region subproblem solver using geometric measure–theoretic arguments, which we integrate with a greedy patch selection to prove convergence of our algorithm. In conclusion, we demonstrate the practicality of our algorithm on a benchmark large-scale, PDE-constrained integer optimal control problem and find that our method is faster than the state of the art.

domain decomposition↗

Sequential linear integer programming for integer optimal control with total variation regularization

We propose a trust-region method that solves a sequence of linear integer programs to tackle integer optimal control problems regularized with a total variation penalty. The total variation penalty implies that the considered integer control problems admit minimizers. We introduce a local optimality concept for the problem, which arises from the infinite-dimensional perspective. In the case of a one-dimensional domain of the control function, we prove convergence of the iterates produced by our algorithm to points that satisfy first-order stationarity conditions for local optimality. We demonstrate the theoretical findings on a computational example.

97 MATHEMATICS AND COMPUTING↗

Iterative Joint Ptychography-Tomography with Total Variation Regularization

In order to determine the 3D structure of a thick sample, researchers have recently combined ptychography (for high resolution) and tomography (for 3D imaging) in a single experiment. 2-step methods are usually adopted for reconstruction, where the ptychography and tomography problems are often solved independently. In this paper, we provide a novel model and ADMM-based algorithm to jointly solve the ptychography-tomography problem iteratively, also employing total variation regularization. The proposed method permits large scan stepsizes for the ptychography experiment, requiring less measurements and being more robust to noise with respect to other strategies, while achieving higher reconstruction quality results.

2-step methods↗

An iterative reconstruction algorithm for pole figure inversion using total variation regularization

This paper describes a new discrete method for inverting X-ray pole figures to estimate the orientation distribution function (ODF). The method employs the equal-volume `cubochoric' representation for uniform discretization of orientation space, SO(3). The forward-projection model is combined with an anisotropic total variation term to iteratively determine the ODF. Here, the efficacy of the new method is evaluated with both model and experimental data and compared with existing discrete and series expansion methods.

97 MATHEMATICS AND COMPUTING↗

Ultrasound waveform tomography with spatial and edge regularization

Synthetic-aperture ultrasound tomography systems and methods using scanning arrays and algorithms configured to simultaneously acquire ultrasound transmission and reflection data, and process the data for improved ultrasound tomography imaging, wherein the tomography imaging comprises total-variation regularization, or a modified total variation regularization, particularly with edge-guided or spatially variant regularization.

Huang, Lianjie↗

Bilevel optimization, deep learning and fractional Laplacian regularization with applications in tomography

Here we consider a generalized bilevel optimization framework for solving inverse problems. We introduce fractional Laplacian as a regularizer to improve the reconstruction quality, and compare it with the total variation regularization. We emphasize that the key advantage of using fractional Laplacian as a regularizer is that it leads to a linear operator, as opposed to the total variation regularization which results in a nonlinear degenerate operator. Inspired by residual neural networks, to learn the optimal strength of regularization and the exponent of fractional Laplacian, we develop a dedicated bilevel optimization neural network with a variable depth for a general regularized inverse problem. We illustrate how to incorporate various regularizer choices into our proposed network. As an example, we consider tomographic reconstruction as a model problem and show an improvement in reconstruction quality, especially for limited data, via fractional Laplacian regularization. We successfully learn the regularization strength and the fractional exponent via our proposed bilevel optimization neural network. We observe that the fractional Laplacian regularization outperforms total variation regularization. This is specially encouraging, and important, in the case of limited and noisy data.

97 MATHEMATICS AND COMPUTING↗

Sparse Recovery for Scientific Data

We have built build and analyzed fundamental mathematical tools that enable sparse recovery of scientific data for high performance computing, experimental facilities and sensor measurement. The proposed work will impact many areas of research across the DOE. We have designed, developed and analyzed fast scalable algorithms for the sparse recovery of scientific data sets that may be extremely large, generated very quickly and distributed across multiple storage devices. The algorithms we developed will be used to process the copious amounts of scientific data generated by the DOE supercomputer simulations and by DOE experimental and observational facilities. They leverage the fact that while the amount of data produced can be extremely large, the actual quantities of interest (QoI's) are often sparse, either in space time, or in some feature space. Mathematically, notions of compressive sensing, including l1 regularized and total variation regularized optimization have played an important part in this effort.

97 MATHEMATICS AND COMPUTING↗

Downscaling Satellite Precipitation with Emphasis on Extremes: A Variational 1-Norm Regularization in the Derivative Domain

The increasing availability of precipitation observations from space, e.g., from the Tropical Rainfall Measuring Mission (TRMM) and the forthcoming Global Precipitation Measuring (GPM) Mission, has fueled renewed interest in developing frameworks for downscaling and multi-sensor data fusion that can handle large data sets in computationally efficient ways while optimally reproducing desired properties of the underlying rainfall fields. Of special interest is the reproduction of extreme precipitation intensities and gradients, as these are directly relevant to hazard prediction. In this paper, we present a new formalism for downscaling satellite precipitation observations, which explicitly allows for the preservation of some key geometrical and statistical properties of spatial precipitation. These include sharp intensity gradients (due to high-intensity regions embedded within lower-intensity areas), coherent spatial structures (due to regions of slowly varying rainfall),and thicker-than-Gaussian tails of precipitation gradients and intensities. Specifically, we pose the downscaling problem as a discrete inverse problem and solve it via a regularized variational approach (variational downscaling) where the regularization term is selected to impose the desired smoothness in the solution while allowing for some steep gradients(called 1-norm or total variation regularization). We demonstrate the duality between this geometrically inspired solution and its Bayesian statistical interpretation, which is equivalent to assuming a Laplace prior distribution for the precipitation intensities in the derivative (wavelet) space. When the observation operator is not known, we discuss the effect of its misspecification and explore a previously proposed dictionary-based sparse inverse downscaling methodology to indirectly learn the observation operator from a database of coincidental high- and low-resolution observations. The proposed method and ideas are illustrated in case studies featuring the downscaling of a hurricane precipitation field.

Hurricanes↗

Electrostatic subframing and compressive-sensing video in transmission electron microscopy

We present kilohertz-scale video capture rates in a transmission electron microscope, using a camera normally limited to hertz-scale acquisition. An electrostatic deflector rasters a discrete array of images over a large camera, decoupling the acquisition time per subframe from the camera readout time. Total-variation regularization allows features in overlapping subframes to be correctly placed in each frame. Moreover, the system can be operated in a compressive-sensing video mode, whereby the deflections are performed in a known pseudorandom sequence. Compressive sensing in effect performs data compression before the readout, such that the video resulting from the reconstruction can have substantially more total pixels than that were read from the camera. This allows, for example, 100 frames of video to be encoded and reconstructed using only 15 captured subframes in a single camera exposure. We demonstrate experimental tests including laser-driven melting/dewetting, sintering, and grain coarsening of nanostructured gold, with reconstructed video rates up to 10 kHz. The results exemplify the power of the technique by showing that it can be used to study the fundamentally different temporal behavior for the three different physical processes. Both sintering and coarsening exhibited self-limiting behavior, whereby the process essentially stopped even while the heating laser continued to strike the material. We attribute this to changes in laser absorption and to processes inherent to thin-film coarsening. In contrast, the dewetting proceeded at a relatively uniform rate after an initial incubation time consistent with the establishment of a steady-state temperature profile.

36 MATERIALS SCIENCE↗

Limited-angle computed tomography with deep image and physics priors

Computed tomography is a well-established x-ray imaging technique to reconstruct the three-dimensional structure of objects. It has been used extensively in a variety of fields, from diagnostic imaging to materials and biological sciences. One major challenge in some applications, such as in electron or x-ray tomography systems, is that the projections cannot be gathered over all the angles due to the sample holder setup or shape of the sample. This results in an ill-posed problem called the limited angle reconstruction problem. Typical image reconstruction in this setup leads to distortion and artifacts, thereby hindering a quantitative evaluation of the results. To address this challenge, we use a generative model to effectively constrain the solution of a physics-based approach. Our approach is self-training that can iteratively learn the nonlinear mapping from partial projections to the scanned object. Because our approach combines the data likelihood and image prior terms into a single deep network, it is computationally tractable and improves performance through an end-to-end training. We also complement our approach with total-variation regularization to handle high-frequency noise in reconstructions and implement a solver based on alternating direction method of multipliers. We present numerical results for various degrees of missing angle range and noise levels, which demonstrate the effectiveness of the proposed approach.

47 OTHER INSTRUMENTATION↗

Total variation vs L1 regularization: a comparison of compressive sensing optimization methods for chemical detection

One of the fundamental assumptions of compressive sensing (CS) is that a signal can be reconstructed from a small number of samples by solving an optimization problem with the appropriate regularization term. Two standard regularization terms are the L1 norm and the total variation (TV) norm. We present a comparison of CS reconstruction results based on these two approaches in the context of chemical detection, and we demonstrate that optimization based on the L1 norm outperforms optimization based on the TV norm. Our comparison is driven by CS sampling, reconstruction, and chemical detection in two real-world datasets: the Physical Sciences Inc. Fabry-Perot interferometer sensor multispectral dataset and the Johns Hopkins Applied Physics Lab FTIR-based longwave infrared sensor hyperspectral dataset. Both datasets contain the release of a chemical simulant such as glacial acetic acid, triethyl phosphate, and sulfur hexafluoride. For chemical detection we use the adaptive coherence estimator (ACE) and bulk coherence, and we propose algorithmic ACE thresholds to define the presence or absence of a chemical of interest in both un-compressed data cubes and reconstructed data cubes. The un-compressed data cubes provide an approximate ground truth. We demonstrate that optimization based on either the L1 norm or TV norm results in successful chemical detection at a compression rate of 90%, but we show that L1 optimization is preferable. We present quantitative comparisons of chemical detection on reconstructions from the two methods, with an emphasis on the number of pixels with an ACE value above the threshold.

Hyperspectral imagery, L1-norm, total variation, A↗

Acoustic- and elastic-waveform inversion with total generalized p-variation regularization

Geophysical models usually contain both sharp interfaces and smooth variations, and it is difficult to accurately account for both of these two types of medium parameter variations using conventional full-waveform inversion methods. We develop a novel full-waveform inversion method for acoustic and elastic waves using a total generalized p-variation regularization scheme to address these challenging problems. We decompose the full-waveform inversion into two subproblems and solve these two minimization subproblems using an alternating-direction minimization strategy. One significant advantage of the total generalized p-variation regularization scheme is that it can simultaneously reconstruct sharp interfaces and smooth background variations of geophysical parameters. Such capability can also effectively suppress the noises in source-encoded inversion and sparse-data inversion, or inversion of noisy data. We demonstrate the advantages of our full-waveform inversion method using a checkerboard model, a modified elastic SEG/EAGE overthrust model, and a land field seismic data set. Our conclusions of synthetic and field seismic data demonstrate that our method reconstructs both smooth background variations and sharp interfaces of subsurface geophysical properties accurately, and provides a useful tool for accurate and reliable inversion of field seismic data.

58 GEOSCIENCES↗

Source function from two-particle correlation function through entropy-regularized Richardson-Lucy deblurring

Source functions are obtained from p – p and d – α correlation functions by applying the Richardson-Lucy (RL) deblurring to the Koonin-Pratt (KP) equation. To prevent fitting of noise in the correlation function, total-variation (TV) regularization is employed that has been effective in ordinary image restoration. TV alone cannot ensure normalization of the source functions. To ensure the latter, we propose a maximum-entropy regularized RL algorithm (MEM-RL). We outline the MEM-RL formalism and optimization strategy for the KP equation, demonstrating its effectiveness on both simulated and experimental data, including the p – p and d – α correlation functions.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Binary Control Pulse Optimization for Quantum Systems

Quantum control aims to manipulate quantum systems toward specific quantum states or desired operations. Designing highly accurate and effective control steps is vitally important to various quantum applications, including energy minimization and circuit compilation. In this paper we focus on discrete binary quantum control problems and apply different optimization algorithms and techniques to improve computational efficiency and solution quality. Specifically, we develop a generic model and extend it in several ways. We introduce a squared L 2 -penalty function to handle additional side constraints, to model requirements such as allowing at most one control to be active. We introduce a total variation (TV) regularizer to reduce the number of switches in the control. We modify the popular gradient ascent pulse engineering (GRAPE) algorithm, develop a new alternating direction method of multipliers (ADMM) algorithm to solve the continuous relaxation of the penalized model, and then apply rounding techniques to obtain binary control solutions. We propose a modified trust-region method to further improve the solutions. Our algorithms can obtain high-quality control results, as demonstrated by numerical studies on diverse quantum control examples.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Seismic Monitoring at the Farnsworth CO2-EOR Field Using Time-Lapse Elastic-Waveform Inversion of 3D-3C VSP Data

During the Development Phase of the U.S. Southwest Regional Partnership on Carbon Sequestration, supercritical CO2 was continuously injected into the deep oil-bearing Morrow B formation of the Farnsworth Unit in Texas for Enhanced Oil Recovery (EOR). The project injected approximately 94 kilotons of CO2 to study geologic carbon storage during CO2-EOR. A three-dimensional (3D) surface seismic dataset was acquired in 2013 to characterize the subsurface structures of the Farnsworth site. Following this data acquisition, the baseline and three time-lapse three-dimensional three-component (3D-3C) vertical seismic profiling (VSP) data were acquired at a narrower surface area surrounding the CO2 injection and oil/gas production wells between 2014 and 2017 for monitoring CO2 injection and migration. With these VSP datasets, we inverted for subsurface velocity models to quantitatively monitor the CO2 plume within the Morrow B formation. We first built 1D initial P-wave (Vp) and S-wave (Vs) velocity models by upscaling the sonic logs. We improved the deep region of the Vp and Vs models by incorporating the deep part of a migration velocity model derived from the 3D surface seismic data. We improved the shallow region of 3D Vp and Vs models using 3D traveltime tomography of first arrivals of VSP downgoing waves. We further improved the 3D baseline velocity models using elastic-waveform inversion (EWI) of the 3D baseline VSP upgoing data. Our advanced EWI method employs alternative tomographic and conventional gradients and total-variation-based regularization to ensure the high-fidelity updates of the 3D baseline Vp and Vs models. We then sequentially applied our 3D EWI method to the three time-lapse datasets to invert for spatiotemporal changes of Vp and Vs in the reservoir. Our inversion results reveal the volumetric changes of the time-lapse Vp and Vs models and show the evolution of the CO2 plume from the CO2 injection well to the oil/gas production wells.

42 ENGINEERING↗

Total Variation Majorization Minimization (TV-MM) Approach to Radiometer Brightness Temperature Gridding and Reconstruction

This paper presents the implementation of an algorithm to enhance the image resolution of the Earth's surface brightness temperature (T B ) data measured by radiometers such as the one onboard of the Soil Moisture Active Passive (SMAP) mission. A key step in radiometer T B processing is the conversion of the swath-based calibrated antenna temperature (T A ) measurements to the Level 3 Earth-centered grid. The simplest algorithm to transform this data from swath to gridded format is called drop-in-the-bucket which simply averages surrounding noisy T A samples to form a T B value at the gridded location. This method reduces noise, however produces low resolution products. To obtain a higher resolution product, SMAP uses other techniques such the Backus-Gilbert (BG) algorithm, which is the conventional method used in microwave radiometry. Although this method performs the required interpolation, it is not effective in denoising and removing blurring effects due to antenna filtering of the radiometer image data. Our motivation for this development is to further improve the resolution through post-processing of the radiometer T B image, a highly cost-effective method of image enhancement. The approach adapted in this work is based on the minimization of the Total Variation (TV) regularized objective function that is used extensively in solving general ill-posed linear inverse problems in image processing. Since the TV-based objective function is convex but not everywhere differentiable, there exists many numerical algorithms that can estimate the solution and the one selected for this work is called Majorization- Minimization (MM). By applying this algorithm, simulation experiments were performed based on synthetic data from the Geophysical model as well as real SMAP data to demonstrate the effectiveness of the technique. Results were then compared against the BG method.

Wing Lee↗

Nondestructive Evaluation of Concrete: Elastic Property Imaging Through Full-Waveform Inversion

Concrete is a vital material in construction—especially in the nuclear industry, where it is used in critical structures such as containment vessels. Over time, concrete can degrade due to harsh operational and environmental conditions, necessitating that its elastic properties be accurately evaluated to ensure structural integrity and safety. Traditional nondestructive evaluation methods such as ultrasound-based techniques often rely on simplifying assumptions that may not hold true for concrete. This paper presents an advanced ultrasound-based method that uses elastic full-waveform inversion (EFWI) to create detailed images of concrete’s mechanical properties. By accurately modeling wave behaviors such as scattering and reflection, we aim to overcome the limitations of conventional ultrasonic-based methods. In this work, the imaging problem involved reconstructing the various elastic properties of a heterogenous concrete block with three steel rebars embedded in it. The ultrasonic measurements were synthetically generated from multiple sources and receivers, and the reconstruction process was performed using a gradient-based optimization algorithm. Our approach leveraged EFWI to reconstruct high-resolution images of the pressure wave speed, shear wave speed, and density. Multiple misfit functions—including L2-norm, cross-correlation (CC), and L1-norm—combined with total variation (TV) regularization and parameter constraints using a Sigmoid function—were explored for the reconstruction. The results demonstrated that using the L1-norm misfit function in conjunction with TV regularization and Sigmoid constraints significantly improved the reconstruction quality in comparison to traditional methods. This approach provided clearer images with fewer artifacts and better captured background heterogeneity. Our findings highlight that, when properly designed, EFWI carries great potential for providing comprehensive, more accurate, and more reliable assessments of concrete conditions, as is crucial for the maintenance and safety of nuclear power plant structures.

97 - MATHEMATICS AND COMPUTING↗