Skip to Main content Skip to Navigation
Journal articles

A maximum diversity-based path sparsification for geometric graph matching

Abstract : This paper presents an effective dissimilarity measure for geometric graphs representing shapes. The dissimilarity measure is a distance that combines a sparsification of the geometric graph based on the maximum diversity problem and a new node embedding that captures the topological neighborhood of nodes. The sparsification step aims to correct the misdistribution of nodes on the geometric graph induced by the noise of image handling. Computational experiments on two popular datasets indicate that our approach retains the form of the shapes while decreasing the number of processed nodes which yields interesting results both on accuracy and time processing 1 .
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03411969
Contributor : Hamida Seba Connect in order to contact the contributor
Submitted on : Tuesday, November 2, 2021 - 4:45:06 PM
Last modification on : Sunday, November 7, 2021 - 4:24:00 PM

File

submitted.pdf
Files produced by the author(s)

Identifiers

Citation

Abd Errahmane Kiouche, Hamida Seba, Karima Amrouche. A maximum diversity-based path sparsification for geometric graph matching. Pattern Recognition Letters, Elsevier, 2021, 152, pp.107-114. ⟨10.1016/j.patrec.2021.09.019⟩. ⟨hal-03411969⟩

Share

Metrics

Les métriques sont temporairement indisponibles