Pasar al contenido principal

Resultados relacionados

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

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

Improving explicit constructions of r-PD-sets for Zps-linear generalized Hadamard codes

  • Rifà, Josep|||0000-0001-9199-4001
  • Torres Martín, Adrián|||0000-0002-2489-8930
  • Villanueva, M.|||0000-0001-6179-0833
It is known that Zps -linear codes, which are the Gray map image of Zps -additive codes (linear codes over Zps ), are systematic and a systematic encoding has been found. This makes Zps -linear codes suitable to apply the permutation decoding method, based on the existence of r-PD-sets, which are subsets of the permutation automorphism group of the code. Some constructions of r-PD-sets of minimum size r + 1 for Zps -linear generalized Hadamard codes of type (n;t1, . . . , ts) are known. In this paper, for these codes, we present new constructions of r-PD-sets of size r + 1, which are suitable for all parameters t1, . . . , ts. These allow us to obtain new r-PD-sets for values of r closer to the theoretical upper bound, improving previous known results.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Integration of Generative-Adversarial-Network-Based Data Compaction and Spatial Attention Transductive Long Short-Term Memory for Improved Rainfall-Runoff Modeling

  • Ghanati, Bahareh
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
This work presents a novel approach to rainfall-runoff modeling. We incorporate GAN-based data compaction into a spatial-attention-enhanced transductive long short-term memory (TLSTM) network. The GAN component reduces data dimensions while retaining essential features. This compaction enables the TLSTM to capture complex temporal dependencies in rainfall-runoff patterns more effectively. When tested on the CAMELS dataset, the model significantly outperforms benchmark LSTM-based models. For 8-day runoff forecasts, our model achieves an NSE of 0.536, compared to 0.326 from the closest competitor. The integration of GAN-based feature extraction with spatial attention mechanisms improves predictive accuracy, particularly for peak-flow events. This method offers a powerful solution for addressing current challenges in water resource management and disaster planning under extreme climate conditions.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Lossy Compression of Integer Astronomical Images Preserving Photometric Properties

  • Maireles González, Òscar|||0000-0003-4754-0373
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
Observatories are producing astronomical image data at quickly increasing rates. As a result, the efficiency of the compression methods employed is critical to meet the storage and distribution requirements of both observatories and scientists. This paper presents a novel lossy compression technique that is able to preserve the results of photometry analysis with high fidelity while improving upon the state of the art in terms of compression performance. The proposed compression pipeline combines a flexible bi-region quantization scheme with the lossless, dictionary-based, LPAQ9M encoder. The quantization process allows compression performance and photometric fidelity to be precisely tailored to different scientific requirements. A representative data set of 16-bit integer astronomical images produced by telescopes from all around the world has been employed to empirically assess its compression-fidelity trade-offs, and compare them to those of the de facto standard Fpack compressor. In these experiments, the widespread SExtractor software is employed as the ground truth for photometric analysis. Results indicate that after lossy compression with our proposed method, the decompressed data allows consistent detection of over 99% of all astronomical objects for all tested telescopes, maintaining the highest photometric fidelity (as compared to state of the art lossy techniques). When compared to the best configuration of Fpack (Hcompress lossy using 1 quantization parameter) at similar compression rates, our proposed method provides better photometry precision: 7.15% more objects are detected with magnitude errors below 0.01, and 9.13% more objects with magnitudes below SExtractor's estimated measurement error. Compared to the best lossless compression results, the proposed pipeline allows us to reduce the compressed data set volume by up to 38.75% and 27.94% while maintaining 90% and 95%, respectively, of the detected objects with magnitude differences lower than 0.01 mag; and up to 18.93% while maintaining 90% of the detected objects with magnitude differences lower than the photometric measure error.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

On self-dual completely regular codes with covering radius ρ ≤ 3

  • Borges, Joaquim|||0000-0002-5774-4874
  • Zinoviev, Victor|||0000-0002-7639-6115
