An Improved Riemannian Metric Approximation for Graph Cuts
| Authors | |
|---|---|
| Year of publication | 2011 |
| Type | Article in Proceedings |
| Conference | 16th International Conference on Discrete Geometry for Computer Imagery |
| MU Faculty or unit | |
| Citation | |
| Web | http://www.springerlink.com/content/g64286w402h4v1p6/ |
| Doi | http://dx.doi.org/10.1007/978-3-642-19867-0_6 |
| Field | Informatics |
| Keywords | graph cuts; metric approximation; Riemannian metrics; image segmentation |
| Description | Boykov and Kolmogorov showed that it is possible to find globally minimal contours and surfaces via graph cuts by embedding an appropriate metric approximation into the graph edge weights and derived the requisite formulas for Euclidean and Riemannian metrics. In [2] we have proposed an improved Euclidean metric approximation that is invariant under (horizontal and vertical) mirroring, applicable to grids with anisotropic resolution and with a smaller approximation error. In this paper, we extend our method to general Riemannian metrics that are essential for graph cut based image segmentation or stereo matching. It is achieved by the introduction of a transformation reducing the Riemannian case to the Euclidean one and adjusting the formulas from [9] to be able to cope with non-orthogonal grids. We demonstrate that the proposed method yields smaller approximation errors than the previous approaches both in theory and practice. |
| Related projects: |
|