Analysis on Hyperspectral Signature Coding
ProQuest, 2008 - 124 pages
This dissertation addresses issues of hyperspectral signature coding, where three coding techniques from various applications, Arithmetic Coding (AC) in source coding, Texture Feature Coding Method (TFCM) in texture analysis and Block Truncation Coding (BTC) in image coding are investigated and further explored for hyperspectral signature characterization. Current coding-based approaches to spectral signature characterization include SPectral Analysis Manager (SPAM) developed by Mazer et al. and its extension Spectral Feature-based Binary Coding (SFBC) by Qian et al. where spectral signatures are encoded as code words and the spectral analysis is conducted by using Hamming distance as a spectral similarity measure. Unfortunately, due to the fact that the Hamming distance is a bit-wise (referred to as memoryless) measure, its performance is completely determined by spectral variation with individual bits without taking into account adjacent bits within a code word. Accordingly, one way to improve the performance of such bit memoryless spectral coding is to introduce bit-memory into its used distance measure. In order to address this issue two new coding techniques are developed, called Spectral Feature Probabilistic Coding (SFPC) which is based on the AC and Spectral Derivative Feature Coding (SDFC) which is based on TFCM. These two techniques extend memoryless signature coding to memory-signature coding and have shown to yield better performance than the current memoryless coding methods. Another alternative way to improve the performance of current memoryless coding schemes is called Block Truncation Signature Coding (BTSC) which is based on BTC and can process the signatures adaptively. This dissertation then culminates in a new approach, called Orthogonal Subspace Projection-based Band Signature for Signature Coding (OSP-BSSC) that can be used to perform signature dimensionality reduction for signature coding. It introduces a new concept, called Joint Dimensionality (JD) of a signature pair for discrimination and then further develops criteria and techniques to find a image of the JD for a signature to retain sufficient information for its discrimination from other signatures. Finally, extensive experiments are conducted to substantiate the techniques proposed in this dissertation for performance evaluation and analysis.
What people are saying - Write a review
We haven't found any reviews in the usual places.
A REVIEW OF MEMORYLESS SPECTRAL BINARY CODING
ADAPTIVE MEMORYLESS SIGNATURE CODING
MEMORY BASED SIGNATURE CODING
APPLICATION OF SIGNATURE CODING FOR SIGNATURE
2-bit SPAM 3-bit C-SFPC 3-bit SFBC algorithm Arithmetic Coding AVD SPAM SFBC AVG(JD AVIRIS Band Selection binary codeword binary coding Blackbrush block size block sizes BTSC C-AC S-AC SPAM C-SFPC and 3-bit code word coding methods coding techniques comparative graphical plots Comparative plots corresponding plots data set denoted encode Feature Probabilistic Coding five signatures GBTSC GBTSC_b64 Hamming distance HD AVD SPAM HD-SDFC and AVD-SDFC hyperspectral signature interest s1 Lab data MBTSC MBTSC_b4 MBTSC_b32 memoryless number of bands OSP-BSSC results panel data performance pixel plots of RSDPW plots of spectral produced by SFBC produced by SPAM reference signature RSDPW values s1 and s2 sagebrush SDFC_b SDFC_b SFBC C-AC S-AC SFBC/SPAM signature block signature block section signature coding signature component signature of interest signature pair signatures s1 similarity values produced SPAM and SFBC spectral bands Spectral Derivative Feature Spectral Feature Probabilistic spectral signature spectral similarity values spectral variation