Extended Investigations on Skeleton Graph Matching for Object Recognition
Shape similarity estimation of objects is a key component in many computer vision systems. In order to compare two shapes, salient features of a query and target shape are selected and compared with each other, based on a predefined similarity measure. The challenge is to find a meaningful similarity measure that captures most of the original shape properties. One well performing approach called Path Similarity Skeleton Graph Matching has been introduced by Bai and Latecki. Their idea is to represent and match the objects shape by its interior through geodesic paths between skeleton end nodes. Thus it is enabled to robustly match deformable objects. However, insight knowledge about how a similarity measure works is of great importance to understand the matching procedure. In this paper we experimentally evaluate our reimplementation of the Path Similarity Skeleton Graph Matching Algorithm on three 2D shape databases. Furthermore, we outline in detail the strengths and limitations of the described methods. Additionally, we explain how the limitations of the existing algorithm can be overcome.
KeywordsSkeleton Skeleton Graph Graph Matching Shape Recognition
Unable to display preview. Download preview PDF.
- 1.Aslan, C., Tari, S.: An axis-based representation for recognition. In: Proceedings of the Tenth IEEE International Conference on Computer Vision, pp. 1339–1346 (2005)Google Scholar
- 8.Klein, P., Srikanta, T., Sharvit, D., Kimia, B.: A tree-edit-distance algorithm for comparing simple, closed shapes. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 696–704. Society for Industrial and Applied Mathematic, Philadelphia (2000)Google Scholar
- 9.Klein, P.N., Sebastian, T.B., Kimia, B.B.: Shape matching using edit-distance: an implementation. In: Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 781–790. Society for Industrial and Applied Mathematic, Philadelphia (2001)Google Scholar
- 10.Komala Lakshmi, J., Punithavalli, M.: A survey on skeletons in digital image processing. In: Proceedings of the International Conference on Digital Image Processing, pp. 260–269 (2009)Google Scholar
- 11.Latecki, L.J., Wang, Q., Koknar-Tezel, S., Megalooikonomou, V.: Optimal subsequence bijection. In: ICDM 2007: Proceedings of the 2007 Seventh IEEE International Conference on Data Mining, pp. 565–570. IEEE Computer Society, Washington, DC (2007)Google Scholar
- 15.Sebastian, T.B., Klein, P.N., Kimia, B.B.: Recognition of shapes by editing shock graphs. In: IEEE International Conference on Computer Vision, pp. 755–762 (2001)Google Scholar
- 17.Tadeusiewicz, R.: What does it means ”automatic understanding of the images”? In: Proceedings of the 2007 IEEE International Workshop on Imaging Systems and Techniques, pp. 1–3 (May 2007)Google Scholar