ProgramsView all programs
From the news
- Chancellor Amma Addresses the Parliament of World’s Religions
- Amrita Students Qualify for the European Mars Rover Challenge
Publication Type : Conference Proceedings
Publisher : Elsevier Procedia Computer Science Journal
Source : Second International Symposium on Computer Vision and the Internet (VisionNet’15), Elsevier Procedia Computer Science Journal, SCMS School of Engineering, Aluva, Kochi, p.307 – 314 (2015)
Keywords : classification, Feature extraction, HyperSpectral, random kitchen sink, Scattering transform
Campus : Coimbatore
School : School of Engineering
Center : Computational Engineering and Networking
Department : Electronics and Communication
Year : 2015
Abstract : Hyperspectral images (HSI) contains extremely rich spectral and spatial information that offers great potential to discriminate between various land cover classes. The inherent high dimensionality and insufficient training samples in such images introduces Hughes phenomenon. In order to deal with this issue, several preprocessing techniques have been integrated in processing chain of HSI prior to classification. Supervised feature extraction is one such method which mitigates the curse of dimensionality induced by Hughes effect. In recent years, new strategies for feature extraction based on scattering transform and Random Kitchen Sink have been introduced, which can be used in context of hyperspectral image classification. This paper presents a comparative analysis of scattering and random features in hyperspectral image classification. The classification is performed using simple linear classifier such as Regularized Least Square (RLS) accessed through Grand Unified Regularized Least Squares (GURLS) library. The proposed approach is tested on two standard hyperspectral datasets namely, Salinas-A and Indian Pines subset scene captured by NASAs AVIRIS sensor (Airborne Visible Infrared Imaging Spectrometer). In order to show the effectiveness of proposed method, a comparative analysis is performed based on feature dimension, classification accuracy measures and computational time. From the comparative assessment, it is evident that classification using random features achieve excellent classification results with less computation time when compared with raw pixels(without feature extraction) and scattering features for both the datasets.
Cite this Research Publication : N. Haridas, Sowmya, and Dr. Soman K. P., “Comparative Analysis of Scattering and Random Features in Hyperspectral Image Classification”, Second International Symposium on Computer Vision and the Internet (VisionNet’15). Elsevier Procedia Computer Science Journal, SCMS School of Engineering, Aluva, Kochi, pp. 307 – 314, 2015.