Pasar al contenido principal

Resultados relacionados

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

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)

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)

Diagnostically lossless coding of X-ray angiography images based on background suppression

  • Xu, Zhongwei
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Blanes, Ian|||0000-0001-8939-1666
  • Sánchez Silva, Víctor Francisco|||0000-0002-7089-7031
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • García Bach, Marcel
  • Muñoz, Juan Francisco
X-ray angiography images are widely used to identify irregularities in the vascular system. Because of their high spatial resolution and the large amount of images generated daily, coding of X-ray angiography images is becoming essential. This paper proposes a diagnostically lossless coding method based on automatic segmentation of the focal area using ray-casting and α-shapes. The diagnostically relevant Region of Interest is first identified by exploiting the inherent symmetrical features of the image. The background is then suppressed and the resulting images are encoded using lossless and progressive lossy-to-lossless methods, including JPEG-LS, JPEG2000, H.264 and HEVC. Experiments on a large set of X-ray angiography images suggest that our method correctly identifies the Region of Interest. When compared to the case of coding with no background suppression, the method achieves average bit-stream reductions of nearly 34% and improvements on the reconstruction quality of up to 20 dB-SNR for progressive decoding.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Piecewise mapping in HEVC lossless intra-prediction coding

  • Sánchez Silva, Víctor Francisco|||0000-0002-7089-7031
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
The lossless intra-prediction coding modality of the High Efficiency Video Coding standard provides high coding performance while allowing frame-by-frame basis access to the coded data. This is of interest in many professional applications, such as medical imaging, automotive vision, and digital preservation in libraries and archives. Various improvements to lossless intra-prediction coding have been proposed recently, most of them based on sample-wise prediction using differential pulse code modulation (DPCM). Other recent proposals aim at further reducing the energy of intra-predicted residual blocks. However, the energy reduction achieved is frequently minimal due to the difficulty of correctly predicting the sign and magnitude of residual values. In this paper, we pursue a novel approach to this energy-reduction problem using piecewise mapping (pwm) functions. In particular, we analyze the range of values in residual blocks and apply accordingly a pwm function to map specific residual values to unique lower values. We encode the appropriate parameters associated with the pwm functions at the encoder, so that the corresponding inverse pwm functions at the decoder can map values back to the same residual values. These residual values are then used to reconstruct the original signal. This mapping is, therefore, reversible and introduces no losses. We evaluate the pwm functions on 4 × 4 residual blocks computed after DPCM-based prediction for lossless coding of a variety of camera-captured and screen content sequences. Evaluation results show that the pwm functions can attain the maximum bitrate reductions of 5.54% and 28.33% for screen content material compared with DPCM-based and block-wise intra-prediction, respectively. Compared with intra-block copy, piecewise mapping can attain the maximum bit-rate reductions of 11.48% for a camera-captured material.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

DPCM-based edge prediction for lossless screen content coding in HEVC

  • Sánchez Silva, Víctor Francisco|||0000-0002-7089-7031
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
Screen content sequences are ubiquitous type of video data in numerous multimedia applications like video conferencing, remote education, and cloud gaming. These sequences are characterized for depicting a mix of computer generated graphics, text, and camera-captured material. Such a mix poses several challenges, as the content usually depicts multiple strong discontinuities, which are hard to encode using current techniques. Differential pulse code modulation (DPCM)-based intra-prediction has shown to improve coding efficiency for these sequences. In this paper we propose sample-based edge and angular prediction (SEAP), a collection of DPCM-based intra-prediction modes to improve lossless coding of screen content. SEAP is aimed at accurately predicting regions depicting not only camera-captured material, but also those depicting strong edges. It incorporates modes that allow selecting the best predictor for each pixel individually based on the characteristics of the causal neighborhood of the target pixel. We incorporate SEAP into HEVC intra-prediction. Evaluation results on various screen content sequences show the advantages of SEAP over other DPCM-based approaches, with bit-rate reductions of up to 19.56% compared to standardized RDPCM. When used in conjunction with the coding tools of the screen content coding extensions, SEAP provides bit-rate reductions of up to 8.63% compared to RDPCM.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Diffusion-based inpainting for coding remote-sensing data

  • Amrani, Naoufal
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • Peter, Pascal
  • Weickert, Joachim
