International Journal of Research in Advanced Technology IJORAT (ISSN ONLINE 2456-2769)

Vol. 2, Issue 1, JANUARY 2017

GENERALIZED BILINEAR MODEL

BASED NONLINEAR SPECTRAL
UNMIXING IN HYPERSPECTRAL
IMAGE
T. PRIYANKA1, G.VEERA SENTHIL KUMAR2, Dr.S.VASUKI3
PG Student, Department of ECE,Velammal College of Engineering and Technology,Tamil Nadu, India.1
Assistant Professor, Department of ECE,Velammal College of Engineering and Technology,Tamil Nadu, India.2
Professor & Head,Department of ECE,Velammal College of Engineering and Technology, Tamil Nadu, India.3

ABSTRACT: This paper deals with the difficulty of unmixing hyperspectral using hierarchical bayseian
algorithm. Further the worth of unmixing approach images, while the light suffers multiple interactions
among distinct endmembers. In these scenarios, linear unmixing has poor accuracy since the multiple light
scattering effects are not accounted for by the linear mix model. Even though linear mix models are often
considered because of their simplicity, there are many situation in which they can be beneficially replaced by
nonlinear mixing models. In this work, Generalized Bilinear Model(GBM) and a hierarchical Bayesian
algorithm for hyperspectral images unmixing has been proposed. Simplex Growing Algorithm (SGA) is
used for extracting end members in this work. The abundance map for each end members is constructed
using GBM. The performance of the proposed method is evaluated in terms of Root Mean Square
Error(RMSE).

Keywords: End member extraction, SGA, GBM, Spectral unmixing, RMSE

photons with multiple components. Linear mixing
models have motivated a lot of investigate work in
I.INTRODUCTION
the geo science community. However, nonlinear
Over the last few decades, spectral unmixing[13] models constitute a new interesting field of research
has been getting significant attention in the signal and for hyper spectral imagery. In particular, nonlinear
image processing literature . Spectral unmixing (SU) models have shown attractive properties for
is widely used for analyzing hyperspectral data abundance estimation[12], e.g., for scenes including
arising in areas such as: remote sensing, planetary mixtures of minerals , orchards or vegetation .
science chemometrics, materials science and other
This paper introduces a generalized bilinear
areas of micro spectroscopy. SU provides a
model (GBM)[5] for nonlinear unmixing of
comprehensive and quantitative mapping of the
hyperspectral images. This model is a generalization
elementary materials that are present in the acquired
of the established linear mixing model (LMM) [9]but
data. More precisely, SU can identify the spectral
also of a bilinear model newly introduced by Fan et
signatures of these materials (usually called
al. Estimating the abundances related to this
endmembers) and can estimate their relative
nonlinear model is not a easy problem. Almost all
contributions (or abundances) to the measured
algorithms dedicated to the unmixing of nonlinear
spectra.The mixture model associated with hyper
models are based on the least square estimators as in
spectral images can be linear[9] or nonlinear[1].
.We propose here a hierarchical Bayesian algorithm
Linear mixtures known as macro spectral mixtures
to estimate the parameters and hyperparameters
are interesting when the detected photons interact
associated with the GBM. The major benefit of this
mainly with a single component on the scene before
algorithm is that it allows one to satisfy the positivity
they reach the sensor. on the other hand, nonlinear
and sum to one constraint for the abundances as well
mixture models [6]result from the interaction of
as the physical constraint for the nonlinearity

All Rights Reserved 2017 IJORAT 18

 International Journal of Research in Advanced Technology IJORAT (ISSN ONLINE 2456-2769)
Vol. 2, Issue 1, JANUARY 2017

