870 likes | 1.14k Views
Regularized Least-Squares. Outline. Why regularization? Truncated Singular Value Decomposition Damped least-squares Quadratic constraints. Why regularization?. We have seen that. Why regularization?. We have seen that But what happens if the system is almost dependent?
E N D
Regularized Least-Squares Regularized Least-Squares
Outline • Why regularization? • Truncated Singular Value Decomposition • Damped least-squares • Quadratic constraints Regularized Least-Squares
Why regularization? • We have seen that Regularized Least-Squares
Why regularization? • We have seen that • But what happens if the system is almost dependent? • The solution becomes very sensitive to the data • Poor conditioning Regularized Least-Squares
The 1-dimensional case • The 1-dimensional normal equation Regularized Least-Squares
The 1-dimensional case • The 1-dimensional normal equation Regularized Least-Squares
The 1-dimensional case • The 1-dimensional normal equation Regularized Least-Squares
Why regularization • Contradiction between data and model Regularized Least-Squares
A more interesting example:scattered data interpolation Regularized Least-Squares
“True” curve Regularized Least-Squares
Radial basis functions Regularized Least-Squares
Radial basis functions Regularized Least-Squares
Rbf are popular • Modeling • J. C. Carr, R. K. Beatson, J. B. Cherrie, T. J. Mitchell,W. R. Fright, B. C. McCallum, and T. R. Evans. Reconstruction and representation of 3d objects with radial basis functions. In Proceedings of ACM SIGGRAPH 2001, Computer Graphics Proceedings, Annual Conference Series, pages 67–76, August 2001. • G. Turk and J. F. O’Brien. Modelling with implicit surfaces that interpolate. ACM Transactions on Graphics, 21(4):855–873, October 2002. • Animation • J. Noh and U. Neumann. Expression cloning. In Proceedings of ACMSIGGRAPH 2001, Computer Graphics Proceedings, Annual Conference Series, pages 277–288, August 2001. • F. Pighin, J. Hecker, D. Lischinski, R. Szeliski, and D. H. Salesin. Synthesizing realistic facial expressions from photographs. In Proceedings of SIGGRAPH 98, Computer Graphics Proceedings, Annual Conference Series, pages 75–84, July 1998. Regularized Least-Squares
Radial basis functions • At every point Regularized Least-Squares
Radial basis functions • At every point • Solve the least-squares problem Regularized Least-Squares
Radial basis functions • At every point • Solve the least-squares problem Regularized Least-Squares
Rbf results Regularized Least-Squares
pi0 close topi1 Regularized Least-Squares
Radial basis functions • At every point • Solve the least-squares problem Regularized Least-Squares
Radial basis functions • At every point • Solve the least-squares problem • If pi0 close topi1, A is near singular Regularized Least-Squares
pi0 close topi1 Regularized Least-Squares
pi0 close topi1 Regularized Least-Squares
Rbf results with noise Regularized Least-Squares
Rbf results with noise Regularized Least-Squares
The Singular Value Decomposition • Every matrix A (nxm) can be decomposed into: • where • U is an nxn orthogonal matrix • V is an mxm orthogonal matrix • D is an nxm diagonal matrix Regularized Least-Squares
The Singular Value Decomposition • Every matrix A (nxm) can be decomposed into: • where • U is an nxn orthogonal matrix • V is an mxm orthogonal matrix • D is an nxm diagonal matrix Regularized Least-Squares
Geometric interpretation Regularized Least-Squares
Solving with the SVD Regularized Least-Squares
Solving with the SVD Regularized Least-Squares
Solving with the SVD Regularized Least-Squares
Solving with the SVD Regularized Least-Squares
Solving with the SVD Regularized Least-Squares
A is nearly rank defficient Regularized Least-Squares
A is nearly rank defficient Regularized Least-Squares
A is nearly rank defficient Regularized Least-Squares
A is nearly rank defficient • A is nearly rank defficient =>some of the are close to 0 Regularized Least-Squares
A is nearly rank defficient • A is nearly rank defficient =>some of the are close to 0 =>some of the are close to Regularized Least-Squares
A is nearly rank defficient • A is nearly rank defficient =>some of the are close to 0 =>some of the are close to • Problem with Regularized Least-Squares
A is nearly rank defficient • A is nearly rank defficient =>some of the are close to 0 =>some of the are close to • Problem with • Truncate the SVD Regularized Least-Squares
pi0 close topi1 Regularized Least-Squares
Rbf fit with truncated SVD Regularized Least-Squares
Rbf results with noise Regularized Least-Squares
Rbf fit with truncated SVD Regularized Least-Squares
Choosing cutoff value k • The first k such as Regularized Least-Squares
Example: inverse skinning“Skinning Mesh Animations”, James and Twigg, siggraph • Skinning Regularized Least-Squares
Example: inverse skinning“Skinning Mesh Animations”, James and Twigg, siggraph • Skinning ? Regularized Least-Squares
Example: inverse skinning“Skinning Mesh Animations”, James and Twigg, siggraph • Skinning Regularized Least-Squares
Example: inverse skinning“Skinning Mesh Animations”, James and Twigg, siggraph • Skinning • Inverse skinning • Let be a set of pairs of geometry and skeleton configurations Regularized Least-Squares
Example: inverse skinning“Skinning Mesh Animations”, James and Twigg, siggraph • Skinning • Inverse skinning • Let be a set of pairs of geometry and skeleton configurations Regularized Least-Squares
Example: inverse skinning“Skinning Mesh Animations”, James and Twigg, siggraph • Skinning • Inverse skinning • Let be a set of pairs of geometry and skeleton configurations Regularized Least-Squares