Perimetric complexity of binary digital images: Notes on calculation and relation to visual complexity (2012)
Perimetric complexity is a measure of the complexity of binary pictures. It is defined as the sum of inside and outside perimeters of the foreground, squared, divided by the foreground area, divided by 4 p. Difficulties arise when this definition is applied to digital images composed of binary pixels. In this article we identify these problems and propose solutions. Perimetric complexity is often used as a measure of visual complexity, in which case it should take into account the limited resolution of the visual system. We propose a measure of visual perimetric complexity that meets this requirement.
binary, calculation, complexity, complexity, digital, images, Notes, Perimetric, relation, visual
Mathematica Journal, 14
