Pasar al contenido principal

COMPRESION DE DATOS PARA CONSTELACIONES DE SATELITES EN LA ERA DEL NEWSPACE

RTI2018-095287-B-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2018
Plan Estatal 2017-2020 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): 27
Encontrada(s) 1 página(s)

Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Analysis of Lossless Compressors Applied to Integer and Floating-Point Astronomical Data

  • Maireles González, Òscar|||0000-0003-4754-0373
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
In this work, lossless compression algorithms are evaluated on a variety of real, current as-tronomical images. The test dataset comprises raw (integer) and processed (floating-point) images of discrete and extensive astronomical objects, captured by spatial or terrestrial tele-scopes. Compression techniques herein analyzed are chosen to be representative of the most recent algorithms devised for astronomical data, as well as the most commonly employed compressors employed in real observatories. Experimental results suggest that coding techniques such as RICE and HCOMPRESS, typically employed in world-class observatories such as Roque de los Muchachos, do not produce the best possible lossless compression results. Instead, JPEG-LS, LZMA and NDZIP yield the best compression ratio results for 16-bit data (2.72), floating-point data (2.38) and radio data (1.81), respectively. Therefore, the efficiency with which data are stored and transmitted by these observatories could be significantly improved by selectively employing the aforementioned algorithms.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Dual Link Image Coding Based on CCSDS-123

  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
Predictive coding techniques are attractive for image codecs because they can yield high compression efficiency while spending few computational resources. In remote sensing, predictive techniques are employed in prominent standards to transmit images captured by Earth Observation (EO) satellites. Although EO satellites have full duplex capacity, compression standards for spatial data are devised to use the downlink only. Recently, we presented a dual-link image coding system that employs both the uplink and the downlink to accelerate the transmission of such images. The proposed system was introduced in the wavelet-based JPEG2000 standard, which is not well-suited for satellites due to its complexity. This letter approaches the dual-link scheme to a more suitable standard for spatial data based on predictive coding, more precisely, the Lossless Multispectral and Hyperspectral image compression standard CCSDS-123.0-B.2. The proposed method adapts the dual-link image coding scheme to CCSDS-123.0-B-2 by incorporating a quantizer, a lightweight arithmetic coder, and a rate control technique. Experimental results suggest that the resulting system achieves higher coding ratios than CCSDS-123.0-B-2 and JPEG2000 with dual link.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Resiliency and Efficiency of the CCSDS 124.0-B-1 Telemetry Compression Standard

  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Evans, David
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Blanes, Ian|||0000-0001-8939-1666
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
The Consultative Committee for Space Data Systems (CCSDS) recently published a lossless compression standard for housekeeping and telemetry. These data are critical for the safe and productive operation of virtually all remote sensing missions, including Earth observation. The new standard, CCSDS 124.0-B-1 "Robust Compression of Fixed-Length Housekeeping Data," allows lossless, real-time telemetry packet transmission with low energy and memory requirements. Furthermore, it offers flexible resiliency mechanisms to resume decompression after losing one or more data packets. This work provides an accessible introduction to CCSDS 124.0-B-1, paying special attention to its resiliency features. Two novel and complementary decoder resynchronization strategies are also presented, which maximize the amount of correctly decoded data. Comprehensive experiments with real and simulated mission data were conducted for this work to assess the standard's performance and the impact of user-defined parameters. Results indicate competitive coding performance, with average compression ratios between 4 and 16 depending on the dataset. Smooth trade-offs are also observed between compression performance and the degree of protection against data loss events, which enhances the usability of CCSDS 124.0-B-1 in multiple mission types and operational conditions.
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)

