Skip to main content

Resultados relacionados

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

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

Enhanced JPEG2000 Quality Scalability through Block-Wise Layer Truncation

  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
Quality scalability is an important feature of image and video coding systems. In JPEG2000, quality scalability is achieved through the use of quality layers that are formed in the encoder through rate-distortion optimization techniques. Quality layers provide optimal rate-distortion representations of the image when the codestream is transmitted and/or decoded at layer boundaries. Nonetheless, applications such as interactive image transmission, video streaming, or transcoding demand layer fragmentation. The common approach to truncate layers is to keep the initial prefix of the to-be-truncated layer, which may greatly penalize the quality of decoded images, especially when the layer allocation is inadequate. So far, only one method has been proposed in the literature providing enhanced quality scalability for compressed JPEG2000 imagery. However, that method provides quality scalability at the expense of high computational costs, which prevents its application to the aforementioned applications. This paper introduces a Block-Wise Layer Truncation (BWLT) that, requiring negligible computational costs, enhances the quality scalability of compressed JPEG2000 images. The main insight behind BWLT is to dismantle and reassemble the to-be-fragmented layer by selecting the most relevant codestream segments of codeblocks within that layer. The selection process is conceived from a rate-distortion model that finely estimates rate-distortion contributions of codeblocks. Experimental results suggest that BWLT achieves near-optimal performance even when the codestream contains a single quality layer.
Dipòsit Digital de Documents de la UAB
Publication 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
Publication 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
Publication 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
Publication Artículo científico (JournalArticle)

FAST rate allocation for JPEG2000 video transmission over time-varying channels

  • Jiménez Rodríguez, Leandro
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
  • Marcellin, Michael W.|||0000-0001-9606-134X
This work introduces a rate allocation method for the transmission of pre-encoded JPEG2000 video over timevarying channels, which vary their capacity during video transmission due to network congestion, hardware failures, or router saturation. Such variations occur often in networks and are commonly unpredictable in practice. The optimization problem is posed for such networks and a rate allocation method is formulated to handle such variations. The main insight of the proposed method is to extend the complexity scalability features of the FAst rate allocation through STeepest descent (FAST) algorithm. Extensive experimental results suggest that the proposed transmission scheme achieves near-optimal performance while expending few computational resources.
Dipòsit Digital de Documents de la UAB
Publication 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
Publication 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
Publication 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
Publication Artículo científico (JournalArticle)

Divide-and-conquer strategies for hyperspectral image processing, a review of their benefits and advantages

  • Blanes, Ian|||0000-0001-8939-1666
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • Marcellin, Michael W.|||0000-0001-9606-134X
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
In the field of geophysics, huge volumes of information often need to be processed with complex and time-consuming algorithms to better understand the nature of the data at hand. A particularly useful instrument within a geophysicists toolbox is a set of decorrelating transforms. Such transforms play a key role in the acquisition and processing of satellite-gathered information, and notably in the processing of hyperspectral images. Satellite images have a substantial amount of redundancy that not only renders the true nature of certain events less perceivable to geophysicists but also poses an issue to satellite makers, who have to exploit this data redundancy in the design of compression algorithms due to the constraints of down-link channels. This issue is magnified for hyperspectral imaging sensors, which capture hundreds of visual representations of a given targeteach representation (called a component or a band) for a small range of the light spectrum. Although seldom alone, decorrelation transforms are often used to alleviate this situation by changing the original data space into a representation where redundancy is decreased and valuable information is more apparent.
Dipòsit Digital de Documents de la UAB
Publication 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
Publication 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
Publication Artículo científico (JournalArticle)

Permutation decoding of Z₂Z₄-linear codes

  • Bernal, José Joaquín
  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Villanueva, M.|||0000-0001-6179-0833
