Two linear time Union--Find strategies for image processing

DOI10.1016/0304-3975(94)00262-2zbMath0873.68212OpenAlexW2047839530MaRDI QIDQ672744

Christophe Fiorio, Jens Gustedt

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00549539/file/82650509.pdf

zbMATH Keywords

linear time algorithms for the segmentation of images

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies for image processing (68U10) Data structures (68P05)

Related Items (8)

Memory management for Union-Find algorithms ⋮ A hole-filling based approach to controlling structural complexity in topology optimization ⋮ The longest common substring problem ⋮ Semi-supervised statistical region refinement for color image segmentation ⋮ Efficient region segmentation on compressed gray images using quadtree and shading representation ⋮ Fast connected-component labeling ⋮ Efficient Union-Find for planar graphs and other sparse graph classes ⋮ Comparative study and proof of single-pass connected components algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of algorithms which require nonlinear time to maintain disjoint sets
• A linear-time algorithm for a special case of disjoint set union
• A complement to Tarjan's result about the lower bound on the complexity of the set union problem
• Lower bounds for the union-find and the split-find problem on pointer machines
• Worst-case Analysis of Set Union Algorithms
• Efficiency of a Good But Not Linear Set Union Algorithm
• A general approach to connected-component labeling for arbitrary image representations

This page was built for publication: Two linear time Union--Find strategies for image processing