Search NASA⌕ Search

SEARCH · Search NASA

Results for “Laplacian smoothing”

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.

16 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Laplacian Smoothing Stochastic Gradient Markov Chain Monte Carlo

As an important Markov chain Monte Carlo (MCMC) method, the stochastic gradient Langevin dynamics (SGLD) algorithm has achieved great success in Bayesian learning and posterior sampling. Furthermore, SGLD typically suffers from a slow convergence rate due to its large variance caused by the stochastic gradient. In order to alleviate these drawbacks, we leverage the recently developed Laplacian smoothing technique and propose a Laplacian smoothing stochastic gradient Langevin dynamics (LS-SGLD) algorithm. We prove that for sampling from both log-concave and non-log-concave densities, LS-SGLD achieves strictly smaller discretization error in 2-Wasserstein distance, although its mixing rate can be slightly slower. Experiments on both synthetic and real datasets verify our theoretical results and demonstrate the superior performance of LS-SGLD on different machine learning tasks including posterior sampling, Bayesian logistic regression, and training Bayesian convolutional neural networks.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1982

The computation of Laplacian smoothing splines with examples

Laplacian smoothing splines (LSS) are presented as generalizations of graduation, cubic and thin plate splines. The method of generalized cross validation (GCV) to choose the smoothing parameter is described. The GCV is used in the algorithm for the computation of LSS's. An outline of a computer program which implements this algorithm is presented along with a description of the use of the program. Examples in one, two and three dimensions demonstrate how to obtain estimates of function values with confidence intervals and estimates of first and second derivatives. Probability plots are used as a diagnostic tool to check for model inadequacy.

Wendelberger, J. G.↗
NASA NTRS1982

Estimation of divergence and vorticity using multidimensional smoothing splines

Laplacian smoothing splines, smoothing splines on the sphere, and smoothing pseudo splines on the sphere are presented. The method of generalized cross validation to choose the smoothing parameter is described. These methods are applied to estimate divergence and vorticity of the atmosphere from wind speed and wind direction.

Wendelberger, J. G.↗
DOE OSTI2022

A deterministic gradient-based approach to avoid saddle points

Abstract Loss functions with a large number of saddle points are one of the major obstacles for training modern machine learning (ML) models efficiently. First-order methods such as gradient descent (GD) are usually the methods of choice for training ML models. However, these methods converge to saddle points for certain choices of initial guesses. In this paper, we propose a modification of the recently proposed Laplacian smoothing gradient descent (LSGD) [Osher et al., arXiv:1806.06317 ], called modified LSGD (mLSGD), and demonstrate its potential to avoid saddle points without sacrificing the convergence rate. Our analysis is based on the attraction region, formed by all starting points for which the considered numerical scheme converges to a saddle point. We investigate the attraction region’s dimension both analytically and numerically. For a canonical class of quadratic functions, we show that the dimension of the attraction region for mLSGD is $\lfloor (n-1)/2\rfloor$ , and hence it is significantly smaller than that of GD whose dimension is $n-1$ .

Mathematics↗
NASA NTRS1984

Conjugate gradient coupled with multigrid for an indefinite problem

An iterative algorithm for the Helmholtz equation is presented. This scheme was based on the preconditioned conjugate gradient method for the normal equations. The preconditioning is one cycle of a multigrid method for the discrete Laplacian. The smoothing algorithm is red-black Gauss-Seidel and is constructed so it is a symmetric operator. The total number of iterations needed by the algorithm is independent of h. By varying the number of grids, the number of iterations depends only weakly on k when k(3)h(2) is constant. Comparisons with a SSOR preconditioner are presented.

Gozani, J.↗
DOE OSTI2025

automesh: Automatic mesh generation in Rust

automesh is an open-source Rust software program that uses a segmentation, typically generated from a 3D image stack, to create a finite element mesh, composed either of hexahedral (volumetric) or triangular (isosurface) elements. automesh converts between segmentation formats (.npy, .spn) and mesh formats (.exo, .inp, .mesh, .stl, .vtk). automesh can defeature voxel domains, apply Laplacian and Taubin smoothing, and output mesh quality metrics. automesh uses an internal octree for fast performance.

