Dataset Information

Kolmogorov compression complexity may differentiate different schools of Orthodox iconography.

ABSTRACT: The complexity in the styles of 1200 Byzantine icons painted between 13th and 16th from Greece, Russia and Romania was investigated through the Kolmogorov algorithmic information theory. The aim was to identify specific quantitative patterns which define the key characteristics of the three different painting schools. Our novel approach using the artificial surface images generated with Inverse FFT and the Midpoint Displacement (MD) algorithms, was validated by comparison of results with eight fractal and non-fractal indices. From the analyzes performed, normalized Kolmogorov compression complexity (KC) proved to be the best solution because it had the best complexity pattern differentiations, is not sensitive to the image size and the least affected by noise. We conclude that normalized KC methodology does offer capability to differentiate the icons within a School and amongst the three Schools.

SUBMITTER: Peptenatu D

PROVIDER: S-EPMC9232591 | biostudies-literature | 2022 Jun

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Kolmogorov compression complexity may differentiate different schools of Orthodox iconography.

Peptenatu Daniel D Andronache Ion I Ahammer Helmut H Taylor Richard R Liritzis Ioannis I Radulovic Marko M Ciobanu Bogdan B Burcea Marin M Perc Matjaz M Pham Tuan D TD Tomić Bojan M BM Cîrstea Cosmin Iulian CI Lemeni Adrian Nicolae AN Gruia Andreea Karina AK Grecu Alexandra A Marin Marian M Jelinek Herbert Franz HF

Scientific reports 20220624 1

The complexity in the styles of 1200 Byzantine icons painted between 13th and 16th from Greece, Russia and Romania was investigated through the Kolmogorov algorithmic information theory. The aim was to identify specific quantitative patterns which define the key characteristics of the three different painting schools. Our novel approach using the artificial surface images generated with Inverse FFT and the Midpoint Displacement (MD) algorithms, was validated by comparison of results with eight f ...[more]

PMID: 35750777

Similar Datasets

Project description:BackgroundWith the rapid emergence of RNA databases and newly identified non-coding RNAs, an efficient compression algorithm for RNA sequence and structural information is needed for the storage and analysis of such data. Although several algorithms for compressing DNA sequences have been proposed, none of them are suitable for the compression of RNA sequences with their secondary structures simultaneously. This kind of compression not only facilitates the maintenance of RNA data, but also supplies a novel way to measure the informational complexity of RNA structural data, raising the possibility of studying the relationship between the functional activities of RNA structures and their complexities, as well as various structural properties of RNA based on compression.ResultsRNACompress employs an efficient grammar-based model to compress RNA sequences and their secondary structures. The main goals of this algorithm are two fold: (1) present a robust and effective way for RNA structural data compression; (2) design a suitable model to represent RNA secondary structure as well as derive the informational complexity of the structural data based on compression. Our extensive tests have shown that RNACompress achieves a universally better compression ratio compared with other sequence-specific or common text-specific compression algorithms, such as Gencompress, winrar and gzip. Moreover, a test of the activities of distinct GTP-binding RNAs (aptamers) compared with their structural complexity shows that our defined informational complexity can be used to describe how complexity varies with activity. These results lead to an objective means of comparing the functional properties of heteropolymers from the information perspective.ConclusionA universal algorithm for the compression of RNA secondary structure as well as the evaluation of its informational complexity is discussed in this paper. We have developed RNACompress, as a useful tool for academic users. Extensive tests have shown that RNACompress is a universally efficient algorithm for the compression of RNA sequences with their secondary structures. RNACompress also serves as a good measurement of the informational complexity of RNA secondary structure, which can be used to study the functional activities of RNA molecules.

Dataset Information

Kolmogorov compression complexity may differentiate different schools of Orthodox iconography.

Publications

Kolmogorov compression complexity may differentiate different schools of Orthodox iconography.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets