Extending Graph-Cut to Continuous Value Domain Minimization

Felsberg, M.
CRV07
Fourth Canadian Conference on Computer and Robot Vision
Pages 274-281
2007

Abstract

In this paper we propose two methods for minimizing objective functions of discrete functions with continuous value domain. Many practical problems in the area of computer vision are continuous-valued, and discrete optimization methods of graph-cut type cannot be applied directly. This is different with the proposed methods. The first method is an add-on for multiple-label graph-cut. In the second one, binary graph-cut is firstly used to generate regions of support within different ranges of the signal. Secondly, a robust error minimization is approximated based on the previously determined regions. The advantages and properties of the new approaches are explained and visualized using synthetic test data. The methods are compared to ordinary multi-label graph-cut and robust smoothing for the application of disparity estimation. They show better quality of results compared to the other approaches and the second algorithm is significantly faster than multi-label graph-cut.

Bibtex entry

@inproceedings{f07,
        Author = {Felsberg, M.},
        Booktitle = {Fourth Canadian Conference on Computer and Robot Vision},
        Date-Added = {2007-08-07 11:14:41 +0200},
        Date-Modified = {2007-08-07 11:14:41 +0200},
        Pages = {274--281},
        Title = {Extending Graph-Cut to Continuous Value Domain Minimization},
        Year = {2007}}