Two linear time Union--Find strategies for image processing
From MaRDI portal
Publication:672744
DOI10.1016/0304-3975(94)00262-2zbMATH Open0873.68212OpenAlexW2047839530MaRDI QIDQ672744FDOQ672744
Authors: 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
Recommendations
- Memory management for union-find algorithms
- A general approach to connected-component labeling for arbitrary image representations
- Efficient Union-Find for planar graphs and other sparse graph classes
- A linear-time algorithm for a special case of disjoint set union
- Fast morphological attribute operations using Tarjan's union-find algorithm.
Data structures (68P05) Searching and sorting (68P10) Computing methodologies for image processing (68U10)
Cites Work
- A class of algorithms which require nonlinear time to maintain disjoint sets
- Efficiency of a Good But Not Linear Set Union Algorithm
- A linear-time algorithm for a special case of disjoint set union
- Title not available (Why is that?)
- Worst-case Analysis of Set Union Algorithms
- Lower bounds for the union-find and the split-find problem on pointer machines
- Title not available (Why is that?)
- A complement to Tarjan's result about the lower bound on the complexity of the set union problem
- Title not available (Why is that?)
- A general approach to connected-component labeling for arbitrary image representations
- Title not available (Why is that?)
Cited In (11)
- Fast connected-component labeling
- A topologically consistent representation for image analysis: the frontiers topological graph
- Comparative study and proof of single-pass connected components algorithms
- Fast morphological attribute operations using Tarjan's union-find algorithm.
- Efficient Union-Find for planar graphs and other sparse graph classes
- Semi-supervised statistical region refinement for color image segmentation
- Memory management for union-find algorithms
- Efficient region segmentation on compressed gray images using quadtree and shading representation
- A hole-filling based approach to controlling structural complexity in topology optimization
- The longest common substring problem
- Efficient union-find for planar graphs and other sparse graph classes (extended abstract)
This page was built for publication: Two linear time Union--Find strategies for image processing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672744)
