32 search results - page 1 / 7 » Many-to-Many Graph Matching: a Continuous Relaxation Approac... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
JCSC
1998
13 years 5 months ago
1998
: Continuous and hybrid Petri nets can be seen as relaxation of discrete nets, in which the firing of some or of all transitions is approximated with a fluid model. Several analysi...
EMMCVPR
2005
Springer
13 years 10 months ago
2005
Springer
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
CVPR
2004
IEEE
14 years 7 months ago
2004
IEEE
This paper explores a formulation for attributed graph matching as an inference problem over a hidden Markov Random Field. We approximate the fully connected model with simpler mo...
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
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...