Pasar al contenido principal

LEARNING IMAGE FEATURES TO ENCODE VISUAL INFORMATION

TIN2012-38102-C03-03

•
Nombre agencia financiadora Ministerio de Economía y Competitividad
Acrónimo agencia financiadora MINECO
Programa Programa Nacional de Proyectos de Investigación Fundamental
Subprograma Subprograma de Proyectos de Investigación Fundamental no Orientada
Convocatoria Proyectos I+D
Año convocatoria 2012
Plan Estatal 2008-2011 Plan Nacional de Investigación Científica, Desarrollo e Innovación Tecnológica
Unidad de gestión Secretaría de Estado de Investigación, Desarrollo e Innovación
Centro beneficiario UNIVERSIDAD AUTONOMA DE BARCELONA
Identificador persistente http://dx.doi.org/10.13039/501100003329

Resultados relacionados

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

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

2-step scalar deadzone quantization for bitplane image coding

  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
Modern lossy image coding systems generate a quality progressive codestream that, truncated at increasing rates, produces an image with decreasing distortion. Quality progressivity is commonly provided by an embedded quantizer that employs uniform scalar deadzone quantization (USDQ) together with a bitplane coding strategy. This paper introduces a 2-step scalar deadzone quantization (2SDQ) scheme that achieves same coding performance as that of USDQ while reducing the coding passes and the emitted symbols of the bitplane coding engine. This serves to reduce the computational costs of the codec and/or to code high dynamic range images. The main insights behind 2SDQ are the use of two quantization step sizes that approximate wavelet coefficients with more or less precision depending on their density, and a rate-distortion optimization technique that adjusts the distortion decreases produced when coding 2SDQ indexes. The integration of 2SDQ in current codecs is straightforward. The applicability and efficiency of 2SDQ are demonstrated within the framework of JPEG2000.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Visually lossless strategies to decode and transmit JPEG2000 imagery

  • Jiménez Rodríguez, Leandro
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Marcellin, Michael W.|||0000-0001-9606-134X
Visually lossless coding allows image codecs to achieve high compression ratios while producing images without visually noticeable distortion. In general, visually lossless coding is approached from the point of view of the encoder, so most methods are not applicable to already compressed codestreams. This paper presents two algorithms focused on the visually lossless decoding and transmission of JPEG2000 codestreams. The proposed strategies can be employed by a decoder, or a JPIP server, to reduce the decoding or transmission rate without penalizing the visual quality of the resulting images.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Stationary probability model for microscopic parallelism in JPEG2000

  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Marcellin, Michael W.|||0000-0001-9606-134X
Parallel processing is key to augmenting the throughput of image codecs. Despite numerous efforts to parallelize wavelet-based image coding systems, most attempts fail at the parallelization of the bitplane coding engine, which is the most computationally intensive stage of the coding pipeline. The main reason for this failure is the causality with which current coding strategies are devised, which assumes that one coefficient is coded after another. This work analyzes the mechanisms employed in bitplane coding and proposes alternatives to enhance opportunities for parallelism. We describe a stationary probability model that, without sacrificing the advantages of current approaches, removes the main obstacle to the parallelization of most coding strategies. Experimental tests evaluate the coding performance achieved by the proposed method in the framework of JPEG2000 when coding different types of images. Results indicate that the stationary probability model achieves similar coding performance, with slight increments or decrements depending on the image type and the desired level of parallelism.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Entropy-based evaluation of context models for wavelet-transformed images

  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
Entropy is a measure of a message uncertainty. Among others aspects, it serves to determine the minimum coding rate that practical systems may attain. This paper defines an entropy-based measure to evaluate context models employed in wavelet-based image coding. The proposed measure is defined considering the mechanisms utilized by modern coding systems. It establishes the maximum performance achievable with each context model. This helps to determine the adequateness of the model under different coding conditions and serves to predict with high precision the coding rate achieved by practical systems. Experimental results evaluate four well-known context models using different types of images, coding rates, and transform strategies. They reveal that, under specific coding conditions, some widely-spread context models may not be as adequate as it is generally thought. The hints provided by this analysis may help to design simpler and more efficient wavelet-based image codecs.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

General embedded quantization for wavelet-based lossy image coding

  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
