Optimal Blurred Segments Decomposition in Linear Time - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2004

Optimal Blurred Segments Decomposition in Linear Time


Blurred (previously named fuzzy) segments were introduced by Debled-Rennesson et al as an extension of the arithmetical approach of Reveillès on discrete lines, to take into account noise in digital images. An incremental linear-time algorithm was presented to decompose a discrete curve into blurred segments with order bounded by a parameter d. However, it fails to segment discrete curves into a minimal number of blurred segments. We identify in this paper, that this characteristic is intrinsic to the whole class of blurred segments. We thus introduce a subclass of blurred segments, based on a geometric measure of thickness. We provide a new convex hull based incremental linear time algorithm for segmenting discrete curves into minimally thin blurred segments.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5334.pdf (402.37 Ko) Télécharger le fichier

Dates and versions

inria-00070667 , version 1 (19-05-2006)


  • HAL Id : inria-00070667 , version 1


Isabelle Debled-Rennesson, Fabien Feschet, Jocelyne Rouyer-Degli. Optimal Blurred Segments Decomposition in Linear Time. [Research Report] RR-5334, INRIA. 2004, pp.16. ⟨inria-00070667⟩
133 View
508 Download


Gmail Facebook Twitter LinkedIn More