An Efficient Feature Extraction Method, Global Between Maximum and Local Within Minimum, and Its Applications

Table 1

Estimate approximately computational complexity for the six different algorithms, where 𝑛 denotes the total number of training samples, 𝑘 and 𝐶 are the size of neighborhood and the number of class, respectively.

Method	PCA	LDA	MMC	LPP	ANMM	GBMLWM
Computational; Complexity	𝑂(𝑛)	𝑂(𝑛)	𝑂(𝑛)	𝑂(𝑛^2+𝑘𝑛)	𝑂(𝑛^2+𝑘𝑛)	𝑂(𝑛^2+𝑘𝑛+𝑘𝐶)