Similarity Invariant Delaunay Graph Matching
Delaunay tessellation describes a set of arbitrarily distributed points as unique triangular graphs which preserves most local point configuration called a clique regardless of noise addition and partial occlusion. In this paper, this structure is utilised in a matching method and proposed a clique-based Hausdorff Distance (HD) to address point pattern matching problems. Since the proposed distance exploits similarity invariant features extracted from a clique, it is invariant to rotation, translation and scaling. Furthermore, it inherits noise robustness from HD and has partial matching ability because matching performs on local entities. Experimental results show that the proposed method performs better than the existing variants of the general HD.
KeywordsPoint pattern matching Delaunay tessellation Hausdorff distance Similarity invariant distance
- 9.Jolly, M.P.D., Jain, A.K.: A modified hausdorff distance for object matching. In: Proc. Int. Conf. Pattern Recognition, vol. A, pp. 566–568 (1994)Google Scholar
- 13.Yu, X., Leung, M.K.H.: Shape recognition using curve segment Hausdorff distance. In: Proc. Int. Conf. Pattern Recognition, vol. 3, pp. 441–444 (2006)Google Scholar