Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
From MaRDI portal
DOI10.1016/0166-218X(88)90034-0zbMATH Open0663.68119MaRDI QIDQ1115212FDOQ1115212
Publication date: 1988
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- Minimal non-deletable sets and minimal non-codeletable sets in binary images
- Tests for connectivity preservation for parallel reduction operators
- On topology preservation for hexagonal parallel thinning algorithms
- A topological characterization of thinning
- A criterion on thinning in digital pictures
Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99) Connected and locally connected spaces (general aspects) (54D05)
Cites Work
Cited In (22)
- Tests for connectivity preservation for parallel reduction operators
- Reflections on a scientific career and its possible legacy
- A duality theorem for two connectivity-preserving parallel shrinking transformations
- On parallel thinning algorithms: minimal non-simple sets, P-simple points and critical kernels
- Minimal Simple Pairs in the Cubic Grid
- New Characterizations of Simple Points, Minimal Non-simple Sets and P-Simple Points in 2D, 3D and 4D Discrete Spaces
- Sufficient conditions for topology-preserving parallel reductions on the BCC grid
- Sufficient conditions for topology-preserving parallel reductions on the face-centered cubic grid
- Topology-preserving hexagonal thinning
- Topology preservation on the BCC grid
- On Topology Preservation for Hexagonal Parallel Thinning Algorithms
- Discrete Topological Transformations for Image Processing
- Powerful parallel and symmetric 3D thinning schemes based on critical kernels
- Two symmetrical thinning algorithms for 3D binary images, based on \(P\)-simple points
- A topological characterization of thinning
- Topology preservation on the triangular grid
- A 3D 6-subiteration curve thinning algorithm based on \(P\)-simple points
- Minimal non-deletable sets and minimal non-codeletable sets in binary images
- Title not available (Why is that?)
- Title not available (Why is that?)
- A pair of equivalent sequential and fully parallel 3D surface-thinning algorithms
- On topology preservation of mixed operators in triangular, square, and hexagonal grids
This page was built for publication: Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115212)
