Complexity of Shapes Embedded in ${\mathbb Z^n}$ with a Bias Towards
Squares
- URL: http://arxiv.org/abs/2003.07341v1
- Date: Mon, 16 Mar 2020 17:24:22 GMT
- Title: Complexity of Shapes Embedded in ${\mathbb Z^n}$ with a Bias Towards
Squares
- Authors: M. Ferhat Arslan (1), Sibel Tari (1) ((1) Middle East Technical
University)
- Abstract summary: Shape complexity is a hard-to-quantify quality, mainly due to its relative nature.
We consider squares to be the simplest shapes relative to which complexity orders are constructed.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: 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 $\mathbb Z^n$) to be the simplest shapes relative to which
complexity orders are constructed. Using the connection between $L^\infty$ 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.
Related papers
- AdaContour: Adaptive Contour Descriptor with Hierarchical Representation [52.381359663689004]
Existing angle-based contour descriptors suffer from lossy representation for non-star shapes.
AdaCon is able to represent shapes more accurately robustly than other descriptors.
arXiv Detail & Related papers (2024-04-12T07:30:24Z) - Toward a physically motivated notion of Gaussian complexity geometry [0.0]
We present a construction of a geometric notion of circuit complexity for Gaussian states.
We show how to account for time-reversal symmetry breaking in measures of complexity.
This establishes a first step towards building a quantitative, geometric notion of complexity.
arXiv Detail & Related papers (2023-09-25T18:00:01Z) - Geometrically Consistent Partial Shape Matching [50.29468769172704]
Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics.
An often neglected but essential property of matching geometrics is consistency.
We propose a novel integer linear programming partial shape matching formulation.
arXiv Detail & Related papers (2023-09-10T12:21:42Z) - CCuantuMM: Cycle-Consistent Quantum-Hybrid Matching of Multiple Shapes [62.45415756883437]
Jointly matching multiple, non-rigidly deformed 3D shapes is a challenging, $mathcalNP$-hard problem.
Existing quantum shape-matching methods do not support multiple shapes and even less cycle consistency.
This paper introduces the first quantum-hybrid approach for 3D shape multi-matching.
arXiv Detail & Related papers (2023-03-28T17:59:55Z) - A Scalable Combinatorial Solver for Elastic Geometrically Consistent 3D
Shape Matching [69.14632473279651]
We present a scalable algorithm for globally optimizing over the space of geometrically consistent mappings between 3D shapes.
We propose a novel primal coupled with a Lagrange dual problem that is several orders of magnitudes faster than previous solvers.
arXiv Detail & Related papers (2022-04-27T09:47:47Z) - Bounds on quantum evolution complexity via lattice cryptography [0.0]
We address the difference between integrable and chaotic motion in quantum theory as manifested by the complexity of the corresponding evolution operators.
Complexity is understood here as the shortest geodesic distance between the time-dependent evolution operator and the origin within the group of unitaries.
arXiv Detail & Related papers (2022-02-28T16:20:10Z) - Simplicial Quantum Gravity [0.0]
A four-dimensional simplicial geometry is made up of flat four-simplices joined together.
A sum over simplicial geometries is a sum over thedifferent ways the simplices can be joined together with an integral over their edge lengths.
arXiv Detail & Related papers (2022-01-01T18:20:07Z) - Sectional curvatures distribution of complexity geometry [0.0]
In the geometric approach to define complexity, operator complexity is defined as the distance on the operator space.
The typical sectional curvatures of this complexity geometry are positive.
It can also be shown that in the Hilbert space, 2-surfaces generated by operators of size much smaller than the typical size acting on typical states also have negative curvatures.
arXiv Detail & Related papers (2021-08-26T07:23:03Z) - Average-case Complexity of Teaching Convex Polytopes via Halfspace
Queries [55.28642461328172]
We show that the average-case teaching complexity is $Theta(d)$, which is in sharp contrast to the worst-case teaching complexity of $Theta(n)$.
Our insights allow us to establish a tight bound on the average-case complexity for $phi$-separable dichotomies.
arXiv Detail & Related papers (2020-06-25T19:59:24Z) - A refinement of Reznick's Positivstellensatz with applications to
quantum information theory [72.8349503901712]
In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares.
Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
arXiv Detail & Related papers (2019-09-04T11:46:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.