loading
  • Login
  • Sign-Up

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Ondřej Daněk and Pavel Matula

Affiliation: Masaryk University, Czech Republic

ISBN: 978-989-674-029-0

Keyword(s): Graph cuts, Euclidean metric approximation, Anisotropic grids, Voronoi diagrams, Image segmentation.

Related Ontology Subjects/Areas/Topics: Computational Geometry ; Computer Vision, Visualization and Computer Graphics ; Early Vision and Image Representation ; Image and Video Analysis ; Image Formation and Preprocessing ; Segmentation and Grouping

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 imag e segmentation. (More)

PDF ImageFull Text

Download
Sign In Guest: Register as new SCITEPRESS user or Join INSTICC now for free.

Sign In SCITEPRESS user: please login.

Sign In INSTICC Members: please login. If not a member yet, Join INSTICC now for free.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 54.204.185.160. INSTICC members have higher download limits (free membership now)

In the current month:
Recent papers: 1 available of 1 total
2+ years older papers: 2 available of 2 total

Paper citation in several formats:
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 (VISIGRAPP 2010)ISBN 978-989-674-029-0, pages 68-73. DOI: 10.5220/0002833000680073

@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 (VISIGRAPP 2010)},
year={2010},
pages={68-73},
doi={10.5220/0002833000680073},
isbn={978-989-674-029-0},
}

TY - CONF

JO - Proceedings of the International Conference on Computer Vision Theory and Applications (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

Sorted by: Show papers

Note: The preferred Subjects/Areas/Topics, listed below for each paper, are those that match the selected paper topics and their ontology superclasses.
More...

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.

Show authors

Note: The preferred Subjects/Areas/Topics, listed below for each author, are those that more frequently used in the author's papers.
More...