Application of Curve Fitting in Hyperspectral Data Classification and Compression
Journal Title: Journal of Information Systems and Telecommunication - Year 2015, Vol 3, Issue 3
Abstract
Regarding to the high between-band correlation and large volumes of hyperspectral data, feature reduction (either feature selection or extraction) is an important part of classification process for this data type. A variety of feature reduction methods have been developed using spectral and spatial domains. In this paper, a feature extracting technique is proposed based on rational function curve fitting. For each pixel of a hyperspectral image, a specific rational function approximation is developed to fit the spectral response curve of that pixel. Coefficients of the numerator and denominator polynomials of these functions are considered as new extracted features. This new technique is based on the fact that the sequence discipline - ordinance of reflectance coefficients in spectral response curve - contains some information which has not been considered by other statistical analysis based methods, such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) and their nonlinear versions. Also, we show that naturally different curves can be approximated by rational functions with equal form, but different amounts of coefficients. Maximum likelihood classification results demonstrate that the Rational Function Curve Fitting Feature Extraction (RFCF-FE) method provides better classification accuracies compared to competing feature extraction algorithms. The method, also, has the ability of lossy data compression. The original data can be reconstructed using the fitted curves. In addition, the proposed algorithm has the possibility to be applied to all pixels of image individually and simultaneously, unlike to PCA and other methods which need to know whole data for computing the transform matrix.
Authors and Affiliations
Seyed Hossein Hosseini, Hassan Ghassemian
Keywords
Related Articles
- EP ID EP184696
- DOI 10.7508/jist.2015.03.002
- Views 115
- Downloads 0
Optimal Sensor Scheduling Algorithms for Distributed Sensor Networks
In this paper, a sensor network is used to estimate the dynamic states of a system. At each time step, one (or multiple) sensors are available that can send its measured data to a central node, in which all of processing...
Safe Use of the Internet of Things for Privacy Enhancing
New technologies and their uses have always had complex economic, social, cultural, and legal implications, with accompanying concerns about negative consequences. So it will probably be with the IoT and their use of dat...
COGNISON: A Novel Dynamic Community Detection Algorithm in Social Network
The problem of community detection has a long tradition in data mining area and has many challenging facet, especially when it comes to community detection in time-varying context. While recent studies argue the usabilit...
On-road Vehicle detection based on hierarchical clustering using adaptive vehicle localization
Vehicle detection is one of the important tasks in automatic driving. It is a hard problem that many researchers focused on it. Most commercial vehicle detection systems are based on radar. But these methods have some pr...
Statistical Analysis of Different Traffic Types Effect on QoS of Wireless Ad Hoc Networks
IEEE 802.11 based wireless ad hoc networks are highly appealing owing to their needless of infrastructures, ease and quick deployment and high availability. Vast variety of applications such as voice and video transmissi...