Moving least squares is a method of reconstructing continuous functions from a set of unorganized point samples via the calculation of a weighted least squares measure biased towards the region around the point at which the reconstructed value is requested.
In computer graphics, the moving least squares method is useful for reconstructing a surface from a set of points. Often it is used to create a 3D surface from a point cloud through either downsampling or upsampling.
In numerical analysis to handle contributions of geometry where it is difficult to obtain discretizations, the moving least squares methods have also been used and generalized to solve PDEs on curved surfaces and other geometries.[1][2][3] This includes numerical methods developed for curved surfaces for solving scalar parabolic PDEs [1][3] and vector-valued hydrodynamic PDEs.[2]
In machine learning, moving least squares methods have also been used to develop model classes and learning methods. This includes function regression methods [4] and neural network function and operator regression approaches, such as GMLS-Nets.[5]
^ abLiang, Jian; Zhao, Hongkai (January 2013). "Solving Partial Differential Equations on Point Clouds". SIAM Journal on Scientific Computing. 35 (3): A1461–A1486. Bibcode:2013SJSC...35A1461L. doi:10.1137/120869730. S2CID 9984491.
^ abGross, B. J.; Trask, N.; Kuberry, P.; Atzberger, P. J. (15 May 2020). "Meshfree methods on manifolds for hydrodynamic flows on curved surfaces: A Generalized Moving Least-Squares (GMLS) approach". Journal of Computational Physics. 409: 109340. arXiv:1905.10469. Bibcode:2020JCoPh.40909340G. doi:10.1016/j.jcp.2020.109340. S2CID 166228451.
^ ab Gross, B. J.; Kuberry, P.; Atzberger, P. J. (15 March 2022). "First-passage time statistics on surfaces of general shape: Surface PDE solvers using Generalized Moving Least Squares (GMLS)". Journal of Computational Physics. 453: 110932. arXiv:2102.02421. Bibcode:2022JCoPh.45310932G. doi:10.1016/j.jcp.2021.110932. ISSN 0021-9991. S2CID 231802303.
^Wang, Hong-Yan; Xiang, Dao-Hong; Zhou, Ding-Xuan (1 March 2010). "Moving least-square method in learning theory". Journal of Approximation Theory. 162 (3): 599–614. doi:10.1016/j.jat.2009.12.002. ISSN 0021-9045.
^Trask, Nathaniel; Patel, Ravi G.; Gross, Ben J.; Atzberger, Paul J. (13 September 2019). "GMLS-Nets: A framework for learning from unstructured data". arXiv:1909.05371 [cs.LG].
and 24 Related for: Moving least squares information
Movingleastsquares is a method of reconstructing continuous functions from a set of unorganized point samples via the calculation of a weighted least...
LOWESS thus build on "classical" methods, such as linear and nonlinear leastsquares regression. They address situations in which the classical procedures...
indicator Martingale (probability theory) Moving average crossover Movingleastsquares Rising moving average Rolling hash Running total Savitzky–Golay...
to the use of the discrete leastsquares method to discretize the governing differential equation. A Movingleastsquares (MLS) approximation method is...
fluid dynamic equations in a grid free framework is the movingleastsquares or leastsquares method. With this approach boundary conditions can be implemented...
Dynamics (2nd ed., Prentice-Hall 1998) p.201-2 ISBN 0-13-737123-3 Movingleast-squares enhanced Shepard interpolation for the fast marching and string methods...
given set of points. In fact the method boils down to the well-known movingleastsquares for the particular case of a global approximation (using all available...
function is used to adjust the initial point set. Functions like MovingLeastSquares, basic functions with local support, based on the Poisson equation...
methods. Some of the most popular methods include Kriging and the movingleastsquares method. Response surface methodology, developed extensively by the...
in the line of weighted least-squares methods (WLSQ). The latter can be regarded as particular forms of the movingleast-squares method (MLS) proposed by...
fourth-order magic squares, while merely passing on the finished diagrams of larger squares. He gives a magic square of order 3, two squares for each order...
x ≥ 0, f(x) ≥ 0 and xT f(x) = 0 Leastsquares — the objective function is a sum of squares Non-linear leastsquares Gauss–Newton algorithm BHHH algorithm...
shape, often a square or circle. Square packing in a square is the problem of determining the maximum number of unit squares (squares of side length one)...
set and the most appropriate approximation model (polynomial or MovingLeastSquares with linear or quadratic basis). Due to the model independence and...
use surface smoothing using one of the implemented algorithms. The MovingLeastSquares (MLS) surface reconstruction method is a resampling algorithm that...
Mean square error Residual sum of squares Explained sum of squares Total sum of squares Scatterplot General linear model Ordinary leastsquares Generalized...
horizontal axis. The least-squares fit is a common method to fit a straight line through the data. This method minimizes the sum of the squared errors in the...
curve outline, by using the topology of the spanning tree to guide a movingleastsquares method. Another application of minimum spanning trees is a constant-factor...
square, if that square is vacant. If it has not yet moved, a pawn also has the option of moving two squares straight forward, provided both squares are...
or four nested squares of color. The position of the interior squares is determined by a regular schema, with the margin below the square being smaller...
difference of two squares is a squared (multiplied by itself) number subtracted from another squared number. Every difference of squares may be factored...
Global Information