@inproceedings{7253c03814c24e75b7bbfadf9db09a5e,
title = "Intrinsic mean for semi-metrical shape retrieval via graph cuts",
abstract = "We address the problem of describing the mean object for a set of planar shapes in the case that the considered dissimilarity measures are semi-metrics, i.e. in the case that the triangle inequality is generally not fulfilled. To this end, a matching of two planar shapes is computed by cutting an appropriately defined graph the edge weights of which encode the local similarity of respective contour parts on either shape. The cost of the minimum cut can be interpreted as a semi-metric on the space of planar shapes. Subsequently, we introduce the notion of a mean shape for the case of semi-metrics and show that this allows to perform a shape retrieval which mimics human notions of shape similarity.",
author = "Schmidt, {Frank R.} and Eno T{\"o}ppe and Daniel Cremers and Yuri Boykov",
year = "2007",
doi = "10.1007/978-3-540-74936-3_45",
language = "English",
isbn = "3540749330",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "446--455",
booktitle = "Pattern Recognition - 29th DAGM Symposium, Proceedings",
note = "29th Annual Symposium of the Deutsche Arbeitsgemeinschaft fur Mustererkennung, DAGM 2007 ; Conference date: 12-09-2007 Through 14-09-2007",
}