Generalized vs set median strings for histogram-based distances: algorithms and classification results in the image domain - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Generalized vs set median strings for histogram-based distances: algorithms and classification results in the image domain

Résumé

We compare different statistical characterizations of a set of strings, for three different histogram-based distances. Given a distance, a set of strings may be characterized by its generalized median, i.e., the string ---over the set of all possible strings--- that minimizes the sum of distances to every string of the set, or by its set median, i.e., the string of the set that minimizes the sum of distances to every other string of the set. For the first two histogram-based distances, we show that the generalized median string can be computed efficiently; for the third one, which biased histograms with individual substitution costs, we conjecture that this is a NP-hard problem, and we introduce two different heuristic algorithms for approximating it. We experimentally compare the relevance of the three histogram-based distances, and the different statistical characterizations of sets of strings, for classifying images that are represented by strings.
Fichier principal
Vignette du fichier
Liris-2728.pdf (188.18 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01501826 , version 1 (04-04-2017)

Identifiants

  • HAL Id : hal-01501826 , version 1

Citer

Christine Solnon, Jean-Michel Jolion. Generalized vs set median strings for histogram-based distances: algorithms and classification results in the image domain. Graph based Representation for Pattern Recognition (GbR'07), Jun 2007, Alicante, Spain. pp.404-414. ⟨hal-01501826⟩
99 Consultations
118 Téléchargements

Partager

Gmail Facebook X LinkedIn More