• 沒有找到結果。

Lossless compression of hyperspectral images using spectral and spatial relations 倪銘鴻、張世旭

N/A
N/A
Protected

Academic year: 2022

Share "Lossless compression of hyperspectral images using spectral and spatial relations 倪銘鴻、張世旭"

Copied!
2
0
0

加載中.... (立即查看全文)

全文

(1)

Lossless compression of hyperspectral images using spectral and spatial relations 倪銘鴻、張世旭

E-mail: [email protected]

ABSTRACT

Because of the hyperspectral imaging of lossless compression of compression ratio still has room for improvement, so this paper give high compression ratio of lossless compression algorithm.In the literature use of the LUT forecast pixel values of the current bandalgorithm has the advantage of a simple and fast, but due to the hyperspectral image pixel value range is very broad,for example , on the need to carry large amounts of memory. In the LAIS-QLUT algorithm it will look up the desired index value to quantify that can effectively reduce the memory required for checking, and improved compression effect. The hyperspectral imaging with high correlation between the spectrum, in the same band under adjacent pixels also has a high degree of relevance, therefore this Paper using least squares methods and multiband quantization look-up, reduce hyperspectral image superfluous information in spatial and spectral, increase accuracy of pixel the predicted value, and use to predict value selection probability model, Finally use the arithmetic coding and Golomb-rice encoding encodes of the prediction difference. When the Cuprite, Jasper Ridge, Lumar Lake, Moffett Field and Low Altitude after compression tests, Get an the average compression ratio of 3.87. The experimental results prove that this thesis can be effective on hyperspectral image compression.

Keywords : Hyperspectral image、LUT、Least suae、Arithmetic coding、Golomb-rice、AVIRIS Table of Contents

封面內頁 簽名頁 授權書iii 中文摘要iv ABSTRACTv 誌謝vi 目錄vii 圖目錄ix 第一章 緒論1 1.1 前言1 1.2 相關研究2 1.3 論文 架構4 第二章 相關技術探討5 2.1 JPEG-LS5 2.2 查表法6 2.3 LAIS-LUT8 2.4 LAIS-QLUT9 2.5 Golomb rice11 2.6 算術編碼12 2.7 高光譜影像介紹14 第三章 所提出之無失真壓縮編碼17 3.1 系統架構17 3.2 表格初始化19 3.3 預測方法23 3.4 編碼29 3.5 解碼32 第四章 實驗結果34 第五章 結論與未來展望42 5.1 結論42 5.2 未來展望42

REFERENCES

[1]S.-E. Qian, A. B. Hollinger, D. Williams et al., “Vector quantization using spectral index-based multiple subcodebooks for hyperspectral data compression,” IEEE Transactions on Geoscience and Remote Sensing Letters, vol. 38, no. 3, pp. 1183-1190, 2000.

[2]S.-E. Qian, “Hyperspectral data compression using a fast vector quantization algorithm,” IEEE Transactions on Geoscience and Remote Sensing, vol. 42, no. 8, pp. 1791-1798, 2004.

[3]G. Motta, F. Rizzo, and J. Storer, “Locally Optimal Partitioned Vector Quantization of Hyperspectral Data,” Hyperspectral Data Compression, pp. 107-146, 2006.

[4]J. Zhang, and G. Liu, “A novel lossless compression for hyperspectral images by context-based adaptive classified arithmetic coding in wavelet domain,” IEEE Geoscience and Remote Sensing Letters, vol. 4, no. 3, pp. 461-465, 2007.

[5]C. Emmanuel, M. Corinne, and D. Pierre, “Hyperspectral image compression: adapting SPIHT and EZW to anisotropic 3-D wavelet coding,

” IEEE Transactions on Image Processing, vol. 17, no. 12, pp. 2334-2346, 2008.

[6]J. Zhang, J. E. Fowler, and G. Liu, “Lossy-to-lossless compression of hyperspectral imagery using three-dimensional TCE and an integer KLT,

” IEEE Geoscience and Remote Sensing Letters, vol. 5, no. 4, pp. 814-818, 2008.

[7]X. Wu, and N. Memon, “Context-based lossless interband compression-extending CALIC,” IEEE Transactions on Image Processing, vol. 9, no. 6, pp. 994-1001, 2000.

[8]F. Rizzo, B. Carpentieri, G. Motta et al., “Low-complexity lossless compression of hyperspectral imagery via linear prediction,” IEEE Signal Processing Letters, vol. 12, no. 2, pp. 138-141, 2005.

[9]S. K. Jain, and D. A. Adjeroh, "Edge-Based Prediction for Lossless Compression of Hyperspectral Images." pp. 153-162.

[10]H. Wang, B. S. Derin, and S. Khalid, “Lossless hyperspectral-image compression using context-based conditional average,” IEEE Transactions Geoscience and Remote Sensing Letters, vol. 45, no. 12, pp. 4187-4193, 2007.

[11]L. Bai, M. He, and Y. Dai, “Lossless compression of hyperspectral images based on 3D context prediction,” in 2008. ICIEA 2008. 3rd IEEE Conference on Industrial Electronics and Applications, 2008, pp. 1845-1848.

[12]E. Magli, “Multiband lossless compression of hyperspectral images,” IEEE Transactions on Geoscience and Remote Sensing, vol. 47, no. 4,

(2)

pp. 1168-1178, 2009.

[13]K. Aaron B, and K. Matthew A, “Exploiting calibration-induced artifacts in lossless compression of hyperspectral Imagery,” IEEE Transactions on Geoscience and Remote Sensing, vol. 47, no. 8, pp. 2672-2678, 2009.

[14]J. Mielikainen, “Lossless compression of hyperspectral images using lookup tables,” IEEE Signal Processing Letters, vol. 13, no. 3, pp.

157-160, 2006.

[15]J. Mielikainen, and P. Toivanen, “Lossless compression of hyperspectral images using a quantized index to lookup tables,” IEEE Geoscience and Remote Sensing Letters, vol. 5, no. 3, pp. 474-478, 2008.

[16]B. Aiazzi, S. Baronti, and L. Alparone, “Lossless compression of hyperspectral images using multiband lookup tables,” IEEE Signal Processing Letters, vol. 16, no. 6, pp. 481-484, 2009.

[17]B. Huang, and Y. Sriraja, “Lossless compression of hyperspectral imagery via lookup tables with predictor selection,” Image and Signal Processing for Remote Sensing XII, L. Bruzzone, Ed.,, vol. 6365, pp. 63651-1, 2006.

[18]P. Toivanen, O. Kubasova, and J. Mielikainen, “Correlation-based band-ordering heuristic for lossless compression of hyperspectral sounder data,” IEEE Geoscience and Remote Sensing Letters, vol. 2, no. 1, pp. 50-54, 2005.

[19]J. Zhang, and G. Liu, “An efficient reordering prediction-based lossless compression algorithm for hyperspectral images,” IEEE Geoscience and Remote Sensing Letters, vol. 4, no. 2, pp. 283-287, 2007.

[20]C. Huo, R. Zhang, and T. Peng, “Lossless compression of hyperspectral images based on searching optimal multibands for prediction,”

IEEE Geoscience and Remote Sensing Letters, vol. 6, no. 2, pp. 339-343, 2009.

[21]X. Wu, and N. Memon, “Context-based, adaptive, lossless image coding,” IEEE Transactions on Communications, vol. 45, no. 4, pp.

437-444, 1997.

[22]B. Aiazzi, L. Alparone, S. Baronti et al., “Crisp and Fuzzy Adaptive Spectral Predictions for Lossless and Near-Lossless Compression of Hyperspectral Imagery,” Geoscience and Remote Sensing Letters, IEEE, vol. 4, no. 4, pp. 532-536, 2007.

[23]"AVIRIS Home Page," http://aviris.jpl.nasa.gov/.

參考文獻

相關文件

We will give a quasi-spectral characterization of a connected bipartite weighted 2-punctually distance-regular graph whose halved graphs are distance-regular.. In the case the

In the work of Qian and Sejnowski a window of 13 secondary structure predictions is used as input to a fully connected structure-structure network with 40 hidden units.. Thus,

Tekalp, “Frontal-View Face Detection and Facial Feature Extraction Using Color, Shape and Symmetry Based Cost Functions,” Pattern Recognition Letters, vol.. Fujibayashi,

• Learn the mapping between input data and the corresponding points the low dimensional manifold using mixture of factor analyzers. • Learn a dynamical model based on the points on

Pantic, “Facial action unit detection using probabilistic actively learned support vector machines on tracked facial point data,” IEEE Conference on Computer

(2000) “Effects of lime addition sewage sludge composting process.” Water

Li, “Concurrent engineering: a strategy for procuring construction projects,” International Journal of Project Management, Vol. Towill and D.R., “Time compression and supply chain

Soille, “Watershed in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations,” IEEE Transactions on Pattern Analysis and Machine Intelligence,