Skip to Main content Skip to Navigation

Optimal Blurred Segments Decomposition in Linear Time

Isabelle Debled-Rennesson 1 Fabien Feschet Jocelyne Rouyer-Degli 1
1 ADAGE - Applying discrete algorithms to genomics
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 9:09:33 PM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM
Long-term archiving on: : Sunday, April 4, 2010 - 9:41:04 PM


  • 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⟩



Record views


Files downloads