Dominant point detection based on discrete curve structure and applications

Abstract : In this paper, we investigate the problem of dominant point detection on digital curves which consists in nding points with local maximum curvature. Thanks to previous studies of the decomposition of curves into sequence of discrete structures [1, 2, 3], namely maximal blurred segments of width ν [4], an initial algorithm has been proposed in [5] to detect dominant points. However, an heuristic strategy is used to identify the dominant points. We now propose a modied algorithm without heuristics but a simple measure of angle. In addition, two applications are as well presented: (1) polygonal simplication to reduce the number of detected dominant points by associating a weight to each of them, and (2) classication using the polygon issued from the reduced dominant points. The experimental results demonstrate the eciency and robustness of the proposed method.
Type de document :
Article dans une revue
Journal of Computer and System Sciences, Elsevier, 2018, 95, pp.177-192. 〈10.1016/j.jcss.2017.07.007〉
Liste complète des métadonnées

Littérature citée [40 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01584733
Contributeur : Phuc Ngo <>
Soumis le : samedi 9 septembre 2017 - 11:55:56
Dernière modification le : mardi 1 mai 2018 - 01:18:09

Fichier

mainJournal.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Hayat Nasser, Phuc Ngo, Isabelle Debled-Rennesson. Dominant point detection based on discrete curve structure and applications. Journal of Computer and System Sciences, Elsevier, 2018, 95, pp.177-192. 〈10.1016/j.jcss.2017.07.007〉. 〈hal-01584733〉

Partager

Métriques

Consultations de la notice

204

Téléchargements de fichiers

256