Minimum Noise Fraction versus Principal Component Analysis as a Preprocessing Step for Hyperspectral Imagery Denoising

2016 ◽  
Vol 42 (2) ◽  
pp. 106-116 ◽  
Author(s):  
Guangchun Luo ◽  
Guangyi Chen ◽  
Ling Tian ◽  
Ke Qin ◽  
Shen-En Qian
2018 ◽  
Vol 7 (12) ◽  
pp. 488 ◽  
Author(s):  
Zahra Dabiri ◽  
Stefan Lang

Hyperspectral imagery provides detailed spectral information that can be used for tree species discrimination. The aim of this study is to assess spectral–spatial complexity reduction techniques for tree species classification using an airborne prism experiment (APEX) hyperspectral image. The methodology comprised the following main steps: (1) preprocessing (removing noisy bands) and masking out non-forested areas; (2) applying dimensionality reduction techniques, namely, independent component analysis (ICA), principal component analysis (PCA), and minimum noise fraction transformation (MNF), and stacking the selected dimensionality-reduced (DR) components to create new data cubes; (3) super-pixel segmentation on the original image and on each of the dimensionality-reduced data cubes; (4) tree species classification using a random forest (RF) classifier; and (5) accuracy assessment. The results revealed that tree species classification using the APEX hyperspectral imagery and DR data cubes yielded good results (with an overall accuracy of 80% for the APEX imagery and an overall accuracy of more than 90% for the DR data cubes). Among the classification results of the DR data cubes, the ICA-transformed components performed best, followed by the MNF-transformed components and the PCA-transformed components. The best class performance (according to producer’s and user’s accuracy) belonged to Picea abies and Salix alba. The other classes (Populus x (hybrid), Alnus incana, Fraxinus excelsior, and Quercus robur) performed differently depending on the different DR data cubes used as the input to the RF classifier.


Author(s):  
A. Mehta ◽  
O. Dikshit

In this study, correlation clustering is introduced to hyperspectral imagery for unsupervised classification. The main advantage of correlation clustering lies in its ability to simultaneously perform feature reduction and clustering. This algorithm also allows selection of different sets of features for different clusters. This framework provides an effective way to address the issues associated with the high dimensionality of the data. ORCLUS, a correlation clustering algorithm, is implemented and enhanced by making use of segmented principal component analysis (SPCA) instead of principal component analysis (PCA). Further, original implementation of ORCLUS makes use of eigenvectors corresponding to smallest eigenvalues whereas in this study eigenvectors corresponding to maximum eigenvalues are used, as traditionally done when PCA is used as feature reduction tool. Experiments are conducted on three real hyperspectral images. Preliminary analysis of algorithms on real hyperspectral imagery shows ORCLUS is able to produce acceptable results.


Sign in / Sign up

Export Citation Format

Share Document