An alternative permutation decoding method is described which can be used for any binary systematic encoding scheme, regardless whether the code is linear or not. Thus, the method can be applied to some important codessuch as Z₂Z₄ -linear codes, which are binary and, in general, nonlinear codes in the usual sense. For this, it is proved that these codes allow a systematic encoding scheme. As particular examples, this permutation decoding method is applied to some Hadamard Z₂Z₄ -linear codes.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Families of completely transitive codes and distance transitive graphs

  • Borges, Joaquim|||0000-0002-5774-4874
  • Rifà, Josep|||0000-0001-9199-4001
  • Zinoviev, Victor|||0000-0002-7639-6115
In a previous work, the authors found new families of linear binary completely regular codes with the covering radius ρ = 3 and ρ = 4. In this paper, the automorphism groups of such codes are computed and it is proven that the codes are not only completely regular, but also completely transitive. From these completely transitive codes, in the usual way, i.e., as coset graphs, new presentations of infinite families of distance transitive coset graphs of diameter three and four, respectively, are constructed.
Dipòsit Digital de Documents de la UAB
Publication Capítulo o parte de un libro (BookPart)

Nonlinear q-ary codes, constructions and minimum distance computation

  • Villanueva, M.|||0000-0001-6179-0833
  • Zeng, Fanxuan
  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
A nonlinear code can be represented as the union of cosets of a linear subcode. Properties and constructions of new codes from given ones in terms of this representation can be described. Algorithms to compute the minimum distance of nonlinear codes, based on known algorithms for linear codes, are also established. Moreover, the performance of these algorithms is studied and an estimation of the number of enumerated codewords needed in the computations is given.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

JPEG2000 ROI coding through component priority for digital mammography

  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
Region Of Interest (ROI) coding is a prominent feature of some image coding systems aimed to prioritize specific areas of the image through the construction of a codestream that, decoded at increasing bit-rates, recovers the ROI first and with higher quality than the rest of the image. JPEG2000 is a wavelet-based coding system that is supported in the Digital Imaging and Communications in Medicine (DICOM) standard. Among other features, JPEG2000 provides lossy-to-lossless compression and ROI coding, which are especially relevant to the medical community. But, due to JPEG2000 supported ROI coding methods that guarantee lossless coding are not designed to achieve a high degree of accuracy to prioritize ROIs, they have not been incorporated in the medical community. - This paper introduces a ROI coding method that is able to prioritize multiple ROIs at different priorities, guaranteeing lossy-to-lossless coding. The proposed ROI Coding Through Component Prioritization (ROITCOP) method uses techniques of rate-distortion optimization combined with a simple yet effective strategy of ROI allocation that employs the multi-component support of JPEG2000 codestream. The main insight in ROITCOP is the allocation of each ROI to an component. Experimental results indicate that this ROI allocation strategy does not penalize coding performance whilst achieving an unprecedented degree of accuracy to delimit ROIs. - The proposed ROITCOP method maintains JPEG2000 compliance, thus easing its use in medical centers to share images. This paper analyzes in detail the use of ROITCOP to mammographies, where the ROIs are identified by computer-aided diagnosis. Extensive experimental tests using various ROI coding methods suggest that ROITCOP achieves enhanced coding performance.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Standard and specific compression techniques for DNA microarray images

  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Blanes, Ian|||0000-0001-8939-1666
  • Marcellin, Michael W.|||0000-0001-9606-134X
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
We review the state of the art in DNA microarray image compression and provide original comparisons between standard and microarray-specific compression techniques that validate and expand previous work. First, we describe the most relevant approaches published in the literature and classify them according to the stage of the typical image compression process where each approach makes its contribution, and then we summarize the compression results reported for these microarray-specific image compression schemes. In a set of experiments conducted for this paper, we obtain new results for several popular image coding techniques that include the most recent coding standards. Prediction-based schemes CALIC and JPEG-LS are the best-performing standard compressors, but are improved upon by the best microarray-specific technique, Battiato's CNN-based scheme.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Q-ary codes

  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
  • Villanueva, M.|||0000-0001-6179-0833
