In highly mixed hyerspectral datasets, dependent component analysis (DECA) has shown its superiority over other traditional geometric based algorithms. This paper proposes a new algorithm that incorporates DECA with the infinite hidden Markov random field (iHMRF) model, which can efficiently exploit spatial dependencies between image pixels and automatically determine the number of classes. Expectation Maximization algorithm is derived to infer the model parameters, including the endmembers, the abundances, the dirichlet distribution parameters of each class and the classification map. Experimental results based on synthetic and real hyperspectral data show the effectiveness of the proposed algorithm.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.