Shock graphs and shape matching

被引：74

作者：

Siddiqi, K ^{[1
]}

Shokoufandeh, A ^{[1
]}

Dickinson, SJ ^{[1
]}

Zucker, SW ^{[1
]}

机构：

[1] Yale Univ, Ctr Computat Vis & Control, New Haven, CT 06520 USA

来源：

SIXTH INTERNATIONAL CONFERENCE ON COMPUTER VISION | 1998年

关键词：

D O I：

10.1109/ICCV.1998.710722

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We have been developing a theory for the generic representation of 2-D shape, where structural descriptions are derived from the shocks (singularities) of a curve evolution process, acting on bounding contours. We now apply the theory to the problem of shape matching. The shocks are organized into a directed, acyclic shock graph, and complexity is managed by attending to the most significant (central) shape components first. The space of all such graphs is highly structured and can be characterized by the rules of a shock graph grammar. The grammar permits a reduction of a shock graph to a unique rooted shed tree. We introduce a novel tree matching algorithm which finds the best set of corresponding nodes between two shock trees in polynomial time. Using a diverse database of shapes, we demonstrate our system's performance under articulation, occlusion, and changes in viewpoint.

引用

页码：222 / 229

页数：8