557 search results - page 61 / 112 » Visualizing Weighted Edges in Graphs |
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
Classification with only one labeled example per class is a challenging problem in machine learning and pattern recognition. While there have been some attempts to address this pr...
SCIA
2007
Springer
15 years 5 months ago
2007
Springer
This paper proposes a fast 3D reconstruction approach for efficiently generating watertight 3D models from multiple short baseline views. Our method is based on the combination of...
105
click to vote
SIAMDM
2008
14 years 11 months ago
2008
Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
104
click to vote
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
In this work, we extend a common framework for seeded
image segmentation that includes the graph cuts, ran-
dom walker, and shortest path optimization algorithms.
Viewing an ima...
ICML
2006
IEEE
15 years 12 months ago
2006
IEEE
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...