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 条
  • [31] Image segmentation by binary partition tree
    Lu, H.
    Woods, J. C.
    Ghanbari, M.
    ELECTRONICS LETTERS, 2006, 42 (17) : 966 - 967
  • [32] BC tree-based spectral sampling for big complex network visualization
    Hu, Jingming
    Chu, Tuan Tran
    Hong, Seok-Hee
    Chen, Jialu
    Meidiana, Amyra
    Torkel, Marnijati
    Eades, Peter
    Ma, Kwan-Liu
    APPLIED NETWORK SCIENCE, 2021, 6 (01)
  • [33] A tree-based Mergesort
    Moffat, A
    Petersson, O
    Wormald, NC
    ACTA INFORMATICA, 1998, 35 (09) : 775 - 793
  • [34] BC tree-based spectral sampling for big complex network visualization
    Jingming Hu
    Tuan Tran Chu
    Seok-Hee Hong
    Jialu Chen
    Amyra Meidiana
    Marnijati Torkel
    Peter Eades
    Kwan-Liu Ma
    Applied Network Science, 6
  • [35] Binary partition tree analysis based on region evolution and its application to tree simplification
    Lu, Huihai
    Woods, John C.
    Ghanbari, Mohammed
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2007, 16 (04) : 1131 - 1138
  • [36] A Tree-based Mergesort
    Alistair Moffat
    Ola Petersson
    Nicholas C. Wormald
    Acta Informatica, 1998, 35 : 775 - 793
  • [37] Comparing performance of non–tree-based and tree-based association mapping methods
    Katherine L. Thompson
    David W. Fardo
    BMC Proceedings, 10 (Suppl 7)
  • [38] Enhancing Spectral Unmixing by Local Neighborhood Weights
    Liu, Junmin
    Zhang, Jiangshe
    Gao, Yuelin
    Zhang, Chunxia
    Li, Zhihua
    IEEE JOURNAL OF SELECTED TOPICS IN APPLIED EARTH OBSERVATIONS AND REMOTE SENSING, 2012, 5 (05) : 1545 - 1552
  • [39] Binary tree-based fault location algorithm for optical burst switching network
    Wang R.-Y.
    Liu D.
    Peng H.-J.
    Lv K.-W.
    Optoelectronics Letters, 2009, 5 (4) : 284 - 288
  • [40] CONTEXT-ADAPTIVE PANSHARPENING BASED ON BINARY PARTITION TREE SEGMENTATION
    Dalla Mura, Mauro
    Vivone, Gemine
    Restaino, Rocco
    Chanussot, Jocelyn
    2014 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 2014, : 3924 - 3928