Related
Ontology
Subjects/Areas/Topics:Computer Vision, Visualization and Computer Graphics
;
Fundamental Methods and Algorithms
;
Geometric Computing
;
Geometry and Modeling
;
Modeling and Algorithms

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$.(More)

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$.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

Guests can use SciTePress Digital Library without having a SciTePress account. However, guests have limited access to downloading full text versions of papers and no access to special options.

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

@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}, }

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