We give a complete classification of self-dual completely regular codes with covering radius ρ ≤ 3. For ρ = 1 the results are almost trivial. For ρ = 2, by using properties of the more general class of uniformly packed codes in the wide sense, we show that there are two sporadic such codes, of length 8, and an infinite family, of length 4, apart from the direct sum of two self-dual completely regular codes with ρ = 1, each one. For ρ = 3, in some cases, we use similar techniques to the ones used for ρ = 2. However, for some other cases we use different methods, namely, the Pless power moments which allow to us to discard several possibilities. We show that there are only two self-dual completely regular codes with ρ = 3 and d ≥ 3, which are both ternary: the extended ternary Golay code and the direct sum of three ternary Hamming codes of length 4. Therefore, any self-dual completely regular code with d ≥ 3 and ρ = 3 is ternary and has length 12. We provide the intersection arrays for all such codes.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Decision tree based inference of lightning network client implementations

  • Espinasa Vilarrasa, Pol|||0009-0000-3933-4970
  • Sanvicente, Sílvia
  • Pérez-Solà, Cristina|||0000-0001-7534-1326
  • Herrera-Joancomartí, Jordi|||0000-0002-4935-4681
The Lightning Network (LN) is a second layer payment protocol on top of Bitcoin. It creates a peer-to-peer (P2P) network of payment channels that enable instant payments. The LN can be accessed through different implementations or clients, the most popular being Lightning Network Daemon (LND), Core Lightning Network (CLN), and Eclair. The first step in many known attacks to the LN is to infer the software client the node is running. This paper presents two classification models based on decision trees to infer the implementation of LN clients from either the traffic of the gossip protocol or the announced BOLT #9 features, offering a cost-free means of identification. The accuracy presented by both models in our experiments is high, ranging from 87% to 100% depending on the model and the environment where it is deployed. The application of our inference models on the LN shows a prevalence of LND clients.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Foundations of additive codes over finite fields

  • Bhunia, Dipak Kumar|||0000-0003-4852-8739
  • Dougherty, Steven T.
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Villanueva, M|||0000-0001-6179-0833
Additive codes were initially introduced by Delsarte in 1973 within the context of association schemes and recently they have become of interest due to their application in constructing quantum error-correcting codes. We give foundational results for additive codes where the elements are from a finite field, and d fine the orthogonality relation using group characters. We introduce a type for these additive codes and explore the notion of independence for a generating set. Additionally, we provide a definition for a generator matrix of an additive code based on its type. We also relate the type of an additive code to the type of its orthogonal. We study a family of kernels and ranks associated with these additive codes. We relate the equivalence of additive codes to their type, the family of kernels and ranks, and duality. We see how these relations contribute in the class fication of additive codes. Finally, we provide a general encoding and decoding method for these codes.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

Building Resilient AI, A Solution to Data and Model Poisoning Prevention

  • Keshavarzkalhori, Ghazaleh|||0009-0002-7758-0018
  • Pérez-Solà, Cristina|||0000-0001-7534-1326
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
  • Herrera-Joancomartí, Jordi|||0000-0002-4935-4681
In many machine learning scenarios, training occurs outside the control of the model sponsor or the entity using the model. A growing concern in such settings revolves around model poisoning and data poisoning-how training is conducted and which data contributes to the process. This paper introduces a protective scheme against model and data poisoning attacks. Leveraging cryptographic primitives such as hashes, signature schemes, and zero-knowledge proofs, the scheme ensures the integrity of the training process. Hashing maintains the continuity of data from authenticated sensors, while signatures validate the data. In the end, zero-knowledge proofs verify the correct model computation by the entity carrying out the training process. By adopting this approach, model sponsors can securely delegate training tasks, guaranteeing the authenticity of the results. Implementation and testing demonstrate the scheme's feasibility, effectively countering data and model poisoning threats.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Linearity and classification of Z2Z4Z8-linear Hadamard codes

  • Bhunia, Dipak Kumar|||0000-0003-4852-8739
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Villanueva, M.|||0000-0001-6179-0833
The Z2Z4Z8-additive codes are subgroups of Z2α1 × Z4α2 × Z8α3. A Z2Z4Z8-linear Hadamard code is a Hadamard code which is the Gray map image of a Z2Z4Z8-additive code. A recursive construction of Z2Z4Z8-additive Hadamard codes of type (α1, α2, α3; t1, t2, t3) with α1 ≠ 0, α2 ≠ 0, α3 ≠ 0, t1 ≥ 1, t2 ≥ 0, and t3 ≥ 1 is known. In this paper, we generalize some known results for Z2Z4-linear Hadamard codes to Z2Z4Z8-linear Hadamard codes with α1 ≠ 0, α2 ≠ 0, and α3 ≠ 0. First, we show for which types the corresponding Z2Z4Z8-linear Hadamard codes of length 2t are nonlinear. For these codes, we compute the kernel and its dimension, which allows us to give a partial classification of these codes. Moreover, for 3 ≤ t ≤ 11, we give a complete classification by providing the exact amount of nonequivalent such codes. We also prove the existence of several families of infinite such nonlinear Z2Z4Z8-linear Hadamard codes, which are not equivalent to any other constructed Z2Z4Z8-linear Hadamard code, nor to any Z2Z4-linear Hadamard code, nor to any previously constructed Z2s-linear Hadamard code with s ≥ 2, with the same length 2t.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

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

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

