Pasar al contenido principal

CODIFICACION DE IMAGENES PARA SATELITES DE OBSERVACION TERRESTRE

BES-2016-078369

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de Promoción del Talento y su Empleabilidad en I+D+i
Subprograma Subprograma Estatal de Formación
Convocatoria Contratos Predoctorales
Año convocatoria 2016
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD AUTONOMA DE BARCELONA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 4
Encontrada(s) 1 página(s)

Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Performance Improvement on k2-Raster Compact Data Structure for Hyperspectral Scenes

  • Chow, Kevin|||0000-0001-9693-9677
  • Tzamarias, Dion E. O.|||0000-0001-5111-0830
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Blanes, Ian|||0000-0001-8939-1666
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
This letter proposes methods to improve data size and access time for k2-raster, a losslessly compressed data structure that provides efficient storage and real-time processing. Hyperspectral scenes from real missions are used as our testing data. In previous studies, with k2-raster, the size of the hyperspectral data was reduced by up to 52% compared with the uncompressed data. In this letter, we continue to explore novel ways of further reducing the data size and access time. First, we examine the possibility of using the raster matrix of hyperspectral data without any padding (unpadded matrix) while still being able to compress the structure and access the data. Second, we examine some integer encoders, more specifically the Simple family. We discuss their ability to provide random element access and compare them with directly addressable codes (DACs), the integer encoder used in the original description for k2 -raster. Experiments show that the use of unpadded matrices has improved the storage size up to 6% while the use of a different integer encoder reduces the storage size up to 6% and element access time up to 20%.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Analysis of variable-length codes for integer encoding in hyperspectral data compression with the k2-raster compact data structure

  • Chow, Kevin|||0000-0001-9693-9677
  • Tzamarias, Dion E. O.|||0000-0001-5111-0830
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Blanes, Ian|||0000-0001-8939-1666
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
This paper examines the various variable-length encoders that provide integer encoding to hyperspectral scene data within a k-raster compact data structure. This compact data structure leads to a compression ratio similar to that produced by some of the classical compression techniques. This compact data structure also provides direct access for query to its data elements without requiring any decompression. The selection of the integer encoder is critical for obtaining a competitive performance considering both the compression ratio and access time. In this research, we show experimental results of different integer encoders such as Rice, Simple9, Simple16, PForDelta codes, and DACs. Further, a method to determine an appropriate k value for building a k-raster compact data structure with competitive performance is discussed.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Using predictive and differential methods with K2-Raster compact data structure for hyperspectral image lossless compression

  • Chow, Kevin|||0000-0001-9693-9677
  • Tzamarias, Dion E. O.|||0000-0001-5111-0830
  • Blanes, Ian|||0000-0001-8939-1666
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
This paper proposes a lossless coder for real-time processing and compression of hyperspectral images. After applying either a predictor or a differential encoder to reduce the bit rate of an image by exploiting the close similarity in pixels between neighboring bands, it uses a compact data structure called k-raster to further reduce the bit rate. The advantage of using such a data structure is its compactness, with a size that is comparable to that produced by some classical compression algorithms and yet still providing direct access to its content for query without any need for full decompression. Experiments show that using k-raster alone already achieves much lower rates (up to 55% reduction), and with preprocessing, the rates are further reduced up to 64%. Finally, we provide experimental results that show that the predictor is able to produce higher rates reduction than differential encoding.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Compression of hyperspectral scenes through integer-to-integer spectral graph transforms+

  • Tzamarias, Dion E. O.|||0000-0001-5111-0830
  • Chow, Kevin|||0000-0001-9693-9677
  • Blanes, Ian|||0000-0001-8939-1666
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
Hyperspectral images are depictions of scenes represented across many bands of the electromagnetic spectrum. The large size of these images as well as their unique structure requires the need for specialized data compression algorithms. The redundancies found between consecutive spectral components and within components themselves favor algorithms that exploit their particular structure. One novel technique with applications to hyperspectral compression is the use of spectral graph filterbanks such as the GraphBior transform, that leads to competitive results. Such existing graph based filterbank transforms do not yield integer coefficients, making them appropriate only for lossy image compression schemes. We propose here two integer-to-integer transforms that are used in the biorthogonal graph filterbanks for the purpose of the lossless compression of hyperspectral scenes. Firstly, by applying a Triangular Elementary Rectangular Matrix decomposition on GraphBior filters and secondly by adding rounding operations to the spectral graph lifting filters. We examine the merit of our contribution by testing its performance as a spatial transform on a corpus of hyperspectral images; and share our findings through a report and analysis of our results.