Sciweavers

221 search results - page 4 / 45
» Graph matching with type constraints on nodes and edges
Sort
View
ICCV
2011
IEEE
12 years 7 months ago
A Graph-matching Kernel for Object Categorization
This paper addresses the problem of category-level image classification. The underlying image model is a graph whose nodes correspond to a dense set of regions, and edges reflec...
Olivier Duchenne, Armand Joulin, Jean Ponce
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
13 years 11 months ago
Routing permutations on graphs via matchings
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
Noga Alon, Fan R. K. Chung, Ronald L. Graham
CVPR
2011
IEEE
13 years 3 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
CCS
2009
ACM
14 years 8 months ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
CVPR
2004
IEEE
14 years 9 months ago
Representation and Matching of Articulated Shapes
We consider the problem of localizing the articulated and deformable shape of a walking person in a single view. We represent the non-rigid 2D body contour by a Bayesian graphical...
Jiayong Zhang, Robert T. Collins, Yanxi Liu