The authors present an approach for finding corresponding points between two graphs derived from perspective views of a moving object whose surface is composed of planar polygons. In their approach, each circuit of the graph is encoded with a shape code which they call RLCC code, then a relaxation process is used to get a reliable matching result. A series of experiments have shown that the present approach works well even when considerable dissimilarities exist between the two graphs.
|Original language||English (US)|
|Title of host publication||Proceedings - International Conference on Pattern Recognition|
|Number of pages||3|
|State||Published - Dec 1 1984|
|Name||Proceedings - International Conference on Pattern Recognition|
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition