Kolmogorov, V and Boykov, Y and Rother, C (2007) Applications of parametric maxflow in computer vision. In: 2007 IEEE 11TH INTERNATIONAL CONFERENCE ON COMPUTER VISION, VOLS 1-6. (pp. 644 - 651). IEEE
Full text not available from this repository.
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 linearly on parameter lambda. In this paper we study vision applications for which it is important to solve the maxflow problem for different lambda's. An example is a weighting between data and regularization terms in image segmentation or stereo: it is desirable to vary it both during training (to learn lambda from ground truth data) and testing (to select best lambda using high-knowledge constraints, e.g. user input).We review algorithmic aspects of this parametric maximum flow problem previously unknown in vision, such as the ability to compute all breakpoints of lambda and corresponding optimal configurations infinite time.These results allow, in particular to minimize the ratio of some geometric functionals, such as flux of a vector field over length (or area). Previously, such functionals were tackled with shortest path techniques applicable only in 2D.We give theoretical improvements for "PDE cuts" . We present experimental results for image segmentation, 3D reconstruction, and the cosegmentation problem.
|Title:||Applications of parametric maxflow in computer vision|
|Event:||11th IEEE International Conference on Computer Vision|
|Location:||Rio de Janeiro, BRAZIL|
|Dates:||2007-10-14 - 2007-10-21|
|Keywords:||IMAGE SEGMENTATION, ALGORITHM|
|UCL classification:||UCL > School of BEAMS > Faculty of Engineering Science > Computer Science|
Archive Staff Only: edit this record