Dominant point detection based on discrete curve structure and applications - Archive ouverte HAL Access content directly
Journal Articles Journal of Computer and System Sciences Year : 2018

Dominant point detection based on discrete curve structure and applications

(1, 2) , (1, 2) , (1, 2)
1
2

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

Dates and versions

hal-01584733 , version 1 (09-09-2017)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook Twitter LinkedIn More