Skip to main content

Resultados relacionados

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

Dipòsit Digital de Documents de la UAB
Publication 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.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Measuring QoS in an Aeronautical Opportunistic Network Architecture with Limited Access to a Satellite Communications Backhaul

  • Martínez Vidal, Rubén|||0000-0002-9767-4057
  • Martí, Ramon|||0000-0003-3887-2165
  • Sreenan, Cormac J.|||0000-0002-0767-7888
  • Borrell i Viader, Joan|||0000-0001-6649-0450
We measure quality of service (QoS) in a wireless network architecture of transoceanic aircraft. A distinguishing characteristic of the network scheme we analyze is that it mixes the concept of Delay Tolerant Networking (DTN) through the exploitation of opportunistic contacts, together with direct satellite access in a limited number of the nodes. We provide a graph sparsification technique for deriving a network model that satisfies the key properties of a real aeronautical opportunistic network while enabling scalable simulation. This reduced model allows us to analyze the impact regarding QoS of introducing Internet-like traffic in the form of outgoing data from passengers. Promoting QoS in DTNs is usually really challenging due to their long delays and scarce resources. The availability of satellite communication links offers a chance to provide an improved degree of service regarding a pure opportunistic approach, and therefore it needs to be properly measured and quantified. Our analysis focuses on several QoS indicators such as delivery time, delivery ratio, and bandwidth allocation fairness. Obtained results show significant improvements in all metric indicators regarding QoS, not usually achievable on the field of DTNs.
Dipòsit Digital de Documents de la UAB
Publication 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
Publication 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
Publication 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
Publication Artículo científico (JournalArticle)

Classification of the Z₂ Z₄-linear Hadamard codes and their automorphism groups

  • Krotov, Denis S.
  • Villanueva, M.|||0000-0001-6179-0833
A Z₂ Z₄-linear Hadamard code of length α + 2β = 2t is a binary Hadamard code, which is the Gray map image of a Z₂ Z₄-additive code with α binary coordinates and β quaternary coordinates. It is known that there are exactly ⌊t-1/2⌋ and ⌊t/2⌋ nonequivalent Z₂ Z₄-linear Hadamard codes of length 2t, with α = 0 and α ≠ 0, respectively, for all t ≥ 3. In this paper, it is shown that each Z₂ Z₄-linear Hadamard code with α = 0 is equivalent to a Z₂ Z₄-linear Hadamard code with α ≠ 0, so there are only ⌊t/2⌋ nonequivalent Z₂ Z₄-linear Hadamard codes of length 2t. Moreover, the order of the monomial automorphism group for the Z2Z4-additive Hadamard codes and the permutation automorphism group of the corresponding Z₂ Z₄-linear Hadamard codes are given.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Methodological evaluation of architectural alternatives for an aeronautical delay tolerant network

  • Martínez Vidal, Rubén|||0000-0002-9767-4057
  • Martí Escalé, Ramon|||0000-0001-8203-5642
  • Sreenan, Cormac J.|||0000-0002-0767-7888
  • Borrell i Viader, Joan|||0000-0001-6649-0450
In this paper, we use graph analysis to evaluate the network architecture of a large scale delay tolerant network (DTN) of transoceanic aircraft. At LCN (Local Computer Networks) 2014 we analyzed information propagation inside a pure opportunistic version of this network, a scenario constructed from more than 2,500 traces of transatlantic flights in which communications relied only on the sporadic contacts between airplanes. As only a small percentage of the nodes were capable of performing efficient air-to-ground communications we concluded the need to devise a more suitable network architecture by combining opportunistic and satellite communication systems. We propose a generic methodology based on graph analysis (both static and dynamic temporal) to evaluate the different ways to create this new architecture. We show the architectural combination that most improves the network delivery performance while minimizing its deployment costs.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Efficient representation of binary nonlinear codes, constructions and minimum distance computation

  • Villanueva, M.|||0000-0001-6179-0833
  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
  • Zeng, Fanxuan
A binary nonlinear code can be represented as a union of cosets of a binary linear subcode. In this paper, the complexity of some algorithms to obtain this representation is analyzed. Moreover, some properties and constructions of new codes from given ones in terms of this representation are described. Algorithms to compute the minimum distance of binary nonlinear codes, based on known algorithms for linear codes, are also established, along with an algorithm to decode such codes. All results are written in such a way that they can be easily transformed into algorithms, and the performance of these algorithms is evaluated.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Construction of Hadamard Z₂Z₄Q₈-codes for each allowable value of the rank and dimension of the kernel

  • Montolio, Pere
  • Rifà, Josep|||0000-0001-9199-4001
