[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Moving least squares

From Wikipedia, the free encyclopedia

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]

Definition

Thumb
Here is a 1D example. The circles are the sample points and the polygon is a linear interpolation. The blue curve is a smooth approximation of order 3.

Consider a function and a set of sample points . Then, the moving least square approximation of degree at the point is where minimizes the weighted least-square error

over all polynomials of degree in . is the weight and it tends to zero as .

In the example . The smooth interpolator of "order 3" is a quadratic interpolator.

See also

References

Loading related searches...

Wikiwand - on

Seamless Wikipedia browsing. On steroids.