1115 search results - page 51 / 223 » Separating Shape Graphs |
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...
POPL
1993
ACM
14 years 17 days ago
1993
ACM
e data structures are abstractions of simple records and pointers. They impose a shape invariant, which is verified at compiletime and exploited to automatically generate code fo...
CVPR
2000
IEEE
14 years 10 months ago
2000
IEEE
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...
DAWAK
2007
Springer
14 years 2 months ago
2007
Springer
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...
DAGSTUHL
2003
13 years 10 months ago
2003
One way to visualize large time-dependent data sets, is by visualization of the evolution of features in these data. The process consists of four steps: feature extraction, featur...