Hovey, Chad Brian [Sandia National Laboratories (S↗
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↗
NASA NTRS1991

Image feature extraction using Gabor-like transform

Noisy and highly textured images were operated on with a Gabor-like transform. The results were evaluated to see if useful features could be extracted using spatio-temporal operators. The use of spatio-temporal operators allows for extraction of features containing simultaneous frequency and orientation information. This method allows important features, both specific and generic, to be extracted from images. The transformation was applied to industrial inspection imagery, in particular, a NASA space shuttle main engine (SSME) system for offline health monitoring. Preliminary results are given and discussed. Edge features were extracted from one of the test images. Because of the highly textured surface (even after scan line smoothing and median filtering), the Laplacian edge operator yields many spurious edges.

Finegan, Michael K., Jr.↗
DOE OSTI2022

Learning Optimal Multigrid Smoothers via Neural Networks

Multigrid methods are one of the most efficient techniques for solving large sparse linear systems arising from partial differential equations (PDEs) and graph Laplacians from machine learning applications. One of the key components of multigrid is smoothing, which aims at reducing high-frequency errors on each grid level. However, finding optimal smoothing algorithms is problem-dependent and can impose challenges for many problems. In this paper, we propose an efficient adaptive framework for learning optimized smoothers from operator stencils in the form of convolutional neural networks (CNNs). Here, the CNNs are trained on small-scale problems from a given type of PDEs based on a supervised loss function derived from multigrid convergence theories and can be applied to large-scale problems of the same class of PDEs. Numerical results on anisotropic rotated Laplacian problems and variable coefficient diffusion problems demonstrate improved convergence rates and solution time compared with classical hand-crafted relaxation methods.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1982

High spatial resolution Mg/Al maps of the western Crisium and Sulpicius Gallus regions

High spatial resolution Mg/Al ratio maps of the western Crisium and Sulpicius Gallus regions of the moon are presented. The data is from the X-ray fluorescence experiment and the image enhancement technique in the Laplacian subtraction method using a special least-squares version of the Laplacian to reduce noise amplification. In the highlands region west of Mare Crisium several relatively small patches of smooth material have high local Mg/Al ratio similar to values found in mare sites, suggesting volcanism in the highlands. In the same highland region there were other smooth areas with no high Mg/Al local values and they are probably Cayley Formation material produced by impact mass wasting. The Sulpicius Gallus region has variable Mg/Al ratios. In this region there are several high Mg/Al ratio spots, two of which occur at the highland-mare interface. Another high Mg/Al ratio area corresponds to the Sulpicius Gallus Rima I region. The high Mg/Al ratio material in the Sulpicius Gallus region is probably pyroclastic.

Schonfeld, E.↗
NASA NTRS2004

Improved Discrete Approximation of Laplacian of Gaussian

An improved method of computing a discrete approximation of the Laplacian of a Gaussian convolution of an image has been devised. The primary advantage of the method is that without substantially degrading the accuracy of the end result, it reduces the amount of information that must be processed and thus reduces the amount of circuitry needed to perform the Laplacian-of- Gaussian (LOG) operation. Some background information is necessary to place the method in context. The method is intended for application to the LOG part of a process of real-time digital filtering of digitized video data that represent brightnesses in pixels in a square array. The particular filtering process of interest is one that converts pixel brightnesses to binary form, thereby reducing the amount of information that must be performed in subsequent correlation processing (e.g., correlations between images in a stereoscopic pair for determining distances or correlations between successive frames of the same image for detecting motions). The Laplacian is often included in the filtering process because it emphasizes edges and textures, while the Gaussian is often included because it smooths out noise that might not be consistent between left and right images or between successive frames of the same image.

Shuler, Robert L., Jr.↗
NASA NTRS1993

Is Large-Scale Low-Frequency Variability Satisfying Linear Barotropic Vorticity Dynamics?

What is the dynamics governing the sea level variabilities at spatial scales larger than the mesoscale and periods longer than a few weeks? This question is investigated using the TOPEX/POSEIDON altimetry data. For periods shorter than a decade, it is believed that the large-scale variabilities in the open ocean should be barotropic and can be described by the barotropic vorticity equation. To avoid the error-sensitive Laplacian operator, the above equation was integrated over a large area. Preliminary analysis was performed in the northeastern Pacific, where the eddy energy is relatively low and the bathymetry is relatively smooth. Good correlation between the two sides of the equation was obtained at periods longer than 60 days. The largest error in the data is suspected to be the ocean tides. Empirical correction for the ocean tides will be performed for further analysis. Preliminary results of a global calculation will be presented.

Fu, Lee-Lueng↗
DOE OSTI2024

Reducing Operator Complexity of Galerkin Coarse-grid Operators with Machine Learning

Here, we propose a data-driven and machine-learning-based approach to compute non-Galerkin coarse-grid operators in multigrid (MG) methods, addressing the well-known issue of increasing operator complexity. Guided by the MG theory on spectrally equivalent coarse-grid operators, we have developed novel machine learning algorithms that utilize neural networks combined with smooth test vectors from multigrid eigenvalue problems. The proposed method demonstrates promise in reducing the complexity of coarse-grid operators while maintaining overall MG convergence for solving parametric partial differential equation problems. Numerical experiments on anisotropic rotated Laplacian and linear elasticity problems are provided to showcase the performance and comparison with existing methods for computing non-Galerkin coarse-grid operators.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

Robust contour decomposition using a constant curvature criterion

The problem of decomposing an extended boundary or contour into simple primitives is addressed with particular emphasis on Laplacian-of-Gaussian (LoG) zero-crossing contours. A technique is introduced for partitioning such contours into constant curvature segments. A nonlinear `blip' filter matched to the impairment signature of the curvature computation process, an overlapped voting scheme, and a sequential contiguous segment extraction mechanism are used. This technique is insensitive to reasonable changes in algorithm parameters and robust to noise and minor viewpoint-induced distortions in the contour shape, such as those encountered between stereo image pairs. The results vary smoothly with the data, and local perturbations induce only local changes in the result. Robustness and insensitivity are experimentally verified.

Wuescher, Daniel M.↗