Robustness of Lossy Multispectral Compression to Simulated Instrumental Noise: A Comparative Study

  • González de Regàs, Jordi|||0009-0006-8525-5150
  • Mijares i Verdú, Sebastià|||0000-0003-1038-6413
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
Lossy compression of multispectral data has been widely adopted to tackle the downlink bottleneck in space-based Earth observation. However, compression artifacts may interact with the instrumental noise inherent to the sensors, affecting both the performance of the compressors and the effectiveness of denoising techniques. This letter evaluates the effects of lossy compression in the presence of instrumental noise and the corresponding denoising procedures on multispectral data, comparing current techniques for on-board lossy compression (CCSDS 122.0-B-1, near-lossless CCSDS 123.0-B-2, JPEG 2000, and exogenous KLT-JPEG 2000) with recent reduced-complexity models based on neural networks (mijares, chabert, oberlin and serra (MCOS) and spectral orthogonal transform encoder lossY (SORTENY)]. The rate-distortion performance of each codec is analyzed across four simulated instrumental noise conditions: thermal noise, dark signal, missing lines, and parallax-induced band misalignment. Experimental results show that all the evaluated codecs are resilient under thermal noise, dark signal, and missing line artifacts. However, for band misalignment artifacts, the compressors using a linear spectral transform, as E-KLT-JPEG 2000 and SORTENY, experienced a significant degradation.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Fixed-Quality Compression of Remote Sensing Images With Neural Networks

  • Mijares i Verdú, Sebastià|||0000-0003-1038-6413
  • Chabert, Marie|||0000-0001-9869-4693
  • Oberlin, Thomas|||0000-0002-9680-4227
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
Fixed-quality image compression is a coding paradigm where the tolerated introduced distortion is set by the user. This article proposes a novel fixed-quality compression method for remote sensing images. It is based on a neural architecture we have recently proposed for multirate satellite image compression. In this article, we show how to efficiently estimate the reconstruction quality using an appropriate statistical model. The performance of our approach is assessed and compared against recent fixed-quality coding techniques and standards in terms of accuracy and rate-distortion, as well as with recent machine learning compression methods in rate-distortion, showing competitive results. In particular, the proposed method does not introduce artifacts even when coding neighboring areas at different qualities.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Learned Spectral and Spatial Transforms for Multispectral Remote Sensing Data Compression

  • Mijares i Verdú, Sebastià|||0000-0003-1038-6413
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
As more and more multispectral and hyperspectral platforms are deployed for Earth observation (EO), limited downlink capacity increases the pressure for more efficient data compression algorithms. Machine learning (ML) has been successfully applied to produce highly competitive compression models though this performance has typically been at the cost of high computational complexity, a crucial limitation for on-board remote sensing data compression. To address these issues, a reduced-complexity multispectral and hyperspectral data compression architecture is proposed. Using separate spectral and spatial transforms, the complexity of the proposed models is scalable on the number of bands, regardless of the compression ratios. This proposal outperforms state-of-the-art ML compression models as well as established lossy compression methods such as JPEG 2000 prepended with a spectral Karhunen-Loève transform (KLT) on a variety of remote sensing data sources. The performance improvement is achieved with a lower complexity than said ML models. To reproduce our results, training and test data are publicly available at https://gici.uab.cat/GiciWebPage/datasets.php and source code at https://github.com/smijares/mbhs2025.
Dipòsit Digital de Documents de la UAB
Publicación

