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 条
  • [41] A Novel Reduction Circuit Based on Binary Tree Path Partition on FPGAs
    Tang, Linhuai
    Huang, Zhihong
    Cai, Gang
    Zheng, Yong
    Chen, Jiamin
    ALGORITHMS, 2021, 14 (02)
  • [42] Binary tree-based fault location algorithm for optical burst switching network
    王汝言
    刘丹
    彭焕嘉
    吕科苇
    OptoelectronicsLetters, 2009, 5 (04) : 284 - 288
  • [43] Full Binary Tree-Based Fixed Degree Graph Design and Parallel Algorithm
    Seong, Bo Ok
    Jang, Jin-Hyeok
    Lee, Hyeong Ok
    IEEE ACCESS, 2023, 11 : 120816 - 120826
  • [44] Tree-based binary image dissimilarity measure with meta-heuristic optimization
    Zielinski, Bartlomiej
    Iwanowski, Marcin
    PATTERN ANALYSIS AND APPLICATIONS, 2016, 19 (01) : 1 - 10
  • [45] Tree-Based Morse Regions: A Topological Approach to Local Feature Detection
    Xu, Yongchao
    Monasse, Pascal
    Geraud, Thierry
    Najman, Laurent
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2014, 23 (12) : 5612 - 5625
  • [46] A generic binary tree-based progressive demosaicking method for multispectral filter array
    Miao, Lidan
    Qi, Hairong
    Ramanath, Rajeev
    2006 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, ICIP 2006, PROCEEDINGS, 2006, : 3221 - +
  • [47] Development Research on the Expert System for the Binary Tree-Based Apple Disease Diagnosis
    Qiu, Yun
    Fan, Jingchao
    Zhou, Guomin
    INFORMATION TECHNOLOGY APPLICATIONS IN INDUSTRY II, PTS 1-4, 2013, 411-414 : 2051 - 2055
  • [48] Tree-based QTL mapping with expected local genetic relatedness matrices
    Link, Vivian
    Schraiber, Joshua G.
    Fan, Caoqi
    Dinh, Bryan
    Mancuso, Nicholas
    Chiang, Charleston W. K.
    Edge, Michael D.
    AMERICAN JOURNAL OF HUMAN GENETICS, 2023, 110 (12) : 2077 - 2091
  • [49] Tree-based binary image dissimilarity measure with meta-heuristic optimization
    Bartłomiej Zieliński
    Marcin Iwanowski
    Pattern Analysis and Applications, 2016, 19 : 1 - 10
  • [50] Ethernet Ultra Fast Switching: A Tree-based Local Recovery Scheme
    Su, Li
    Chen, Wentao
    Su, Haibo
    Xiao, Zhenyu
    Jin, Depeng
    Zeng, Lieguang
    2008 11TH IEEE SINGAPORE INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS (ICCS), VOLS 1-3, 2008, : 314 - 318