DivNet, Efficient Convolutional Neural Network via Multilevel Hierarchical Architecture Design

  • Kaddar, Bachir|||0000-0003-4385-8683
  • Fizazi, Hadria
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Sánchez Silva, Víctor Francisco|||0000-0002-7089-7031
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
Designing small and efficient mobile neural networks is difficult because the challenge is to determine the architecture that achieves the best performance under a given limited computational scenario. Previous lightweight neural networks rely on a cell module that is repeated in all stacked layers across the network. These approaches do not permit layer diversity, which is critical for achieving strong performance. This paper presents an experimental study to develop an efficient mobile network using a hierarchical architecture. Our proposed mobile network, called Diversity Network (DivNet), has been shown to perform better than the basic architecture generally employed by the best high-efficiency models-with simply stacked layers-, regarding complexity cost and performance. A set of architectural design decisions are described that reduce the proposed model size while yielding a significant performance improvement. Our experiments on image classification show that compared to, respectively, MobileNetV2, SqueezeNet, and ShuffleNetV2, our proposal DivNet can improve accuracy by 2.09%, 0.76%, and 0.66% on the CIFAR100 dataset, and by 0.05%, 4.96%, and 1.13% on the CIFAR10 dataset. On more complex datasets, e.g., ImageNet, our proposal DivNet achieves 70.65% Top-1 accuracy and 90.23% Top-5 accuracy, still better than other small models like MobilNet, SqueezeNet, ShuffleNet.
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)

High-throughput variable-to-fixed entropy codec using selective, stochastic code forests

  • Torres, Manuel Martinez|||0000-0001-6020-7618
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Blanes, Ian|||0000-0001-8939-1666
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
Efficient high-throughput (HT) compression algorithms are paramount to meet the stringent constraints of present and upcoming data storage, processing, and transmission systems. In particular, latency, bandwidth and energy requirements are critical for those systems. Most HT codecs are designed to maximize compression speed, and secondarily to minimize compressed lengths. On the other hand, decompression speed is often equally or more critical than compression speed, especially in scenarios where decompression is performed multiple times and/or at critical parts of a system. In this work, an algorithm to design variable-to-fixed (VF) codes is proposed that prioritizes decompression speed. Stationary Markov analysis is employed to generate multiple, jointly optimized codes (denoted code forests). Their average compression efficiency is on par with the state of the art in VF codes, e.g., within 1% of Yamamoto et al.'s algorithm. The proposed code forest structure enables the implementation of highly efficient codecs, with decompression speeds 3.8 times faster than other state-of-the-art HT entropy codecs with equal or better compression ratios for natural data sources. Compared to these HT codecs, the proposed forests yields similar compression efficiency and speeds.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Lower Bounds on the Redundancy of Huffman Codes with Known and Unknown Probabilities

  • Blanes, Ian|||0000-0001-8939-1666
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • Marcellin, Michael W.|||0000-0001-9606-134X
In this paper, we provide a method to obtain tight lower bounds on the minimum redundancy achievable by a Huffman code when the probability distribution underlying an alphabet is only partially known. In particular, we address the case where the occurrence probabilities are unknown for some of the symbols in an alphabet. Bounds can be obtained for alphabets of a given size, for alphabets of up to a given size, and alphabets of arbitrary size. The method operates on a computer algebra system, yielding closed-form numbers for all results. Finally, we show the potential of the proposed method to shed some light on the structure of the minimum redundancy achievable by the Huffman code.
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

High-performance lossless compression of hyperspectral remote sensing scenes based on spectral decorrelation

  • Hernández-Cabronero, Miguel
  • Portell, Jordi
  • Blanes, Ian
  • Serra-Sagristà, Joan