Visual image analysis of high-rate local fixed-quality compression with neural networks

  • Mijares i Verdú, Sebastià|||0000-0003-1038-6413
  • Bruno, Mickaël
  • Latry, Christophe
  • Chabert, Marie|||0000-0001-9869-4693
  • Oberlin, Thomas|||0000-0002-9680-4227
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
Fixed-quality compression is a lossy compression paradigm in which data is encoded at a user-defined tolerated distortion. When that tolerated distortion is allocated in certain regions of the image, it is referred to as local fixed-quality compression. It consists in compressing more complex regions at a higher bit rate and less complex areas at a lower bit rate, in order to reach the same level of quality with a reduced overall bit rate. Indeed, the global trend in high resolution satellite imagery is to drive the compression algorithm with a distortion target rather than with a bit rate target, which allows to allocate the bit rate resource where it is needed~\cite{camarero2015fixedquality}. The introduction of neural networks to data compression, particularly lossy image compression, has produced a breakthrough in the field. These novel methods outperform established algorithms that are the result of decades of innovation and fine-tuning. These advances have been applied to remote sensing satellite images through reduced-complexity algorithms that are compatible with on-board devices~\cite{alves2021mdpi, mijares2023multirate}. Indeed, missions such as ESA's Phi-Sat 2 will soon be pioneering the usage of neural compression on board remote sensing satellites~\cite{guerrisi2023phisat2}. Recent contributions have proposed methods for local fixed-quality compression using neural networks for remote sensing data, presenting rate-distortion and accuracy results for rates up to 1.5 bps or 2.5 bps~\cite{mijares2024fixedquality}. However in live applications target bit rates (and therefore image quality) are typically higher, so that distortion is at the level of instrumental noise. In this contribution, models for local fixed-quality compression at high qualities/bit rates are evaluated and visual image analysis is conducted on the artefacts. Furthermore, the computational capacity of the method is evaluated, showing it is compatible with new-generation on-board devices.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

SGST, bit-depth recovery-based lossless compression for hyperspectral images

  • Xi, Zuoxin
  • Mijares i Verdú, Sebastià|||0000-0003-1038-6413
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
Deep learning applications to hyperspectral image (HSI) compression have attracted significant interest in recent years. Existing deep learning methods often rely on convolutional architectures, limiting their ability to capture long-range spectral dependencies. Their use of latent feature maps also requires full decoding before any downstream analysis. To address these limitations, we propose the Spectral Group Swin Transformer (SGST), a bit-depth recovery model that explicitly separates the most and least significant bits (MSB and LSB) and employs a transformer-based structure to enhance contextual modeling. Moreover, the MSB can be directly used for preliminary downstream analysis. Experiments on the HySpecNet-11k dataset show that SGST improves reconstruction quality by over 10 dB in PSNR compared to 3D-CAE and SSCNet, with lower entropy in lossy settings. While SGST's entropy rate in lossless compression is higher than the recent LineRWKV, its significantly lower computational complexity makes it better suited for onboard applications. Code is available at: https://github.com/ZuoxinXi/SGST.
Dipòsit Digital de Documents de la UAB
Publicación

