TY - GEN
T1 - Graphic matching based on constrained Voronoi diagrams
AU - Zhang, Hailin
AU - Yan, Hong
PY - 1999
Y1 - 1999
N2 - This paper presents a novel approach to the inexact graph matching problem based on local relationships. The constrained Voronoi diagram (CVD) is used to partition a graph into a set of polygons. The CVD provides a convenient and robust neighborhood representation for the graph. In the proposed method, Voronoi neighboring relationships as well as geometrical characteristics are used to detect potentially matching pairs of objects. This method is implemented and tested in the matching process for 2D cartoon key frames with encouraging results. © 1999 IEEE.
AB - This paper presents a novel approach to the inexact graph matching problem based on local relationships. The constrained Voronoi diagram (CVD) is used to partition a graph into a set of polygons. The CVD provides a convenient and robust neighborhood representation for the graph. In the proposed method, Voronoi neighboring relationships as well as geometrical characteristics are used to detect potentially matching pairs of objects. This method is implemented and tested in the matching process for 2D cartoon key frames with encouraging results. © 1999 IEEE.
UR - https://www.scopus.com/pages/publications/3142705169
UR - https://www.scopus.com/pages/publications/3142705169#tab=impact
U2 - 10.1109/ISSPA.1999.818204
DO - 10.1109/ISSPA.1999.818204
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 1864354518
SN - 9781864354515
VL - 1
SP - 431
EP - 434
BT - ISSPA 1999 - Proceedings of the 5th International Symposium on Signal Processing and Its Applications
PB - IEEE Computer Society
T2 - 5th International Symposium on Signal Processing and Its Applications, ISSPA 1999
Y2 - 22 August 1999 through 25 August 1999
ER -