This work deals with Hadamard Z₂Z₄Q₈-codes, which are binary codes after a Gray map from a subgroup of a direct product of Z₂, Z₄ and Q₈ groups, where Q₈ is the quaternionic group. In a previous work, these kind of codes were classified in five shapes. In this paper we analyze the allowable range of values for the rank and dimension of the kernel, which depends on the particular shape of the code. We show that all these codes can be represented in a standard form, from a set of generators, which help to understand the characteristics of each shape. The main results we present are the characterization of Hadamard Z₂Z₄Q₈-codes as a quotient of a semidirect product of Z₂Z₄-linear codes and, on the other hand, the construction of Hadamard Z₂Z₄Q₈-codes with each allowable pair of values for the rank and dimension of the kernel.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Endeavouring to be in the good books, awarding DTN network use for acknowledging the reception of bundles

  • Sánchez-Carmona, Adrián|||0000-0003-0813-3927
  • Robles, Sergi|||0000-0002-9924-2477
  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
This paper describes an incentive scheme for promoting the cooperation, and, therefore, avoiding selfish behaviours, in Delay Tolerant Networks (DTN) by rewarding participant nodes with cryptographic keys that will be required for sending bundles. DTN are normally sparse, and there are few opportunistic contacts, so forwarding of other's bundles can be left out. Moreover, it is difficult to determine the responsible nodes in case of bundle loss. The mechanism proposed in this paper contributes to both problems at the same time. On one hand, cryptographic receipts are generated using time-limited Identity Based Cryptography (IBC) keys to keep track of bundle transmissions. On the other hand, these receipts are used to reward altruistic behaviour by providing newer IBC keys. Finally, these nodes need these IBC keys to send their own bundles. When all nodes behave in a cooperative way, this incentive scheme works as a virtuous circle and achieves a Nash equilibrium, improving very much the network performance in terms of latency. The scheme is not difficult to implement, and it can use an already existing IBC infrastructure used for other purposes in a DTN.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Partial permutation decoding for binary linear Hadamard codes

  • Barrolleta, Roland David
  • Villanueva, M.|||0000-0001-6179-0833
Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permutation automorphism group PAut(C) of a code C in order to assist in decoding. A method to obtain s-PD-sets of size s + 1 for partial permutation decoding for the binary linear Hadamard codes H m of length 2 m , for all m ≥ 4 and 1 < s ≤ (2 m - m - 1)/(1 + m) , is described. Moreover, a recursive construction to obtain s-PD-sets of size s + 1 for H m+1 of length 2 m+1 , from a given s-PD-set of the same size for the Hadamard code of half length H m is also established.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Self-dual codes from 3-class association schemes

  • Bilal, Muhammad
  • Borges, Joaquim|||0000-0002-5774-4874
  • Dougherty, Steven T.
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
3-class association schemes are used to construct binary self-dual codes. We use the pure and bordered construction to get self-dual codes starting from the adjacency matrices of symmetric and non-symmetric 3-class association schemes. In some specific cases, we also study constructions of self-dual codes over Z k . For symmetric 3-class association schemes, we focus on the rectangular scheme and association schemes derived from symmetric designs.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

About a class of Hadamard propelinear codes

  • Rifà, Josep|||0000-0001-9199-4001
  • Suárez Canedo, E.
This article aims to explore the algebraic structure of Hadamard propelinear codes, which are not abelian in general but they have good algebraic and combinatorial properties. We construct a subclass of Hadamard propelinear codes which enlarges the family of the Hadamard translation invariant propelinear codes. Several papers have been devoted to the relations between difference sets, t-designs, cocyclic-matrices and Hadamard groups, and we present a link between them and a class of Hadamard propelinear codes, which we call full propelinear. Finally, as an exemplification, we provide a full propelinear structure for all Hadamard codes of length sixteen.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Z₂Z₄-additive formally self-dual codes

  • Dougherty, Steven T.
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
We study odd and even Z₂Z₄ formally self-dual codes. The images of these codes are binary codes whose weight enumerators are that of a formally self-dual code but may not be linear. Three constructions are given for formally self-dual codes and existence theorems are given for codes of each type defined in the paper.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Families of nested completely regular codes and distance-regular graphs

  • Borges, Joaquim|||0000-0002-5774-4874
  • Rifà, Josep|||0000-0001-9199-4001
  • Zinoviev, Victor|||0000-0002-7639-6115
In this paper infinite families of linear binary nested completely regular codes are constructed. They have covering radius ρ equal to 3 or 4, and are 1/2 i th parts, for i ∈ {1, ... , u} of binary (respectively, extended binary) Hamming codes of length n = 2 m - 1 (respectively, 2 m ), where m = 2u. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter D equal to 3 or 4 are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive. This gives antipodal covers of some distance-regular and distance-transitive graphs.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Self-embeddings of Hamming Steiner triple systems of small order and APN permutations

  • Rifà, Josep|||0000-0001-9199-4001
  • Solov'eva, Faina I.
  • Villanueva, M.|||0000-0001-6179-0833
The classification, up to isomorphism, of all self-embedding monomial power permutations of Hamming Steiner triple systems of order n = 2 m - 1 for small m (m ≤ 22), is given. As far as we know, for m ∈ {5, 7, 11, 13, 17, 19}, all given self-embeddings in closed surfaces are new. Moreover, they are cyclic for all m and nonorientable at least for all m ≤ 19. For any non prime m, the nonexistence of such self-embeddings in a closed surface is proven. The rotation line spectrum for self-embeddings of Hamming Steiner triple systems in pseudosurfaces with pinch points as an invariant to distinguish APN permutations or, in general, to classify permutations, is also proposed. This invariant applied to APN monomial power permutations gives a classification which coincides with the classification of such permutations via CCZ-equivalence, at least up to m ≤ 17.
Dipòsit Digital de Documents de la UAB
Publication

