Point distribution model: Difference between revisions

Content deleted Content added
Monkbot (talk | contribs)
m References: Task 17 (BRFA trial): replace deprecated: |last-author-amp= (1× replaced; usage: 1 of 2);
Line 54:
Due to the PCA properties: eigenvectors are mutually [[orthogonal]], form a basis of the training set cloud in the shape space, and cross at the 0 in this space, which represents the mean shape. Also, PCA is a traditional way of fitting a closed ellipsoid to a Gaussian cloud of points (whatever their dimension): this suggests the concept of bounded variation.
 
The idea behind PDM'sPDMs is that eigenvectors can be linearly combined to create an infinity of new shape instances that will 'look like' the one in the training set. The coefficients are bounded alike the values of the corresponding eigenvalues, so as to ensure the generated 2n/3n-dimensional dot will remain into the hyper-ellipsoidal allowed ___domain—[[allowable shape ___domain]] (ASD).<ref name=taylor/>
 
==See also==