Spectral Feature Probabilistic Coding for Hyperspectral Signatures

Spectral signature coding (SSC) is generally performed by encoding spectral values of a signature across its spectral coverage followed by the Hamming distance to measure signature similarity. The effectiveness of such an SSC largely relies on how well the Hamming distance can capture spectral varia...

Full description

Saved in:
Bibliographic Details
Published in:IEEE sensors journal 2010-03, Vol.10 (3), p.395-409
Main Authors: Chein-I Chang, Chakravarty, S., Chien-Shun Lo, Chinsu Lin
Format: Article
Language:English
Subjects:
Arithmetic coding (AC)
Binary codes
binary coding
circular SFPC (C-SFPC)
Coding
Comparative analysis
Computer science
Hamming distance
Image coding
Image processing
Performance evaluation
Probabilistic methods
Probability theory
Remote sensing
Signal processing
Signature analysis
Signatures
Similarity
Spectra
Spectral analysis
spectral analysis manager (SPAM)
spectral feature probabilistic coding (SFPC)
spectral feature-based binary coding (SFBC)
spectral signature coding (SSC)
Spectral signatures
split SFPC (S-SFPC)
Unsolicited electronic mail
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Spectral signature coding (SSC) is generally performed by encoding spectral values of a signature across its spectral coverage followed by the Hamming distance to measure signature similarity. The effectiveness of such an SSC largely relies on how well the Hamming distance can capture spectral variations that characterize a signature. Unfortunately, in most cases, this Hamming-distance-based SSC does not provide sufficient discriminatory information for signature analysis because the Hamming distance does not take into account the band-to-band variation, in which case the Hamming distance can be considered as a memoryless distance. This paper extends the Hamming-distance-based SSC to an approach, referred to as spectral feature probabilistic coding (SFPC), which introduces a new concept into SSC that uses a criterion with memory to measure spectral similarity. It implements the well-known arithmetic coding (AC) in two ways to encode a signature in a probabilistic manner, called circular SFPC and split SFPC. The values resulting from the AC is then used to measure the distance between two spectral signatures. In order to demonstrate advantages of using AC-based SSC in signature analysis, a comparative analysis is also conducted against spectral binary coding.
ISSN:1530-437X
1558-1748
DOI:10.1109/JSEN.2009.2038119