# A discrete geometry approach for dominant point detection

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.
Document type :
Journal articles

Cited literature [40 references]

https://hal.inria.fr/inria-00526714
Contributor : Thanh Phuong Nguyen Connect in order to contact the contributor
Submitted on : Friday, December 10, 2010 - 11:23:08 AM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM
Long-term archiving on: : Monday, November 5, 2012 - 1:05:51 PM

### File

PR_NguyenDebled_revision_4mai....
Files produced by the author(s)

### Identifiers

• HAL Id : inria-00526714, version 1

### Citation

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

Record views