EFFICIENT DYNAMICAL COMPUTATION OF PRINCIPAL COMPONENTS

Darko Dimitrov, Mathias Holst, Christian Knauer, Klaus Kriegel

Abstract

In this paper we consider the problem of updating principal components of a point set in $\mathbb{R}^d$ when points are added or deleted from the point set. A recent result of \cite{Pebay-08} implies an efficient solution for that problem when points are added to a discrete point set. Here, we extend that result for deletions in the discrete case, and for both additions and deletions for continuous point sets in $\mathbb{R}^2$ and $\mathbb{R}^3$. In both cases, discrete and continuous, no additional data structures or storage are needed for computing the new principal components. An important application of the above results is the dynamical computation of bounding boxes based on principal component analysis. PCA bounding boxes are very often used in many fields, among others in computer graphics, for example, for ray tracing, fast rendering, collision detection, or video compression algorithms. Since some version of PCA bounding boxes have guaranties on their size (volume), they are also of interest in applications where the guaranty of the approximation quality is required. We have designed and implemented algorithms for computing dynamically PCA bounding boxes in $\mathbb{R}^3$.

References

  1. Barequet, G., Chazelle, B., Guibas, L. J., Mitchell, J. S. B., and Tal, A. (1996). Boxtree: A hierarchical representation for surfaces in 3D. Computer Graphics Forum, 15:387-396.
  2. Chan, T. F., Golub, G. H., and LeVeque, R. J. (1979). Updating formulae and a pairwise algorithm for computing sample variances. Technical Report STAN-CS79-773, Department of Computer Science, Stanford University.
  3. Cheng, S.-W. and Y. Wang, Z. W. (2008). Provable dimension detection using principal component analysis. Int. J. Comput. Geometry Appl., 18:415-440.
  4. Dimitrov, D., Holst, M., Knauer, C., and Kriegel, K. (2009a). Closed-form solutions for continuous PCA and bounding box algorithms. A. Ranchordas et al. (Eds.): VISIGRAPP 2008, CCIS, Springer, 24:26-40.
  5. Dimitrov, D., Knauer, C., Kriegel, K., and Rote, G. (2009b). Bounds on the quality of the PCA bounding boxes. Computational Geometry, 42:772-789.
  6. Duda, R., Hart, P., and Stork, D. (2001). Pattern classification. John Wiley & Sons, Inc., 2nd ed.
  7. Gottschalk, S., Lin, M. C., and Manocha, D. (1996). OBBTree: A hierarchical structure for rapid interference detection. Computer Graphics, 30:171-180.
  8. Jolliffe, I. (2002). Principal Component Analysis. SpringerVerlag, New York, 2nd ed.
  9. Knuth, D. E. (1998). The art of computer programming, volume 2: seminumerical algorithms. AddisonWesley, Boston, 3rd ed.
  10. Parlett, B. N. (1998). The symmetric eigenvalue problem. Society of Industrial and Applied Mathematics (SIAM), Philadelphia, PA.
  11. Pébay, P. P. (2008). Formulas for robust, one-pass parallel computation of covariances and arbitrary-order statistical moments. Technical Report SAND2008-6212, Sandia National Laboratories.
  12. Press, W. H., Teukolsky, S. A., Veterling, W. T., and Flannery, B. P. (1995). Numerical recipes in C: the art of scientific computing. Cambridge University Press, New York, USA, 2nd ed.
  13. Vranic, D. V., Saupe, D., and Richter, J. (2001). Tools for 3D-object retrieval: Karhunen-Loeve transform and spherical harmonics. In IEEE 2001 Workshop Multimedia Signal Processing, pages 293-298.
  14. Welford, B. P. (1962). Note on a method for calculating corrected sums of squares and products. Technometrics, 4:419-420.
  15. West, D. H. D. (1979). Updating mean and variance estimates: an improved method. Communications of the ACM, 22:532-535.
Download


Paper Citation


in Harvard Style

Dimitrov D., Holst M., Knauer C. and Kriegel K. (2011). EFFICIENT DYNAMICAL COMPUTATION OF PRINCIPAL COMPONENTS . In Proceedings of the International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2011) ISBN 978-989-8425-45-4, pages 85-93. DOI: 10.5220/0003324800850093


in Bibtex Style

@conference{grapp11,
author={Darko Dimitrov and Mathias Holst and Christian Knauer and Klaus Kriegel},
title={EFFICIENT DYNAMICAL COMPUTATION OF PRINCIPAL COMPONENTS},
booktitle={Proceedings of the International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2011)},
year={2011},
pages={85-93},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003324800850093},
isbn={978-989-8425-45-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2011)
TI - EFFICIENT DYNAMICAL COMPUTATION OF PRINCIPAL COMPONENTS
SN - 978-989-8425-45-4
AU - Dimitrov D.
AU - Holst M.
AU - Knauer C.
AU - Kriegel K.
PY - 2011
SP - 85
EP - 93
DO - 10.5220/0003324800850093