feature vectors to achieve the same classification accuracy asin the original space for the given classification problem.Let the
N
E
be the
N
-dimensional Euclidean space and{}
i
φ
a new feature vector set produced by a feature extractionalgorithm where
i
φ
is a
N
×
1 column vector, and it is assumedthat
i
φ
has more discriminating power than
j
φ
if
i j
<
. It isalso assumed that {}
i
φ
is a basis for the
N
-dimensionalEuclidean space. One can always make an independent featurevector set into an orthonormal basis by using the Gram-Schmidt procedure [7]. Then, an observation,
X
, can berepresented by
1
N i ii
X
α φ
=
=
∑
(3)
In the proposed method, the coefficients of feature vectorswhich are dominant in discriminating power are enhanced asfollows:
1
N i i ii
X w
αφ
=
′=
∑
(4)
where
i
w
is a weight in accordance of discriminating power of the corresponding feature vector. Then the pre-enhanced data
X
′
is compressed using the conventional PCA method. Inorder to reconstruct the original data from the compressed data,the following equation can be used:
1
1ˆ
N i iii
X w
βφ
=
=
∑
whereˆ
X
′
is a pre-enhanced data reconstructed by the inversePCA andˆ
X
represents the final reconstructed data fromˆ
X
′
. Itis assumed that {}
i
φ
and {}
i
w
are available at both theencoder and decoder.There can be a number of possible weight functions for (4).In this paper, we tested various types of weight function andempirically selected the following 2 types of weight function:weightfct1:1()weightfct2:(width=5bands)
i i i DBFM i
w eigenvaluesof w stair fct
λ λ
=+=Σ
=
.
Most feature extraction methods, which include canonicalanalysis and the decision boundary feature extraction method,require that covariance matrices should be invertible.However, due to high correlations between adjacent bands, inmost cases, the covariance matrix of 220 spectral bands maynot be invertible, even though there are a large number of training samples. In order to address this problem, a possiblesolution is to group spectral bands. In this paper, we divide thedata into two groups.IV.
E
XPERIMENTAL
R
ESULTS
The data used in this paper was acquired by the AirborneVisible/Infrared Imaging Spectrometer (AVIRIS), whichcontains 220 spectral bands, and the size of images is2166
×
614 [8]. From the data, we selected a sub-region of 256
×
256. In order to evaluate the performance of the proposed algorithm, we computed SNRs and classificationaccuracies, and compared them with those of non-enhanceddata. In this paper, the bit-rate is defined on a per-band basis.That is, 1 bpp indicates 1 bit per pixel for each band. The SNR is defined as
210
[]10log
E xSNRSE
=.
where
2
ˆ[()]
M SE E x x
=−
. In the experiment, we chose 15classes from the selected area. Fig. 1 shows the selected area(50
th
band) with 15 classes chosen, and Table I describes theclass information.
Fig. 1. Sub-region of 256 x 256 with 15 classes chosen.TABLE I. D
ESCRIPTION OF CLASS INFORMATION
.
Class species No. samplesNo. trainingsamples
Buildings 375 100Corn 819 100Corn-CleanTill 966 100Corn-CleanTill-EW 1320 100Grass 172 100Hay 231 100 NotCorpped 480 100Pasture 483 100Soybeans 836 100Soybeans-CleanTill 1050 100Soybeans-CleanTill-EW 1722 100Water 189 100Trees 330 100Wheat 940 100Woods 252 100
The Gaussian ML classifier was used assuming theGaussian distribution for each class, and the 220 bands werereduced to 20 features by combining adjacent bands for classification process. It is noted that combining adjacent bands was performed after decompressing the compressed data.In other words, the compression was performed using allspectral bands.First, we divided 220 spectral bands of AVIRIS data intotwo spectral divisions (2 groups), and enhanced each datagroup by applying (2)-(4). Then, the pre-enhanced data arecompressed using the conventional PCA method. Fig. 2 showsSNRs of the PCA compression method with different numbersof eigenimages used for compression. It was observed that theweight function 1 and 2 showed almost the same compression
0-7803-9050-4/05/$20.00 ©2005 IEEE.705
Leave a Comment