Survey on Z₂Z₄-additive codes

  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
  • Rifà, Josep|||0000-0001-9199-4001
  • Villanueva, M.|||0000-0001-6179-0833
A code C is Z₂Z₄-additive if the set of coordinates can be partitioned into two subsets X and Y such that the punctured code of C by deleting the coordinates outside X (respectively, Y ) is a binary linear code (respectively, a quaternary linear code). The corresponding binary codes of Z₂Z₄-additive codes under an extended Gray map are called Z₂Z₄-linear codes, which seem to be a very distinguished class of binary group codes. As for binary and quaternary linear codes, for these codes the fundamental parameters are shown and standard forms for generator and parity-check matrices are given, defining the appropriate concept of duality. The main results on Z₂Z₄-additive self-dual and Z₂Z₄-additive formally self-dual codes are also presented, as well as, the results on the invariants rank and dimension of the kernel for these codes are given. Several families of important binary codes fall in the class of Z₂Z₄-linear codes. In this survey, we review characterizations, properties and constructions of perfect and extended perfect Z₂Z₄-linear codes, Hadamard Z₂Z₄-linear codes, Reed-Muller Z₂Z₄-linear codes, maximum distance separable Z₂Z₄-linear codes, and Preparata-like and Kerdock-like Z₂Z₄-linear codes. Finally, applications of Z₂Z₄-additive codes to steganography are also presented.
Dipòsit Digital de Documents de la UAB
Publication

On nested completely regular codes and distance regular graphs

  • Borges, Joaquim|||0000-0002-5774-4874
  • Rifà, Josep|||0000-0001-9199-4001
  • Zinoviev, Victor|||0000-0002-7639-6115
Infinite families of linear binary nested completely regular codes with covering radius ρ equal to 3 and 4 are constructed. In the usual way, i.e., as coset graphs, infinite families of embedded distance-regular coset graphs of diameter D = 3 or 4 are constructed. In some cases, the constructed codes are also completely transitive codes and the corresponding coset graphs are distance-transitive.
Dipòsit Digital de Documents de la UAB
Publication

Z₂Z₄-additive cyclic codes, generator polynomials and dual codes

  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Ten Valls, Roger|||0000-0001-5193-7491
A Z₂Z₄-additive code C ⊆ Zα2 × Zβ₄ is called cyclic code if the set of coordinates can be partitioned into two subsets, the set of Z₂ and the set of Z₄ coordinates, such that any cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be identified as submodules of the Z₄[x]-module Z₂[x]/(x^α - 1) × Z₄ [x]/(x^β - 1). The parameters of a Z₂Z₄-additive cyclic code are stated in terms of the degrees of the generator polynomials of the code. The generator polynomials of the dual code of a Z₂Z₄-additive cyclic code are determined in terms of the generator polynomials of the code C.
Dipòsit Digital de Documents de la UAB
Publication

Z₂-double cyclic codes

  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Ten Valls, Roger|||0000-0001-5193-7491
A binary linear code C is a Z2-double cyclic code if the set of coordinates can be partitioned into two subsets such that any cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be identified as submodules of the Z2[x]-module Z2[x]/(x^r - 1) × Z2[x]/(x^s - 1). We determine the structure of Z2-double cyclic codes giving the generator polynomials of these codes. The related polynomial representation of Z2-double cyclic codes and its duals, and the relations between the polynomial generators of these codes are studied.
Dipòsit Digital de Documents de la UAB
Publication

Double cyclic codes over the rings Zα2 × Zβ2 and Zα2 × Zβ4

  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Ten Valls, Roger|||0000-0001-5193-7491
Consider the rings R1 and R2 , such that R1 is an R2-module, and C ⊂ R1α × R2β an additive code. The code C is a double cyclic code if the set of coordinates can be partitioned into two subsets, the set of coordinates in R1 and the set of coordinates in R2 , such that any cyclic shift of the coordinates of both subsets leaves invariant the code. The code can be identified as submodules of the R2[x]-module R1[x]/(x^α - 1) × R2[x]/(x^β - 1). We define two cases. First, when the code C is binary, that is R1 = R2 = Z2 , which is called Z2-double cyclic. The second case is when R1 = Z2 and R2 = Z4 , that is the code is a Z2Z4-additive code, and it is called Z2Z4-cyclic. In both cases, we determine the structure of these double cyclic codes giving their generator polynomials. We also determine the related polynomial representation of its duals in terms of the generator polynomials.
Dipòsit Digital de Documents de la UAB
Publication Capítulo o parte de un libro (BookPart)

PD-sets for (nonlinear) Hadamard Z₄-linear codes

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

Kronecker sums to construct Hadamard full propelinear codes of type CnQ₈

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

On ZprZps-additive cyclic codes

