Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
From MaRDI portal
Publication:1115212
DOI10.1016/0166-218X(88)90034-0zbMath0663.68119MaRDI QIDQ1115212
Publication date: 1988
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99) Connected and locally connected spaces (general aspects) (54D05)
Related Items (18)
Two symmetrical thinning algorithms for 3D binary images, based on \(P\)-simple points ⋮ Reflections on a scientific career and its possible legacy ⋮ Sufficient conditions for topology-preserving parallel reductions on the BCC grid ⋮ Unnamed Item ⋮ On Topology Preservation for Hexagonal Parallel Thinning Algorithms ⋮ Topology preservation on the triangular grid ⋮ Minimal non-deletable sets and minimal non-codeletable sets in binary images ⋮ Discrete Topological Transformations for Image Processing ⋮ Powerful parallel and symmetric 3D thinning schemes based on critical kernels ⋮ A pair of equivalent sequential and fully parallel 3D surface-thinning algorithms ⋮ On topology preservation of mixed operators in triangular, square, and hexagonal grids ⋮ Tests for connectivity preservation for parallel reduction operators ⋮ On parallel thinning algorithms: minimal non-simple sets, P-simple points and critical kernels ⋮ New Characterizations of Simple Points, Minimal Non-simple Sets and P-Simple Points in 2D, 3D and 4D Discrete Spaces ⋮ Minimal Simple Pairs in the Cubic Grid ⋮ Topology preservation on the BCC grid ⋮ A 3D 6-subiteration curve thinning algorithm based on \(P\)-simple points ⋮ Topology-preserving hexagonal thinning
Cites Work
This page was built for publication: Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images
