Search NASA⌕ Search

SEARCH · Search NASA

Results for “total variation”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

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↗
DOE OSTI2025

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↗
DOE OSTI2022

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↗
DOE OSTI2024

Rapid Optimization of Total Variation with Applications in Imaging, Additive Manufacturing, and Qualification

Total Variation optimization penalizes the gradient of a control variable or state. While this work focuses on image processing in particular, it has also found applications in inverse problems and topology optimization. In image processing, the goal is to maintain faithfulness to the original image while denoising and/or deblurring. Additionally, bilevel optimization over the spatially varying regularization weights can illuminate interfaces such as damage regions and other anomalies. We will address two fundamental challenges with TV-optimization: (i) the typical slow convergence of existing TV-optimization methods, and (ii) the selection of spatially varying TV parameters to promote interface detection. Additionally, we will apply such techniques to image data collected in additive manufacturing. In said context, stochasticity in build events induces flaws in the manufactured piece, compromising the integrity of said part. There is a critical need for in-situ monitoring to spot anomalies once they form, and in this setting we apply our total variation and hyperparameter solvers. We will develop a customized algorithm based on for extreme-scale TV-optimization that achieves super-linear or quadratic-convergence, a critical property for real-time, image-by-image analysis. A worst-case outcome is a preprocessing step that enhances image quality in-situ, specifically for out-of-focus and noisy images.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Rigid registration algorithm based on the minimization of the total variation of the difference map

Image registration is broadly used in various scenarios in which similar scenes in different images are to be aligned. However, image registration becomes challenging when the contrasts and backgrounds in the images are vastly different. This work proposes using the total variation of the difference map between two images (TVDM) as a dissimilarity metric in rigid registration. A method based on TVDM minimization is implemented for image rigid registration. The method is tested with both synthesized and real experimental data that have various noise and background conditions. The performance of the proposed method is compared with the results of other rigid registration methods. It is demonstrated that the proposed method is highly accurate and robust and outperforms other methods in all of the tests. The new algorithm provides a robust option for image registrations that are critical to many nano-scale X-ray imaging and microscopy applications.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Block-structured, equal-workload, multi-grid-nesting interface for the Boussinesq wave model FUNWAVE-TVD (Total Variation Diminishing)

Abstract. We describe the development of a block-structured, equal-CPU-load (central processing unit), multi-grid-nesting interface for the Boussinesq wave model FUNWAVE-TVD (Fully Nonlinear Boussinesq Wave Model with Total Variation Diminishing Solver). The new model framework does not interfere with the core solver, and thus the core program, FUNWAVE-TVD, is still a standalone model used for a single grid. The nesting interface manages the time sequencing and two-way nesting processes between the parent grid and child grid with grid refinement in a hierarchical manner. Workload balance in the MPI-based (message passing interface) parallelization is handled by an equal-load scheme. A strategy of shared array allocation is applied for data management that allows for a large number of nested grids without creating additional memory allocations. Four model tests are conducted to verify the nesting algorithm with assessments of model accuracy and the robustness in the application in modeling transoceanic tsunamis and coastal effects.

Choi, Young-Kwang↗
DOE OSTI2022

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↗
DOE OSTI2023

Protection Against Graph-Based False Data Injection Attacks on Power Systems

Graph signal processing (GSP) has emerged as a powerful tool for practical network applications, including power system monitoring. By representing power system voltages as smooth graph signals, recent research has focused on developing GSP-based methods for state estimation, attack detection, and topology identification. Included, efficient methods have been developed for detecting false data injection (FDI) attacks, which until now were perceived as non-smooth with respect to the graph Laplacian matrix. Consequently, these methods may not be effective against smooth FDI attacks. In this paper, we propose a graph FDI (GFDI) attack that minimizes the Laplacian-based graph total variation (TV) under practical constraints. In addition, we develop a low-complexity algorithm that solves the non-convex GDFI attack optimization problem using ell_1-norm relaxation, the projected gradient descent (PGD) algorithm, and the alternating direction method of multipliers (ADMM). We then propose a protection scheme that identifies the minimal set of measurements necessary to constrain the GFDI output to high graph TV, thereby enabling its detection by existing GSP-based detectors. Our numerical simulations on the IEEE-57 bus test case reveal the potential threat posed by well-designed GSP-based FDI attacks. Moreover, we demonstrate that integrating the proposed protection design with GSP-based detection can lead to significant hardware cost savings compared to previous designs of protection methods against FDI attacks.