Dipòsit Digital de Documents de la UAB
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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
Publication Artículo científico (JournalArticle)

Ranks and kernels of codes from generalized Hadamard matrices

Dipòsit Digital de Documents de la UAB
Publication 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
Publication Capítulo o parte de un libro (BookPart)

Onion routing in deterministic delay tolerant networks

  • Antunez-Veas, Adrian
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
Deterministic DTNs are networks where the behavior is known in advance or where a repetitive action occurs over time like in public transportation networks. This work proposes the application of an onion routing approach to deterministic DTNs to achieve anonymous communications. We show how the prior stage of path selection in onion routing can be achieved using the information provided by deterministic networks.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

A mobile code bundle extension for application-defined routing in delay and disruption tolerant networking

  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
  • Robles, Sergi|||0000-0002-9924-2477
  • Fàbregues, Àngela|||0000-0001-9712-1690
  • Sánchez-Carmona, Adrián|||0000-0003-0813-3927
In this paper, we introduce software code to improve Delay and Disruption Tolerant Networking (DTN) performance. DTN is extremely useful when source and destination nodes are intermittently connected. DTN implementations use application-specific routing algorithms to overcome those limitations. However, current implementations do not support the concurrent execution of several routing algorithms. In this paper, we contribute to this issue providing a solution that consists on extending the messages being communicated by incorporating software code for forwarding, lifetime control and prioritisation purposes. Our proposal stems from the idea of moving the routing algorithms from the host to the message. This solution is compatible with Bundle Protocol (BP) and facilitates the deployment of applications with new routing needs. A real case study based on an emergency scenario is presented to provide details of a real implementation. Several simulations are presented to prove the feasibility and usability of the system and to analyse its performance in comparison to state-of-the-art approaches.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

About some Hadamard full propelinear (2t,2,2)-codes, Rank and Kernel

  • Bailera, Ivan|||0000-0001-6772-4802
  • Borges, Joaquim|||0000-0002-5774-4874
  • Rifà, Josep|||0000-0001-9199-4001
A new subclass of Hadamard full propelinear codes is introduced in this article. We define the HFP(2t,2,2)-codes as codes with a group structure isomorphic to C₂t × C₂^2. Concepts such as rank and dimension of the kernel are studied, and bounds for them are established. For t odd, r=4t-1 and k=1. For t even, r≤2t and k≠2, and r=2t if and only if t≢0 (mod 4).
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Construction and classification of Z₂s-linear Hadamard codes

  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Vela, C.
  • Villanueva, M|||0000-0001-6179-0833
The Z₂s-additive and Z₂Z₄-additive codes are subgroups of Z₂s^n and Z₂^α × Z₄^β, respectively. Both families can be seen as generalizations of linear codes over Z₂ and Z₄. A Z₂s-linear (resp. Z₂Z₄-linear) Hadamard code is a binary Hadamard code which is the Gray map image of a Z₂s-additive (resp. Z₂Z₄-additive) code. It is known that there are exactly ⌊(t-1)/2⌋ and ⌊t/2⌋ nonequivalent Z₂Z₄-linear Hadamard codes of length 2ᵗ, with α=0 and α≠0, respectively, for all t≥3. In this paper, new Z₂s-linear Hadamard codes are constructed for s>2, which are not equivalent to any Z₂Z₄-linear Hadamard code. Moreover, for each s>2, it is claimed that the new constructed nonlinear Z₂-linear Hadamard codes of length 2ᵗ are pairwise nonequivalent.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Comparing decoding methods for quaternary linear codes

  • Barrolleta, Roland David
  • Pujol Capdevila, Jaume|||0000-0001-5221-3233
  • Villanueva, M.|||0000-0001-6179-0833
Permutation decoding is a technique which involves finding a subset S, called PD-set, of the permutation automorphism group of a code C. Constructions of small PD-sets for partial decoding for two families of Z₄-linear codes (Hadamard and Kerdock) are given. Moreover, different decoding methods for Z₄-linear codes are compared by showing their performance applied to these two families.
Dipòsit Digital de Documents de la UAB
Publication

Linear and cyclic codes over direct product of finite chain rings

  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Ten-Valls, Roger|||0000-0001-5193-7491
We introduce a new type of linear and cyclic codes. These codes are defined over a direct product of two finite chain rings. The definition of these codes as certain submodules of the direct product of copies of these rings is given and the cyclic property is defined. Cyclic codes can be seen as submodules of the direct product of polynomial rings. Generator matrices for linear codes and generator polynomials for cyclic codes are determined.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

PD-sets for Z₄-linear codes, Hadamard and Kerdock codes

  • Barrolleta, Roland David
  • Villanueva, M.|||0000-0001-6179-0833
Permutation decoding is a technique that strongly depends on the existence of a special subset, called PD-set, of the permutation automorphism group of a code. In this paper, a general criterion to obtain s-PD-sets of size s+1, which enable correction up to s errors, for Z₄-linear codes is provided. Furthermore, some explicit constructions of s-PD-sets of size s+1 for important families of (nonlinear) Z₄-linear codes such as Hadamard and Kerdock codes are given.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Kernels and ranks of cyclic and negacyclic quaternary codes

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

