By Topic

Linear feature extraction for hyperspectral images using information theoretic learning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Mehdi Kamnadar ; Faculty of Electrical and Computer Engineering, Tarbiat Modares University, Tehran, Iran ; Hassan Ghassemian

In this paper, we propose a new linear feature extraction scheme for hyperspectral images. A modified Maximum relevance, Min redundancy (MRMD) is used as a criterion for linear feature extraction. Parzen density estimator and instantaneous entropy estimation are used for estimating mutual information. Using Instantaneous entropy estimator mitigates nonstationary behavior of the hyperspectral data and reduces computational cost. Based on proposed estimator and MRMD, an algorithm for linear feature extraction in hyperspectral images is designed that is less offended by Hueghs phenomenon and has less computation cost for applying to hyperspectral images. An ascent gradient algorithm is used for optimizing proposed criterion with respect to parameters of a linear transform. Preliminary results achieve better classification comparing the traditional methods.

Published in:

20th Iranian Conference on Electrical Engineering (ICEE2012)

Date of Conference:

15-17 May 2012