The Landscape of Compressibility Measures for Two-Dimensional Data
IEEE Access · 2024 · 12 · 87268-87283
DOI: 10.1109/access.2024.3417621 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Access, 2024. Verfasst von Lorenzo Carfagna und 1 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 24 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC-ND 4.0). Gefördert von: INdAM-GNCS Project CUP, Spoke “FutureHPC and BigData” of the ICSC—Centro Nazionale di Ricerca in High-Performance Computing, Big Data and Quantum Computing, European Union NextGeneration EU Program.
Abstract (Originalsprache)
In this paper we extend to two-dimensional data two recently introduced one-dimensional compressibility measures: the $\gamma $ measure defined in terms of the smallest string attractor, and the $\delta $ measure defined in terms of the number of distinct substrings of the input string. Concretely, we introduce the two-dimensional measures $\gamma _{2D}$ and $\delta _{2D}$ , as natural generalizations of $\gamma $ and $\delta $ , and we initiate the study of their properties. Among other things, we prove that $\delta _{2D}$ is monotone and can be computed in linear time, and we show that, although it is still true that $\delta _{2D}\leq \gamma _{2D}$ , the gap between the two measures can be $\Omega (\sqrt {n})$ and therefore asymptotically larger than the gap between $\gamma $ and $\delta $ . To complete the scenario of two-dimensional compressibility measures, we introduce the measure $b_{2D}$ which generalizes to two dimensions the notion of optimal parsing. We prove that, somewhat surprisingly, the relationship between $b_{2D}$ and $\gamma _{2D}$ is significantly different than in the one-dimensional case. As an application of our results we provide the first analysis of the space usage of the two-dimensional block tree introduced in [Brisaboa et al., Two-dimensional block trees, The computer Journal , 2024]. Our analysis shows that the space usage can be bounded in terms of both $\gamma _{2D}$ and $\delta _{2D}$ . Finally, using insights from our analysis, we design the first linear time and space algorithm for constructing the two-dimensional block tree for arbitrary matrices.
Förderung
- INdAM-GNCS Project CUP
- Spoke “FutureHPC and BigData” of the ICSC—Centro Nazionale di Ricerca in High-Performance Computing, Big Data and Quantum Computing
- European Union NextGeneration EU Program
- MIUR PRIN Project
Zitieren
APA
Carfagna, L., & Manzini, G. (2024). The Landscape of Compressibility Measures for Two-Dimensional Data. IEEE Access, 12, 87268-87283. https://doi.org/10.1109/access.2024.3417621
Vancouver
Carfagna L, Manzini G. The Landscape of Compressibility Measures for Two-Dimensional Data. IEEE Access. 2024;12:87268-87283. doi:10.1109/access.2024.3417621
BibTeX
@article{Carfagna2024,
author = {Carfagna, Lorenzo and Manzini, Giovanni},
title = {The Landscape of Compressibility Measures for Two-Dimensional Data},
journal = {IEEE Access},
year = {2024},
volume = {12},
pages = {87268--87283},
doi = {10.1109/access.2024.3417621}
}
EUVIMED