616 search results - page 40 / 124 » Local Feature Matching Using Entropic Graphs |
NIPS
2001
13 years 9 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
ICIP
2009
IEEE
14 years 9 months ago
2009
IEEE
We present a new method for matching a region between an input and a query image, based on the P-channel representation of pixel-based image features such as grayscale and color i...
RECOMB
2004
Springer
14 years 8 months ago
2004
Springer
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
JCP
2008
13 years 7 months ago
2008
We perform the task of shape recognition using a skeleton based method. Skeleton of the shape is considered as a free tree and is represented by a connectivity graph. Geometric fea...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
We present a unified framework for modeling and solving invariant point pattern matching problems. Invariant features are encoded as potentials in a probabilistic graphical model....