Embedded quantization is a mechanism employed by many lossy image codecs to progressively refine the distortion of a (transformed) image. Currently, the most common approach to do so in the context of wavelet-based image coding is to couple uniform scalar deadzone quantization (USDQ) with bitplane coding (BPC). USDQ+BPC is convenient for its practicality and has proved to achieve competitive coding performance. But the quantizer established by this scheme does not allow major variations. This paper introduces a multistage quantization scheme named general embedded quantization (GEQ) that provides more flexibility to the quantizer. GEQ schemes can be devised for specific decoding rates achieving optimal coding performance. Practical approaches of GEQ schemes achieve coding performance similar to that of USDQ+BPC while requiring fewer quantization stages. The performance achieved by GEQ is evaluated in this paper through experimental results carried out in the framework of modern image coding systems.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Lossy-to-lossless 3D image coding through prior coefficient lookup tables

  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Marcellin, Michael W.|||0000-0001-9606-134X
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
This paper describes a low-complexity, highefficiency, lossy-to-lossless 3D image coding system. The proposed system is based on a novel probability model for the symbols that are emitted by bitplane coding engines. This probability model uses partially reconstructed coefficients from previous components together with a mathematical framework that captures the statistical behavior of the image. An important aspect of this mathematical framework is its generality, which makes the proposed scheme suitable for different types of 3D images. The main advantages of the proposed scheme are competitive coding performance, low computational load, very low memory requirements, straightforward implementation, and simple adaptation to most sensors.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

JPIP proxy server with prefetching strategies based on user-navigation model and semantic map

  • Monteagudo Pereira, José Lino
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
The efficient transmission of large resolution images and, in particular, the interactive transmission of images in a client-server scenario, is an important aspect for many applications. Among the current image compression standards, JPEG2000 excels for its interactive transmission capabilities. In general, three mechanisms are employed to optimize the transmission of images when using the JPEG2000 Interactive Protocol (JPIP): 1) packet re-sequencing at the server; 2) prefetching at the client; and 3) proxy servers along the network infrastructure. To avoid the congestion of the network, prefetching mechanisms are not commonly employed when many clients within a local area network (LAN) browse images from a remote server. Aimed to maximize the responsiveness of all the clients within a LAN, this work proposes the use of prefetching strategies at the proxy server -rather than at the clients. The main insight behind the proposed prefetching strategies is a user-navigation model and a semantic map that predict the future requests of the clients. Experimental results indicate that the introduction of these strategies into a JPIP proxy server enhances the browsing experience of the end-users notably.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Isorange pairwise orthogonal transform

  • Blanes, Ian|||0000-0001-8939-1666
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • Marcellin, Michael W.|||0000-0001-9606-134X
Spectral transforms are tools commonly employed in multi- and hyperspectral data compression to decorrelate images in the spectral domain. The Pairwise Orthogonal Transform (POT) is one such transform that has been specifically devised for resource-constrained contexts like those found on board satellites or airborne sensors. Combining the POT with a 2D coder yields an efficient compressor for multi- and hyperspectral data. However, a drawback of the original POT is that its dynamic range expansion -i.e., the increase in bit depth of transformed images- is not constant, which may cause problems with hardware implementations. Additionally, the dynamic range expansion is often too large to be compatible with the current 2D standard CCSDS 122.0-B-1. This paper introduces the Isorange Pairwise Orthogonal Transform, a derived transform that has a small and limited dynamic range expansion, compatible with CCSDS 122.0-B-1 in almost all scenarios. Experimental results suggest that the proposed transform achieves lossy coding performance close to that of the original transform. For lossless coding, the original POT and the proposed isorange POT achieve virtually the same performance.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A Tutorial on image compression for optical space imaging systems

  • Blanes, Ian|||0000-0001-8939-1666
  • Magli, Enrico|||0000-0002-0901-0251
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
Abstract-Public policies and private initiatives share the will to explore outer space and to monitor the Earth from space sensors. Recent years have seen an increased number of space missions, while the sensors on board aircrafts or spacecrafts have also significantly improved their acquisition capabilities. Given this huge volume of remote sensing data and the detailed characteristics of the acquired images, a data compression process is in order to allow as large a transmission rate as possible. In this paper we provide an overview of several standards for remote sensing data compression, notably of those recently approved by the Consultative Committee for Space Data Systems, although the use of other ISO/IEC image coding standards is also dealt with. Discussion embraces both mono band and multi band compression, and lossless, lossy and near-lossless compression. Illustrative results are reported for a set of AVIRIS and Hyperion images, indicating that exploiting the spectral correlation -either in prediction-based or in transform-based schemes- is paramount to achieve improved coding performance.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Performance impact of parameter tuning on the CCSDS-123 lossless multi- and hyperspectral image compression standard

  • Augé, Stanislau
  • Sánchez, José Enrique
  • Kiely, Aaron
  • Blanes, Ian|||0000-0001-8939-1666
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
Multispectral and hyperspectral image data payloads have large size and may be challenging to download from remote sensors. To alleviate this problem, such images can be effectively compressed using specially designed algorithms. The new CCSDS-123 standard has been developed to address onboard lossless coding of multispectral and hyperspectral images. The Standard is based on the Fast Lossless (FL) algorithm, which is composed of a causal context-based prediction stage and an entropy-coding stage that utilizes Golomb power-of-two codes. Several parts of each of these two stages have adjustable parameters. CCSDS-123 provides satisfactory performance for a wide set of imagery acquired by various sensors, but end-users of a CCSDS-123 implementation may require assistance to select a suitable combination of parameters for a specific application scenario. To assist end-users, this paper investigates the performance of CCSDS-123 under different parameter combinations and addresses the selection of an adequate combination given a specific sensor. Experimental results suggest that prediction parameters have a greater impact on the compression performance than entropy-coding parameters.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Correlation modeling for compression of computed tomography images

  • Muñoz Gómez, Juan
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Marcellin, Michael W.|||0000-0001-9606-134X
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
Abstract-Computed Tomography (CT) is a noninvasive medical test obtained via a series of X-ray exposures resulting in 3D images that aid medical diagnosis. Previous approaches for coding such 3D images propose to employ multi-component transforms to exploit correlation among CT slices, but these approaches do not always improve coding performance with respect to a simpler slice-by-slice coding approach. In this work, we propose a novel analysis which accurately predicts when the use of a multi-component transform is profitable. This analysis models the correlation coefficient r based on image acquisition parameters readily available at acquisition time. Extensive experimental results from multiple image sensors suggest that multi-component transforms are appropriate for images with correlation coefficient r in excess of 0.87.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

