A discrete geometry approach for dominant point detection

Thanh Phuong Nguyen 1 Isabelle Debled-Rennesson 1
1 ADAGIO - Applying Discrete Algorithms to Genomics and Imagery
LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We propose two fast methods for dominant point detection and polygonal representation of noisy and possibly disconnected curves based on a study of the decomposition of the curve into the sequence of maximal blurred segments \cite{ND07}. Starting from results of discrete geometry \cite{FT99,Deb05}, the notion of maximal blurred segment of width $\nu$ \cite{ND07} has been proposed, well adapted to noisy curves. The first method uses a fixed parameter that is the width of considered maximal blurred segments. The second one is proposed based on a multi-width approach to obtain a non-parametric method that uses no threshold for working with noisy curves. Comparisons with other methods in the literature prove the efficiency of our approach. Thanks to a recent result \cite{FF08} concerning the construction of the sequence of maximal blurred segments, the complexity of the proposed methods is $O(n\log n)$. An application of vectorization is also given in this paper.
Type de document :
Article dans une revue
Pattern Recognition, Elsevier, 2011, pp.32-44
Liste complète des métadonnées

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

Contributeur : Thanh Phuong Nguyen <>
Soumis le : vendredi 10 décembre 2010 - 11:23:08
Dernière modification le : mardi 4 septembre 2018 - 19:18:05
Document(s) archivé(s) le : lundi 5 novembre 2012 - 13:05:51


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00526714, version 1



Thanh Phuong Nguyen, Isabelle Debled-Rennesson. A discrete geometry approach for dominant point detection. Pattern Recognition, Elsevier, 2011, pp.32-44. 〈inria-00526714〉



Consultations de la notice


Téléchargements de fichiers