2219 search results - page 9 / 444 » Dynamic Programming and Graph Algorithms in Computer Vision |
ICPR
2002
IEEE
14 years 8 months ago
2002
IEEE
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
Graph cut algorithms (i.e., min s-t cuts) [3][10][15] are useful in many computer vision applications. In this paper we develop a formulation that allows the addition of side cons...
DGCI
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We give an overview of the main ideas and tools that have been employed in uncertain geometry. We show how several recognition problems in computer vision can be translat...
ICPP
1993
IEEE
13 years 12 months ago
1993
IEEE
Task graphs are used for scheduling tasks on parallel processors when the tasks have dependencies. If the execution of the program is known ahead of time, then the tasks can be st...
EMMCVPR
2001
Springer
14 years 6 days ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...