The Pixel Purity Index (PPI) algorithm extracts endmember signatures from hyperspectral data cubes. It identifies endmember pixels by projecting dimensionality-reduced data onto randomly generated unit vectors and finding the pixels with the largest projection values.
Algorithm Principle
- Perform dimensionality reduction on the hyperspectral data cube, choosing from PCA (Principal Component Analysis), MNF (Maximum Noise Fraction), or no reduction at all.
- Generate a set number of random unit vectors (10,000 by default).
- Project the reduced data onto each random unit vector and record the maximum projection value obtained by each pixel.
- Rank the pixels by their maximum projection values and select the N pixels with the largest values as the endmember signatures.
Algorithm Implementation
Here is how to implement the PPI algorithm in MATLAB.
| |
In summary, PPI is a geometry-based unsupervised endmember extraction method. It identifies endmember pixels by projecting dimensionality-reduced data onto random unit vectors and finding the pixels with the maximum projection values. The algorithm is widely used for endmember extraction and nonlinear unmixing analysis of hyperspectral images.
