# Implementing PCA/Whitening

(Difference between revisions)
 Revision as of 08:56, 1 June 2011 (view source) (pFrA7g bjzuhaqkkgdg, [url=http://fbrmgfrpuwcw.com/]fbrmgfrpuwcw[/url], [link=http://laephhvnzyfg.com/]laephhvnzyfg[/link], http://dllkssivxryk.com/)← Older edit Revision as of 09:15, 1 June 2011 (view source)Jngiam (Talk | contribs) (Undo revision 994 by 79.142.67.147 (talk))Newer edit → Line 1: Line 1: - pFrA7g bjzuhaqkkgdg, [url=http://fbrmgfrpuwcw.com/]fbrmgfrpuwcw[/url], [link=http://laephhvnzyfg.com/]laephhvnzyfg[/link], http://dllkssivxryk.com/ + In this section, we summarize the PCA, PCA whitening and ZCA whitening algorithms, + and also describe how you can implement them using efficient linear algebra libraries. + + First, we need to ensure that the data has (approximately) zero-mean. For natural images, we achieve this (approximately) by subtracting the mean value of each image patch. + + We achieve this by computing the mean for each patch and subtracting it for each patch. In Matlab, we can do this by using + + avg = mean(x, 1);    % Compute the mean pixel intensity value separately for each patch. + x = x - repmat(avg, size(x, 1), 1); + + Next, we need to compute \textstyle \Sigma = \frac{1}{m} \sum_{i=1}^m (x^{(i)})(x^{(i)})^T.  If you're implementing this in Matlab (or even if you're implementing this in C++, Java, etc., but have access to an efficient linear algebra library), doing it as an explicit sum is inefficient. Instead, we can compute this in one fell swoop as + + sigma = x * x' / size(x, 2); + + (Check the math yourself for correctness.) + Here, we assume that $x is a data structure that contains one training example per column (so, [itex]x is a \textstyle n$-by-$\textstyle m$ matrix). + + Next, PCA computes the eigenvectors of $\Sigma$.  One could do this using the Matlab eig function.  However, because $\Sigma$ is a symmetric positive semi-definite matrix, it is more numerically reliable to do this using the svd function. Concretely, if you implement + + [U,S,V] = svd(sigma); + + then the matrix $U will contain the eigenvectors of [itex]Sigma (one eigenvector per column, sorted in order from top to bottom eigenvector), and the diagonal entries of the matrix [itex]S$ will contain the corresponding eigenvalues (also sorted in decreasing order). The matrix $V will be equal to transpose of [itex]U, and can be safely ignored. + + (Note: The svd function actually computes the singular vectors and singular values of a matrix, which for the special case of a symmetric positive semi-definite matrix---which is all that we're concerned with here---is equal to its eigenvectors and eigenvalues. A full discussion of singular vectors vs. eigenvectors is beyond the scope of these notes.) + + Finally, you can compute [itex]\textstyle x_{\rm rot}$ and $\textstyle \tilde{x}$ as follows: + + xRot = U' * x;          % rotated version of the data. + xTilde = U(:,1:k)' * x; % reduced dimension representation of the data, + % where k is the number of eigenvectors to keep + + This gives your PCA representation of the data in terms of $\textstyle \tilde{x} \in \Re^k. + Incidentally, if [itex]x is a [itex]\textstyle n$-by-$\textstyle m$ matrix containing all your training data, this is a vectorized + implementation, and the expressions + above work too for computing $x_{\rm rot}$ and $\tilde{x}$ for your entire training set + all in one go. The resulting + $x_{\rm rot} and [itex]\tilde{x} will have one column corresponding to each training example. + + To compute the PCA whitened data [itex]\textstyle x_{\rm PCAwhite}$, use + + xPCAwhite = diag(1./sqrt(diag(S) + epsilon)) * U' * x; + + Since $S's diagonal contains the eigenvalues [itex]\textstyle \lambda_i$, + this turns out to be a compact way + of computing $\textstyle x_{{\rm PCAwhite},i} = \frac{x_{{\rm rot},i} }{\sqrt{\lambda_i}}$ + simultaneously for all $\textstyle i$. + + Finally, you can also compute the ZCA whitened data $\textstyle x_{\rm ZCAwhite}$ as: + + xZCAwhite = U * diag(1./sqrt(diag(S) + epsilon)) * U' * x; + + + {{PCA}}

## Revision as of 09:15, 1 June 2011

In this section, we summarize the PCA, PCA whitening and ZCA whitening algorithms, and also describe how you can implement them using efficient linear algebra libraries.

First, we need to ensure that the data has (approximately) zero-mean. For natural images, we achieve this (approximately) by subtracting the mean value of each image patch.

We achieve this by computing the mean for each patch and subtracting it for each patch. In Matlab, we can do this by using

avg = mean(x, 1);     % Compute the mean pixel intensity value separately for each patch.
x = x - repmat(avg, size(x, 1), 1);


Next, we need to compute $\textstyle \Sigma = \frac{1}{m} \sum_{i=1}^m (x^{(i)})(x^{(i)})^T$. If you're implementing this in Matlab (or even if you're implementing this in C++, Java, etc., but have access to an efficient linear algebra library), doing it as an explicit sum is inefficient. Instead, we can compute this in one fell swoop as

sigma = x * x' / size(x, 2);


(Check the math yourself for correctness.) Here, we assume that x is a data structure that contains one training example per column (so, x is a $\textstyle n$-by-$\textstyle m$ matrix).

Next, PCA computes the eigenvectors of Σ. One could do this using the Matlab eig function. However, because Σ is a symmetric positive semi-definite matrix, it is more numerically reliable to do this using the svd function. Concretely, if you implement

[U,S,V] = svd(sigma);


then the matrix U will contain the eigenvectors of Sigma (one eigenvector per column, sorted in order from top to bottom eigenvector), and the diagonal entries of the matrix S will contain the corresponding eigenvalues (also sorted in decreasing order). The matrix V will be equal to transpose of U, and can be safely ignored.

(Note: The svd function actually computes the singular vectors and singular values of a matrix, which for the special case of a symmetric positive semi-definite matrix---which is all that we're concerned with here---is equal to its eigenvectors and eigenvalues. A full discussion of singular vectors vs. eigenvectors is beyond the scope of these notes.)

Finally, you can compute $\textstyle x_{\rm rot}$ and $\textstyle \tilde{x}$ as follows:

xRot = U' * x;          % rotated version of the data.
xTilde = U(:,1:k)' * x; % reduced dimension representation of the data,
% where k is the number of eigenvectors to keep


This gives your PCA representation of the data in terms of $\textstyle \tilde{x} \in \Re^k$. Incidentally, if x is a $\textstyle n$-by-$\textstyle m$ matrix containing all your training data, this is a vectorized implementation, and the expressions above work too for computing xrot and $\tilde{x}$ for your entire training set all in one go. The resulting xrot and $\tilde{x}$ will have one column corresponding to each training example.

To compute the PCA whitened data $\textstyle x_{\rm PCAwhite}$, use

xPCAwhite = diag(1./sqrt(diag(S) + epsilon)) * U' * x;


Since S's diagonal contains the eigenvalues $\textstyle \lambda_i$, this turns out to be a compact way of computing $\textstyle x_{{\rm PCAwhite},i} = \frac{x_{{\rm rot},i} }{\sqrt{\lambda_i}}$ simultaneously for all $\textstyle i$.

Finally, you can also compute the ZCA whitened data $\textstyle x_{\rm ZCAwhite}$ as:

xZCAwhite = U * diag(1./sqrt(diag(S) + epsilon)) * U' * x;


PCA | Whitening | Implementing PCA/Whitening | Exercise:PCA in 2D | Exercise:PCA and Whitening