The research group CCSG (Combinatorics, Coding and Security Group) is one of the research groups in the dEIC (Department of Information and Communications Engineering) at the UAB (Universitat Aut'onoma de Barcelona) in Spain. From 1987 the team CCSG has been uninterruptedly working in several projects and research activities on Information Theory, Communications, Coding Theory, Source Coding, Teledetection, Cryptography, Electronic Voting, e-Auctions, Mobile Agents, etc. The more important know-how of CCSG is about algorithms for forward error correction (FEC), such as Golay codes, Hamming product codes, Reed-Solomon codes, Preparata and Preparata-like codes, (extended) nonlinear 1-perfect codes, Z4-linear codes, Z2Z4-linear codes, etc.; computations of the rank and the dimension of the kernel for nonlinear codes as binary 1-perfect codes, q-ary 1-perfect codes, Preparata codes, Hadamard codes, Kerdock codes, quaternary Reed-Muller codes, etc.; the existence and structural properties for 1-perfect codes, uniformly packed codes, completely regular codes, completely transitive codes, etc.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Z2Z4-additive codes

  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Gastón Brasó, Bernat
  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
  • Rifà, Josep|||0000-0001-9199-4001
  • Villanueva, M.|||0000-0001-6179-0833
The Combinatoric, Coding and Security Group (CCSG) is a research group in the Department of Information and Communications Engineering (DEIC) at the Universitat Aut'onoma de Barcelona (UAB). The research group CCSG has been uninterruptedly working since 1987 in several projects and research activities on Information Theory, Communications, Coding Theory, Source Coding, Cryptography, Electronic Voting, Network Coding, etc. The members of the group have been producing mainly results on optimal coding. Specifically, the research has been focused on uniformly-packed codes; perfect codes in the Hamming space; perfect codes in distance-regular graphs; the classification of optimal codes of a given length; and codes which are close to optimal codes by some properties, for example, Reed-Muller codes, Preparata codes, Kerdock codes and Hadamard codes. Part of the research developed by CCSG deals with Z2Z4-linear codes. There are no symbolic software to work with these codes, so the members of CCSG have been developing this new package that supports the basic facilities for Z2Z4-additive codes. Specifically, this Magma package generalizes most of the known functions for codes over the ring Z4, which are subgroups of Zn4, to Z2Z4-additive codes, which are subgroups of Zγ2 × Zδ4, maintaining all the functionality for codes over Z4 and adding new functions which, not only generalize the previous ones, but introduce new variants when it is needed. A beta version of this new package for Z2Z4-additive codes and this manual with the description of all functions can be downloaded from the web page http://ccsg.uab.cat. For any comment or further information about this package, you can send an e-mail to support-ccsg@deic.uab.cat. The authors would like to thank Lorena Ronquillo, Jaume Pernas, Roger Ten-Valls, and Cristina Diéguez for their contributions developing some parts of this Magma package.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Cost and scalability improvements to the Karhunen-Loéve transform for remote-sensing image coding

  • Blanes, Ian|||0000-0001-8939-1666
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
The Karhunen-Loêve transform (KLT) is widely used in hyperspectral image compression because of its high spectral decorrelation properties. However, its use entails a very high computational cost. To overcome this computational cost and to increase its scalability, in this paper, we introduce a multilevel clustering approach for the KLT. As the set of different multilevel clustering structures is very large, a two-stage process is used to carefully pick the best members for each specific situation. First, several candidate structures are generated through local search and eigenthresholding methods, and then, candidates are further screened to select the best clustering configuration. Two multilevel clustering combinations are proposed for hyperspectral image compression: one with the coding performance of the KLT but with much lower computational requirements and increased scalability and another one that outperforms a lossy wavelet transform, as spectral decorrelator, in quality, cost, and scalability. Extensive experimental validation is performed, with images from both the AVIRIS and Hyperion sets, and with JPEG2000, 3D-TCE, and CCSDS-Image Data Compression recommendation as image coders. Experiments also include classification-based results produced by k-means clustering and Reed-Xiaoli anomaly detection.