M. Pelillo, K. Siddiqi, and S. W. Zucker. Attributed tree matching and maximum weight cliques. In Proc. Image Analysis and Processing, pages 1154--1159. IEEE, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Matching Hierarchical Structures Using Association Graphs - Pelillo, Siddiqi, Zucker (1998) (39 citations) Self-citation (Pelillo Siddiqi Zucker) (Correct)
....Table 1. A tabulation of the top 5 matches for each query. The scores indicate the size of the maximal clique found, normalized by the average number of nodes in the two trees. Note that only the topology of the shock trees was used; the addition of geometric information permits finer comparisons [27]. 5 Conclusions We have developed a formal approach for matching hierarchical structures by constructing an association graph whose maximal cliques are in one to one correspondence with maximal subtree isomorphisms. The framework is general and can be applied in a variety of computer vision ....
....potential for shape matching. The solution is found by using a dynamical system, which makes it amenable to hardware implementation and offers the advantage of biological plausibility. In particular, the relaxation labeling equations are related to putative neuronal implementations [18, 19] In [27] we extend the present framework to the problem of matching hierarchical structures with attributes. The attributes result in weights being placed on the nodes of the association graph, and a conversion of the maximum clique problem to a maximum weight clique problem. Acknowledgements We thank ....
M. Pelillo, K. Siddiqi, and S. W. Zucker. Attributed tree matching and maximum weight cliques. Submitted, 1997.
Continuous-based Heuristics for Graph and Tree.. - Pelillo, Siddiqi, Zucker (1999) (3 citations) Self-citation (Pelillo Siddiqi Zucker) (Correct)
....are typically within the top 5 matches, illustrating the potential of a topological matching process for indexing into a database of shapes. Nevertheless, there are shapes with similar shock tree topologies but dissimilar geometries, e.g. the profile and the brushes in the first two rows. In [43] we extended our framework to incorporate geometric information contained in each shock sequence (the location, time of formation, speed and direction of each shock) as attributes on the nodes. This leads to better discrimination between shapes than that provided by shock tree topologies alone. 6 ....
....local solutions, they nevertheless provide experimental results which are competitive with those obtained using more sophisticated mean field annealing heuristics. Application of this approach to shape matching problems arising in computer vision and pattern recognition have been presented. In [43], we extend the framework to handle the matching of attributed trees, by casting the problem as that of finding a maximum weight clique in a weighted association graph. A recent generalization of the Motzkin Straus theorem applies [15] allowing the use of the same replicator dynamics as in the ....
M. Pelillo, K. Siddiqi, and S. W. Zucker. Attributed tree matching and maximum weight cliques. submitted to ICIAP'99---10th Int. Conf. on Image Analysis and Processing, Venice, Italy, Sept. 1999.
A 3D Model Search Engine - Min (2004) (Correct)
No context found.
M. Pelillo, K. Siddiqi, and S. W. Zucker. Attributed tree matching and maximum weight cliques. In Proc. Image Analysis and Processing, pages 1154--1159. IEEE, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC