Machine Learning
Efficient Graph-Based Image Segmentation
International Journal of Computer Vision
Random Forests for land cover classification
Pattern Recognition Letters - Special issue: Pattern recognition in remote sensing (PRRS 2004)
Hyperspectral Data Exploitation: Theory and Applications
Hyperspectral Data Exploitation: Theory and Applications
A morphological gradient approach to color edge detection
IEEE Transactions on Image Processing
Hi-index | 0.00 |
The high dimensionality of hyperspectral images are usually coupled with limited reference data available, which degenerates the performances of supervised classification techniques such as random forests (RF). The commonly used pixel-wise classification lacks information about spatial structures of the image. In order to improve the performances of classification, incorporation of spectral and spatial is needed. This paper proposes a novel scheme for accurate spectral-spatial classification of hyperspectral image. It is based on random forests, followed by majority voting within the superpixels obtained by oversegmentation through a graph-based technique. The scheme combines the result of a pixel-wise RF classification and the segmentation map obtained by oversegmentation. Our experimental results on two hyperspectral images show that the proposed framework combining spectral information with spatial context can greatly improve the final result with respect to pixel-wise classification with Random Forests.