Related papers: Frozen Gaussian Grid-point Correction For Semi-cla…
3D Gaussian Splatting (3DGS) has emerged as a promising approach for CT reconstruction. However, existing methods rely on the average gradient magnitude of points within the view, often leading to severe needle-like artifacts under…
Cartesian-grid methods with Adaptive Mesh Refinement (AMR) are ideally suited for simulating the breaking of waves, the formation of spray, and the entrainment of air around ships. As a result of the cartesian-grid formulation, minimal…
Surface-from-gradients (SfG) aims to recover a three-dimensional (3D) surface from its gradients. Traditional methods encounter significant challenges in achieving high accuracy and handling high-resolution inputs, particularly facing the…
The Fast Proximal Gradient Method (FPGM) and the Monotone FPGM (MFPGM) for minimization of nonsmooth convex functions are introduced and applied to tomographic image reconstruction. Convergence properties of the sequence of objective…
Inspired by the structure of spherical harmonics, we propose the truncated kernel stochastic gradient descent (T-kernel SGD) algorithm with a least-square loss function for spherical data fitting. T-kernel SGD introduces a novel…
Channel state information (CSI) is essential for adaptive beamforming and maintaining robust links in wireless communication systems. However, acquiring CSI incurs significant overhead, consuming up to 25% of spectrum resources in 5G…
Self-consistent approaches to superfluid many-fermion systems in 3-dimensions (and subsequent time-dependent approaches) require a large number of diagonalizations of very large dimension hermitian matrices, which results in enormous…
We perform a complete Fourier analysis of the semi-discrete 1-d wave equation obtained through a P1 discontinuous Galerkin (DG) approximation of the continuous wave equation on an uniform grid. The resulting system exhibits the interaction…
The Gaussian splatting methods are getting popular. However, their loss function only contains the $\ell_1$ norm and the structural similarity between the rendered and input images, without considering the edges in these images. It is…
We present a fully discrete Crank-Nicolson Fourier-spectral-Galerkin (FSG) scheme for approximating solutions of the fractional Korteweg-de Vries (KdV) equation, which involves a fractional Laplacian with exponent $\alpha \in [1,2]$ and a…
The Trefftz Discontinuous Galerkin (TDG) method is a technique for approximating the Helmholtz equation (or other linear wave equations) using piecewise defined local solutions of the equation to approximate the global solution. When…
Network compression techniques have become increasingly important in recent years because the loads of Deep Neural Networks (DNNs) are heavy for edge devices in real-world applications. While many methods compress neural network parameters,…
3D Gaussian Splatting (3DGS) has emerged as a mainstream solution for novel view synthesis and 3D reconstruction. By explicitly encoding a 3D scene using a collection of Gaussian kernels, 3DGS achieves high-quality rendering with superior…
In this paper, a new efficient and generalized consistency correction method for weakly-compressible smoothed particle hydrodynamics is proposed and successfully implemented in the simulation of violent free-surface flow exhibiting breaking…
We present a family of algorithms for the numerical approximation of the Schr\"odinger equation with potential concentrated at a finite set of points. Our methods belong to the so-called fast and oblivious convolution quadrature algorithms.…
This study presents the Fourier-Gegenbauer Integral-Galerkin (FGIG) method, a novel and efficient numerical framework for solving the one-dimensional advection-diffusion equation with periodic boundary conditions. The FGIG method uniquely…
3D scene reconstruction is fundamental for spatial intelligence applications such as AR, robotics, and digital twins. Traditional multi-view stereo struggles with sparse viewpoints or low-texture regions, while neural rendering approaches,…
The Gaussian graphical model (GGM) incorporates an undirected graph to represent the conditional dependence between variables, with the precision matrix encoding partial correlation between pair of variables given the others. To achieve…
Stochastic gradient descent (SGD) is a simple and popular method to solve stochastic optimization problems which arise in machine learning. For strongly convex problems, its convergence rate was known to be O(\log(T)/T), by running SGD for…
As a mesh-free method, smoothed particle hydrodynamics (SPH) has been widely used for modeling and simulating fluid-structure interaction (FSI) problems. While the kernel gradient correction (KGC) method is commonly applied in structural…