Skip to Main content Skip to Navigation
Journal articles

Optimal blurred segments decomposition of noisy shapes in linear time

Abstract : Blurred segments were introduced by Debled-Rennesson et al. [Segmentation of discrete curves into fuzzy segments. In: 9th IWCIA, Electronic notes in discrete mathematics, vol. 12; 2003; Segmentation of discrete curves into fuzzy segments, extended version. Technical Report, INRIA Report RR-4989,; 2003] as an extension of the arithmetical approach of Reveillès [Géométrie discrète, calculs en nombres entiers et algorithmique. Thèse d'Etat, Université Louis Pasteur; 1991] on discrete lines, to take into account noise in digital images. A subclass of blurred discrete segments was introduced in [Debled-Rennesson I, Feschet F, Rouyer J. Optimal blurred segments decomposition in linear time. In: Andres E, Damiand G, Lienhardt P, editors, 12th International conference DGCI. Lecture notes in computer science, vol. 3429. Berlin: Springer; 2005. p. 371–82] with an optimal linear time algorithm for the recognition of blurred segment in this class. This paper extends the previous algorithm to deal with very noisy curves and to propose a decomposition somewhat preserving the intuitive notion of corners.
Document type :
Journal articles
Complete list of metadata
Contributor : Isabelle Debled-Rennesson <>
Submitted on : Wednesday, September 19, 2007 - 1:06:03 PM
Last modification on : Friday, February 26, 2021 - 3:28:08 PM



Isabelle Debled-Rennesson, Fabien Feschet, Jocelyne Rouyer-Degli. Optimal blurred segments decomposition of noisy shapes in linear time. Computers and Graphics, Elsevier, 2006, 30 (1), pp.30-36. ⟨10.1016/j.cag.2005.10.007⟩. ⟨inria-00173228⟩



Record views