coefficients. We propose to approximate these
estimators from samples generated by Markov chain
Monte Carlo (MCMC) methods. Note that similar
hierarchical Bayesian algorithms[10] have already
been applied successfully to linear [9]unmixing of
hyperspectral images.
The rest of the paper describes about each section as
follows. In section II, Spectral Unmixing has been
discussed. In section III, Endmember extraction has
been briefed. In section IV, Abundances Estimation
is described. In Section V Proposed Methodology is
explained. In Section VI,Experimental results and
data used for this work is explained are demonstrated.
At last In section VII, Conclusion is given.
II.SPECTRAL UNMIXING
Spectral unmixing is the procedure by which
the measured spectrum of a mixed pixel is
decomposed into a collection of constituent spectra,
or endmembers[7], and a set of corresponding
fractions, or abundances[14], that indicate the
proportion of each endmember present in the pixel.
Linear spectral unmixing is all very well but
unfortunately in reality most scenarios are nonlinear.
In nonlinear mixing [14]the light incident on a small
surface components interacts (or scatters) with
multiple components before being detected by the
sensor. Consideration of nonlinear [1]effects in
hyperspectral images can provide more accurate
results interms of endmember and abundance[14]
identication.Various models are generally used for
nonlinearity detection .
1. Generalised Bilinear Model
Nonlinear mixture models[1] account for the
presence of multiple photon Interactions by
introducing additional interaction terms in the
LMM . The bilinear model [4]considers second order
interactions among endmembers [7]#i and #j (for i,j =
1, . . . , R & ij) such that the observed mixed pixel y
can be written as,
1

= + , + (2)
A. Linear Mixing Model =1 =+1

Each surface component within a pixel is where is the Hadamard (term-by-term) product
sufficiently large enough such that no multiple operation
scattering exists between the components . The linear
scattering approximation is valid when the size of the 1, 1, 1, ,
pixel is smaller than the typical patch or component . . .
= . . = . (3)
being sensed i.e. linear mixing occurs at the
. . .
macroscopic scale. According to the LMM[9], the L- , , , ,
spectrum y = [y1 ,.,yL]T of a mixed pixel can be
expressed as a mixture of R endmembers mk with It is interesting to state here that different bilinear
additive noise models[4] have been planned in the literature. These
models differ by the additivity constraints imposed
on the abundances. For instance,the model proposed
= + = M + (1) in [13], referred to as Nascimento model,is based
=1 on the following constraints:
1
where M is an L R matrix whose columns are the L
+ , =1 (4)
1 endmember [7]spectra mk = [m1,k ,.,mL,k]T (k =1 =1 =+1
=1,.,R) and = [1,.R]T is the R 1 fractional
abundance vector. The additive noise n = [n1,., nL]T whereas the model studied in [9], referred to as Fan
is assumed to be an independent and identically model(FM), is defined by
distributed (i.i.d) zero-mean Gaussian sequence with
variance 2. = 1 , = (5)
=1

B. Nonlinear Mixing Model The GBM studied in this paper assumes that the
observed mixed pixel can be written as,

All Rights Reserved 2017 IJORAT 19

 International Journal of Research in Advanced Technology IJORAT (ISSN ONLINE 2456-2769)
