Symmetry of Shapes Via Self-similarity

Authors:
Xingwei Yang;Nagesh Adluru;Longin Jan Latecki;Xiang Bai;Zygmunt Pizlo
Affiliations:
Temple University, Philadelphia,;Temple University, Philadelphia,;Temple University, Philadelphia,;Huazhong University of Science and Technology, Wuhan,;Purdue University, West Lafayette,
Venue:
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Year:
2008

Citing 11
Cited 1

Finding axes of skewed symmetry

Computer Vision, Graphics, and Image Processing
On characterizing ribbons and finding skewed symmetries

Computer Vision, Graphics, and Image Processing
Convexity rule for shape decomposition based on discrete contour evolution

Computer Vision and Image Understanding
Introduction to Algorithms

Introduction to Algorithms
Shape Matching and Object Recognition Using Shape Contexts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Representation and Self-Similarity of Shapes

IEEE Transactions on Pattern Analysis and Machine Intelligence
An Axis-Based Representation for Recognition

ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
Shape Classification Using the Inner-Distance

IEEE Transactions on Pattern Analysis and Machine Intelligence
Analysis of Two-Dimensional Non-Rigid Shapes

International Journal of Computer Vision
Path Similarity Skeleton Graph Matching

IEEE Transactions on Pattern Analysis and Machine Intelligence
Matching two-dimensional articulated shapes using generalized multidimensional scaling

AMDO'06 Proceedings of the 4th international conference on Articulated Motion and Deformable Objects

Short Communication to SMI 2011: Affine-invariant geodesic geometry of deformable 3D shapes

Computers and Graphics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a simple and novel approach to identify main similarity axes by maximizing self-similarity of object contour parts divided by the axes. For a symmetric or approximately symmetric shape, the main self-similarity axis coincides with the main axis of symmetry. However, the concept of the main self-similarity axis is more general, and significantly easier to compute. By identifying critical points on the contour self-similarity computation can be expressed as a discrete problem of finding two subsets of the critical points such that the two contour parts determined by the subsets are maximally similar. In other words, for each shape, we compute its division into two parts so that the parts are maximally similar. Our experimental results yield correctly placed maximal symmetry axes for articulated and highly distorted shapes.