Sciweavers

422 search results - page 3 / 85
» Weighted Minimal Hypersurfaces and Their Applications in Com...
Sort
View
CVPR
2008
IEEE
14 years 7 months ago
Globally optimal bilinear programming for computer vision applications
We present a practical algorithm that provably achieves the global optimum for a class of bilinear programs commonly arising in computer vision applications. Our approach relies o...
Manmohan Krishna Chandraker, David J. Kriegman
ICML
2006
IEEE
14 years 6 months ago
Combined central and subspace clustering for computer vision applications
Central and subspace clustering methods are at the core of many segmentation problems in computer vision. However, both methods fail to give the correct segmentation in many pract...
Le Lu, René Vidal
ICCV
2007
IEEE
14 years 7 months 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
EMMCVPR
2001
Springer
13 years 10 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
14 years 7 months ago
Computing minimal deformations: application to construction of statistical shape models
Nonlinear registration is mostly performed after initialization by a global, linear transformation (in this work, we focus on similarity transformations), computed by a linear reg...
Darko Zikic, Michael Sass Hansen, Ben Glocker, Ali...