Sciweavers

103 search results - page 1 / 21
» Adaptive Matching Based Kernels for Labelled Graphs
Sort
View
PAKDD
2010
ACM
124views Data Mining» more  PAKDD 2010»
13 years 9 months ago
Adaptive Matching Based Kernels for Labelled Graphs
Adam Woznica, Alexandros Kalousis, Melanie Hilario
ICCV
2007
IEEE
14 years 6 months ago
Optimization Algorithms for Labeling Brain Sulci Based on Graph Matching
Graph matching techniques are widely used in pattern recognition problems such as scene description, finger print identification, or face recognition. In this paper, we put forwar...
Faguo Yang, Frithjof Kruggel
AAAI
2012
11 years 7 months ago
Semi-Supervised Kernel Matching for Domain Adaptation
In this paper, we propose a semi-supervised kernel matching method to address domain adaptation problems where the source distribution substantially differs from the target distri...
Min Xiao, Yuhong Guo
CVPR
2007
IEEE
14 years 7 months ago
Image Classification with Segmentation Graph Kernels
We propose a family of kernels between images, defined as kernels between their respective segmentation graphs. The kernels are based on soft matching of subtree-patterns of the r...
Francis Bach, Zaïd Harchaoui
EMMCVPR
2005
Springer
13 years 10 months ago
Linear Programming Matching and Appearance-Adaptive Object Tracking
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...
Hao Jiang, Mark S. Drew, Ze-Nian Li