Two Linear Time Union-Find Strategies for Image Processing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 1996

Two Linear Time Union-Find Strategies for Image Processing

Abstract

We consider Union-Find as an appropriate data structure to obtain two linear time algorithms for the Segmentation of images. The linearity is obtained by restricting the Order in which Union's are performed. For one algorithm the complexity bound is proven by amortizing the Find operations. For the other we use periodic updates to keep the relevant part of our Union-Find-tree of constant height. Both algorithms are generalized and lead to new linear strategies for Union-Find that are neither covered by the algorithm of Gabow and Tarjan (1984) nor by the one of Dillencourt et al. (1992).
Fichier principal
Vignette du fichier
82650509.pdf (1.08 Mo) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

inria-00549539 , version 1 (05-09-2019)

Identifiers

Cite

Christophe Fiorio, Jens Gustedt. Two Linear Time Union-Find Strategies for Image Processing. Theoretical Computer Science, 1996, 154 (2), pp.165-181. ⟨10.1016/0304-3975(94)00262-2⟩. ⟨inria-00549539⟩
113 View
318 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More