Sciweavers

2219 search results - page 209 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
JMLR
2006
124views more  JMLR 2006»
15 years 3 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
ICCV
2009
IEEE
16 years 6 months ago
The Swap and Expansion Moves Revisited and Fused
Many solutions to computer vision and image processing problems involve the minimization of multi-label energy functions with up to K variables in each term. In the minimization pr...
Ido Leichter
CVPR
2010
IEEE
15 years 11 months ago
Parallel Graph-cuts by Adaptive Bottom-up Merging
Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today’s ubiquitou...
Jiangyu Liu, Jian Sun
SSPR
2010
Springer
15 years 1 months ago
Fast Population Game Dynamics for Dominant Sets and Other Quadratic Optimization Problems
We propose a fast population game dynamics, motivated by the analogy with infection and immunization processes within a population of “players,” for finding dominant sets, a p...
Samuel Rota Bulò, Immanuel M. Bomze, Marcel...
CSR
2008
Springer
15 years 5 months ago
Comparing Universal Covers in Polynomial Time
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
Jirí Fiala, Daniël Paulusma