Table of Contents
Partial Shape Similarity
0. Motivation
1. Edge Detection
2. Edge Grouping
3. Extraction of Contour Parts
4. Recognizing Shapes by Parts
5. Results

Structural Shape Similarity
0. Introduction
1. Shape Segmentation
2. Skeleton Computation
3. Skeleton Pruning
4. Recognizing Shapes by Structures

Contour Grouping Based on Local Symetry
0. Introduction
1. From Edges To Contours
2. Center points
3. Reference Shape Model
4. Particle Filter
5.1. Experimental Result 1
5.2. Experimental Result 2
5.3. Experimental Result 3
5.4. Experimental Result 4
5.5. Experimental Result 5
5.6. Experimental Result 6
5.7. Experimental Result 7
5.8. Experimental Result 8
6. Conclusion
7. Contour Grouping Video

Introduction

Structural skeleton representation is an efficient method to represent the general structure of a shape. Many ways exitst to produce skeletons, but a raw skeleton contains many branches that are either redundant or the product of noise along the shape's contour. The process of skeleton pruning reduces the number of branches to obtain a much more compact tree. However, most modern methods of pruning suffer from two problems: noise and topological alteration.

Noise along the contour of a shape produces many spurrious branches in the intial tree. By current methods, some of these noisy branches are erroneously retained after pruning. This leads to skeletal structures that are inaccurate and that contain more branches than they need to have to represent the shape.

Topological alteration occurs during the pruning process. Branches that are not pruned are often times reduced in length, cut short by the pruning algorithm. In cutting the branch short, the endpoint of the branch is moved inward toward the center of the shape, off of the contour it is meant to represent. Sometimes in cutting a branch short, parts of a skeleton actually get disconnected, creating two separate skeletons out of one.

In the proposed method, we use contour partitioning to solve both of these problems. The contour partitions are obtained using Discrete Curve Evolution (DCE), an algorithm that progressively filters out noise while retaining points of visual significance along the contour. Using these points, a skeleton can be constructed that is topologically stable to the original shape, and is mostly free from noise distortions.

The skeletons we obtain represent the most significant aspects of the original shape. We are then able to use these skeletons to perform effective shape similarity comparisons.