the data sets used, tests conducted and resultsobtained. A comparative analysis on existingalgorithms is also given here. Section 5 concludes thework
.
2. Related Works
Recent researches in hyperspectral image analysismainly focus on applying supervised or unsupervisedclassification methods [7]-[9] before dimensionalityreduction using classical approaches like PCA [6] or Independent Component Analysis [10]. Classificationmethods such as the Maximum Likelihood Classifier (MLC) [9] are highly dependent on assumptionsrelated to statistical distribution of the data and theywill not give good results in hyper-spectralclassification. Though neural networks [11] have anadvantage as they can work with complex datasets,these are slow in the training phase. Recently, SupportVector Machines (SVMs) [12][13] that canoutperform other hyperspectral image classifiers have been proposed. To make classification more simpleand robust keeping the quality of the resultscomparable to the same obtained through SVM, aclustering based on support vectors [14] isimplemented here. The kernel used in SVC discussedin [14] is based on geometric distance betweenvectors, which does not take spectral meaning and behaviour of the data into consideration. Toincorporate the spectral knowledge also into theclassification, the spectral based kernel [5] is used inthe clustering process associated with this work. In arelated work [15] based on SAM and PCA, spectralscreening is done before dimensionality reduction insuch a manner that if the spectral distance betweentwo vectors exceeds a particular threshold, they belongto separate classes. The major steps involved in our work are described in the next section.
3. Proposed Method
The mathematical concept used in this work is built on the theory of spectral angles, support vectorsand principal components. Spectral based kernels areused to find out the support vectors and thereby uniquespectral signatures. Initially the unique signature set isempty. Using support vectors with spectral–basedkernels, a clustering is done first. To do this, theoriginal data is mapped to a feature space using SAMand RBF kernel [5] and clustered. The bestrepresentative of each cluster is added to a unique set.This unique set is used to find out the mean in thespectral de-correlation process thereby avoiding the problem of giving more importance to the frequentlyoccurred data.A ray casting through each pixel in the hyper-spectral image cube results in a vector called the pixelvector, which gives the spectral signature of theground region (or the material) represented by that pixel. As a first step in the algorithm, the spectralangle matrix and kernel function for SVC arecalculated. If
x
and
y
are two ‘n’ dimensional pixelvectors, where ‘n’ is the number of bands in the inputimage, then the angle between two vectors can begiven as,
α
(
x,
y
) =cos
-1
((
x
●
y
)
⁄
(||
x
| |.||
y
||)) (1)As described in SVC algorithm [14], let
x
i
be avector in the data space X, where the number of attributes for each
x
i
is ‘
n
’. Using a nonlinear mapping
Φ
,
the data is mapped from X to some highdimensional feature space and the smallest enclosingsphere of radius R is found. It is described by theconstraints:||
Φ
(
x
j
)-
a
||
2
≤
R
2
∀
j, (2)where || . || is the Euclidean norm and ‘
a’
is the center of the sphere. At each point
x
the distance of its imagein feature space from the center
a
of the sphere isdefined as,R
2
(
x
) = ||
Φ
(
x
)-
a
||
2
(3)The support Vectors are found by solving for Lagrange Multipliers as follows [14]: Theoptimization problem is,Minimize
W=
Σ
j
K(
x
j
,
x
j
)
β
j
-
Σ
i,j
β
i
β
j
K(
x
i
,
x
j
)
(4)Such that 0
≤
β
i
≤
C,where C is the regularization parameter,
β
i
is the i
th
Lagrange Multiplier and
K
is the kernel matrix.The next step in the proposed method is clusteringand classification. The square of the radial distance of the image of
x
from the center of the sphere is given by eq. (3) and can be written as,
R
2
(
x
)=K(
x
,
x
)-2
Σ
j
β
j
K(
x
,
x
j
)+
Σ
i, j
β
i
β
j
K(
x
i
,
x
j
)
(5)where
β
i,
β
j
are Lagrangian multipliers
and
K(
x
,
x
j
)is an appropriate Mercer kernel[5]. In this work theRBF kernel given by
K(
x
,
x
j
)=exp(-q ||
α
(
x
,
x
j
)||) (6)where
α
(
x
,
x
j
)
is the spectral angle between vectors
x
and
x
j
and ‘q’
is the width parameter of the kernelwhich decides the number of clusters formed in thedata space.The radius of the sphere is calculated asR = {R(
x
i
) |
x
i
is a support vector} (7)The contours that enclose the points in data space aredefined by the set {
x
| R(
x
) = R}, and they describethe boundary of the clusters. To differentiate betweenthe points belonging to different clusters the conceptof connected components is used [14]. To do this, anadjacency matrix
Aij
between a pair of point
x
i
and
x
j
whose images lie in or on the sphere in feature space isdefined as,
Proceedings of the International Conference on Computing: Theory and Applications (ICCTA'07)0-7695-2770-1/07 $20.00 © 2007
Leave a Comment