779 search results - page 67 / 156 » Algorithms for the Sample Mean of Graphs |
134
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
This paper proposes a robust estimation and validation framework for characterizing local structures in a positive multi-variate continuous function approximated by a Gaussian-base...
144
click to vote
CVPR
2008
IEEE
16 years 6 months ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
340
click to vote
EMMCVPR
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. We present two data-driven importance distributions for particle filterbased articulated tracking; one based on background subtraction, another on depth information. In ...
158
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...
143
click to vote
ICCV
2007
IEEE
15 years 10 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...