Morgenstern, Gal↗
DOE OSTI2025

Stability analysis of the Eulerian–Lagrangian finite volume methods for nonlinear hyperbolic equations in one space dimension

In this paper, we construct a novel Eulerian–Lagrangian finite volume (ELFV) method for nonlinear scalar hyperbolic equations in one space dimension. It is well known that the exact solutions to such problems may contain shocks though the initial conditions are smooth, and direct numerical methods may suffer from restricted time step sizes. To relieve the restriction, we propose an ELFV method, where the space-time domain was separated by the partition lines originated from the cell interfaces whose slopes are obtained following the Rakine–Hugoniot junmp condition. Unfortunately, to avoid the intersection of the partition lines, the time step sizes are still limited. To fix this gap, we detect effective troubled cells (ETCs) and carefully design the influence region of each ETC, within which the partitioned space-time regions are merged together to form a new one. Then with the new partition of the space-time domain, we theoretically prove that the proposed first-order scheme with Euler forward time discretization is total-variation-diminishing and maximum-principle-preserving with at least twice larger time step constraints than the classical first order Eulerian method for Burgers’ equation. Numerical experiments verify the optimality of the designed time step sizes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Numerical fluid dynamics for FRG flow equations: Zero-dimensional QFTs as numerical test cases. II. Entropy production and irreversibility of RG flows

Herein we demonstrate that the reformulation of renormalization group (RG) flow equations as nonlinear heat equations has severe implications on the understanding of RG flows in general. We demonstrate by explicitly constructing an entropy function for a zero-dimensional Z 2 -symmetric model that the dissipative character of generic nonlinear diffusion equations is also hard-coded in the functional RG equation. This renders RG flows manifestly irreversible, revealing the semigroup property of RG transformations on the level of the flow equation itself. Additionally, we argue that the dissipative character of RG flows, its irreversibility and the entropy production during the RG flow may be linked to the existence of a so-called C– / A-function. In total, this introduces an asymmetry in the so-called RG time—in complete analogy to the thermodynamic arrow of time—and allows for an interpretation of infrared actions as equilibrium solutions of dissipative RG flows equations. The impossibility of resolving microphysics from macrophysics is evident in this framework. Furthermore, we directly link the irreversibility and the entropy production in RG flows to an explicit numerical entropy production, which is manifest in diffusive and non-linear partial differential equations (PDEs) and a standard mathematical tool for the analysis of PDEs. Using exactly solvable zero-dimensional Z 2 -symmetric models, we explicitly compute the (numerical) entropy production related to the total variation nonincreasing property of the PDE during RG flows toward the infrared limit. Finally, we discuss generalizations of our findings and relations to the C– / A-theorem as well as how our work may help to construct truncations of RG flow equations in the future, including numerically stable schemes for solving the corresponding PDEs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Iterative Reconstruction for Multimodal Neutron Tomography

Here, we describe a unified framework for model-based iterative 3-D reconstruction of multimodal neutron transmission, hydrogen-scatter, and induced-fission images from low resolution data recorded using 14.1-MeV neutrons and the associated-particle imaging (API) technique. The framework, which was developed to facilitate use in challenging field-deployment scenarios, is centered around physics-based system models and a total variation (TV) constrained implementation of the simultaneous iterative reconstruction technique (SIRT). Modified to solve a statistically weighted least squares (WLS) problem, the SIRT algorithm is accelerated using ordered subsets and Nesterov’s momentum for which we derive a near-optimal value of the governing Lipschitz constant. The approach enables the reconstruction of images that are high resolution compared to the acquired data and is robust to both limited statistics and a limited number of projection angles. Moreover, the framework is fast enough to be practical. Example images are provided that demonstrate both the ability to perform fast-neutron imaging of high-atomic-number materials with low radiation dose and the benefit of multimodal neutron imaging to identify key materials.

Hydrogen scatter↗
DOE OSTI2023

Quantifying Site Effects and Their Influence on Earthquake Source Parameter Estimations Using a Dense Array in Oklahoma