Quasi-cyclic codes as cyclic codes over a family of local rings

  • Dougherty, Steven T.
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Ten Valls, Roger|||0000-0001-5193-7491
We give an algebraic structure for a large family of binary quasi-cyclic codes. We construct a family of commutative rings and a canonical Gray map such that cyclic codes over this family of rings produce quasi-cyclic codes of arbitrary index in the Hamming space via the Gray map. We use the Gray map to produce optimal linear codes that are quasi-cyclic.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Z₂Z₄-additive cyclic codes, generator polynomials, and dual codes

  • Borges, Joaquim|||0000-0002-5774-4874
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Ten-Valls, Roger|||0000-0001-5193-7491
A Z₂Z₄-additive code C ⊆ Zα2 × Zβ₄ is called cyclic code if the set of coordinates can be partitioned into two subsets, the set of Z₂ and the set of Z₄ coordinates, such that any cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be identified as submodules of the Z₄[x]-module Z₂[x]/(x^α - 1) × Z₄ [x]/(x^β - 1). The parameters of a Z₂Z₄-additive cyclic code are stated in terms of the degrees of the generator polynomials of the code. The generator polynomials of the dual code of a Z₂Z₄-additive cyclic code are determined in terms of the generator polynomials of the code C.
Dipòsit Digital de Documents de la UAB
Publication Capítulo o parte de un libro (BookPart)

Integral privacy

  • Torra i Reventós, Vicenç|||0000-0002-0368-8037
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
When considering data provenance some problems arise from the need to safely handle provenance related functionality. If some modifications have to be performed in a data set due to provenance related requirements, e.g. remove data from a given user or source, this will affect not only the data itself but also all related models and aggregated information obtained from the data. This is specially aggravated when the data are protected using a privacy method (e.g. masking method), since modification in the data and the model can leak information originally protected by the privacy method. To be able to evaluate privacy related problems in data provenance we introduce the notion of integral privacy as compared to the well known definition of differential privacy.
Dipòsit Digital de Documents de la UAB
Publication 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
Publication 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
Publication 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
Publication

Completely regular codes with different parameters and the same intersection arrays

  • Rifà, Josep|||0000-0001-9199-4001
  • Zinoviev, Victor|||0000-0002-7639-6115
We obtain several classes of completely regular codes with different parameters, but identical intersection array. Given a prime power q and any two natural numbers a, b, we construct completely transitive codes over different fields with covering radius ρ = min{a, b} and identical intersection array, specifically, we construct one code over Fqʳ for each divisor r of a or b. As a corollary, for any prime power q, we show that distance regular bilinear forms graphs can be obtained as coset graphs from several completely regular codes with different parameters.
Dipòsit Digital de Documents de la UAB
Publication 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
Publication Artículo científico (JournalArticle)

Partial permutation decoding for binary linear and Z4-linear Hadamard codes

  • Barrolleta, Roland David|||0000-0002-8792-2571
  • Villanueva, M|||0000-0001-6179-0833
In this paper, s-PD-sets of minimum size s + 1 for partial permutation decoding for the binary linear Hadamard code H_m of length 2^m , for all m ≥ 4 and 2 ≤ s ≤ floor(2^m/(1+m)) -1, are constructed. Moreover, recursive constructions to obtain s-PD-sets of size l ≥ s + 1 for H_{m+1} of length 2^(m+1), from an s-PD-set of the same size for H_m , are also described. These results are generalized to find s-PD-sets for the Z4 -linear Hadamard codes H_{γ,δ} of length 2^m , m = γ + 2δ - 1, which are binary Hadamard codes (not necessarily linear) obtained as the Gray map image of quaternary linear codes of type 2^γ 4^δ . Specifically, s-PD-sets of minimum size s + 1 for H_{γ,δ} , for all δ ≥ 3 and 2 ≤ s ≤ floor(2^(2δ-2)/δ)-1, are constructed and recursive constructions are described.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

About non equivalent completely regular codes with identical intersection array

  • Rifà, Josep|||0000-0001-9199-4001
  • Zinoviev, Victor|||0000-0002-7639-6115
We obtain several classes of completely regular codes with different parameters, but identical intersection array. Given a prime power q and any two natural numbers a, b, we construct completely transitive codes over different fields with covering radius ρ = min{a, b} and identical intersection array, specifically, we construct one code over F_{q^r} for each divisor r of a or b. As a corollary, for any prime power q, we show that distance regular bilinear forms graphs can be obtained as coset graphs from several completely regular codes with different parameters.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Completely regular codes with different parameters giving the same distance-regular coset graphs

  • Rifà, Josep|||0000-0001-9199-4001
  • Zinoviev, Victor|||0000-0002-7639-6115
We construct several classes of completely regular codes with different parameters, but identical intersection array. Given a prime power q and any two natural numbers a,b, we construct completely transitive codes over different fields with covering radius ρ=min{a,b}ρ=min{a,b} and identical intersection array, specifically, one code over F_q^r for each divisor r of a or b. As a corollary, for any prime power qq, we show that distance regular bilinear forms graphs can be obtained as coset graphs from several completely regular codes with different parameters.
Dipòsit Digital de Documents de la UAB
Publication 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
Publication Artículo científico (JournalArticle)

