Search Results for author:
Found 5 papers, 0 papers with code
Complexity of Shapes Embedded in ${\mathbb Z^n}$ with a Bias Towards Squares
Hence, we consider squares (hypercubes in $\mathbb Z^n$) to be the simplest shapes relative to which complexity orders are constructed.
A Non-structural Representation Scheme for Articulated Shapes
For representing articulated shapes, as an alternative to the structured models based on graphs representing part hierarchy, we propose a pixel-based distinctness measure.
Analysis of planar ornament patterns via motif asymmetry assumption and local connections
Given the image of an ornament fragment, we present a method to simultaneously classify the input into one of the $13$ groups and extract the so called fundamental domain (FD), the minimum region that is sufficient to reconstruct the entire ornament.
A Product Shape Congruity Measure via Entropy in Shape Scale Space
We propose a measure to indirectly quantify congruity of different parts of the shape and the degree to which the parts deviate from a sphere, i. e. our choice of the prototype, without explicitly defining parts and their relations.
Topologically Robust 3D Shape Matching via Gradual Deflation and Inflation
Despite being vastly ignored in the literature, coping with topological noise is an issue of increasing importance, especially as a consequence of the increasing number and diversity of 3D polygonal models that are captured by devices of different qualities or synthesized by algorithms of different stabilities.
