Estimating Complexity of 2D Shapes

@article{Chen2005EstimatingCO,
  title={Estimating Complexity of 2D Shapes},
  author={Yinpeng Chen and H. Sundaram},
  journal={2005 IEEE 7th Workshop on Multimedia Signal Processing},
  year={2005},
  pages={1-4}
}
  • Yinpeng Chen, H. Sundaram
  • Published 2005
  • Computer Science, Mathematics
  • 2005 IEEE 7th Workshop on Multimedia Signal Processing
This paper deals with the problem of estimating 2D shape complexity. [...] Key Method We define shape complexity using correlates of Kolmogorov complexity-entropy measures of global distance and local angle, and a measure of shape randomness. We tested our algorithm on synthetic and real world datasets with excellent results. We also conducted user studies that indicate that our measure is highly correlated with human perception. They also reveal an intuitive shape sensitivity curve-simple shapes are easily…Expand
Scale Adaptive Complexity Measure of 2D Shapes
TLDR
A complexity (or irregularity) measure of 2D shapes is described that incorporates the scale information into the boundary complexity definition and also into the determination of weights associated with different properties. Expand
Exploring 2D Shape Complexity
TLDR
A new measure of complexity based on the Blum medial axis and the notion of persistent complexity as captured by histograms at multiple scales rather than a single numerical value are included. Expand
3 D Shape Complexity using View Similarity
Shape complexity algorithms are mostly based on informatio n theory, which is based on probability theory and statistics, like Shannon’s definition of entropy or mutual information. The input of theExpand
Parameter-free modelling of 2D shapes with ellipses
TLDR
A novel definition of shape complexity that exploits the shape skeleton is proposed and the solutions proposed by AEFA and DEFA seem to agree with human intuition. Expand
Visual complexity of shapes: a hierarchical perceptual learning model
TLDR
This model considers both local features of shapes: edge lengths and vertex angles, and global features: concaveness, and is in 92% agreement with human subjective ratings of shape complexity, consistent with hierarchical perceptual learning theory. Expand
Complexity of Shapes Embedded in ${\mathbb Z^n}$ with a Bias Towards Squares.
TLDR
This work considers squares (hypercubes in $\mathbb Z^n$) to be the simplest shapes relative to which complexity orders are constructed and what kind of shapes in addition to squares have zero complexity. Expand
Evaluation of shape complexity based on STL data
TLDR
It is discovered that evaluation of shape complexity based only on basic data of STL data gives us some basic view on part complexity, which can cause revolution in manufacturing optimization, especially in hybrid manufacturing processes. Expand
Basic solutions on shape complexity evaluation of STL data
TLDR
It is discovered that evaluation of shape complexity based only on basic data of STL data gives us some basic results on part complexity and can be used for further researches. Expand
Complexity of Shapes Embedded in Zn With a Bias Towards Squares
  • Mazlum Ferhat Arslan, S. Tari
  • Computer Science, Medicine
  • IEEE Transactions on Image Processing
  • 2020
TLDR
What zero complexity implies in terms of information repetition and constructibility and what kind of shapes in addition to squares have zero complexity are discussed. Expand
A Computational Model for Amodal Completion
TLDR
A perceptually inspired object disocclusion method that works by minimizing the Euler’s elastica as well as by incorporating the relatability of partially occluded contours and the convexity of the disoccluded objects to recover the most likely interpretation of the 3D scene structure from a planar image. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 10 REFERENCES
A computationally efficient 3D shape rejection algorithm
TLDR
An efficient 3D shape rejection algorithm for unlabeled 3D markers with an order of magnitude improvement in terms of computational complexity over a baseline shape matching algorithm is presented. Expand
Shape analysis algorithm based on information theory
TLDR
An algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes is described and the theory of shape information is formulated from these definitions. Expand
Measuring the Complexity of Polygonal Objects
TLDR
A basic set of parameters describing a polygon and a set of intuitive lingual properties are developed and condensed into one measure of complexity, which distinguishes a wider range of more and less complex objects and is more intuitive than the fractal dimension. Expand
Triangulation and shape-complexity
TLDR
This paper describes a new method for triangulating a simple n-sided polygon, and is the first method whose performance is linear in the number of vertices, up to within a factor that depends only on the shape-complexity of the polygon. Expand
Efficient triangulation of simple polygons
  • G. Toussaint
  • Mathematics, Computer Science
  • The Visual Computer
  • 2005
TLDR
This paper considers the topic of efficiently traingulating a simple polygon with emphasis on practical and easy-to-implement algorithms and describes a new adaptive algorithm for triangulating a simplen-sided polygon that is the first polygon triangulation algorithm where the computational complexity is a function of the output complexity. Expand
Parts of Visual Form: Computational Aspects
TLDR
Computational support for the limb-based and neck-based parts is presented by showing that they are invariant, robust, stable and yield a hierarchy of parts. Expand
Features of Similarity
The metric and dimensional assumptions that underlie the geometric representation of similarity are questioned on both theoretical and empirical grounds. A new set-theoretical approach to similarityExpand
Elements of Information Theory
TLDR
The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment. Expand
A Computationally Efficient 3 D Shape Rejection Algorithm , to appear in Proc
  • 2005
Features of Similarity. Psychological Review
  • Downloaded on December 27,2020
  • 1977