Inpainting techniques based on partial differential equations (PDEs) such as diffusion processes are gaining growing importance as a novel family of image compression methods. Nevertheless, the application of inpainting in the field of hyperspectral imagery has been mainly focused on filling in missing information or dead pixels due to sensor failures. In this paper we propose a novel PDE-based inpainting algorithm to compress hyperspectral images. The method inpaints separately the known data in the spatial and in the spectral dimensions. Then it applies a prediction model to the final inpainting solution to obtain a representation much closer to the original image. Experimental results over a set of hyperspectral images indicate that the proposed algorithm can perform better than a recent proposed extension to prediction-based standard CCSDS-123.0 at low bitrate, better than JPEG 2000 Part 2 with the DWT 9/7 as a spectral transform at all bit-rates, and competitive to JPEG 2000 with principal component analysis (PCA), the optimal spectral decorrelation transform for Gaussian sources.
Dipòsit Digital de Documents de la UAB
Publicación

Marlin, a high throughput variable-to-fixed codec using plurally parsable dictionaries

  • Martinez, Manuel
  • Haurilet, Monica
  • Stiefelhagen, Rainer
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
We present Marlin, a variable-to-fixed (VF) codec optimized for decoding speed. Marlin builds upon a novel way of constructing VF dictionaries that maximizes efficiency for a given dictionary size. On a lossless image coding experiment, Marlin achieves a compression ratio of 1.94 at 2494MiB/s. Marlin is as fast as state-of-the-art high-throughput codecs (e.g., Snappy, 1.24 at 2643MiB/s), and its compression ratio is close to the best entropy codecs (e.g., FiniteStateEntropy, 2.06 at 523MiB/s). Therefore, Marlin enables efficient and high- throughput encoding for memoryless sources, which was not possible until now.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Lossless compression of color filter array mosaic images with visualization via JPEG 2000

  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Marcellin, Michael W.|||0000-0001-9606-134X
  • Blanes, Ian|||0000-0001-8939-1666
Digital cameras have become ubiquitous for amateur and professional applications. The raw images captured by digital sensors typically take the form of color filter array (CFA) mosaic images, which must be "developed" (via digital signal processing) before they can be viewed. Photographers and scientists often repeat the "development process" using different parameters to obtain images suitable for different purposes. Since the development process is generally not invertible, it is commonly desirable to store the raw (or undeveloped) mosaic images indefinitely. Uncompressed mosaic image file sizes can be more than 30 times larger than those of developed images stored in JPEG format. Thus, data compression is of interest. Several compression methods for mosaic images have been proposed in the literature. However, they all require a custom decompressor followed by development-specific software to generate a displayable image. In this paper, a novel compression pipeline that removes these requirements is proposed. Specifically, mosaic images can be losslessly recovered from the resulting compressed files, and, more significantly, images can be directly viewed (decompressed and developed) using only a JPEG 2000 compliant image viewer. Experiments reveal that the proposed pipeline attains excellent visual quality, while providing compression performance competitive to that of state-of-the-art compression algorithms for mosaic images.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Hyperspectral IASI L1C data compression

  • García-Sobrino, Joaquín|||0000-0003-3808-7132
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
The Infrared Atmospheric Sounding Interferometer (IASI), implemented on the MetOp satellite series, represents a significant step forward in atmospheric forecast and weather understanding. The instrument provides infrared soundings of unprecedented accuracy and spectral resolution to derive humidity and atmospheric temperature profiles, as well as some of the chemical components playing a key role in climate monitoring. IASI collects rich spectral information, which results in large amounts of data (about 16 Gigabytes per day). Efficient compression techniques are requested for both transmission and storage of such huge data. This study reviews the performance of several state of the art coding standards and techniques for IASI L1C data compression. Discussion embraces lossless, near-lossless and lossy compression. Several spectral transforms, essential to achieve improved coding performance due to the high spectral redundancy inherent to IASI products, are also discussed. Illustrative results are reported for a set of 96 IASI L1C orbits acquired over a full year (4 orbits per month for each IASI-A and IASI-B from July 2013 to June 2014) . Further, this survey provides organized data and facts to assist future research and the atmospheric scientific community.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Statistical atmospheric parameter retrieval largely benefits from spatial-spectral image compression

  • García-Sobrino, Joaquín|||0000-0003-3808-7132
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • Laparra, Valero|||0000-0001-7531-9890
The infrared atmospheric sounding interferometer (IASI) is flying on board of the Metop satellite series, which is part of the EUMETSAT Polar System. Products obtained from IASI data represent a significant improvement in the accuracy and quality of the measurements used for meteorological models. Notably, the IASI collects rich spectral information to derive temperature and moisture profiles, among other relevant trace gases, essential for atmospheric forecasts and for the understanding of weather. Here, we investigate the impact of near-lossless and lossy compression on IASI L1C data when statistical retrieval algorithms are later applied. We search for those compression ratios that yield a positive impact on the accuracy of the statistical retrievals. The compression techniques help reduce certain amount of noise on the original data and, at the same time, incorporate spatial-spectral feature relations in an indirect way without increasing the computational complexity. We observed that compressing images, at relatively low bit rates, improves results in predicting temperature and dew point temperature, and we advocate that some amount of compression prior to model inversion is beneficial. This research can benefit the development of current and upcoming retrieval chains in infrared sounding and hyperspectral sensors.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

