Sciweavers

64 search results - page 1 / 13
» Applications of parametric maxflow in computer vision
Sort
View
ICCV
2007
IEEE
15 years 24 days ago
Applications of parametric maxflow in computer vision
The maximum flow algorithm for minimizing energy functions of binary variables has become a standard tool in computer vision. In many cases, unary costs of the energy depend linea...
Vladimir Kolmogorov, Yuri Boykov, Carsten Rother
EMMCVPR
2001
Springer
14 years 3 months 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
CVPR
2008
IEEE
15 years 26 days ago
Statistical analysis on Stiefel and Grassmann manifolds with applications in computer vision
Many applications in computer vision and pattern recognition involve drawing inferences on certain manifoldvalued parameters. In order to develop accurate inference algorithms on ...
Pavan K. Turaga, Ashok Veeraraghavan, Rama Chellap...
CVPR
2012
IEEE
12 years 1 months ago
Compressive depth map acquisition using a single photon-counting detector: Parametric signal processing meets sparsity
Active range acquisition systems such as light detection and ranging (LIDAR) and time-of-flight (TOF) cameras achieve high depth resolution but suffer from poor spatial resolutio...
Andrea Colaco, Ahmed Kirmani, Gregory A. Howland, ...
ICCV
2007
IEEE
15 years 24 days ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov