Entropy estimation in bidimensional sequences
arXiv:2207.02672 · doi:10.1103/PhysRevE.105.054116
Abstract
We investigate the performance of entropy estimation methods, based either on block entropies or compression approaches, in the case of bidimensional sequences. We introduce a validation dataset made of images produced by a large number of different natural systems, in the vast majority characterized by long-range correlations, which produce a large spectrum of entropies. Results show that the framework based on lossless compressors applied to the one-dimensional projection of the considered dataset leads to poor estimates. This is because higher-dimensional correlations are lost in the projection operation. The adoption of compression methods which do not introduce dimensionality reduction improves the performance of this approach. By far, the best estimation of the asymptotic entropy is generated by the faster convergence of the traditional block-entropies method. As a by-product of our analysis, we show how a specific compressor method can be used as a potentially interesting technique for automatic detection of symmetries in textures and images.
10 pages, 7 figures
References in corpus (4)
- The Organization of Intrinsic Computation: Complexity-Entropy Diagrams and the Diversity of Natural Information Processing
- Quantifying hidden order out of equilibrium
- Universal and accessible entropy estimation using a compression algorithm
- Entropy and hierarchical clustering: characterising the morphology of the urban fabric in different spatial cultures