Sciweavers

2219 search results - page 11 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
ACCV
2009
Springer
14 years 2 months ago
A Dynamic Programming Approach to Maximizing Tracks for Structure from Motion
We present a novel algorithm for improving the accuracy of structure from motion on video sequences. Its goal is to efficiently recover scene structure and camera pose by using dyn...
Jonathan Mooser, Suya You, Ulrich Neumann, Raphael...
WG
2005
Springer
14 years 1 months ago
Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny
We improve the current complexities for maintaining a chordal graph by starting with an empty graph and repeatedly adding or deleting edges.
Anne Berry, Alain Sigayret, Jeremy Spinrad
PPAM
2005
Springer
14 years 1 months ago
Scheduling Moldable Tasks for Dynamic SMP Clusters in SoC Technology
Abstract. The paper presents an algorithm for scheduling parallel programs for execution in a parallel architecture based on dynamic SMP processor clusters with data transfers on t...
Lukasz Masko, Pierre-François Dutot, Gregor...
EMMCVPR
2001
Springer
14 years 6 days ago
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
Yuri Boykov, Vladimir Kolmogorov
IPPS
2007
IEEE
14 years 2 months ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis