49 search results - page 3 / 10 » Comparing Graph Layouts for Vertex Selection Tasks |
TRECVID
2008
13 years 8 months ago
2008
We studied a method using support vector machines (SVMs) with walk-based graph kernels for the high-level feature extraction (HLF) task. In this method, each image is first segmen...
UIST
2009
ACM
14 years 1 months ago
2009
ACM
Time-series graphs are often used to visualize phenomena that change over time. Common tasks include comparing values at different points in time and searching for specified patte...
AAAI
2007
13 years 9 months ago
2007
RDF (“Resource Description Framework”) is now a widely used World Wide Web Consortium standard. However, methods to index large volumes of RDF data are still in their infancy....
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
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...
CVPR
2004
IEEE
14 years 9 months ago
2004
IEEE
Many vision tasks can be formulated as partitioning an adjacency graph through optimizing a Bayesian posterior probability p defined on the partition-space. In this paper two appr...