Vol. 2, Issue 1, JANUARY 2017
1
= + , + (6)
=1 =+1
with the following constraints for the different
parameters:
k 0 1, , =1 =1 contains at least one pure pixel for each endmember
0 , 1 1, , 1 + 1, , (7) (which is not always a realistic assumption) and
Note that i,j is a coefficient that controls the
interactions between endmembers [7].#i and #j in the
considered pixel. A main property of the GBM is that
it reduces to LMM for i,j = 0 i = 1, . . . , R 1, j =
i + 1, . . . , R, and to FM for i,j = 1 i = 1, . . . , R
1, j = i + 1, . . . , R. The unknown parameter vector
associated with the GBM includes the abundance
vector , the nonlinearity[1] coefficient vector
=[1,2, . . . , R1,R]T, and the noise variance 2. To
know the physics related to this model, assume that
there are only two components tree and soil
present in the observed pixel. The hyperspectral
sensor will receive signals backscattered by the tree
and the soil separately, corresponding to the terms
1m1 and 2m2. However, it will also receive
interaction terms resulting from multiple scattering of
photons between the two components tree and
soil (which can be seen as multipath terms). For
example, if the signal is first backscattered by the tree
and then backscattered by the soil, the hyperspectral
sensor will receive an interaction term
1212m1m2. It makes sense to imagine 12 1
since the path associated to the two reflections on the
tree and the soil is longer than the direct paths linked
to the tree only and soil only signals (resulting in
smaller amplitudes). Note that higher order
interaction terms are also received by the
hyperspectral sensor.
III.ENDMEMBER EXTRACTION
Spectral unmixing [1]includes two main
steps. The rst step (referred to as endmember
extraction) consists of extracting endmembers from
the hyperspectral image.This extraction can be
achieved in a supervised manner when prior
information about the image is available. For
instance,one might recognize classes of pure
materials in the imageand select the associated
All Rights Reserved 2017 IJORAT
endmembers to create a learning setcontaining
samples belonging to the different classes. When this
information is not available, an automatic
endmember extraction algorithm (EEA) has to be
considered. Automatic EEA include the pixel purity
index , the N-FINDR[2] ,and the vertex component
analysis (VCA)[8] . They assume that the data set
extract the purest pixels from the image.The
extraction of endmembers[7] from the Hyper spectral
images has been performed by SGA .The obtained
spectra for the Japer ridge and Samson images are
shown in Fig. These spectra have been identied
using prior knowledge regarding the Japer Ridge
image (which is known to be composed of
vegetation, soil, and water,road ) and for the Samson
image (which is known to be composed of
vegetation, soil, and water).
A. Simplex Growing Algorithm
SGA is an simplex based EEA which finds
simplex with maximum volume for each vertex . The
method of finding maximum volume simplexes is
repeated till the number of vertices equals the number
of endmembers[7], provided by VD estimate. The
algorithm starts with random choice of initial
endmember[7] pixel. The first endmember selection
process is given as follows.
1. First a target pixel t is randomly generated.
2. Then a pixel e1 yielding maximum of absolute
determinant of the matrix over all sample vectors r is
found using the formula
1 1
e1 arg max det (8)
r
t r
where band selection is used to decrease the
original dimensionality of data from L to dimension
n. Now, including the above first endmember
selection process, SGA is described as follows.
1. Determine VD to estimate the number of
endmembers p.
2. Put e1 as initial endmember pixel and set n=1.
20
 International Journal of Research in Advanced Technology IJORAT (ISSN ONLINE 2456-2769)
Vol. 2, Issue 1, JANUARY 2017

3. For 1, Determine the volume of the For that purpose, prior distributions for the
hyperparameters have to be dened, introducing a
simplex V(e1,e2, ., en, r) for each sample vector r
second level of hierarchy into the Bayesian
by
formulation.
1 1.......... .1 1
det
e1 e2 .......en r V.PROPOSED METHODOLOGY
1, 2, , =| | (9)
!
In this proposed method, two different
hyperspectral data(Jasper ridge, Samson) are taken .
In this paper, Endmember Extraction in the unmixing
4. Find en+1 that yields maximum of equation in step procedure is done by using SGA. Simplex Growing
Algorithm provides better results when compared to
en + 1 = arg max V e1, e2, . en, r (10) N-Findr[2] And PPI(Pixel Purity Index)[7].After
r
finding endmember[7], next step is to find
Abundance Map and nonlinearity coefficients of the
5. If the value of n is below the number of
nonlinear [6]model using hierarchical bayseian
endmembers, then increase n value by one and go
algorithm. The obtained abundance map[4] is
on from step 3. Else, the obtained set of {e1, e2, . ,
compared with the groundtruth abundance map
ep}in the preceding step is final endmember.
[14]of Hyperspectral Data. Finally the quality of the
IV.ABUNDANCES ESTIMATION unmixing strategy is evaluated by using Root mean
The second step of spectral unmixing, called square error. The flow of the proposed work is
inversion, consists of estimating the corresponding explained in the Fig 1.
abundances under positivity and sum-to-one
constraints. Many different algorithms have been HYPER SPECTRAL IMAGE CUBE
proposed in the literature to estimate the abundances
for the LMM. These algorithms are based on the
least square principle , maximum likelihood
estimation ,or Bayesian algorithms . Estimating the
ENDMEMBER EXTRACTION
abundances for nonlinear models[15] is a more (SIMPLEX GROWING ALGORITHM)
challenging problem. Almost all algorithms for the
unmixing[1] of nonlinear models are based on the
least square estimators . Some other methods based
NONLINEAR SPECTRAL UNMIXING USING
on support vector machines (SVMs) and neural GENERALISED BILINEAR MODEL
networks have also been recently investigated.

