Sciweavers

160 search results - page 17 / 32
» A New Algorithm for Inexact Graph Matching
Sort
View
ICALP
2009
Springer
15 years 10 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
CVPR
2008
IEEE
15 years 11 months ago
Relaxed matching kernels for robust image comparison
The popular bag-of-features representation for object recognition collects signatures of local image patches and discards spatial information. Some have recently attempted to at l...
Andrea Vedaldi, Stefano Soatto
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 14 days ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
CVPR
2000
IEEE
15 years 11 months ago
Robust and Efficient Skeletal Graphs
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...
Pavel Dimitrov, Carlos Phillips, Kaleem Siddiqi
76
Voted
CG
2007
Springer
14 years 9 months ago
Graphtracker: A topology projection invariant optical tracker
In this paper, we describe a new optical tracking algorithm for pose estimation of interaction devices in virtual and augmented reality. Given a 3D model of the interaction device...
Ferdi A. Smit, Arjen van Rhijn, Robert van Liere