GPU implementation of bitplane coding with parallel coefficient processing for high performance image compression

  • Enfedaque Montes, Pablo
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Moure, Juan C.|||0000-0001-6697-0331
The fast compression of images is a requisite in many applications like TV production, teleconferencing, or digital cinema. Many of the algorithms employed in current image compression standards are inherently sequential. High performance implementations of such algorithms often require specialized hardware like field integrated gate arrays. Graphics Processing Units (GPUs) do not commonly achieve high performance on these algorithms because they do not exhibit fine-grain parallelism. Our previous work introduced a new core algorithm for wavelet-based image coding systems. It is tailored for massive parallel architectures. It is called bitplane coding with parallel coefficient processing (BPC-PaCo). This paper introduces the first high performance, GPU-based implementation of BPC-PaCo. A detailed analysis of the algorithm aids its implementation in the GPU. The main insights behind the proposed codec are an efficient thread-to-data mapping, a smart memory management, and the use of efficient cooperation mechanisms to enable inter-thread communication. Experimental results indicate that the proposed implementation matches the requirements for high resolution (4 K) digital cinema in real time, yielding speedups of 30x with respect to the fastest implementations of current compression standards. Also, a power consumption evaluation shows that our implementation consumes 40 x less energy for equivalent performance than state-of-the-art methods.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Almost fixed quality rate-allocation under unequal scaling factors for on-board remote-sensing data compression

  • Blanes, Ian|||0000-0001-8939-1666
  • Albinet, Mathieu
  • Camarero, Roberto
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
This article extends a rate-allocation method based on the near-lossless-rate (NLR) complexity that is designed to operate on-board spacecrafts, to include support for distortion scaling factors, such as those that are needed to code multi- and hyperspectral image when a spectral transform is employed. In this article, the conditions to achieve global minimum distortion are derived under the rate-distortion model based on the NLR complexity for the case of varying distortion scaling factors. Practical implementation issues are dealt with, and a rate-allocation method capable of operating under the constraints of on-board operation is provided. An exhaustive experimental validation of the rate-allocation method is performed, reporting modest performances for low rates and close to optimal performances for high rates.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Multilevel split regression wavelet analysis for lossless compression of remote sensing data

  • Álvarez Cortés, Sara|||0000-0003-3244-8080
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
Spectral redundancy is a key element to be exploited in compression of remote sensing data. Combined with an entropy encoder, it can achieve competitive lossless coding performance. One of the latest techniques to decorrelate the spectral signal is the regression wavelet analysis (RWA). RWA applies a wavelet transform in the spectral domain and estimates the detail coeffi- cients through the approximation coefficients using linear regres- sion. RWA was originally coupled with JPEG 2000. This letter introduces a novel coding approach, where RWA is coupled with the predictor of CCSDS-123.0-B-1 standard and a lightweight contextual arithmetic coder. In addition, we also propose a smart strategy to select the number of RWA decomposition levels that maximize the coding performance. Experimental results indicate that, on average, the obtained coding gains vary between 0.1 and 1.35 bits-per-pixel-per-component compared with the other state- of-the-art coding techniques.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Dual link image coding for earth observation satellites

  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Marcellin, Michael W.|||0000-0001-9606-134X
  • Sánchez Silva, Víctor Francisco|||0000-0002-7089-7031
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
The conventional strategy to download images captured by satellites is to compress the data on board and then transmit them via the downlink. It often happens that the capacity of the downlink is too small to accommodate all the acquired data, so the images are trimmed and/or transmitted through lossy regimes. This paper introduces a coding system that increases the amount and quality of the downloaded imaging data. The main insight of this paper is to use both the uplink and the downlink to code the images. The uplink is employed to send reference information to the satellite so that the onboard coding system can achieve higher efficiency. This reference information is computed on the ground, possibly employing extensive data and computational resources. The proposed system is called dual link image coding. As it is devised in this paper, it is suitable for Earth observation satellites with polar orbits. Experimental results obtained for data sets acquired by the Landsat 8 satellite indicate significant coding gains with respect to conventional methods.
Dipòsit Digital de Documents de la UAB
Publicación