On the hardware implementation of the arithmetic elements of the pairwise orthogonal transform

  • Santos, Lucana
  • Blanes, Ian|||0000-0001-8939-1666
  • García, Aday
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • López Blanco, José Manuel|||0000-0002-4104-6262
  • Sarminto, Roberto
The pairwise orthogonal transform (POT) is an attractive alternative to the Kahrunen-Loève transform for spectral decorrelation in on-board multispectral and hyperspectral image compression due to its reduced complexity. This work validates that the low complexity of the POT makes it feasible for a space-qualified field-programmable gate array (FPGA) implementation. A register transfer level description of the arithmetic elements of the POT is provided with the aim of achieving a low occupancy of resources and making it possible to synthesize the design on a space-qualified RTAX2000S and RTAX2000S-DSP. In order to accomplish these goals, the operations of the POT are fine-tuned such that their implementation footprint is minimized while providing equivalent coding performance. The most computationally demanding operations are solved by means of a lookup table. An additional contribution of this paper is a bit-exact description of the mathematical equations that are part of the transform, defined in such a way that they can be solved with integer arithmetic and implementations that can be easily cross-validated. Experimental results are presented, showing that it is feasible to implement the components of the POT on the mentioned FPGA.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A fully embedded two-stage coder for hyperspectral near-lossless compression

  • Beerten, Jente
  • Blanes, Ian|||0000-0001-8939-1666
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
This letter proposes a near-lossless coder for hyperspectral images. The coding technique is fully embedded and minimizes the distortion in the l2 norm initially and in the l∞ norm subsequently. Based on a two-stage near-lossless compression scheme, it includes a lossy and a near-lossless layer. The novelties are: the observation of the convergence of the entropy of the residuals in the original domain and in the spectral-spatial transformed domain; and an embedded near-lossless layer. These contributions enable a progressive transmission while optimising both SNR and PAE performance. The embeddedness is accomplished by bitplane encoding plus arithmetic encoding. Experimental results suggest that the proposed method yields a highly competitive coding performance for hyperspectral images, outperforming multi-component JPEG2000 for l∞ norm and pairing its performance for l2 norm, and also outperforming M-CALIC in the near-lossless case -for PAE ≥5-.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Analysis-driven lossy compression of DNA microarray images

  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Blanes, Ian|||0000-0001-8939-1666
  • Pinho, Armando J.|||0000-0002-9164-0016
  • Marcellin, Michael W.|||0000-0001-9606-134X
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
DNA microarrays are one of the fastest-growing new technologies in the field of genetic research, and DNA microarray images continue to grow in number and size. Since analysis techniques are under active and ongoing development, storage, transmission and sharing of DNA microarray images need be addressed, with compression playing a significant role. However, existing lossless coding algorithms yield only limited compression performance (compression ratios below 2:1), whereas lossy coding methods may introduce unacceptable distortions in the analysis process. This work introduces a novel Relative Quantizer (RQ), which employs non-uniform quantization intervals designed for improved compression while bounding the impact on the DNA microarray analysis. This quantizer constrains the maximum relative error introduced into quantized imagery, devoting higher precision to pixels critical to the analysis process. For suitable parameter choices, the resulting variations in the DNA microarray analysis are less than half of those inherent to the experimental variability. Experimental results reveal that appropriate analysis can still be performed for average compression ratios exceeding 4.5:1.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Proposal for infrared atmospheric sounding interferometer on-board data compression

  • García-Sobrino, Joaquín|||0000-0003-3808-7132
  • Blanes, Ian|||0000-0001-8939-1666
  • Albinet, Mathieu
  • Camarero, Roberto
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
The Infrared Atmospheric Sounding Interferometer (IASI) system provides infrared soundings of moisture and temperature profiles, as well as soundings of chemical components. These measurements play a key role in atmospheric chemistry, global change and climate monitoring. The instrument, developed by a cooperating agreement between EUMETSAT and CNES, is implemented on the Metop satellite series. The instrument data production rate is 45 Megabits/s while the transmission rate allocated to IASI measurements is 1.5 Megabits/s. It is thus necessary to implement a significant part of the IASI data processing on board the instrument. In this paper we investigate the information statistics of IASI L0 data once the on-board processing chain is finished. We analyze order-0 entropy, and order-1, order-2 and order-3 conditional entropies, where conditional entropies assess both the spectral and the spatial joint information. According to the simple order-0 entropy, at least one bit per sample could be spared if a variable-length code were employed. We also investigate the actual performance of different lossless compression techniques on IASI L0 data. The CCSDS-123, JPEG-LS and JPEG2000 standards, as well as M-CALIC coding technique are evaluated. Experimental results reveal that IASI Level 0 data can be coded by a compression ratio above 2.6:1.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Hybrid compression of hyperspectral images based on PCA with pre-encoding discriminant information

  • Lee, Chulhee
  • Youn, Sungwook
  • Jeong, Taeuk
  • Lee, Eunjae
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
It has been shown that image compression based on principal component analysis (PCA) provides good compression efficiency for hyperspectral images. However, PCA might fail to capture all the discriminant information of hyperspectral images, since features that are important for classification tasks may not be high in signal energy. To deal with this problem, we propose a hybrid compression method for hyperspectral images with pre-encoding discriminant information. A feature extraction method is first applied to the original images, producing a set of feature vectors that are used to generate feature images and then residual images by subtracting the feature-reconstructed images from the original ones. Both feature images and residual images are compressed and transmitted. Experiments on data from the Airborne Visible/Infrared Imaging Spectrometer sensor indicate that the proposed method provides better compression efficiency with improved classification accuracy than conventional compression methods.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Efficient storage of microCT data preserving bone morphometry assessment

  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Blanes, Ian|||0000-0001-8939-1666
  • Marcellin, Michael W.|||0000-0001-9606-134X
  • Sánchez Silva, Víctor Francisco|||0000-0002-7089-7031
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
Preclinical micro-computed tomography (microCT) images are of utility for 3D morphological bone evaluation, which is of great interest in cancer detection and treatment development. This work introduces a compression strategy for microCTs that allocates specific substances in different Volumes of Interest (VoIs). The allocation procedure is conducted by the Hounsfield scale. The VoIs are coded independently and then grouped in a single DICOM-compliant file. The proposed method permits the use of different codecs, identifies and transmit data corresponding to a particular substance in the compressed domain without decoding the volume(s), and allows the computation of the 3D morphometry without needing to store or transmit the whole image. The proposed approach reduces the transmitted data in more than 90% when the 3D morphometry evaluation is performed in high density and low density bone. This work can be easily extended to other imaging modalities and applications that work with the Hounsfield scale.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Cell-based 2-step scalar deadzone quantization for high bit-depth hyperspectral image coding

  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
