Spectral Feature Probabilistic Coding for Hyperspectral Signatures

Spectral signature coding has been used to characterize spectral features where a binary code book is designed to encode an individual spectral signature and the Hamming distance is then used to perform signature discrimination. The effectiveness of such a binary signature coding largely relies on how well the Hamming distance can capture spectral variations that characterize a signature. Unfortunately, in most cases, such coding does not provide sufficient information for signature analysis, thus it has received little interest in the past. This paper reinvents the wheel by introducing a new concept, referred to as spectral feature probabilistic coding (SFPC) into signature coding. Since the Hamming distance does not take into account the band-to-band variation, it can be considered as a memoryless distance. Therefore, one approach is to extend the Hamming distance to a distance with memory. One such coding technique is the well-known arithmetic coding (AC) which encodes a signature in a probabilistic manner. The values resulting from the AC is then used to measure the distance between two signatures. This paper investigates AC-based signature coding for signature analysis and conducts a comparative analysis with spectral binary coding.

[1]  Ian H. Witten,et al.  Arithmetic coding for data compression , 1987, CACM.

[2]  Allen Gersho,et al.  Vector quantization and signal compression , 1991, The Kluwer international series in engineering and computer science.

[3]  Shen-En Qian,et al.  Fast three‐dimensional data compression of hyperspectral imagery using vector quantization with spectral‐feature‐based binary coding , 1996 .

[4]  A. Mazer,et al.  Image processing software for imaging spectrometry data analysis , 1988 .

[5]  S. P. Lloyd,et al.  Least squares quantization in PCM , 1982, IEEE Trans. Inf. Theory.

[6]  Jorma Rissanen,et al.  Compression of Black-White Images with Arithmetic Coding , 1981, IEEE Trans. Commun..

[7]  Chein-I Chang,et al.  Hyperspectral image classification and dimensionality reduction: an orthogonal subspace projection approach , 1994, IEEE Trans. Geosci. Remote. Sens..

[8]  Chein-I. Chang Hyperspectral Imaging: Techniques for Spectral Detection and Classification , 2003 .

[9]  Joel Max,et al.  Quantizing for minimum distortion , 1960, IRE Trans. Inf. Theory.

[10]  Jorma Rissanen,et al.  Generalized Kraft Inequality and Arithmetic Coding , 1976, IBM J. Res. Dev..

[11]  Jing Wang,et al.  A novel approach for spectral unmixing, classification, and concentration estimation of chemical and biological agents , 2006, IEEE Transactions on Geoscience and Remote Sensing.

[12]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[13]  Terry A. Welch,et al.  A Technique for High-Performance Data Compression , 1984, Computer.