Volume 36 Issue 6
Jun.  2011
Turn off MathJax
Article Contents
ZHOU Yuan, FANG Shenghui, LI Deren. A Fast Spectral Matching Algorithm for Larger-Scale Hyperspectral Data:Spectral Angle Sensitive Forest[J]. Geomatics and Information Science of Wuhan University, 2011, 36(6): 687-690.
Citation: ZHOU Yuan, FANG Shenghui, LI Deren. A Fast Spectral Matching Algorithm for Larger-Scale Hyperspectral Data:Spectral Angle Sensitive Forest[J]. Geomatics and Information Science of Wuhan University, 2011, 36(6): 687-690.

A Fast Spectral Matching Algorithm for Larger-Scale Hyperspectral Data:Spectral Angle Sensitive Forest

More Information
  • Received Date: March 31, 2011
  • Published Date: June 04, 2011
  • We propose a spectral matching algorithm,spectral angle sensitive forest(SASF),which improves the spectral matching efficiency in high dimensional large-scale hyperspectral dataset.The locality sensitive hashing(LSH) is expanded to the metric space of spectral angle.Moreover,we introduce a new scheme to index the data bucket,which remove the flaw of the original LSH method that a part of the query points won't get any neighbors.We provide systematical analysis of the parameters,and theoretical and experimental evaluation of the algorithm.The computational efficiency of SASF is proved outperforming the former algorithms.And SASF also provides a tradeoff between efficiency and precision of spectral matching by which make the user has more choices in the applications.

Catalog

    Article views (1002) PDF downloads (377) Cited by()
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return