Finite topology as applied to image analysis
Computer Vision, Graphics, and Image Processing
Digital topology: introduction and survey
Computer Vision, Graphics, and Image Processing
A new characterization of three-dimensional simple points
Pattern Recognition Letters
Simple points, topological numbers and geodesic neighborhoods in cubic grids
Pattern Recognition Letters
A parallel thinning algorithm for medial surfaces
Pattern Recognition Letters
A 3D fully parallel thinning algorithm for generating medial faces
Pattern Recognition Letters
A fully parallel 3D thinning algorithm and its applications
Computer Vision and Image Understanding
A 3D 6-subiteration thinning algorithm for extracting medial lines
Pattern Recognition Letters
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
A parallel 3D 12-subiteration thinning algorithm
Graphical Models and Image Processing
Topology-Preserving Deletion of 1's from 2-, 3- and 4-Dimensional Binary Images
DGCI '97 Proceedings of the 7th International Workshop on Discrete Geometry for Computer Imagery
A 3D 12-subiteration thinning algorithm based on P-simple points
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
A 3D 6-subiteration curve thinning algorithm based on P-simple points
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Two-Dimensional Parallel Thinning Algorithms Based on Critical Kernels
Journal of Mathematical Imaging and Vision
A 3D fully parallel surface-thinning algorithm
Theoretical Computer Science
Minimal Simple Pairs in the 3-D Cubic Grid
Journal of Mathematical Imaging and Vision
Discrete 2D and 3D euclidean medial axis in higher resolution
Image and Vision Computing
A note on 3-D simple points and simple-equivalence
Information Processing Letters
On Parallel Thinning Algorithms: Minimal Non-simple Sets, P-simple Points and Critical Kernels
Journal of Mathematical Imaging and Vision
Surface Thinning in 3D Cubical Complexes
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Minimal simple pairs in the cubic grid
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Hierarchic euclidean skeletons in cubical complexes
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Isthmus-based 6-directional parallel thinning algorithms
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
Exact euclidean medial axis in higher resolution
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
A 3d curvilinear skeletonization algorithm with application to path tracing
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Powerful Parallel and Symmetric 3D Thinning Schemes Based on Critical Kernels
Journal of Mathematical Imaging and Vision
| Hi-index | 0.00 |
Critical kernels constitute a general framework settled in the category of abstract complexes for the study of parallel thinning in any dimension We take advantage of the properties of this framework, and we derive a general methodology for designing parallel algorithms for skeletons of objects in 3D grids In fact, this methodology does not need to handle the structure of abstract complexes, we show that only 3 masks defined in the classical cubic grid are sufficient to implement it We illustrate our methodology by giving two new types of skeletons.