A discrete geometry approach for dominant point detection - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Pattern Recognition Year : 2011

A discrete geometry approach for dominant point detection


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.
Fichier principal
Vignette du fichier
PR_NguyenDebled_revision_4mai.pdf (2.07 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00526714 , version 1 (10-12-2010)


  • HAL Id : inria-00526714 , version 1


Thanh Phuong Nguyen, Isabelle Debled-Rennesson. A discrete geometry approach for dominant point detection. Pattern Recognition, 2011, pp.32-44. ⟨inria-00526714⟩
222 View
1289 Download


Gmail Facebook Twitter LinkedIn More