Towards inferring communication patterns in online social networks

  • Balsa, Ero
  • Pérez-Solà, Cristina|||0000-0001-7534-1326
  • Diaz, Claudia
The separation between the public and private spheres on online social networks is known to be, at best, blurred. On the one hand, previous studies have shown how it is possible to infer private attributes from publicly available data. On the other hand, no distinction exists between public and private data when we consider the ability of the online social network (OSN) provider to access them. Even when OSN users go to great lengths to protect their privacy, such as by using encryption or communication obfuscation, correlations between data may render these solutions useless. In this article, we study the relationship between private communication patterns and publicly available OSN data. Such a relationship informs both privacy-invasive inferences as well as OSN communication modelling, the latter being key toward developing effective obfuscation tools. We propose an inference model based on Bayesian analysis and evaluate, using a real social network dataset, how archetypal social graph features can lead to inferences about private communication. Our results indicate that both friendship graph and public traffic data may not be informative enough to enable these inferences, with time analysis having a non-negligible impact on their precision.
Dipòsit Digital de Documents de la UAB
Publication

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
Publication 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
Publication 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
Publication 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
Publication 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
Publication 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
Publication Artículo científico (JournalArticle)

Binary codes, binary codes databases

  • 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ònoma 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)

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)

On Zpr Zps-additive cyclic codes

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

On primitive constant dimension codes and a geometrical sunflower bound

  • Barrolleta, Roland David
  • Storme, Leo
  • Suárez Canedo, E.
  • Vandendriessche, Peter
In this paper we study subspace codes with constant intersection dimension (SCIDs). We investigate the largest possible dimension spanned by such a code that can yield non-sunflower codes, and classify the examples attaining equality in that bound as one of two infinite families. We also construct a new infinite family of primitive SCIDs.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Filling in the missing link between simulation and application in opportunistic networking

  • Sánchez-Carmona, Adrián|||0000-0003-0813-3927
  • Guidec, Frédéric
  • Launay, Pascale
  • Mahéo, Yves
  • Robles, Sergi|||0000-0002-9924-2477
In the domain of opportunistic networking, just like in any other domain of computer science, the engineering process should span all stages between an original idea and the validation of its implementation in real conditions. Yet most researchers often stop halfway along this process: they rely on simulation to validate the protocols and distributed applications they design, and neglect to go further. Their algorithms are thus only rarely implemented for real, and when they are, the validation of the resulting code is usually performed at a very small scale. Therefore, the results obtained are hardly repeatable or comparable to others. LEPTON is an emulation platform that can help bridge the gap between pure simulation and fully operational implementation, thus allowing developers to observe how the software they develop (instead of pseudo-code that simulates its behavior) performs in controlled, repeatable conditions. In this paper we present LEPTON, an emulation platform we developed, and we show how existing opportunistic networking systems can be adapted to run with this platform. Taking two existing middleware systems as use cases, we also demonstrate that running demanding scenarios with LEPTON constitute an excellent stress test and a powerful tool to improve the opportunistic systems under test.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

PrivHab, A privacy preserving georouting protocol based on a multiagent system for podcast distribution on disconnected areas

  • Sánchez-Carmona, Adrián|||0000-0003-0813-3927
  • Robles, Sergi|||0000-0002-9924-2477
  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
We present PrivHab, a privacy preserving georouting protocol that improves multiagent decision-making. PrivHab learns the mobility habits of the nodes of the network. Then, it uses this information to dynamically select to route an agent carrying a piece of data to reach its destination. PrivHab makes use of cryptographic techniques from secure multi-party computation to make the decisions while preserving nodes' privacy. PrivHab uses a waypoint-based routing that achieves a high performance and low overhead in rugged terrain areas that are plenty of physical obstacles. The store-carry-and-forward approach used is combined with mobile agents that provide intelligence, and it is designed to operate in areas that lack network infrastructure. We have evaluated PrivHab under the scope of a realistic podcast distribution application in remote rural areas, where these programs have to be recorded into a physical format and distributed to the local radio stations. The usage of PrivHab aims to reduce this spending of resources. The PrivHab protocol is compared with a set of well-known delay-tolerant routing algorithms and shown to outperform them.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

PrivHab+, A secure geographic routing protocol for DTN

  • Sánchez Carmona, Adrian|||0000-0003-0813-3927
  • Robles, Sergi|||0000-0002-9924-2477
  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
