BINARY PARTITION TREE-BASED LOCAL SPECTRAL UNMIXING

被引:0
|
作者
Drumetz, L. [1 ]
Veganzones, M. A. [1 ]
Marrero, R. [2 ]
Tochon, G. [1 ]
Dalla Mura, M. [1 ]
Plaza, A. [3 ]
Chanussot, J. [1 ,4 ]
机构
[1] Grenoble INP, GIPSA Lab, St Martin Dheres, France
[2] IPAG, Grenoble, France
[3] Univ Extremadura UEX, Hyperspectral Comp Lab, Caceres, Spain
[4] Univ Iceland, Fac Elect & Comp Engn, Reykjavik, Iceland
关键词
Hypespectral imaging; local spectral unmixing; spectral bundles; binary partition trees; REPRESENTATION; EXTRACTION;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The linear mixing model (LMM) is a widely used methodology for the spectral unmixing (SU) of hyperspectral data. In this model, hyperspectral data is formed as a linear combination of spectral signatures corresponding to macroscopically pure materials (endmembers), weighted by their fractional abundances. Some of the drawbacks of the LMM are the presence of multiple mixtures and the spectral variability of the endmembers due to illumination and atmospheric effects. These issues appear as variations of the spectral conditions of the image along its spatial domain. However, these effects are not so severe locally and could be at least mitigated by working in smaller regions of the image. The proposed local SU works over a partition of the image, performing the spectral unmixing locally in each region of the partition. In this work, we first introduce the general local SU methodology, then we propose an implementation of the local SU based on a binary partition tree representation of the hyperspectral image and finally we give an experimental validation of the approach using real data.
引用
收藏
页数:4
相关论文
共 50 条
  • [21] Tree-based partition querying: a methodology for computing medoids in large spatial datasets
    Kyriakos Mouratidis
    Dimitris Papadias
    Spiros Papadimitriou
    The VLDB Journal, 2008, 17 : 923 - 945
  • [22] Tree-based partition querying: a methodology for computing medoids in large spatial datasets
    Mouratidis, Kyriakos
    Papadias, Dimitris
    Papadimitriou, Spiros
    VLDB JOURNAL, 2008, 17 (04): : 923 - 945
  • [23] An efficient face segmentation algorithm based on binary partition tree
    Liu, Z
    Yang, H
    Peng, NS
    SIGNAL PROCESSING-IMAGE COMMUNICATION, 2005, 20 (04) : 295 - 314
  • [24] A multiscale image segmentation algorithm based on binary partition tree
    Liu, Zhi
    Shen, Liquan
    Zhang, Zhaoyang
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2009, 21 (09): : 1321 - 1327
  • [25] QUEUING ANALYSES OF A TOPOLOGICALLY TREE-BASED LOCAL AREA NETWORK
    STIGALL, PD
    AZIMI, S
    COMPUTERS & ELECTRICAL ENGINEERING, 1988, 14 (1-2) : 11 - 27
  • [26] Binary tree-based generic demosaicking algorithm for multispectral filter arrays
    Miao, Lidan
    Qi, Hairong
    Ramanath, Rajeev
    Snyder, Wesley E.
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2006, 15 (11) : 3550 - 3558
  • [27] Binary tree-based clustering algorithm and used in color image segmentation
    Shi, Yuexiang
    Liu, Yingying
    FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 2, PROCEEDINGS, 2007, : 219 - 223
  • [28] Queuing analyses of a topologically tree-based local area network
    Stigall, P.D.
    Azimi, Saeed
    1600, (14): : 1 - 2
  • [29] Tree-based classification and regression Part 3: Tree-based procedures
    Gunter, B
    QUALITY PROGRESS, 1998, 31 (02) : 121 - 123
  • [30] SPECTRAL UNMIXING BASED ON NONNEGATIVE MATRIX FACTORIZATION WITH LOCAL SMOOTHNESS CONSTRAINT
    Yang, Zuyuan
    Yang, Liu
    Cai, Zhaoquan
    Xiang, Yong
    2015 IEEE CHINA SUMMIT & INTERNATIONAL CONFERENCE ON SIGNAL AND INFORMATION PROCESSING, 2015, : 635 - 638