Complexity of Shapes Embedded in ℤ^n with a Bias Towards Squares

03/16/2020
by   M. Ferhat Arslan, et al.
0

Shape complexity is a hard-to-quantify quality, mainly due to its relative nature. Biased by Euclidean thinking, circles are commonly considered as the simplest. However, their constructions as digital images are only approximations to the ideal form. Consequently, complexity orders computed in reference to circle are unstable. Unlike circles which lose their circleness in digital images, squares retain their qualities. Hence, we consider squares (hypercubes in ℤ^n) to be the simplest shapes relative to which complexity orders are constructed. Using the connection between L^∞ norm and squares we effectively encode squareness-adapted simplification through which we obtain multi-scale complexity measure, where scale determines the level of interest to the boundary. The emergent scale above which the effect of a boundary feature (appendage) disappears is related to the ratio of the contacting width of the appendage to that of the main body. We discuss what zero complexity implies in terms of information repetition and constructibility and what kind of shapes in addition to squares have zero complexity.

READ FULL TEXT

page 4

page 7

page 8

page 9

research
06/14/2017

Delta Complexes in Digital Images. Approximating Image Object Shapes

In a computational topology of digital images, simplexes are replaced by...
research
12/30/2020

Even latin squares of order 10

The Alon-Tarsi Conjecture says that the number of even latin squares of ...
research
04/05/2019

The Complexity of the Ideal Membership Problem and Theta Bodies for Constrained Problems Over the Boolean Domain

Given an ideal I and a polynomial f the Ideal Membership Problem is to t...
research
04/15/2020

Efficient Algorithms for Battleship

We consider an algorithmic problem inspired by the Battleship game. In t...
research
09/26/2019

Multi-scale Dynamic Feature Encoding Network for Image Demoireing

The prevalence of digital sensors, such as digital cameras and mobile ph...
research
01/02/2020

Convergence bounds for empirical nonlinear least-squares

We consider best approximation problems in a (nonlinear) subspace M of a...
research
05/16/2021

Monomial-size vs. Bit-complexity in Sums-of-Squares and Polynomial Calculus

In this paper we consider the relationship between monomial-size and bit...

Please sign up or login with your details

Forgot password? Click here to reset