We present PrivHab+, a secure geographic routing protocol that learns about the mobility habits of the nodes of the network and uses this information in a secure manner. PrivHab+ is designed to operate in areas that lack of network, using the store-carry-and-forward approach. PrivHab+ compares nodes and chooses the best choice to carry messages towards a known geographical location. To achieve a high performance and low overhead, PrivHab+ uses information about the usual whereabouts of the nodes to make optimal routing decisions. PrivHab+ makes use of cryptographic techniques from secure multi-party computation to preserve nodes' privacy while taking routing decisions. The overhead introduced by PrivHab+ is evaluated using a proof-of-concept implementation, and its performance is studied under the scope of a realistic application of podcast distribution. PrivHab+ is compared, through simulation, with a set of well-known delay-tolerant routing algorithms in two different scenarios of remote rural areas.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Two birds, one stone, using mobility behavioral profiles both as destinations and as a routing tool

  • Sánchez Carmona, Adrian|||0000-0003-0813-3927
  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
  • Robles, Sergi|||0000-0002-9924-2477
  • García-Vandellós, Gerard
We present HabCast, a profile-cast communication paradigm that learns about the mobility habits of the location-aware nodes of the network and uses this information both to route the messages, and to deliver them only to the nodes that match the target behavioral profile. HabCast substitutes destination's identifier by a mobility profile model called habitat, meaning that allows users to send messages "to any nodes who usually roams around this area" instead of sending messages intended to a node. HabCast is designed to operate without network infrastructure, using Opportunistic Networking strategies and operates in three phases: approximation, floating and delivery phase. HabCast enables new services and applications on Opportunistic Networking by automatically inferring the nodes' behavioral profiles and using them to define the messages' destinations. The overhead introduced by HabCast is evaluated using a proof-of-concept implementation, and its performance and feasibility is studied, through simulation, under the scope of a real carsharing application.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Explore and wait, a composite routing-delivery scheme for relative profile-casting in opportunistic networks

  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
  • Sánchez-Carmona, Adrián|||0000-0003-0813-3927
  • Li, Zhiyuan|||0000-0002-6088-8086
  • Robles, Sergi|||0000-0002-9924-2477
In the context of Opportunistic Networking (OppNet), designing routing and delivery protocols is currently an open and active line of research. In some OppNet scenarios, destination addresses are not always known by sending applications. Profile-cast models solve this problem by allowing message destinations to be users or groups of users defined by their profiles. These profiles provide very effective ways of characterizing nodes in terms of node's attributes such as their profession, interests or typical whereabouts, for example. However, there are strong limitations in OppNet Profile-casting. There is no current way of representing special profiles defined by relative delivery functions such as best, maximum or over-the-average: nodes belong to these relative profiles taking into account not only attributes from the very same node but also relative to others from the same profile. In this article, we introduce Relcast, a Profile-cast model that allows messages to be sent to profiles defined in terms of relative delivery functions. Additionally, we present Explore and Wait, a composite routing-delivery scheme that uses optimal stopping theory-based delivery strategies to route Relcast messages. We show, using simulations, that this routing-delivery scheme performs better than traditional approaches that use state-of-the-art routing-delivery primitives.
Dipòsit Digital de Documents de la UAB
Publication

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
Publication 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
Publication Artículo científico (JournalArticle)

Softwarecast, a code-based delivery Manycast scheme in heterogeneous and Opportunistic Ad Hoc Networks

  • Borrego Iglesias, Carlos|||0000-0002-9452-9970
  • Robles, Sergi|||0000-0002-9924-2477
  • García-Vandellós, Gerard
In the context of Opportunistic Ad Hoc Networking paradigms, group communication schemes (Manycast) are difficult to conduct. In this article, we propose a general delivery scheme for Manycast group communications based on mobile code. Our proposal extends network addressing by moving from the static header field paradigm to a software code-based addressing scheme. We allow messages to be delivered using built-in software codes that consider application-defined, context-aware or history-based information. Additionally, we allow messages to carry a delivery state that permits them to perform refined delivery-decision-making methods. As a consequence of this scheme, we have found that new group communication schemes, besides the traditional ones, may be beneficial to improve the network performance and to provide new functionalities to emerging scenarios like intermittently connected networks of heterogeneous physical objects. We present an application of this scheme to solve, following an analytical delivery method, the problem of sending a message to k and only k nodes of a heterogeneous and opportunistic network scenario that fit best a given criterion. We show, using simulations, that our proposal performs better than traditional approaches. Finally, to show that our proposal is feasible, we present an implementation of our proposal in a real Opportunistic Ad Hoc network, a DTN network, compatible with the de facto standard Bundle Protocol.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Another coin bites the dust, an analysis of dust in UTXO-based cryptocurrencies

  • Pérez-Solà, Cristina|||0000-0001-7534-1326
  • Delgado-Segura, Sergi|||0000-0001-7783-7288
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
  • Herrera-Joancomartí, Jordi|||0000-0002-4935-4681
Unspent Transaction Outputs (UTXOs) are the internal mechanism used in many cryptocurrencies to represent coins. Such representation has some clear benefits, but also entails some complexities that, if not properly handled, may leave the system in an inefficient state. Specifically, inefficiencies arise when wallets (the software responsible for transferring coins between parties) do not manage UTXOs properly when performing payments. In this paper, we study three cryptocurrencies: Bitcoin, Bitcoin Cash and Litecoin, by analysing the state of their UTXO sets, that is, the status of their sets of spendable coins. These three cryptocurrencies are the top-3 UTXO-based cryptocurrencies by market capitalization. Our analysis shows that the usage of each cryptocurrency presents some differences, and led to different results. Furthermore, it also points out that the management of the transactions has not always been performed efficiently and therefore, the current state of the UTXO sets is far from ideal.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Double-spending prevention for Bitcoin zero-confirmation transactions

  • Pérez-Solà, Cristina|||0000-0001-7534-1326
  • Delgado-Segura, Sergi|||0000-0001-7783-7288
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
  • Herrera-Joancomartí, Jordi|||0000-0002-4935-4681