Region of Interest Coding in Photsat Mission

  • Quintas Torra, Pau|||0009-0001-9873-279X
  • Fernández-Mellado, Xavier|||0009-0006-6806-4416
  • Maireles González, Òscar|||0000-0003-4754-0373
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
The Institute of Space Studies of Catalonia (IEEC) coordinates the PhotSat project [1], which involves the development and construction of a satellite to monitor the 10 million brightest stars in the sky for at least two years. The scientific objective of this project is to complement the Large Synoptic Survey Telescope (LSST) [2] and the GAIA mission [3] by examining the intensity of stars. In the PhotSat mission, a CubeSat is expected to be launched at the end of 2025, with the mission of scanning the entire sky using two cameras-one with an ultraviolet detector and another with a visible detector. The desired configurations of the camera field of view (FoV) and the sensor step size are 8◦ and 4◦, respectively, which will generate a total of 16.75 GB of image data that will need to be transmitted from the satellite to the Montsec ground station [4]. Since the download capacity to the Montsec station is limited to 8 GB per day, some compression is required. The compression presented in this paper consists of two stages. The first stage uses an auto- matic object detection technique based on photometry [5], which analyzes the pixel intensities of the acquired data to identify the pixels corresponding to the Regions of Interest (ROI). This pro- cess adjusts the image so that only the ROIs are preserved, eliminating irrelevant pixels. In the second stage, the modified data is losslessly compressed using a prediction-based compressor and a contextual binary arithmetic encoder [6]. To provide contextual information around the ROI, the ROI can be expanded using the parameter ROI Extended Coding Pixels (RECP), which adds a specified number of pixels around the detected objects. Additionally, both the predictor and ROI coding can be independently enabled or disabled, allowing for faster execution and, under certain circumstances, improved coding performance. Experimental results show that when our proposal is used with ROI coding disabled, all acquired data can be losslessly compressed to 5.86 GB. However, when ROI coding is enabled, compression performance improves significantly; for example, if RECP is set to 0 or 64, the acquired data can be compressed to 0.16 GB and 4.13 GB, respectively-a very significant compression.
Dipòsit Digital de Documents de la UAB
Publicación

On Board Compression For PhotSat Mission

  • Fernández-Mellado, Xavier|||0009-0006-6806-4416
  • Quintas Torra, Pau|||0009-0001-9873-279X
  • Ferrer Jorge, Gabriel
  • Maireles González, Òscar|||0000-0003-4754-0373
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Carrasco, Josep Manel
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
PhotSat is a satellite mission aimed at exploring deep space through high-resolution imaging using advanced optical sensors. Utilizing a CubeSat platform, the mission seeks to obtain precise astronomical data at a low cost, leveraging miniaturized technologies that reduce complexity while maximizing observational capabilities. The platform is equipped with a high-performance optical system capable of capturing images in two spectral bands (visual and ultraviolet), making it possible to detect transient events such as exoplanets or variable stars. The preliminary design of PhotSat integrates an innovative data compression system based on a binary context-based arithmetic coder, ensuring the preservation of quality in crucial observations while optimizing bandwidth and storage usage. A comparative experiment was conducted with five state-of-the-art codecs, and the results show that the proposed codec outperforms the others in terms of compression efficiency. PhotSat establishes a significant precedent in the field of astronomy with CubeSats, serving as a proof of concept for the feasibility of low-cost scientific missions yielding high-quality results.
Dipòsit Digital de Documents de la UAB
Publicación Capítulo o parte de un libro (BookPart)

T2F2L, Towards Trustworthy Fairness in Federated Learning Through A Verifiable Approach

  • Keshavarzkalhori, Ghazaleh|||0009-0002-7758-0018
  • Pérez-Solà, Cristina|||0000-0001-7534-1326
  • Navarro-Arribas, Guillermo|||0000-0003-3535-942X
  • Herrera-Joancomartí, Jordi|||0000-0002-4935-4681
Federated learning (FL) has emerged as a privacypreserving alternative to traditional machine learning, enabling collaborative model training without centralizing users' data. While this decentralized approach enhances privacy, it ntroduces new trust assumptions. Specifically, that users honestly participate in the protocol. Simultaneously, the growing emphasis on fairness in machine learning has led to the development of fairness-aware FL schemes, which aim to ensure equitable model performance across diverse user groups. However, existing solutions for fair FL schemes rely on users truthfully reporting fairness-related metrics. This trust assumption opens the door to malicious behavior: users may manipulate these statistics to influence the global model, degrading its fairness, and/or its overall accuracy. Current frameworks lack mechanisms to detect or prevent such adversarial manipulation. This paper addresses this critical gap through two main contributions. First, as an example to illustrate our point, we empirically demonstrate the vulnerability of a representative fairness-aware FL framework to targeted attacks that exploit unverified fairness computations. Second, and most mportantly, we propose a novel scheme (that can be integrated into existing fair FL schemes) that augments fairness-aware FL with verifiability. Our solution enables the detection of dishonest participants without compromising user privacy, thus strengthening the robustness of fairness-aware federated learning schemes.
O2, repositorio institucional de la UOC
Publicación Artículo científico (JournalArticle)

