A Hybrid Evolutionary Approach to Band Selection for Hyperspectral Image Classification

DOI: 10.1007/978-3-642-12990-2_37

ABSTRACT With the development of the remote-sensing imaging technology, there are more and more applications of hyperspectral image
classification tasks, in which to select a minimal and effective subset from a mass of bands is the key issue. This paper
put forward a novel band selection strategy based on conditional mutual information between adjacent bands and branch and
bound algorithm for the high correlation between the bands. In addition, genetic algorithm and support vector machine are
employed to search for the best band combination. Experimental results on two benchmark data set have shown that this approach
is competitive and robust.

KeywordsHyperspectral Remote Sensing-Band Selection-Conditional Mutual Information-Support Vector Machine-Genetic Algorithm-Branch and Bound Algorithm

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A new suboptimal search strategy suitable for feature selection in very high-dimensional remote sensing images (e.g., those acquired by hyperspectral sensors) is proposed. Each solution of the feature selection problem is represented as a binary string that indicates which features are selected and which are disregarded. In turn, each binary string corresponds to a point of a multidimensional binary space. Given a criterion function to evaluate the effectiveness of a selected solution, the proposed strategy is based on the search for constrained local extremes of such a function in the above-defined binary space. In particular, two different algorithms are presented that explore the space of solutions in different ways. These algorithms are compared with the classical sequential forward selection and sequential forward floating selection suboptimal techniques, using hyperspectral remote sensing images (acquired by the airborne visible/infrared imaging spectrometer [AVIRIS] sensor) as a data set. Experimental results point out the effectiveness of both algorithms, which can be regarded as valid alternatives to classical methods, as they allow interesting tradeoffs between the qualities of selected feature subsets and computational cost
    IEEE Transactions on Geoscience and Remote Sensing 08/2001; · 2.93 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Classification of hyperspectral data with high spatial resolution from urban areas is investigated. A method based on mathematical morphology for preprocessing of the hyperspectral data is proposed. In this approach, opening and closing morphological transforms are used in order to isolate bright (opening) and dark (closing) structures in images, where bright/dark means brighter/darker than the surrounding features in the images. A morphological profile is constructed based on the repeated use of openings and closings with a structuring element of increasing size, starting with one original image. In order to apply the morphological approach to hyperspectral data, principal components of the hyperspectral imagery are computed. The most significant principal components are used as base images for an extended morphological profile, i.e., a profile based on more than one original image. In experiments, two hyperspectral urban datasets are classified. The proposed method is used as a preprocessing method for a neural network classifier and compared to more conventional classification methods with different types of statistical computations and feature extraction.
    IEEE Transactions on Geoscience and Remote Sensing 04/2005; · 2.93 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Much research has shown that the definitions of within-class and between-class scatter matrices and regularization technique are the key components to design a feature extraction for small sample size problems. In this paper, we illustrate the importance of another key component, eigenvalue decomposition method, and a new regularization technique was proposed. In the hyperspectral image experiment, the effects of these three components of feature extraction are explored on ill-posed and poorly posed conditions. The experimental results show that different regularization methods need to cooperate with different eigenvalue decomposition methods to reach the best performance, the proposed regularization method, regularized feature extraction (RFE) outperform others, and the best feature extraction for a small sample size classification problem is RFE with nonparametric weighted scatter matrices
    IEEE Transactions on Geoscience and Remote Sensing 04/2007; · 2.93 Impact Factor