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 条
  • [1] Hyperspectral Image Segmentation Using a New Spectral Unmixing-Based Binary Partition Tree Representation
    Veganzones, Miguel A.
    Tochon, Guillaume
    Dalla-Mura, Mauro
    Plaza, Antonio J.
    Chanussot, Jocelyn
    [J]. IEEE TRANSACTIONS ON IMAGE PROCESSING, 2014, 23 (08) : 3574 - 3589
  • [2] Face Recognition with Decision Tree-Based Local Binary Patterns
    Maturana, Daniel
    Mery, Domingo
    Soto, Alvaro
    [J]. COMPUTER VISION - ACCV 2010, PT IV, 2011, 6495 : 618 - 629
  • [3] Local spectral envelope: An approach using dyadic tree-based adaptive segmentation
    Stoffer, DS
    Ombao, HC
    Tyler, DE
    [J]. ANNALS OF THE INSTITUTE OF STATISTICAL MATHEMATICS, 2002, 54 (01) : 201 - 223
  • [4] Local Spectral Envelope: An Approach Using Dyadic Tree-Based Adaptive Segmentation
    David S. Stoffer
    Hernando C. Ombao
    David E. Tyler
    [J]. Annals of the Institute of Statistical Mathematics, 2002, 54 : 201 - 223
  • [5] A NEW APPROACH TO BINARY TREE-BASED HEURISTICS
    ZUPAN, J
    [J]. ANALYTICA CHIMICA ACTA-COMPUTER TECHNIQUES AND OPTIMIZATION, 1980, 4 (04): : 337 - 346
  • [6] Convex Optimization for Binary Tree-Based Transport Networks
    de Chou, Raoul Salle
    Srir, Mohamed Ali
    Najman, Laurent
    Passat, Nicolas
    Talbot, Hugues
    Vignon-Clementel, Irene
    [J]. DISCRETE GEOMETRY AND MATHEMATICAL MORPHOLOGY, DGMM 2024, 2024, 14605 : 217 - 228
  • [7] Non-binary universal tree-based networks
    Fischer, Mareike
    Galla, Michelle
    Wicke, Kristina
    [J]. Journal of Graph Algorithms and Applications, 2022, 26 (01) : 81 - 90
  • [8] A tree-based approach to joint spectral radius determination
    Moeller, Claudia
    Reif, Ulrich
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2014, 463 : 154 - 170
  • [9] Tree-Based Genetic Algorithm with Binary Encoding for QoS Routing
    Maniscalco, Vincenzo
    Polito, Silvana Greco
    Intagliata, Antonio
    [J]. 2013 SEVENTH INTERNATIONAL CONFERENCE ON INNOVATIVE MOBILE AND INTERNET SERVICES IN UBIQUITOUS COMPUTING (IMIS 2013), 2013, : 101 - 107
  • [10] OPTIMIZATION OF A TOPOLOGICALLY TREE-BASED LOCAL AREA NETWORK
    STIGALL, PD
    AZIMI, S
    [J]. COMPUTERS & ELECTRICAL ENGINEERING, 1988, 14 (1-2) : 1 - 9