2219 search results - page 25 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
ASP
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
ICCV
2007
IEEE
14 years 3 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...
EMMCVPR
2007
Springer
14 years 27 days ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
COMPGEOM
2006
ACM
14 years 3 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
ICCV
2001
IEEE
14 years 11 months ago
2001
IEEE
Several new algorithms for visual correspondence based on graph cuts [6, 13, 16] have recently been developed. While these methods give very strong results in practice, they do no...