Matthijs van Eede University of Toronto August 22nd, 2006

1. Matthijs van Eede University of Toronto August 22nd, 2006 Joint work with Diego Macrini, Alex Telea, Cristian Sminchisescu, and Sven Dickinson

2. The skeleton of a shape yields a symmetry-based parts decomposition (e.g., a shock graph) which can support effective object indexing and recognition, e.g., Siddiqi et al. (1999), Sebastian et al. (2004). But, they suffer from two forms of instability…

5. Ligature segment Ligature branch Blum (1973)

6. “Smooth” these structural instabilities while retaining the object’s salient shape structure. • Two exemplar shapes drawn from the same category should therefore yield two graphs with the same structure.

7. Prune skeletal branches that don’t contribute to the salient shape structure of the object. • Simpler graphs with fewer unstable nodes lead to more efficient and more effective indexing and matching. • But how do we measure branch saliency and when do we stop pruning?

8. Reconstruction error

9. Saliency favors elongated and thick parts External branches rank-ordered by saliency: 7 4 8 2 5 3 1 6 9 12 10 11

10. The cost of external branch smoothing: increased reconstruction error No Smoothing Mild Smoothing Strong Smoothing

11. Intuitively: create similar topologies in the skeletons by pruning short (low saliency) ligature segments and branches Ligature branch Ligature segment

13. Fit piecewise linear skeleton fragments subject to endpoint and tangent constraints

14. The cost of internal branch smoothing: altering the shape’s appearance No Smoothing Mild Smoothing Strong Smoothing

15. Fact  the medial axis transform of a shape is unique; skeleton changes introduce reconstruction error • Goal  minimize a cost function that promotes simpler skeletons with low reconstruction error Reconstruction error # branches R(sp) sp p

16. Rank-order external branches by saliency • Iteratively prune low-saliency external branches until cost function is minimized • For internal branches, identify the ligature branches as candidates for pruning, and rank-order them by saliency • Iteratively prune low-saliency candidate internal branches until cost function is minimized

17. Three hand shapes and their skeletons using both external as well as internal simplifications Notice the isomorphic graph structure Three hand shapes and their skeletons using no simplifications

18. Shock graphs are computed for 15 views of 8 three dimensional CAD models. A total of 120 shapes in the database. • Each object view is removed from the database and used as a query • Successful object recognition  best ranked view belongs to the same object as query view • Successful pose estimation  neighbouring view of query is among top ranked views • Noise is simulated by adding random “bumps” and “notches” to the query.

20. Results without using simplifications • Object recognition performance increased up to 16% • Pose estimation performance increased up to 20% • (r5) = having a radius of 5 pixels Results when using simplifications

21. Skeletal descriptions of a shape offer a powerful shape representation for object recognition, yet their structural instability has long been an obstacle to their widespread use. • Our structural simplification framework isolates this instability at both external and internal branches, and removes non-salient branches. • The removal of internal branches requires a proper smoothing of neighboring branches so that the resulting skeleton is a MAT and reconstruction error is minimized. • Results on a shock graph recognition experiment indicate a significant improvement in recognition and pose estimation performance when both query and database are structurally simplified prior to recognition.