This article belongs to the Special Issue Remote Sensing Data Compression., The capacity of the downlink channel is a major bottleneck for applications based on remote sensing hyperspectral imagery (HSI). Data compression is an essential tool to maximize the amount of HSI scenes that can be retrieved on the ground. At the same time, energy and hardware constraints of spaceborne devices impose limitations on the complexity of practical compression algorithms. To avoid any distortion in the analysis of the HSI data, only lossless compression is considered in this study. This work aims at finding the most advantageous compression–complexity trade-off within the state of the art in HSI compression. To do so, a novel comparison of the most competitive spectral decorrelation approaches combined with the best performing low-complexity compressors of the state is presented. Compression performance and execution time results are obtained for a set of 47 HSI scenes produced by 14 different sensors in real remote sensing missions. Assuming only a limited amount of energy is available, obtained data suggest that the FAPEC algorithm yields the best trade-off. When compared to the CCSDS 123.0-B-2 standard, FAPEC is 5.0 times faster and its compressed data rates are on average within 16% of the CCSDS standard. In scenarios where energy constraints can be relaxed, CCSDS 123.0-B-2 yields the best average compression results of all evaluated methods., This research was funded by the Spanish Ministry of Economy and Competitiveness and the European Regional Development Fund under grants RTI2018-095287-B-I00, TIN2015-71126-R, RTI2018-095076-B-C21 (MINECO/FEDER, UE); by the ESA Business Incubation Programme and Barcelona Activa; by the Catalan Government under grant 2017SGR-463; by the postdoctoral fellowship programme Beatriu de Pinós, reference 2018-BP-00008, funded by the Secretary of Universities and Research (Government of Catalonia); and by the Horizon 2020 programme of research and innovation of the European Union under the Marie Skłodowska-Curie grant agreement #801370., Peer reviewed
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Regression Wavelet Analysis for Near-Lossless Remote Sensing Data Compression

  • Álvarez Cortés, Sara|||0000-0003-3244-8080
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Marcellin, Michael W.|||0000-0001-9606-134X
Regression wavelet analysis (RWA) is one of the current state-of-the-art lossless compression techniques for remote sensing data. This article presents the first regression-based near-lossless compression method. It is built upon RWA, a quantizer, and a feedback loop to compensate the quantization error. Our near-lossless RWA (NLRWA) proposal can be followed by any entropy coding technique. Here, the NLRWA is coupled with a bitplane-based coder that supports progressive decoding. This successfully enables gradual quality refinement and lossless and near-lossless recovery. A smart strategy for selecting the NLRWA quantization steps is also included. Experimental results show that the proposed scheme outperforms the state-of-the-art lossless and the near-lossless compression methods in terms of compression ratios and quality retrieval.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Competitive Segmentation Performance on Near-lossless and Lossy Compressed Remote Sensing Images

  • García-Sobrino, Joaquín|||0000-0003-3808-7132
  • Pinho, Armando J.|||0000-0002-9164-0016
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
Image segmentation lies at the heart of multiple image processing chains, and achieving accurate segmentation is of utmost importance as it impacts later processing. Image segmentation has recently gained interest in the field of remote sensing, mostly due to the widespread availability of remote sensing data. This increased availability poses the problem of transmitting and storing large volumes of data. Compression is a common strategy to alleviate this problem. However, lossy or near-lossless compression prevents a perfect reconstruction of the recovered data. This letter investigates the image segmentation performance in data reconstructed after a near-lossless or a lossy compression. Two image segmentation algorithms and two compression standards are evaluated on data from sev- eral instruments. Experimental results reveal that segmentation performance over previously near-lossless and lossy compressed images is not markedly reduced at low and moderate compression ratios. In some scenarios, accurate segmentation performance can be achieved even for high compression ratios.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Improved Statistically Based Retrievals via Spatial-Spectral Data Compression for IASI Data

  • García-Sobrino, Joaquín|||0000-0003-3808-7132
  • Laparra, Valero|||0000-0001-7531-9890
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • Calbet, Xavier|||0000-0003-0058-8425
  • Camps Valls, Gustau|||0000-0003-1683-2138
In this paper, we analyze the effect of spatial and spectral compression on the performance of statistically based retrieval. Although the quality of the information is not com- pletely preserved during the coding process, experiments reveal that a certain amount of compression may yield a positive impact on the accuracy of retrievals. We unveil two strategies, both with interesting benefits: either to apply a very high compression, which still maintains the same retrieval performance as that obtained for uncompressed data; or to apply a moderate to high compression, which improves the performance. As a second contribution of this paper, we focus on the origins of these benefits. On the one hand, we show that a certain amount of noise is removed during the compression stage, which benefits the retrievals performance. On the other hand, we analyze the effect of compression on spectral/spatial regularization (smoothing). We quantify the amount of information shared among the spatial neighbors for the different methods and compression ratios. We also propose a simple strategy to specifically exploit spectral and spatial relations and find that, when these relations are taken into account beforehand, the benefits of compression are reduced. These experiments suggest that compression can be understood as an indirect way to regularize the data and exploit spatial neighbors information, which improves the performance of pixelwise statistics-based retrieval algorithms.
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.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A novel rate-control for predictive image coding with constant quality

  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Marcellin, Michael W.|||0000-0001-9606-134X
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
Predictive image coding systems yield a high-compression performance at low computational complexity, and are therefore popular in standards and prominent coding techniques for both lossless and near-lossless compression. However, few prediction-based coding techniques include rate-control approaches because of the difficulty in properly combining the prediction feedback loop and the quantization. None of the rate-control approaches for predictive image coding are focused on delivering homogeneous quality along the whole image. The main objective of this paper is to define a novel rate-control approach based on prediction that homogenises the quality over the entire image. The extensive experimental results, on medical, remote sensing, and natural images, suggest that our proposal attains more regular image quality and lower peak absolute error than the state-of-the-art approaches based on prediction and also transform-based techniques such as JPEG2000 and CCSDS-122.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

High-performance lossless compression of hyperspectral remote sensing scenes based on spectral decorrelation

  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Blanes, Ian|||0000-0001-8939-1666
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • Portell i de Mora, Jordi|||0000-0002-8886-8925
The capacity of the downlink channel is a major bottleneck for applications based on remote sensing hyperspectral imagery (HSI). Data compression is an essential tool to maximize the amount of HSI scenes that can be retrieved on the ground. At the same time, energy and hardware constraints of spaceborne devices impose limitations on the complexity of practical compression algorithms. To avoid any distortion in the analysis of the HSI data, only lossless compression is considered in this study. This work aims at finding the most advantageous compression-complexity trade-off within the state of the art in HSI compression. To do so, a novel comparison of the most competitive spectral decorrelation approaches combined with the best performing low-complexity compressors of the state is presented. Compression performance and execution time results are obtained for a set of 47 HSI scenes produced by 14 different sensors in real remote sensing missions. Assuming only a limited amount of energy is available, obtained data suggest that the FAPEC algorithm yields the best trade-off. When compared to the CCSDS 123.0-B-2 standard, FAPEC is 5.0 times faster and its compressed data rates are on average within 16% of the CCSDS standard. In scenarios where energy constraints can be relaxed, CCSDS 123.0-B-2 yields the best average compression results of all evaluated methods.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

GPU-oriented architecture for an end-to-end image/video codec based on JPEG2000

  • de Cea Dominguez, Carlos|||0000-0002-0868-6479
  • Moure, Juan C.|||0000-0001-6697-0331
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
Modern image and video compression standards employ computationally intensive algorithms that provide advanced features to the coding system. Current standards often need to be implemented in hardware or using expensive solutions to meet the real-time requirements of some environments. Contrarily to this trend, this paper proposes an end-to-end codec architecture running on inexpensive Graphics Processing Units (GPUs) that is based on, though not compatible with, the JPEG2000 international standard for image and video compression. When executed in a commodity Nvidia GPU, it achieves real time processing of 12K video. The proposed S/W architecture utilizes four CUDA kernels that minimize memory transfers, use registers instead of shared memory, and employ a double-buffer strategy to optimize the streaming of data. The analysis of throughput indicates that the proposed codec yields results at least 10× superior on average to those achieved with JPEG2000 implementations devised for CPUs, and approximately 4× superior to those achieved with hardwired solutions of the HEVC/H.265 video compression standard.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Complexity scalable bitplane image coding with parallel coefficient processing

  • de Cea Dominguez, Carlos|||0000-0002-0868-6479
  • Moure, Juan C.|||0000-0001-6697-0331
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
Very fast image and video codecs are a pursued goal both in the academia and the industry. This paper presents a complexity scalable and parallel bitplane coding engine for wavelet-based image codecs. The proposed method processes the coefficients in parallel, suiting hardware architectures based on vector instructions. Our previous work is extended with a mechanism that provides complexity scalability to the system. Such a feature allows the coder to regulate the throughput achieved at the expense of slightly penalizing compression effi- ciency. Experimental results suggests that, when using the fastest speed, the method almost doubles the throughput of our previous engine while penalizing compression efficiency by about 10%.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Redundancy and optimization of tANS entropy encoders

  • Blanes, Ian|||0000-0001-8939-1666
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • Marcellin, Michael W.|||0000-0001-9606-134X
Nowadays entropy encoders are part of almost all data compression methods, with the Asymmetrical Numeral Systems (ANS) family of entropy encoders having recently risen in popularity. Entropy encoders based on the tabled variant of ANS are known to provide varying performances depending on their internal design. In this paper, we present a method that calculates encoder redundancies in almost linear time, which translates in practice to thousand-fold speedups in redundancy calculations for small automatons, and allows redundancy calculations for automatons with tens of millions of states that would be otherwise prohibitive. We also address the problem of improving tabled ANS encoder designs, by employing the aforementioned redundancy calculation method in conjunction with a stochastic hill climbing strategy. The proposed approach consistently outperforms state-of-the-art methods in tabled ANS encoder design. For automatons of twice the alphabet size, experimental results show redundancy reductions around 10% over the default initialization method and over 30% for random initialization.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Real-time 16K video coding on a GPU with complexity scalable BPC-PaCo

  • de Cea Dominguez, Carlos|||0000-0002-0868-6479
  • Moure, Juan C.|||0000-0001-6697-0331
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
The advent of new technologies such as high dynamic range or 8K screens has enhanced the quality of digital images but it has also increased the codecs' computational demands to process such data. This paper presents a video codec that, while providing the same coding features and performance as those of JPEG2000, can process 16K video in real time using a consumer-grade GPU. This high throughput is achieved with a technique that introduces complexity scalability to a bitplane coding engine, which is the most computationally complex stage of the coding pipeline. The resulting codec can trade throughput for coding performance depending on the user's needs. Experimental results suggest that our method can double the throughput achieved by CPU implementations of the recently approved High-Throughput JPEG2000 and by hardwired implementations of HEVC in a GPU.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Accelerating BPC-PaCo through visually lossless techniques

  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • de Cea Dominguez, Carlos|||0000-0002-0868-6479
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
Fast image codecs are a current need in applications that deal with large amounts of images. Graphics Processing Units (GPUs) are suitable processors to speed up most kinds of algorithms, especially when they allow fine-grain parallelism. Bitplane Coding with Parallel Coefficient processing (BPC-PaCo) is a recently proposed algorithm for the core stage of wavelet-based image codecs tailored for the highly parallel architectures of GPUs. This algorithm provides complexity scalability to allow faster execution at the expense of coding efficiency. Its main drawback is that the speedup and loss in image quality is controlled only roughly, resulting in visible distortion at low and medium rates. This paper addresses this issue by integrating techniques of visually lossless coding into BPC-PaCo. The resulting method minimizes the visual distortion introduced in the compressed file, obtaining higher-quality images to a human observer. Experimental results also indicate 12% speedups with respect to BPC-PaCo.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Probability models for highly parallel image coding architecture

  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
