Please submit manuscripts in either of the following two submission systems

    ScholarOne Manuscripts

  • ScholarOne
  • 勤云稿件系统

  • 登录

Search by Issue

  • 2024 Vol.31
  • 2023 Vol.30
  • 2022 Vol.29
  • 2021 Vol.28
  • 2020 Vol.27
  • 2019 Vol.26
  • 2018 Vol.25
  • 2017 Vol.24
  • 2016 vol.23
  • 2015 vol.22
  • 2014 vol.21
  • 2013 vol.20
  • 2012 vol.19
  • 2011 vol.18
  • 2010 vol.17
  • 2009 vol.16
  • No.1
  • No.2

Supervised by Ministry of Industry and Information Technology of The People's Republic of China Sponsored by Harbin Institute of Technology Editor-in-chief Yu Zhou ISSNISSN 1005-9113 CNCN 23-1378/T

期刊网站二维码
微信公众号二维码
Related citation:Chunhui Zhao,Haifeng Zhu,Shiling Cui,Bin Qi.Multiple Endmember Hyperspectral Sparse Unmixing Based on Improved OMP Algorithm[J].Journal of Harbin Institute Of Technology(New Series),2015,22(5):97-104.DOI:10.11916/j.issn.1005-9113.2015.05.015.
【Print】   【HTML】   【PDF download】   View/Add Comment  Download reader   Close
←Previous|Next→ Back Issue    Advanced Search
This paper has been: browsed 2124times   downloaded 921times 本文二维码信息
码上扫一扫!
Shared by: Wechat More
Multiple Endmember Hyperspectral Sparse Unmixing Based on Improved OMP Algorithm
Author NameAffiliation
Chunhui Zhao College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China 
Haifeng Zhu College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China 
Shiling Cui College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China 
Bin Qi College of Information and Communication Engineering, Harbin Engineering University, Harbin 150001, China 
Abstract:
In conventional linear spectral mixture analysis model, a class is represented by a single endmember. However, the intra-class spectral variability is usually very large, which makes it difficult to represent a class, and in this case, it leads to incorrect unmixing results. Some proposed algorithms play a positive role in overcoming the endmember variability, but there are shortcomings on computation intensive, unsatisfactory unmixing results and so on. Recently, sparse regression has been applied to unmixing, assuming each mixed pixel can be expressed as a linear combination of only a few spectra in a spectral library. It is essentially the same as multiple endmember spectral unmixing. OMP (orthogonal matching pursuit), a sparse reconstruction algorithm, has advantages of simple structure and high efficiency. However, it does not take into account the constraints of abundance non-negativity and abundance sum-to-one (ANC and ASC), leading to undesirable unmixing results. In order to solve these issues, this paper presents an improved OMP algorithm (fully constraint OMP, FOMP) for multiple endmember hyperspectral sparse unmixing. The proposed algorithm overcomes the shortcomings of OMP, and on the other hand, it solves the problem of endmember variability. The ANC and ASC constraints are firstly added into the OMP algorithm, and then the endmember set is refined by the relative increase in root-mean-square-error (RMSE) to avoid over-fitting, finally pixels are unmixed by their optimal endmember set. The simulated and real hyperspectral data experiments show that FOPM unmixing results are ideally comparable and abundance RMSE reduces much lower than OMP and simple spectral mixture analysis (sSMA), and has a strong anti-noise performance. It proves that multiple endmember spectral mixture analysis is more reasonable.
Key words:  hyperspectral image  sparse representation  multiple endmember spectral unmixing  OMP  ANC and ASC
DOI:10.11916/j.issn.1005-9113.2015.05.015
Clc Number:TN911.73
Fund:

LINKS