Integrating blockchain with IoT: Evaluating the feasibility of lightweight Bitcoin wallets on resource-constrained devices

  • Rahmanikivi, Mohsen
  • Pérez-Solà, Cristina
  • Garcia-Font, Victor
The integration of blockchain technology with IoT architectures holds immense potential for advancing application design and enhancing security properties. However, the resource constraints typically present in IoT devices pose a challenge. This paper explores the feasibility of running a lightweight Bitcoin wallet on IoT devices and identifies the minimum requirements for their successful operation. A review of the literature is used to identify existing integration architectures and derive the wallet needs. The study evaluates performance metrics such as execution time, memory usage, network data transmission, and power consumption to determine the feasibility of deploying these architectures.
O2, repositorio institucional de la UOC
Publicación Artículo científico (JournalArticle)

SmartBLock: a smart lock protocol over the Bitcoin blockchain

  • Rahmanikivi, Mohsen
  • Pérez-Solà, Cristina
  • Garcia-Font, Victor
This paper introduces "SmartBLock", a novel protocol that integrates smart lock management with the Bitcoin blockchain. By employing blockchain technology, the SmartBLock protocol eliminates the need for centralized databases (reducing the risk of data breaches) and ensures accountability for all access events. Authentication is accomplished through Bitcoin's cryptographic signature scheme. Additionally, SmartBLock is an open and manufacturer-agnostic protocol, relying on the open and permissionless Bitcoin blockchain rather than proprietary tools or protocols. Given the limited computational capabilities of Internet of Things (IoT) devices, achieving this integration presents a significant challenge. This paper provides a comprehensive review of the state of the art in smart lock protocols, details the design of the SmartBLock protocol, presents a proof-of-concept prototype to validate its feasibility, and offers a meticulous analysis of its security, privacy, and traceability features.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Fast and Efficient Entropy Coding Architectures for Massive Data Compression

  • Aulí-Llinàs, Francesc|||0000-0002-3208-9957
The compression of data is fundamental to alleviating the costs of transmitting and storing massive datasets employed in myriad fields of our society. Most compression systems employ an entropy coder in their coding pipeline to remove the redundancy of coded symbols. The entropy-coding stage needs to be efficient, to yield high compression ratios, and fast, to process large amounts of data rapidly. Despite their widespread use, entropy coders are commonly assessed for some particular scenario or coding system. This work provides a general framework to assess and optimize different entropy coders. First, the paper describes three main families of entropy coders, namely those based on variable-to-variable length codes (V2VLC), arithmetic coding (AC), and tabled asymmetric numeral systems (tANS). Then, a low-complexity architecture for the most representative coder(s) of each family is presented-more precisely, a general version of V2VLC, the MQ, M, and a fixed-length version of AC and two different implementations of tANS. These coders are evaluated under different coding conditions in terms of compression efficiency and computational throughput. The results obtained suggest that V2VLC and tANS achieve the highest compression ratios for most coding rates and that the AC coder that uses fixed-length codewords attains the highest throughput. The experimental evaluation discloses the advantages and shortcomings of each entropy-coding scheme, providing insights that may help to select this stage in forthcoming compression systems.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

