1 / 33

3D Geometry for Computer Graphics

3D Geometry for Computer Graphics. Class 3. Last week - eigendecomposition. We want to learn how the matrix A works:. A. Last week - eigendecomposition. If we look at arbitrary vectors, it doesn’t tell us much. A. Spectra and diagonalization.

genevive
Télécharger la présentation

3D Geometry for Computer Graphics

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. 3D Geometry forComputer Graphics Class 3

  2. Last week - eigendecomposition • We want to learn how the matrix A works: A

  3. Last week - eigendecomposition • If we look at arbitrary vectors, it doesn’t tell us much. A

  4. Spectra and diagonalization • If A is symmetric, the eigenvectors are orthogonal (and there’s always an eigenbasis). A A = UUT = Aui = iui

  5. The plan for today • First we’ll see some applications of PCA – Principal Component Analysis that uses spectral decomposition. • Then look at the theory. • And then – the assignment.

  6. PCA – the general idea • PCA finds an orthogonal basis that best represents given data set. • The sum of distances2 from the x’ axis is minimized. y’ y x’ x

  7. PCA – the general idea • PCA finds an orthogonal basis that best represents given data set. • PCA finds a best approximating plane (again, in terms of distances2) z 3D point set in standard basis y x

  8. PCA – the general idea • PCA finds an orthogonal basis that best represents given data set. • PCA finds a best approximating plane (again, in terms of distances2) 3D point set in standard basis

  9. Application: finding tight bounding box • An axis-aligned bounding box: agrees with the axes y maxY minX maxX x minY

  10. Application: finding tight bounding box • Oriented bounding box: we find better axes! x’ y’

  11. Application: finding tight bounding box • This is not the optimal bounding box z y x

  12. Application: finding tight bounding box • Oriented bounding box: we find better axes!

  13. Usage of bounding boxes (bounding volumes) • Serve as very simple “approximation” of the object • Fast collision detection, visibility queries • Whenever we need to know the dimensions (size) of the object • The models consist of thousands of polygons • To quickly test that they don’t intersect, the bounding boxes are tested • Sometimes a hierarchy of BB’s is used • The tighter the BB – the less “false alarms” we have

  14. Scanned meshes

  15. Point clouds • Scanners give us raw point cloud data • How to compute normals to shade the surface? normal

  16. Point clouds • Local PCA, take the third vector

  17. Notations • Denote our data points by x1, x2, …, xn Rd

  18. The origin of the new axes • The origin is zero-order approximation of our data set (a point) • It will be the center of mass: • It can be shown that:

  19. Scatter matrix • Denote yi = xi – m, i = 1, 2, …, n where Y is dn matrix with yk as columns (k = 1, 2, …, n) Y YT

  20. Variance of projected points • In a way, S measures variance (= scatterness) of the data in different directions. • Let’s look at a line L through the center of mass m, and project our points xi onto it. The variance of the projected points x’iis: L L L L Original set Small variance Large variance

  21. Variance of projected points • Given a direction v, ||v|| = 1, the projection of xi onto L = m + vt is: xi x’i v L m

  22. Variance of projected points • So,

  23. Directions of maximal variance • So, we have: var(L) = <Sv, v> • Theorem: Letf : {v Rd | ||v|| = 1} R, f (v) = <Sv, v>(and S is a symmetric matrix). Then, the extrema of f are attained at the eigenvectors of S. • So, eigenvectors of S are directions of maximal/minimal variance!

  24. Summary so far • We take the centered data vectors y1, y2, …, yn Rd • Construct the scatter matrix • S measures the variance of the data points • Eigenvectors of S are directions of maximal variance.

  25. Scatter matrix - eigendecomposition • S is symmetric S has eigendecomposition: S = VVT S v1 1 2 v2 = v1 v2 vd d vd The eigenvectors form orthogonal basis

  26. Principal components • Eigenvectors that correspond to big eigenvalues are the directions in which the data has strong components (= large variance). • If the eigenvalues are more or less the same – there is no preferable direction. • Note: the eigenvalues are always non-negative. Think why…

  27. Principal components • There’s no preferable direction • S looks like this: • Any vector is an eigenvector • There is a clear preferable direction • S looks like this: •  is close to zero, much smaller than .

  28. How to use what we got • For finding oriented bounding box – we simply compute the bounding box with respect to the axes defined by the eigenvectors. The origin is at the mean point m. v3 v2 v1

  29. For approximation y v2 v1 x y y x x The projected data set approximates the original data set This line segment approximates the original data set

  30. For approximation • In general dimension d, the eigenvalues are sorted in descending order: 1  2  …  d • The eigenvectors are sorted accordingly. • To get an approximation of dimension d’ < d, we take the d’ first eigenvectors and look at the subspace they span (d’ = 1 is a line, d’ = 2 is a plane…)

  31. For approximation • To get an approximating set, we project the original data points onto the chosen subspace: xi = m + 1v1+ 2v2+…+ d’vd’+…+dvd Projection: xi’ = m + 1v1+ 2v2+…+ d’vd’+0vd’+1+…+ 0vd

  32. Good luck with Ex1

  33. Technical remarks: • i  0, i = 1,…,d (such matrices are called positive semi-definite). So we can indeed sort by the magnitude of i • Theorem: i  0  <Sv, v>  0 v Proof: Therefore, i 0  <Sv, v>  0 v

More Related