616 search results - page 6 / 124 » Local Feature Matching Using Entropic Graphs |
SCIA
2007
Springer
14 years 1 months ago
2007
Springer
SIAMDM
2011
13 years 2 months ago
2011
For stable marriage (SM) and solvable stable roommates (SR) instances, it is known that there are stable matchings that assign each participant to his or her (lower/upper) median ...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— In this paper we present a vision-based approach to self-localization that uses a novel scheme to integrate featurebased matching of panoramic images with Monte Carlo localizat...
DAGSTUHL
2006
13 years 9 months ago
2006
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...