On recursive constructions of Z2Z4Z8-linear Hadamard codes

  • Bhunia, Dipak Kumar|||0000-0003-4852-8739
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Villanueva, M|||0000-0001-6179-0833
The Z2Z4Z8-additive codes are subgroups of Z α1 2 × Z α2 4 × Z α3 8 . A Z2Z4Z8-linear Hadamard code is a Hadamard code, which is the Gray map image of a Z2Z4Z8-additive code. In this paper, we generalize some known results for Z2Z4-linear Hadamard codes to Z2Z4Z8-linear Hadamard codes with α1 ̸= 0, α2 ̸= 0, and α3 ̸= 0. First, we give a recursive construction of Z2Z4Z8- additive Hadamard codes of type (α1, α2, α3;t1, t2, t3) with t1 ≥ 1, t2 ≥ 0, and t3 ≥ 1. It is known that each Z4-linear Hadamard code is equivalent to a Z2Z4-linear Hadamard code with α1 ̸= 0 and α2 ̸= 0. Unlike Z2Z4-linear Hadamard codes, in general, this family of Z2Z4Z8-linear Hadamard codes does not include the family of Z4-linear or Z8-linear Hadamard codes. We show that, for example, for length 211, the constructed nonlinear Z2Z4Z8-linear Hadamard codes are not equivalent to each other, nor to any Z2Z4-linear Hadamard, nor to any previously constructed Z2s -Hadamard code, with s ≥ 2. Finally, we also present other recursive constructions of Z2Z4Z8-additive Hadamard codes having the same type, and we show that, after applying the Gray map, the codes obtained are equivalent to the previous ones.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

On the equivalence of Z ps -linear generalized Hadamard codes

  • Bhunia, Dipak Kumar|||0000-0003-4852-8739
  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Vela, Carlos|||0000-0003-3362-8817
  • Villanueva, M|||0000-0001-6179-0833
Linear codes of length n over Zps , p prime, called Zps -additive codes, can be seen as subgroups of Zn ps . A Zps -linear generalized Hadamard (GH) code is a GH code over Zp which is the image of a Zps -additive code under a generalized Gray map. It is known that the dimension of the kernel allows to classify these codes partially and to establish some lower and upper bounds on the number of such codes. Indeed, in this paper, for p ≥ 3 prime, we establish that some Zps -linear GH codes of length pt having the same dimension of the kernel are equivalent to each other, once t is fixed. This allows us to improve the known upper bounds. Moreover, up to t = 10 if p = 3 or t = 8 if p = 5, this new upper bound coincides with a known lower bound based on the rank and dimension of the kernel.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Partial permutation decoding and PD-sets for Zps-linear generalized Hadamard codes

  • Torres Martín, Adrián|||0000-0002-2489-8930
  • Villanueva, M|||0000-0001-6179-0833
It is known that Zps-linear codes, which are the Gray map image of Zps-additive codes (linear codes over Zps), are systematic and a systematic encoding has been found. This makes Zps-linear codes suitable to apply the permutation decoding method. This technique is also based on the existence of r-PD-sets, which are subsets of the permutation automorphism group of the code. In this paper, we study the permutation automorphism group of Zps-linear generalized Hadamard codes of type (n;t1,…,ts) and show how to construct r-PD-sets of size r + 1, for all r up to an upper bound, in order to be able to perform a partial permutation decoding for these codes.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Reduced-Complexity Multirate Remote Sensing Data Compression With Neural Networks

  • Mijares i Verdú, Sebastià|||0000-0003-1038-6413
  • Chabert, Marie|||0000-0001-9869-4693
  • Oberlin, Thomas|||0000-0002-9680-4227
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
One of the main limitations to the adoption of deep learning for image compression is the need to train multiple models to compress at multiple rates. In the case of onboard remote sensing data compression, another limitation is the computational cost of the neural networks. Addressing both limitations, this letter presents a new reduced-complexity architecture for multirate compression of remote sensing images. The proposed architecture enables compressing at a precise user-selected rate while keeping a competitive performance in lossy compression on different sets of remote sensing data. The proposed approach is amenable for onboard deployment.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

On new infinite families of completely regular and completely transitive codes

  • Borges, Joaquim|||0000-0002-5774-4874
  • Rifà, Josep|||0000-0001-9199-4001
  • Zinoviev, Victor|||0000-0002-7639-6115
In two previous papers we constructed new families of completely regular codes by concatenation methods. Here we determine cases in which the new codes are completely transitive. For these cases we also find the automorphism groups of such codes. For the remaining cases, we show that the codes are not completely transitive assuming an upper bound on the order of the monomial automorphism groups, according to computational results.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

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

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

Efficient Lossless Compression of Integer Astronomical Data

  • Maireles González, Òscar|||0000-0003-4754-0373
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
Each new generation of telescope produces increasingly larger astronomical data volumes, which are expected to reach the order of exabytes in the next decade. Effective and fast data compression methods are paramount to help the scientific community contain storage costs and improve transmission times. Astronomical data differs significantly from natural and Earth-observation images, asking for specifically tailored compression approaches. This paper presents a novel lossless compression technique that employs the discrete Haar wavelet transform within the JPEG 2000 standard. Its performance is compared to that of a comprehensive selection of compressors, including fpack, the most common technique in astronomical observatories, as well as other algorithms highly competitive for other types of data. Experiments are performed on a large data set of 16 bit integer images, produced by telescopes around the world and representative of a wide variety of astronomical scenarios. The proposed technique has two modes. The first mode outperforms all the other tested techniques in terms of compression performance. It surpasses the most competitive configuration of fpack by, respectively, 5.3% (about 0.3 bits per sample), having also 4.5% lower compression and decompression times. The second mode is the fastest among all tested techniques. Its compression and decompression times are 2.5 and 3.5 times faster than the fastest configuration of fpack, while also yielding a 2.4% better compression performance (0.15 bits per sample).
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

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

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

Computing Efficiently a Parity-Check Matrix for Zps-Additive Codes

  • Fernández Córdoba, Cristina|||0000-0001-5880-144X
  • Torres Martín, Adrián|||0000-0002-2489-8930
  • Vela, Carlos|||0000-0003-3362-8817
  • Villanueva, M|||0000-0001-6179-0833
The Zps-additive codes of length n are subgroups of Znps, with p prime and s ≥ 1 . They can be seen as a generalization of linear codes over Z2, Z4, or more general over Z2s. In this paper, we show two methods for computing a parity-check matrix of a Zps-additive code from a generator matrix of the code in standard form. We also compare the performance of our results implemented in Magma with the current available function in Magma for linear codes over finite rings in general. Complementing this comparison, we also show a time complexity analysis of the algorithms. The rings Zps belong to a more general class of rings: finite chain rings. Along the paper, we observe that the same results can be applied to any linear code over a finite commutative chain ring.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Removing Data Dependencies in the CCSDS 123.0-B-2 Predictor Weight Updating

  • Barrios, Yubal|||0000-0001-6186-9971
  • Bartrina-Rapesta, Joan|||0000-0002-1551-3680
  • Hernández-Cabronero, Miguel|||0000-0001-9301-4337
  • Sánchez, Antonio José|||0000-0002-2142-7885
  • Blanes, Ian|||0000-0001-8939-1666
  • Serra-Sagristà, Joan|||0000-0003-4729-9292
  • Sarmiento, Roberto|||0000-0002-4843-0507
The Consultative Committee for Space Data Systems (CCSDS) first standardized near-lossless coding capabilities in the CCSDS 123.0-B-2 algorithm. However, this standard does not describe strategies to produce high-throughput hardware implementations, which are not trivial to derive from its definition. At the same time, throughput optimizations without significant compression performance penalties are paramount to enable real-time compression on-board next-generation satellites. This work demonstrates that the weight update stage of the CCSDS 123.0-B-2 predictor can be selectively bypassed to enhance throughput for both lossless and near-lossless modes with minimal impact on compression performance and still produce fully compliant bitstreams. Skipping the weight update implies that those weights must be carefully chosen outside the original CCSDS 123.0-B-2 pipeline. Two strategies are proposed to select effective weight values based on whether a priori information about the current image is exploited or not. Comprehensive experimental results are presented for both proposed strategies and for lossless and near-lossless regimes, using a representative set of hyperspectral images. The coding penalty is, on average, 1% for lossless and 8% for near-lossless, depending on the strategy used to set the initial weights. The proposed method obtains a maximum throughput of one processed sample per clock cycle when it is evaluated using high-level synthesis (HLS), consuming 4.6% of the look-up tables (LUTs) and 31.1% of the internal memory on a Xilinx Kintex UltraScale space-grade field programmable gate array (FPGA).