Remote sensing images often need to be coded and/or transmitted with constrained computational resources. Among other features, such images commonly have high spatial, spectral, and bit-depth resolution, which may render difficult their handling. This letter introduces an embedded quantization scheme based on two-step scalar deadzone quantization (2SDQ) that enhances the quality of transmitted images when coded with a constrained number of bits. The proposed scheme is devised for use in JPEG2000. It is named cell-based 2SDQ since it uses cells, i.e., small sets of wavelet coefficients within the codeblocks defined by JPEG2000. Cells permit a finer discrimination of coefficients in which to apply the proposed quantizer. Experimental results indicate that the proposed scheme is especially beneficial for high bit-depth hyperspectral images.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Context-adaptive binary arithmetic coding with fixed-length codewords

  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
Context-adaptive binary arithmetic coding is a widespread technique in the field of image and video coding. Most state-of-the-art arithmetic coders produce a (long) codeword of a priori unknown length. Its generation requires a renormalization procedure to permit progressive processing. This paper introduces two arithmetic coders that produce multiple codewords of fixed length. Contrary to the traditional approach, the generation of fixed-length codewords does not require renormalization since the whole interval arithmetic is stored in the coder's internal registers. The proposed coders employ a new context-adaptive mechanism based on variable-size sliding window that estimates with high precision the probability of the symbols coded. Their integration in coding systems is straightforward as demonstrated within the framework of JPEG2000. Experimental tests indicate that the proposed coders are computationally simpler than the MQ coder of JPEG2000 and the M coder of HEVC while achieving superior coding efficiency.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Implementation of the DWT in a GPU through a register-based strategy

  • Enfedaque Montes, Pablo
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Moure, Juan C.|||0000-0001-6697-0331
The release of the CUDA Kepler architecture in March 2012 has provided Nvidia GPUs with a larger register memory space and instructions for the communication of registers among threads. This facilitates a new programming strategy that utilizes registers for data sharing and reusing in detriment of the shared memory. Such a programming strategy can significantly improve the performance of applications that reuse data heavily. This paper presents a register-based implementation of the Discrete Wavelet Transform (DWT), the prevailing data decorrelation technique in the field of image coding. Experimental results indicate that the proposed method is, at least, four times faster than the best GPU implementation of the DWT found in the literature. Furthermore, theoretical analysis coincide with experimental tests in proving that the execution times achieved by the proposed implementation are close to the GPU's performance limits.
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)

