Two symmetrical thinning algorithms for 3D binary images, based on -simple points

2007 ◽  
Vol 40 (8) ◽  
pp. 2301-2314 ◽  
Author(s):  
Christophe Lohou ◽  
Gilles Bertrand
Keyword(s):  
Binary Images ◽  
Thinning Algorithms ◽  
Simple Points

Parallel Thinning Algorithms on 3D (18, 6) Binary Images

2000 ◽  
Vol 80 (3) ◽  
pp. 364-378 ◽  
Author(s):  
Cherng-Min Ma ◽  
Shu-Yen Wan
Keyword(s):  
Binary Images ◽  
Thinning Algorithms

scholarly journals Well-Composed Image Filters for Repairing 2-D and 3-D Binary Images

2006 ◽  
Author(s):  
Nicholas J. Tustison ◽  
Marcelo Siqueira ◽  
James Gee
Keyword(s):  
Marching Cubes ◽  
Geometrical Properties ◽  
Binary Images ◽  
Image Filters ◽  
Thinning Algorithms

We consider 2-D and 3-D digital binary images characterized by their well-composedness. Well-composed images exhibit important topological and geometrical properties not shared by their ill-composed counterparts. These properties have important implications for various algorithms used by the ITK community such as thinning algorithms and Marching Cubes. We introduce two image filters which repair images that are ill-composed such that the output images are well-composed.

scholarly journals Well-Composedness and the Topological Repairing of 2-D and 3-D Digital Images

2007 ◽  
Author(s):  
Nicholas J. Tustison ◽  
Marcelo Siqueira ◽  
James Gee
Keyword(s):  
Digital Images ◽  
Binary Image ◽  
Marching Cubes ◽  
Geometrical Properties ◽  
Binary Images ◽  
Binary Approach ◽  
Image Context ◽  
Thinning Algorithms

In an earlier submission, we considered 2-D and 3-D digital binary images topologically characterized by their well-composedness. Well-composed images exhibit important topological and geometrical properties not shared by their ill-composed counterparts. These properties have important implications for various algorithms used by the ITK community such as thinning algorithms and Marching Cubes.A natural follow-up inquiry to our original submission concerns the possible extension of the binary algorithm to accommodate images with multiple labels. In this paper, we describe such a generalization of our previous submission which also subsumes the binary approach. For completeness and clarity of exposition, we develop the idea of well-composedness within the binary image context and later generalize the discussion to include those images with multiple labels.

scholarly journals A characterization of parallel thinning algorithms

1975 ◽  
Vol 29 (3) ◽  
pp. 286-291 ◽  
Author(s):  
Azriel Rosenfeld
Keyword(s):  
Thinning Algorithms
Sign in / Sign up

Export Citation Format

Share Document