By Topic

Combining Hyperspectral Data Processing Chains for Robust Mapping Using Hierarchical Trees and Class Memberships

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Karoly Livius Bakos ; Dipartimento di Elettronica, Università di Pavia, Pavia, Italy ; Paolo Gamba

In this letter, we introduce a methodology to combine decisions of multiple hyperspectral data processing chains using an already tested preselection step and a novel algorithm for the data labeling procedure. More specifically, we exploit a hierarchical binary decision tree (HBDT) optimization algorithm to select the most suitable processing chains for a given mapping problem. Then, a new methodology for decision fusion is introduced, based on weighting the class probability membership values. Experimental results in two test areas show great potentials for the novel procedure, identified as particularly useful for generic mapping of complex environments due to its flexibility and robustness. Moreover, accuracy values are improved with respect to those obtained by HBDT alone.

Published in:

IEEE Geoscience and Remote Sensing Letters  (Volume:8 ,  Issue: 5 )