Bitplane image coding with parallel coefficient processing

  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Enfedaque Montes, Pablo
  • Moure, Juan C.|||0000-0001-6697-0331
  • Sánchez Silva, Víctor Francisco|||0000-0002-7089-7031
Image coding systems have been traditionally tailored for multiple instruction, multiple data (MIMD) computing. In general, they partition the (transformed) image in codeblocks that can be coded in the cores of MIMD-based processors. Each core executes a sequential flow of instructions to process the coefficients in the codeblock, independently and asynchronously from the others cores. Bitplane coding is a common strategy to code such data. Most of its mechanisms require sequential processing of the coefficients. The last years have seen the upraising of processing accelerators with enhanced computational performance and power efficiency whose architecture is mainly based on the single instruction, multiple data (SIMD) principle. SIMD computing refers to the execution of the same instruction to multiple data in a lockstep synchronous way. Unfortunately, current bitplane coding strategies cannot fully profit from such processors due to inherently sequential coding task. This paper presents bitplane image coding with parallel coefficient (BPC-PaCo) processing, a coding method that can process many coefficients within a codeblock in parallel and synchronously. To this end, the scanning order, the context formation, the probability model, and the arithmetic coder of the coding engine have been re-formulated. The experimental results suggest that the penalization in coding performance of BPC-PaCo with respect to the traditional strategies is almost negligible.
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)

Progressive lossy-to-lossless compression of DNA microarray images

  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Blanes, Ian|||0000-0001-8939-1666
  • Pinho, Armando J.|||0000-0002-9164-0016
  • Marcellin, Michael W.|||0000-0001-9606-134X
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
The analysis techniques applied to DNA microarray images are under active development. As new techniques become available, it will be useful to apply them to existing microarray images to obtain more accurate results. The compression of these images can be a useful tool to alleviate the costs associated to their storage and transmission. The recently proposed Relative Quantizer (RQ) coder provides the most competitive lossy compression ratios while introducing only acceptable changes in the images. However, images compressed with the RQ coder can only be reconstructed with a limited quality, determined before compression. In this work, a progressive lossy-to-lossless scheme is presented to solve this problem. First, the regular structure of the RQ intervals is exploited to define a lossy-to-lossless coding algorithm called the Progressive RQ (PRQ) coder. Second, an enhanced version that prioritizes a region of interest, called the PRQ-region of interest (ROI) coder, is described. Experiments indicate that the PRQ coder offers progressivity with lossless and lossy coding performance almost identical to the best techniques in the literature, none of which is progressive. In turn, the PRQ-ROI exhibits very similar lossless coding results with better rate-distortion performance than both the RQ and PRQ coders.
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.