A key aspect of image coding systems is the probability model employed to code the data. The more precise the probability estimates inferred by the model, the higher the coding efficiency achieved. In general, probability models adjust the estimates after coding every new symbol. The main difficulty to apply such a strategy to a highly parallel coding engine is that many symbols are coded simultaneously, so the probability adaptation requires a different approach. The strategy employed in previous works utilizes stationary estimates collected a priori from a training set. Its main drawback is that statistics are dependent of the image type, so different images require different training sets. This work introduces two probability models for a highly parallel architecture that, similarly to conventional systems, adapt probabilities while coding data. One of the proposed models estimates probabilities through a finite state machine, while the other employs the statistics of already coded symbols via a sliding window. Experimental results indicate that the latter approach improves the performance achieved by the other models, including that of JPEG2000 and High Throughput JPEG2000, at medium and high rates with only a slight increase in computational complexity.
Dipòsit Digital de Documents de la UAB
Publicación Otros (Other)

Editorial to special issue "remote sensing data compression"

  • Vozel, Benoit
  • Lukin, Vladimir
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
A huge amount of remote sensing data is acquired each day, which is transferred to image processing centers and/or to customers. Due to different limitations, compression has to be applied on-board and/or on-the-ground. This Special Issue collects 15 papers dealing with remote sensing data compression, introducing solutions for both lossless and lossy compression, analyzing the impact of compression on different processes, investigating the suitability of neural networks for compression, and researching on low complexity hardware and software approaches to deliver competitive coding performance.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Reducing data dependencies in the feedback loop of the CCSDS 123.0-B-2 predictor

  • Sánchez, Antonio José|||0000-0002-2142-7885
  • Blanes, Ian|||0000-0001-8939-1666
  • Barrios, Yubal|||0000-0001-6186-9971
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • Sarmiento, Roberto|||0000-0002-4843-0507
On-board multi- and hyperspectral instruments acquire large volumes of data that need to be processed with the limited computational and storage resources. In this context, the CCSDS 123.0-B-2 standard emerges as an interesting option to compress multi- and hyperspectral images on-board satellites, supporting both lossless and near-lossless compression with low complexity and reduced power consumption. Nonetheless, the inclusion of a feedback loop in the CCSDS 123.0-B-2 predictor to support near-lossless compression introduces significant data dependencies that hinder real-time processing, particularly due to the presence of a quantization stage within this loop. This work provides an analysis of the aforementioned data dependencies and proposes two strategies aiming at maximizing throughput in hardware implementations and thus enabling real-time processing. In particular, through an elaborate mathematical derivation, the quantization stage is removed completely from the feedback loop. This reduces the critical path, which allows for shorter initiation intervals in a pipelined hardware implementation and higher throughput. This is achieved without any impact in the compression performance, which is identical to the one obtained by the original data flow of the predictor.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A Scalable Reduced-Complexity Compression of Hyperspectral Remote Sensing Images Using Deep Learning

  • Mijares i Verdú, Sebastià|||0000-0003-1038-6413
  • Ballé, Johannes|||0000-0003-0769-8985
  • Laparra, Valero|||0000-0001-7531-9890
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
Two key hurdles to the adoption of Machine Learning (ML) techniques in hyperspectral data compression are computational complexity and scalability for large numbers of bands. These are due to the limited computing capacity available in remote sensing platforms and the high computational cost of compression algorithms for hyperspectral data, especially when the number of bands is large. To address these issues, a channel clusterisation strategy is proposed, which reduces the computational demands of learned compression methods for real scenarios and is scalable for different sources of data with varying numbers of bands. The proposed method is compatible with an embedded implementation for state-of-the-art on board hardware, a first for a ML hyperspectral data compression method. In terms of coding performance, our proposal surpasses established lossy methods such as JPEG 2000 preceded by a spectral Karhunen-Loève Transform (KLT), in clusters of 3 to 7 bands, achieving a PSNR improvement of, on average, 9 dB for AVIRIS and 3 dB for Hyperion images.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Prediction-based coding with rate control for lossless region of interest in pathology imaging

  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Sánchez Silva, Víctor Francisco|||0000-0002-7089-7031
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • Jamshidi, Pouya
  • Castellani, J.