Zero-confirmation transactions, i.e. transactions that have been broadcast but are still pending to be included in the blockchain, have gained attention in order to enable fast payments in Bitcoin, shortening the time for performing payments. Fast payments are desirable in certain scenarios, for instance, when buying in vending machines, fast food restaurants, or withdrawing from an ATM. Despite being quickly propagated through the network, zero-confirmation transactions are not protected against double-spending attacks, since the double-spending protection Bitcoin offers relies on the blockchain and, by definition, such transactions are not yet included in it. In this paper, we propose a double-spending prevention mechanism for Bitcoin zero-confirmation transactions. Our proposal is based on exploiting the flexibility of the Bitcoin scripting language together with a well-known vulnerability of the ECDSA signature scheme to discourage attackers from performing such an attack.
Dipòsit Digital de Documents de la UAB
Publication Artículo de revisión (ReviewArticle)

Cryptocurrency Networks, A New P2P Paradigm

  • Delgado-Segura, Sergi|||0000-0001-7783-7288
  • Pérez-Solà, Cristina|||0000-0001-7534-1326
  • Herrera-Joancomartí, Jordi|||0000-0002-4935-4681
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
  • Borrell i Viader, Joan|||0000-0001-6649-0450
P2P networks are the mechanism used by cryptocurrencies to disseminate system information while keeping the whole system as much decentralized as possible. Cryptocurrency P2P networks have new characteristics that propose new challenges and avoid some problems of existing P2P networks. By characterizing the most relevant cryptocurrency network, Bitcoin, we provide details on different properties of cryptocurrency networks and their similarities and differences with standard P2P network paradigms. Our study allows us to conclude that cryptocurrency networks present a new paradigm of P2P networks due to the mechanisms they use to achieve high resilience and security. With this new paradigm, interesting research lines can be further developed, both in the focused field of P2P cryptocurrency networks and also when such networks are combined with other distributed scenarios.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

A fair protocol for data trading based on Bitcoin transactions

  • Delgado-Segura, Sergi|||0000-0001-7783-7288
  • Pérez-Solà, Cristina|||0000-0001-7534-1326
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
  • Herrera-Joancomartí, Jordi|||0000-0002-4935-4681
On-line commercial transactions involve an inherent mistrust between participant parties since, sometimes, no previous relation exists between them. Such mistrust may be a deadlock point in a trade transaction where the buyer does not want to perform the payment until the seller sends the goods and the seller does not want to do so until the buyer pays for the purchase. In this paper we present a fair protocol for data trading where the commercial deal, in terms of delivering the data and performing the payment, is atomic, since the seller cannot redeem the payment unless the buyer obtains the data and the buyer cannot obtain the data without performing the payment. The protocol is based on Bitcoin scripting language and the fairness of the protocol can be probabilistically enforced.
Dipòsit Digital de Documents de la UAB
Publication Artículo científico (JournalArticle)

Collateral damage of Facebook third-party applications, a comprehensive study

  • Symeonidis, Iraklis|||0000-0003-4494-6685
  • Biczók, Gergely
  • Shirazi, Fatemeh
  • Pérez-Solà, Cristina|||0000-0001-7534-1326
  • Schroers, Jessica
  • Preneel, Bart|||0000-0003-2005-9651
Third-party applications on Facebook can collect personal data of the users who install them, but also of their friends. This raises serious privacy issues as these friends are not notified by the applications nor by Facebook and they have not given consent. This paper presents a detailed multi-faceted study on the collateral information collection of the applications on Facebook. To investigate the views of the users, we designed a questionnaire and collected the responses of 114 participants. The results show that participants are concerned about the collateral information collection and in particular about the lack of notification and of mechanisms to control the data collection. Based on real data, we compute the likelihood of collateral information collection affecting users: we show that the probability is significant and greater than 80% for popular applications such as TripAdvisor. We also demonstrate that a substantial amount of profile data can be collected by applications, which enables application providers to profile users. To investigate whether collateral information collection is an issue to users' privacy we analysed the legal framework in light of the General Data Protection Regulation. We provide a detailed analysis of the entities involved and investigate which entity is accountable for the collateral information collection. To provide countermeasures, we propose a privacy dashboard extension that implements privacy scoring computations to enhance transparency toward collateral information collection. Furthermore, we discuss alternative solutions highlighting other countermeasures such as notification and access control mechanisms, cryptographic solutions and application auditing. To the best of our knowledge this is the first work that provides a detailed multi-faceted study of this problem and that analyses the threat of user profiling by application providers.
Dipòsit Digital de Documents de la UAB
Publication 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.