2015
DOI: 10.1049/iet-cvi.2014.0141
|View full text |Cite
|
Sign up to set email alerts
|

Measuring meaningful information in images: algorithmic specified complexity

Abstract: Both Shannon and Kolmogorov-Chaitin-Solomonoff (KCS) information models fail to measure meaningful information in images. Pictures of a cow and correlated noise can both have the same Shannon and KCS information, but only the image of the cow has meaning. The application of 'algorithmic specified complexity' (ASC) to the problem of distinguishing random images, simple images and content-filled images is explored. ASC is a model for measuring meaning using conditional KCS complexity. The ASC of various images g… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 70 publications
(131 reference statements)
0
2
0
Order By: Relevance
“…One useful information-theoretical metric is redundancy reduction. Algorithms that detect redundancy have been used for some time to compress the size of computer files (e.g., image compression; Ewert, Dembski, & Marks, 2015;Feldman & Crutchfield, 1998). In one study, image compressibility was considered to define complexity (less compressible is more complex).…”
Section: Introductionmentioning
confidence: 99%
“…One useful information-theoretical metric is redundancy reduction. Algorithms that detect redundancy have been used for some time to compress the size of computer files (e.g., image compression; Ewert, Dembski, & Marks, 2015;Feldman & Crutchfield, 1998). In one study, image compressibility was considered to define complexity (less compressible is more complex).…”
Section: Introductionmentioning
confidence: 99%
“…In the literature, there has been recent interest in the complexity of media content in various forms. Image complexity has been measured by a variety of metrics, including fractal dimension [58], algorithmic specified complexity [59], compressed file size [60], the degree of flatness in the profile of gray-scale mean variance [61], and the entropy of luminosity [48]. In addition, the complexities of text discourse [62], movie narration [63], and the rhythm of films [64] have been investigated.…”
Section: Statistical Complexity As a Characteristic Of Emotion Dismentioning
confidence: 99%