Related papers: Fast fitting of spectral lines with Gaussian and h…
Piecewise affine functions are widely used to approximate nonlinear and discontinuous functions. However, most, if not all existing models only deal with fitting continuous functions. In this paper, we investigate the problem of fitting a…
Measuring the centroid of a spectral line is a common problem in astronomy. Many methods have been devised to overcome limitations due to either noise in the spectra or asymmetric profiles, the most common of which are the intensity…
A hypergraph spectral sparsifier of a hypergraph $G$ is a weighted subgraph $H$ that approximates the Laplacian of $G$ to a specified precision. Recent work has shown that similar to ordinary graphs, there exist $\widetilde{O}(n)$-size…
Spectral graph sparsification aims to find ultra-sparse subgraphs whose Laplacian matrix can well approximate the original Laplacian eigenvalues and eigenvectors. In recent years, spectral sparsification techniques have been extensively…
The standard technique for sub-pixel estimation of atom positions from atomic resolution scanning transmission electron microscopy images relies on fitting intensity maxima or minima with a two-dimensional Gaussian function. While this is a…
We investigate methods to calibrate the non-common path aberrations at an adaptive optics system having a wavefront-correcting device working at an extremely high resolution (larger than 150x150). We use focal-plane images collected…
In order to get accurate information about complex systems depending on a lot of parameters, frequently different experimental methods and/or different experimental conditions are used. The evaluation of these data sets is quite often a…
Iterative refinement (IR) is a popular scheme for solving a linear system of equations based on gradually improving the accuracy of an initial approximation. Originally developed to improve upon the accuracy of Gaussian elimination,…
Existing computationally efficient methods for penalized likelihood GAM fitting employ iterative smoothness selection on working linear models (or working mixed models). Such schemes fail to converge for a non-negligible proportion of…
Recently, some hypergraph-based methods have been proposed to deal with the problem of model fitting in computer vision, mainly due to the superior capability of hypergraph to represent the complex relationship between data points. However,…
We present a new method, called "forced-spectrum fitting", for physically-based spectral modelling of radio sources during deconvolution. This improves upon current common deconvolution fitting methods, which often produce inaccurate…
The new generation of solar instruments provides better spectral, spatial, and temporal resolution for a better understanding of the physical processes that take place on the Sun. Multiple-component profiles are more commonly observed with…
Substances such as chemical compounds are invisible to human eyes, they are usually captured by sensing equipments with their spectral fingerprints. Though spectra of pure chemicals can be identified by visual inspection, the spectra of…
The program package SME (Spectroscopy Made Easy), designed to perform an analysis of stellar spectra using spectral fitting techniques, was updated due to adding new functions (isotopic and hyperfine splittins) in VALD and including grids…
In recent years, parametric representations of point clouds have been widely applied in tasks such as memory-efficient mapping and multi-robot collaboration. Highly adaptive models, like spline surfaces or quadrics, are computationally…
Evaluation of the Voigt function, a convolution of a Lorentzian and a Gaussian profile, is essential in various fields such as spectroscopy, atmospheric science, and astrophysics. Efficient computation of the function is crucial, especially…
High-fidelity spectroscopy presents challenges for both observations and in designing instruments. High-resolution and high-accuracy spectra are required for verifying hydrodynamic stellar atmospheres and for resolving intergalactic…
Surface normal integration is a fundamental problem in computer vision, dealing with the objective of reconstructing a surface from its corresponding normal map. Existing approaches require an iterative global optimization to jointly…
The currently operating space missions, as well as those that will be launched in the near future, (will) deliver high-quality data for millions of stellar objects. Since the majority of stellar astrophysical applications still (at least…
Recent advances in optimizing Gaussian Splatting for scene geometry have enabled efficient reconstruction of detailed surfaces from images. However, when input views are sparse, such optimization is prone to overfitting, leading to…