This paper studies a Bayesian algorithm to

estimate the abundance coefcients[14] and the noise ABUNDANCE MAP
CONSTRUCTION
variance of the GBM[4].Appropriate prior
distributions are chosen for the unknown GBM
parameters. The joint posterior distribution of Fig.1. Block Diagram for Proposed Methodology
theseparameters is then derived. However, the
classical minimum mean square error (MMSE) and VI. EXPERIMENTAL RESULTS
maximum a posteriori (MAP)estimators cannot be
Jasper Ridge is a popular hyper spectral
easily computed from this joint posterior.A classical
data which is shown in Fig 2. There is
way of alleviating this problem is to generate samples
512 x 614 pixels in it. Every pixel is recorded at 224
distributed according to the posterior using
channels ranging from 380 nm to 2500 nm. The
Markovchain Monte Carlo (MCMC) methods. These
spectral resolution is equal to 9.46nm. Since this
methods can also be used to estimate the model
hyper spectral image is too complex to get the ground
hyperparameters via hierarchical Bayesian inference.
truth (spectral signatures), we consider a sub image

All Rights Reserved 2017 IJORAT 21

 International Journal of Research in Advanced Technology IJORAT (ISSN ONLINE 2456-2769)
Vol. 2, Issue 1, JANUARY 2017
of 100 x 100 pixels. The first pixel starts from the
(105,269)-th pixel in the original image. After
removing the channels 1--3, 108--112, 154--166 and
220--224 (because of dense water vapor and
atmospheric effects), we remain 198 channels. There
are four targets in this image : Road, Soil, Water and
Tree.
Fig.2. JASPER RIDGE
Fig.3.Spectral signature of endmember in Jasper
ridge using SGA
The abundances of each image have been
estimated by running the proposed Bayesian
unmixing [10]method on each pixel of the Hyper
spectral images. The unmixing procedure has been
performed by considering the R =4. The MMSE
estimates of the abundances [14]have been computed
by averaging the Nr = 1600 last generated samples
obtained after Nbi = 600 burn in iterations. The
image fraction maps,estimated by the proposed
All Rights Reserved 2017 IJORAT
method and relative to the linear[7] contribution of
the endmembers[7]. Fraction maps estimated
according to GBM for Jasperridge.The abundance
map of each endmember[14] is found using GBM
and it is shown in Fig 5.
Tree Road Water Soil
Fig.4.Groundtruth abundance map of
endmembers
Fig.5. Abundance map obtained using GBM
The performance of the proposed method is evaluated
by comparing the abundance map of endmembers[7]
obtained using GBM with those of groundtruth in
terms of RMSE[16] and it is tabulated in the table 1.
Table 1. Performance evaluation of proposed
method in terms of RMSE
Endmembers RMSE
Tree 0.1313
Road 0.1883
Water 0.1623
Soil 0.1407
VII.CONCULSION
A new nonlinear model called generalized
bilinear model has been proposed to model the
interactions between the macroscopic components of
an hyperspectral image. Endmember Extraction in the
unmixing procedure is done by using SGA. Then
Abundance fraction estimation process is done using
Generalised Bilinear Model and the output is
compared with original ground truth abundance map.
The proposed spectral unmixing method provides the
superior result in terms of RMSE.
22
 International Journal of Research in Advanced Technology IJORAT (ISSN ONLINE 2456-2769)
Vol. 2, Issue 1, JANUARY 2017

[11].Chein-I Chang, Senior Member, IEEE, and Su Wang,

