Measuring the complexity of two-dimensional binary patterns - Sub-symmetries versus Papentin complexity

Godfried T. Toussaint, Noris S. Onea, Quan H. Vuong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper describes an experimental comparison of two measures of the complexity of binary patterns with respect to how well they predict human judgement of visual complexity. The experiments are performed with a data set consisting of 45 binary patterns defined on a square 6×6 array of black and white squares. The measures compared are generalizations of the measures previously explored for one-dimensional binary sequences by Alexander and Carey as well as Papentin. The former is based on counting the number of sub-symmetries present in the pattern, and the latter is an upper bound on the Kolmogorov complexity. This upper bound is obtained by calculating the shortest length of all possible descriptions of the pattern among a hierarchy of description languages.

Original languageEnglish (US)
Title of host publicationProceedings of the 14th IAPR International Conference on Machine Vision Applications, MVA 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages480-483
Number of pages4
ISBN (Electronic)9784901122153
DOIs
StatePublished - Jul 8 2015
Event14th IAPR International Conference on Machine Vision Applications, MVA 2015 - Tokyo, Japan
Duration: May 18 2015May 22 2015

Publication series

NameProceedings of the 14th IAPR International Conference on Machine Vision Applications, MVA 2015

Other

Other14th IAPR International Conference on Machine Vision Applications, MVA 2015
CountryJapan
CityTokyo
Period5/18/155/22/15

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Vision and Pattern Recognition

Fingerprint Dive into the research topics of 'Measuring the complexity of two-dimensional binary patterns - Sub-symmetries versus Papentin complexity'. Together they form a unique fingerprint.

Cite this