<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">vestifm</journal-id><journal-title-group><journal-title xml:lang="ru">Известия Национальной академии наук Беларуси. Серия физико-математических наук</journal-title><trans-title-group xml:lang="en"><trans-title>Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1561-2430</issn><issn pub-type="epub">2524-2415</issn><publisher><publisher-name>The Republican Unitary Enterprise Publishing House "Belaruskaya Navuka"</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">vestifm-238</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ИНФОРМАТИКА</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>INFORMATICS</subject></subj-group></article-categories><title-group><article-title>АЛГОРИТМ СЖАТИЯ ГИПЕРСПЕКТРАЛЬНЫХ ДАННЫХ ДИСТАНЦИОННОГО ЗОНДИРОВАНИЯ ЗЕМЛИ</article-title><trans-title-group xml:lang="en"><trans-title>COMPRESSION ALGORITHM OF THE HYPERSPECTRAL DATA OF EARTH REMOTE SENSING</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Дудкин</surname><given-names>А. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Doudkin</surname><given-names>A. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>доктор технических наук, заведующий лабораторией</p></bio><bio xml:lang="en"><p>D. Sc. (Engineering), Head of the Laboratory</p></bio><email xlink:type="simple">doudkin@newman.bas-net.by</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Перцев</surname><given-names>Д. Ю.</given-names></name><name name-style="western" xml:lang="en"><surname>Pertsau</surname><given-names>D. Yu.</given-names></name></name-alternatives><bio xml:lang="ru"><p>младший научный сотрудник</p></bio><bio xml:lang="en"><p>Junior Researcher</p></bio><email xlink:type="simple">DmitryPertsev@gmail.com</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Объединенный институт проблем информатики Национальной академии наук Беларуси, Минск</institution></aff><aff xml:lang="en"><institution>United Institute of Informatics Problems of the National Academy of Sciences of Belarus, Minsk</institution></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Белорусский государственный университет информатики и радиоэлектроники, Минск</institution></aff><aff xml:lang="en"><institution>Belarusian State University of Informatics and Radioelectronics, Minsk</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2017</year></pub-date><pub-date pub-type="epub"><day>30</day><month>04</month><year>2017</year></pub-date><volume>0</volume><issue>1</issue><fpage>120</fpage><lpage>126</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Дудкин А.А., Перцев Д.Ю., 2017</copyright-statement><copyright-year>2017</copyright-year><copyright-holder xml:lang="ru">Дудкин А.А., Перцев Д.Ю.</copyright-holder><copyright-holder xml:lang="en">Doudkin A.A., Pertsau D.Y.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://vestifm.belnauka.by/jour/article/view/238">https://vestifm.belnauka.by/jour/article/view/238</self-uri><abstract><p>Представлены результаты оценки корреляции гиперспектральных данных в пространственной и спектральной областях на примере гиперкуба AVIRIS Moffett Field. На их основе сформулированы ключевые особенности гиперспектральных данных. Приведены основные подходы к сжатию без потерь, выделены алгоритмы, относящиеся к тому или иному классу и применяемые в области дистанционного зондирования, показаны достоинства и недостатки конкретных реализаций на основе предсказания (linear prediction, fast lossless, spectral oriented least squares, correlation-based сonditional аverage рrediction, M-CALIC), поиска по таблице (lookup table, locally averaged interband scaling lookup tables) и вей- влет-преобразования (3D-SPECK). С учетом выявленных недостатков разработан алгоритм сжатия гиперспектральных данных, включающий следующие этапы обработки: предобработка (для каждого спектрального канала выполняется независимо), понижение степени корреляции в спектральной области и энтропийный кодер. Приведены результаты тестирования предложенного алгоритма в сравнении с альтернативными кодеками. В качестве тестовых данных использовались гиперкубы, входящие в тестовый набор AVIRIS (Cuprite, Jasper Ridge, Low Altitude, Moffet Field), который является общепризнанным стандартом при исследовании гиперспектральных данных. Полученные результаты свидетельствуют о соответствии разработанного алгоритма альтернативным подходам к сжатию без потерь, применяемым в дистанционном зондировании Земли. Достоинствами указанного алгоритма являются обеспечение параллельной обработки, вычислительная простота (отсутствие операций с высокой латентностью, например, умножения и деления), минимальные требования к объему оперативной памяти (память используется только для хранения гиперкуба и соответствует его объему). С учетом всего вышесказанного допускается схемотехническая реализация алгоритма на борту летательного аппарата.</p><p> </p></abstract><trans-abstract xml:lang="en"><p>The evaluation results of hyperspectral data correlation in spatial and spectral domains are presented by the example of the hypercube AVIRIS Moffett Field, and the key features of hyperspectral data are formulated. The basic approaches to lossless compression and the algorithms, which can be applied in Earth remote sensing, are considerеd. They are the prediction (linear prediction, fast lossless, spectral oriented least squares, correlation-based conditional average prediction, M-CALIC), the lookup tables (lookup table, locally averaged interband scaling lookup tables), the 3D wavelets (3D-SPECK). A compression algorithm of hyperspectral data is proposed with regard to the advantages and disadvantages of specific implementations of the analyzed algorithms in remote sensing. The main algorithm stages are the preprocessing (for each spectral channel, it is executed independently), the reduction of a correlation level in the spectral area and the entropy coder. The test results of the developed algorithm are given in comparison to the alternative codecs on the AVIRIS test set (Cuprite, Jasper Ridge, Low Altitude, Moffet Field) that prove the efficiency of the proposed algorithm: parallel processing, low computing cost (low latency instructions are used, no division and multiplication), small random access memory requirements (the memory is used only for storage of the hypercube). In the context of the above advantages, the hardware implementation of the algorithm is allowed for on board the aircraft.</p><p> </p></trans-abstract><kwd-group xml:lang="ru"><kwd>гиперспектральные данные</kwd><kwd>AVIRIS</kwd><kwd>сжатие без потерь</kwd><kwd>спектральная корреляция</kwd><kwd>пространственная корреляция</kwd></kwd-group><kwd-group xml:lang="en"><kwd>hyperspectral compression</kwd><kwd>AVIRIS</kwd><kwd>spectral correlation</kwd><kwd>spatial correlation</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">AVIRIS Hyperspectral Images [Electronic resource] / Jet Propulsion Laboratory. – Mode of access: http://aviris.jpl. nasa.gov/data/free_data.html. – Date of access: 10.09.2016.</mixed-citation><mixed-citation xml:lang="en">AVIRIS Hyperspectral Images. Available at: http://aviris.jpl.nasa.gov/data/free_data.html (accessed 10 September 2016).</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Low-complexity lossless compression of hyperspectral imagery via linear prediction / F. Rizzo [et all.] // Signal Proc. Letters, IEEE. – 2005. –Vol. 12, iss. 2. – P. 138–141.</mixed-citation><mixed-citation xml:lang="en">Rizzo F., Carpentieri B., Motta G., Storer J.A. Low-complexity lossless compression of hyperspectral imagery via linear prediction. IEEE Signal Processing Letters, 2005, vol. 12, no. 2, pp. 138–141. Doi: 10.1109/LSP.2004.840907</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Klimesh, M. Low-complexity lossless compression of hyperspectral imagery via adaptive filtering: Technical Report 42-163 / Jet Propulsion Laboratory California Institute of Technology. – California Institute of Technology, 2005.</mixed-citation><mixed-citation xml:lang="en">Klimesh M. Low-complexity lossless compression of hyperspectral imagery via adaptive filtering. Technical Report 42-163. California Institute of Technology, 2005.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Pizzolante, R. Lossless compression of hyperspectral imagery / R. Pizzolante // Proc. of the First Int. Conf. on Data Compression, Communications and Processing (CCP’11). – 2011. – P. 157–162.</mixed-citation><mixed-citation xml:lang="en">Pizzolante R. Lossless compression of hyperspectral imagery. Proceedings of the First International Conference on Data Compression, Communications and Processing. CCP’11, 2011, pp. 157–162. Doi: 10.1109/CCP.2011.31</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Wang, H. Lossless hyperspectral-image compression using context-based conditional average / H. Wang, S. D. Babacan, K. Sayood // Geoscience and Remote Sensing, IEEE Transactions on. – 2007. – Vol. 45, iss. 12. – P. 4187–4193.</mixed-citation><mixed-citation xml:lang="en">Wang H. Babacan S.D., Sayood K. Lossless hyperspectral-image compression using context-based conditional average. IEEE Transactions on Geoscience and Remote Sensing, 2007, vol. 45, no. 12, pp. 4187–4193. Doi: 10.1109/TGRS.2007.906085</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Magli, E. Optimized onboard lossless and near-lossless compression of hyperspectral data using CALIC / Magli, E., Olmo, G., Quacchio, E. // Geoscience and Remote Sensing Letters, IEEE. – 2004. – Vol. 1, iss. 1. – P. 21–25.</mixed-citation><mixed-citation xml:lang="en">Magli E., Olmo G., Quacchio E. Optimized onboard lossless and near-lossless compression of hyperspectral data using CALIC. IEEE Geoscience and Remote Sensing Letters, 2004, vol. 1, no. 1, pp. 21–25. Doi: 10.1109/LGRS.2003.822312</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Huang, B. Lossless compression of hyperspectral imagery via lookup tables with predictor selection / B. Huang, Y. Sriraja // Proc. Image and Signal Proc. for Remote Sensing XII. – 2006. – Vol. 6365. – P. 131–139.</mixed-citation><mixed-citation xml:lang="en">Huang B. Lossless compression of hyperspectral imagery via lookup tables with predictor selection. Proc. Image and Signal Processing for Remote Sensing XII, 2006, vol. 6365, pp. 131–139. Doi: 10.1117/12.690659</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Mielikainen, J. Lossless compression of hyperspectral images using a quantized index to lookup tables / J. Mielikainen, P. Toivanen // Geoscience and Remote Sensing Letters, IEEE. – 2008. – Vol. 5, iss. 3. – P. 474–478.</mixed-citation><mixed-citation xml:lang="en">Mielikainen J. Toivanen P. Lossless compression of hyperspectral images using a quantized index to lookup tables. IEEE Geoscience and Remote Sensing Letters, 2008, vol. 5, no. 3, pp. 474–478. Doi: 10.1109/LGRS.2008.917598</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Tang, X. Three-Dimensional Wavelet-Based Compression of Hyperspectral Images / X. Tang, W. A. Pearlman // Hyperspectral Data Compression. – Berlin: Springer, 2006. – P. 273–308.</mixed-citation><mixed-citation xml:lang="en">Tang X., Pearlman W.A. Three-Dimensional Wavelet-Based Compression of Hyperspectral Images. Hyperspectral Data Compression. Berlin, Springer, 2006, pp. 273–308. Doi: 10.1007/0-387-28600-4_10</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Christophe, E. Hyperspectral Data Compression Tradeoff / E. Christophe // Optical Remote Sensing. – Berlin: Springer, 2011. – P. 9–29.</mixed-citation><mixed-citation xml:lang="en">Christophe E. Hyperspectral Data Compression Tradeoff. Optical Remote Sensing. Berlin, Springer, 2011, pp. 9–29. Doi: 10.1007/978-3-642-14212-3_2</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