REFERENCES
[1].Alfred O. Hero, Jose C. M. Bermudez ,Cedric Richard,
Jean-Yves Tourneret, Nicolas Dobigeon, Stephen
McLaughlin, and Nonlinear Unmixing of Hyperspectral
Images: Models and Algorithms
[2].Antonio Plaza and Chein-I Chang, An Improved N-
FINDR Algorithm inImplementation, Algorithms and
Technologies for Multispectral, Hyperspectral and
Ultraspectral Imagery XI, Proceedings of SPIE Vol. 5806.
[3].Antonio Plazaa and Javier Plazaa Parallel
Implementation of Linear and Nonlinear SpectralUnmixing
of Remotely Sensed Hyperspectral ImagesUniversity of
Extremadura, Avda de la Universidad s/n10071 C hyperspectral data, Imaging Spectrometry V, Proc. SPIE
aceres,Spain.
Student Member,IEEE, Constrained Band Selection for
Hyperspectral Imagery,IEEE Transactions on Geoscience
and Remote Sensing, Vol. 44, No. 6, June 2006.
[12]. Javier Plaza,1 Pablo Martnez, Rosa Prez, and
Antonio Plaza Nonlinear Neural Network Mixture Models
For Fractional Abundance Estimation In Aviris
Hyperspectral Images
[13]. Rob Heylen, Paul Scheunders IBBT-Visionlab,
University of Antwerm Universiteitsplein 1,Building NB-
2610 Wilrijk (Antwerp), Belgium Non-Linear Fully-
Constrained Spectral Unmixing
[14].M.E. Winter, N-FINDR: an algorithm for fast
autonomous spectral end member determination in
3753, pp. 266-277, 1999.

[4].Akira Iwasaki ,Jocelyn Chanussot, Naoto Yokoya
Generalized Bilinear Model Based Nonlinear Unmixing
Using Semi Nonnegative Matrix Factorization Department
of Aeronautics and Astronautics, The University of Tokyo.
[5].Abderrahim Halimi, Yoann Altmann, Nicolas Dobigeon
and Jean-Yvesnonlinear unmixing of hyperspectral images
using a generalized bilinearModel University of Toulouse,
IRIT/INP-ENSEEIHT, 31071 Toulousecedex 7, France.
[6].Abderrahim Halimi, Yoann Altmann Nicolas Dobigeon
and Jean Tourneret Supervised nonlinear spectral
unmixing using a post nonlinear mixing model for
hyperspectral imagery.
[15].Yoann Altmann, Student Member, IEEE, Nicolas
Dobigeon, Member, IEEE, Steve McLaughlin, Fellow,
IEEE, andJean-Yves Tourneret, Senior Member, IEEE
Nonlinear Spectral Unmixing of Hyperspectral Images
Using Gaussian Processes
[16]. Feiyun Zhu, Ying Wang, Bin Fan, Shiming Xiang,
Gaofeng Meng and Chunhong Pan, Spectral Unmixing via
Data-guided Sparsity, IEEE TRANSACTIONS ON
IMAGE PROCESSING, pp. 1-16, Nov 2014.

[7].Chein-I Chang Pixel purity index-based algorithms for

end member extraction from hyperspectral imagery
Recent Advances in HyperspectralSignal and Image
Processing, 2006: ISBN: 81-7895-218-1.

[8].Jos M. Bioucas Dias, Member, IEEE Jos M. P.

Nascimento, Student Member, IEEE, Vertex Component
Analysis: A Fast Algorithm to Unmix Hyperspectral Data .

[9].C.-I Chang and D. Heinz , "Fully constrained least

squares linear mixture analysis for material quantification
in hyperspectral imagery," IEEE Trans. on Geoscience and
Remote Sensing, vol. 39, no. 3, pp. 529-545, March 2001.

[10].Chein-I Chang, Senior Member, IEEE Nicolas

Dobigeon,Jean-Yves Tourneret, Senior Member, IEEE, and
Semi-Supervised Linear Spectral Unmixing Using a
Hierarchical Bayesian Model for Hyperspectral Imagery.

All Rights Reserved 2017 IJORAT 23