Cylinder set measure: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>ChrisGualtieri
m References: Typo fixing, typos fixed: , → , (2) using AWB
 
en>Mgkrupa
References: Added {{Functional Analysis}} footer
Line 1: Line 1:
Claude is her title and she totally digs that title. Her spouse and her selected to reside in Alabama. The factor I adore most flower arranging and now I have time to consider on new issues. Managing individuals is how she makes money and she will not alter it anytime soon.<br><br>my blog :: [http://Freebusinesscollege.com//read_blog/198199/great-ideas-about-auto-repair-that-anyone-can-use auto warranty]
'''Moving least squares''' is a method of reconstructing [[continuous function]]s from a [[set (mathematics)|set]] of unorganized point samples via the calculation of a weighted [[least squares]] [[measure (mathematics)|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]].
 
==Definition==
[[Image:Moving_Least_Squares2.png|thumb|200px|width=250|length=150|Here is a 2D example. The circles are the samples  and the polygon is a linear interpolation. The blue curve is a smooth interpolation of order 3.]]
Consider a function <math>f: \mathbb{R}^n \to \mathbb{R}</math> and a set of sample points <math>S = \{ (x_i,f_i) | f(x_i) = f_i \} </math> where <math>x_i \in \mathbb{R}^n</math> and the <math>f_i</math>'s are real numbers. Then, the moving least square approximation of degree <math>m</math> at the point <math>x</math> is <math>\tilde{p}(x)</math> where <math>\tilde{p}</math> minimizes the weighted least-square error
:<math>\sum_{i \in I} (p(x)-f_i)^2\theta(\|x-x_i\|)</math>
over all polynomials <math>p</math> of degree <math>m</math> in <math>\mathbb{R}^n</math>. <math>\theta(s)</math> is the weight and it tends to zero as <math>s\to \infty</math>.
 
In the example <math>\theta(s) = e^{-s^2}</math>.
 
==See also==
*[[Local regression]]
*[[Diffuse element method]]
 
==References==
{{Reflist}}
*[http://dl.acm.org/citation.cfm?id=301704 The approximation power of moving least squares] David Levin, Mathematics of Computation, Volume 67, 1517-1531, 1998 [http://www.ams.org/mcom/1998-67-224/S0025-5718-98-00974-0/S0025-5718-98-00974-0.pdf ]
*[http://www.sciencedirect.com/science/article/pii/S0045794905000726/ Moving least squares response surface approximation: Formulation and metal forming applications] Piotr Breitkopf; Hakim Naceur; Alain Rassineux; Pierre Villon, Computers and Structures, Volume 83, 17-18, 2005.
* [http://www.springerlink.com/content/v7164702238848p1/ Generalizing the finite element method: diffuse approximation and diffuse elements], B Nayroles, G Touzot. Pierre Villon, P, Computational Mechanics Volume 10, pp 307-318, 1992
 
==External links==
* [http://www.nealen.net/projects/mls/asapmls.pdf An As-Short-As-Possible Introduction to the Least Squares, Weighted Least Squares and Moving Least Squares Methods for Scattered Data Approximation and Interpolation]
 
[[Category:Mathematical optimization]]
[[Category:Regression analysis]]
[[Category:Least squares]]
 
{{mathapplied-stub}}

Revision as of 05:09, 10 January 2014

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.

Definition

Here is a 2D example. The circles are the samples and the polygon is a linear interpolation. The blue curve is a smooth interpolation of order 3.

Consider a function f:n and a set of sample points S={(xi,fi)|f(xi)=fi} where xin and the fi's are real numbers. Then, the moving least square approximation of degree m at the point x is p~(x) where p~ minimizes the weighted least-square error

iI(p(x)fi)2θ(xxi)

over all polynomials p of degree m in n. θ(s) is the weight and it tends to zero as s.

In the example θ(s)=es2.

See also

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

Template:Mathapplied-stub