Intrinsic Mean for Semi-metrical Shape Retrieval Via Graph Cuts

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.

• Type: Conference
• Year: 2007
• Where: DAGM
• Authors: Frank R. Schmidt, Eno Töppe, Daniel Cremers, Yuri Boykov
• Keywords: DAGM 2007, Image Processing, Mean Object, Planar Shapes, Respective Contour Parts