Online collaborative tools for medical diagnosis produced from digital pathology images have experimented an increase in demand in recent years. Due to the large sizes of pathology images, rate control (RC) techniques that allow an accurate control of compressed file sizes are critical to meet existing bandwidth restrictions while maximizing retrieved image quality. Recently, some RC contributions to Region of Interest (RoI) coding for pathology imaging have been presented. These encode the RoI without loss and the background with some loss, and focus on providing high RC accuracy for the background area. However, none of these RC contributions deal efficiently with arbitrary RoI shapes, which hinders the accuracy of background definition and rate control. This manuscript presents a novel coding system based on prediction with a novel RC algorithm for RoI coding that allows arbitrary RoIs shapes. Compared to other methods of the state of the art, our proposed algorithm significantly improves upon their RC accuracy, while reducing the compressed data rate for the RoI by 30%. Furthermore, it offers higher quality in the reconstructed background areas, which has been linked to better clinical performance by expert pathologists. Finally, the proposed method also allows lossless compression of both the RoI and the background, producing data volumes 14% lower than coding techniques included in DICOM, such as HEVC and JPEG-LS.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Fast Run-Length Compression of Point Cloud Geometry

  • 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
The increase in popularity of point-cloud-oriented applications has triggered the development of specialized compression algorithms. In this paper, a novel algorithm is developed for the lossless geometry compression of voxelized point clouds following an intra-frame design. The encoded voxels are arranged into runs and are encoded through a single-pass application directly on the voxel domain. This is done without representing the point cloud via an octree nor rendering the voxel space through an occupancy matrix, therefore decreasing the memory requirements of the method. Each run is compressed using a context-adaptive arithmetic encoder yielding state-of-the-art compression results, with gains of up to 15% over TMC13, MPEG's standard for point cloud geometry compression. Several proposed contributions accelerate the calculations of each run's probability limits prior to arithmetic encoding. As a result, the encoder attains a low computational complexity described by a linear relation to the number of occupied voxels leading to an average speedup of 1.8 over TMC13 in encoding speeds. Various experiments are conducted assessing the proposed algorithm's state-of-the-art performance in terms of compression ratio and encoding speeds.