Improving Marlin's compression ratio with partially overlapping codewords

  • Martinez, Manuel
  • Sandfort, Kai
  • Dubé, Danny
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
Marlin [1] is a Variable-to-Fixed (VF) codec optimized for decoding speed. To achieve its speed, Marlin does not encode the current state of the input source, penalyzing compression ratio. In this paper we address this penalty by partially encoding the current state of the input in the lower bits of the codeword. Those bits select which chapter in the dictionary must be used to decode the next codeword. Each chapter is specialized for a subset of states, improving compression ratio. At the same time, we use one victim chapter to encode all rare symbols, increasing the efficiency of the rest of them. The decoding algorithm remains the same, only now codewords have overlapping bits. Mapping techniques allow us to combine common chapters and thus keep an efficient use of the L1 cache. We evaluate our approach with both synthetic and real data sets, and show significant improvements in low entropy sources, where compression efficiency can improve from 93.9% to 98.6%.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Mosaic-Based Color-Transform Optimization for Lossy and Lossy-to-Lossless Compression of Pathology Whole-Slide Images

  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Sánchez Silva, Víctor Francisco|||0000-0002-7089-7031
  • Marcellin, Michael W.|||0000-0001-9606-134X
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Blanes, Ian|||0000-0001-8939-1666
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
The use of whole-slide images (WSIs) in pathology entails stringent storage and transmission requirements because of their huge dimensions. Therefore, image compression is an essential tool to enable efficient access to these data. In particular, color transforms are needed to exploit the very high degree of inter-component correlation and obtain competitive compression performance. Even though the state-of-the-art color transforms remove some redundancy, they disregard important details of the compression algorithm applied after the transform. Therefore, their coding performance is not optimal. We propose an optimization method called mosaic optimization for designing irreversible and reversible color transforms simultaneously optimized for any given WSI and the subsequent compression algorithm. Mosaic optimization is designed to attain reasonable computational complexity and enable continuous scanner operation. Exhaustive experimental results indicate that, for JPEG 2000 at identical compression ratios, the optimized transforms yield images more similar to the original than the other state-of-the-art transforms. Specifically, irreversible optimized transforms outperform the Karhunen-Loève Transform in terms of PSNR (up to 1.1 dB), the HDR-VDP-2 visual distortion metric (up to 3.8 dB), and the accuracy of computer-aided nuclei detection tasks (F1 score up to 0.04 higher). In addition, reversible optimized transforms achieve PSNR, HDR-VDP-2, and nuclei detection accuracy gains of up to 0.9 dB, 7.1 dB, and 0.025, respectively, when compared with the reversible color transform in lossy-to-lossless compression regimes.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Performance impact of parameter tuning on the CCSDS-123.0-B-2 low-complexity lossless and near-lossless multispectral and Hyperspectral Image Compression standard

  • Blanes, Ian|||0000-0001-8939-1666
  • Kiely, Aaron
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
This article studies the performance impact related to different parameter choices for the new CCSDS-123.0-B-2 Low-Complexity Lossless and Near-Lossless Multispectral and Hyperspectral Image Compression standard. This standard supersedes CCSDS-123.0-B-1 and extends it by incorporating a new near-lossless compression capability, as well as other new features. This article studies the coding performance impact of different choices for the principal parameters of the new extensions, in addition to reviewing related parameter choices for existing features. Experimental results include data from 16 different instruments with varying detector types, image dimensions, number of spectral bands, bit depth, level of noise, level of calibration, and other image characteristics. Guidelines are provided on how to adjust the parameters in relation to their coding performance impact.
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)

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)

A Lightweight Contextual Arithmetic Coder for On-Board Remote Sensing Data Compression

  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Blanes, Ian|||0000-0001-8939-1666
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • Sánchez Silva, Víctor Francisco|||0000-0002-7089-7031
  • Marcellin, Michael W.|||0000-0001-9606-134X
The Consultative Committee for Space Data Systems (CCSDS) has issued several data compression standards devised to reduce the amount of data transmitted from satellites to ground stations. This paper introduces a contextual arithmetic encoder for on-board data compression. The proposed arithmetic encoder checks the causal adjacent neighbors, at most, to form the context and uses only bitwise operations to estimate the related probabilities. As a result, the encoder consumes few computational resources, making it suitable for on-board operation. Our coding approach is based on the prediction and mapping stages of CCSDS-123 lossless compression standard, an optional quantizer stage to yield lossless or near-lossless compression and our proposed arithmetic encoder. For both lossless and near-lossless compression, the achieved coding performance is superior to that of CCSDS-123, M-CALIC, and JPEG-LS. Taking into account only the entropy encoders, fixed-length codeword is slightly better than MQ and interleaved entropy coding.