We investigate the effects of site response on source parameter estimates using earthquakes recorded by the LArge-n Seismic Survey in Oklahoma (LASSO). While it is well known that near-surface unconsolidated sediments can cause an apparent breakdown of earthquake self-similarity, the influence of laterally varying site conditions remains unclear. We analyze site conditions across the 1825-station array on a river plain within an area of 40 km by 23 km using vertical ground motions from 14 regional earthquakes. While the source radiation pattern controls P-wave ground motions below 8 Hz, the surface geology correlates with P-wave ground motions above 8 Hz and S-wave ground motions at 2–21 Hz. Stations installed in alluvial sediments have vertical ground motions that can exceed three times the array median. We use the variation of ground motion of regional earthquakes across the array as a proxy for site effects. The corner frequencies and stress drops of local earthquakes ( M L = 0.01–3) estimated using a standard single-spectra approach show negative correlations with the site-effect proxy, while the seismic moments show positive correlations. In contrast, the spectral-ratio approach effectively shows no correlation. The overall bias is small as expected for this relatively homogeneous structure; accurate estimation of site-related biases requires at least 30 stations. Correcting for site-related biases reduces the standard deviations of the source parameters by less than 13% of the total variations. Remaining variations are partially associated with source directivity and model misfits— as small earthquakes can have complex ruptures.

58 GEOSCIENCES↗
DOE OSTI2022

Enhanced detection of paramagnetic fluorine-19 magnetic resonance imaging agents using zero echo time sequence and compressed sensing

Fluorine-19 ( 19 F) magnetic resonance imaging (MRI) is an emerging technique offering specific detection of labeled cells in vivo. Lengthy acquisition times and modest signal-to-noise ratio (SNR) makes three-dimensional spin-density–weighted 19 F imaging challenging. Recent advances in tracer paramagnetic metallo-perfluorocarbon (MPFC) nanoemulsion probes have shown multifold SNR improvements due to an accelerated 19 F T 1 relaxation rate and a commensurate gain in imaging speed and averages. However, 19 F T 2 -reduction and increased linewidth limit the amount of metal additive in MPFC probes, thus constraining the ultimate SNR. To overcome these barriers, we describe a compressed sampling (CS) scheme, implemented using a “zero” echo time (ZTE) sequence, with data reconstructed via a sparsity-promoting algorithm. Our CS-ZTE scheme acquires k-space data using an undersampled spherical radial pattern and signal averaging. Image reconstruction employs off-the-shelf sparse solvers to solve a joint total variation and -norm regularized least square problem. To evaluate CS-ZTE, we performed simulations and acquired 19 F MRI data at 11.7 T in phantoms and mice receiving MPFC-labeled dendritic cells. For MPFC-labeled cells in vivo, we show SNR gains of ~6.3 × with 8-fold undersampling. We show that this enhancement is due to three mechanisms including undersampling and commensurate increase in signal averaging in a fixed scan time, denoising attributes from the CS algorithm, and paramagnetic reduction of T 1 . Importantly, 19 F image intensity analyses yield accurate estimates of absolute quantification of 19 F spins. Overall, the CS-ZTE method using MPFC probes achieves ultrafast imaging, a substantial boost in detection sensitivity, accurate 19 F spin quantification, and minimal image artifacts.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

Central Compact Finite‐Difference Scheme With High Spectral Resolution for KdV Equation

This work presents a combination of cell‐node and cell‐centered compact finite difference scheme for the approximation of third derivatives involved in Korteweg–de Vries (KdV) equations. This approach employs a half‐shifted derivative construction at cell centers, avoiding the need for compact interpolation, thereby removing transfer errors; hence, it improves spectral resolution and maintains high‐order accuracy. Fourier analysis is performed to show the spectral properties of the proposed formulation, which provides higher spectral resolutions as compared to node‐based compact schemes. A filtering strategy is incorporated to suppress high‐frequency oscillations without compromising the accuracy of the numerical scheme, and the total variation diminishing Runge Kutta (TVDRK3) method is applied for time integration. Numerical experiments on linear, nonlinear, and coupled KdV systems are conducted, and a comparative analysis with cell‐node compact schemes confirms that the proposed scheme consistently reduces errors by up to an order of magnitude and achieves high spectral resolution properties.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

The electronic structure, crystal fields, and magnetic anisotropy in RECo 5 magnets

The current progress in describing rare-earth-based magnets' electronic structure and magnetic properties is discussed. We use several currently popular electronic structure methods to show the typical values of critical parameters that define the physics of RECo 5 (RE = rare earth atom) materials. The magnetic moments and magnetic anisotropy of 4f atoms are obtained using several approaches, including anisotropic 4f-charge density-constrained DFT and DFT+HI methods. We also suggest the introduction of "penalty" functional for obtaining correct variational total energy in the traditional Hund's rule-constrained DFT-based techniques. The applicability and future extensions are discussed. The proposed combination of methods is potentially suitable for high-throughput computational searches of new rare-earth-containing magnetic materials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