GRAPH CUTS AND APPROXIMATION OF THE EUCLIDEAN METRIC ON ANISOTROPIC GRIDS

Ondřej Daněk, Pavel Matula

Abstract

Graph cuts can be used to find globally minimal contours and surfaces in 2D and 3D space, respectively. To achieve this, weights of the edges in the graph are set so that the capacity of the cut approximates the contour length or surface area under chosen metric. Formulas giving good approximation in the case of the Euclidean metric are known, however, they assume isotropic resolution of the underlying grid of pixels or voxels. Anisotropy has to be simulated using more general Riemannian metrics. In this paper we show how to circumvent this and obtain a good approximation of the Euclidean metric on anisotropic grids directly by exploiting the well-known Cauchy-Crofton formulas and Voronoi diagrams theory. Furthermore, we show that our approach yields much smaller metrication errors and most interestingly, it is in particular situations better even in the isotropic case due to its invariance to mirroring. Finally, we demonstrate an application of the derived formulas to biomedical image segmentation.

References

  1. Boykov, Y. and Funka-Lea, G. (2006). Graph cuts and efficient n-d image segmentation (review). International Journal of Computer Vision, 70(2):109-131.
  2. Boykov, Y. and Kolmogorov, V. (2003). Computing geodesics and minimal surfaces via graph cuts. In ICCV 7803: Proceedings of the Ninth IEEE International Conference on Computer Vision, page 26.
  3. Boykov, Y. and Kolmogorov, V. (2004). An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(9):1124-1137.
  4. Boykov, Y. and Veksler, O. (2006). Graph cuts in vision and graphics: Theories and applications. In Handbook of Mathematical Models in Computer Vision, pages 79- 96. Springer-Verlag.
  5. Brown, K. Q. (1979). Geometric transforms for fast geometric algorithms. PhD thesis, Pittsburgh, PA, USA.
  6. Chan, T. F. and Vese, L. A. (2001). Active contours without edges. IEEE Transactions on Image Processing, 10(2):266-277.
  7. Kolmogorov, V. and Boykov, Y. (2005). What metrics can be approximated by geo-cuts, or global optimization of length/area and flux. In ICCV 7805: Proceedings of the Tenth IEEE International Conference on Computer Vision, pages 564-571.
  8. Kolmogorov, V. and Zabih, R. (2004). What energy functions can be minimized via graph cuts? IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(2):147-159.
  9. Zeng, Y., Chen, W., and Peng, Q. (2006). Efficiently solving the piecewise constant mumford-shah model using graph cuts. Technical report, Dept. of Computer Science, Zhejiang University, P.R. China.
Download


Paper Citation


in Harvard Style

Daněk O. and Matula P. (2010). GRAPH CUTS AND APPROXIMATION OF THE EUCLIDEAN METRIC ON ANISOTROPIC GRIDS . In Proceedings of the International Conference on Computer Vision Theory and Applications - Volume 2: VISAPP, (VISIGRAPP 2010) ISBN 978-989-674-029-0, pages 68-73. DOI: 10.5220/0002833000680073


in Bibtex Style

@conference{visapp10,
author={Ondřej Daněk and Pavel Matula},
title={GRAPH CUTS AND APPROXIMATION OF THE EUCLIDEAN METRIC ON ANISOTROPIC GRIDS},
booktitle={Proceedings of the International Conference on Computer Vision Theory and Applications - Volume 2: VISAPP, (VISIGRAPP 2010)},
year={2010},
pages={68-73},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002833000680073},
isbn={978-989-674-029-0},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Computer Vision Theory and Applications - Volume 2: VISAPP, (VISIGRAPP 2010)
TI - GRAPH CUTS AND APPROXIMATION OF THE EUCLIDEAN METRIC ON ANISOTROPIC GRIDS
SN - 978-989-674-029-0
AU - Daněk O.
AU - Matula P.
PY - 2010
SP - 68
EP - 73
DO - 10.5220/0002833000680073