Minimal non-deletable sets and minimal non-codeletable sets in binary images

Theoretical Computer Science

Volumn 406, Issue 1-2, 2008, Pages 97-118

  Kong, T Yung ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

4D; Binary image; Codeletable; Cosimple; Deletable; Digital topology; Minimal non deletable; Minimal non simple; Polytopal complex; Simple; Thinning; Xel complex

Indexed keywords

BINARY IMAGES; BOOLEAN FUNCTIONS; HELIUM; IMAGE ENHANCEMENT; PARALLEL ALGORITHMS; PIXELS;

4D; BINARY IMAGE; CODELETABLE; COSIMPLE; DELETABLE; DIGITAL TOPOLOGY; MINIMAL NON-DELETABLE; MINIMAL NON-SIMPLE; POLYTOPAL COMPLEX; SIMPLE; THINNING; XEL COMPLEX;

SET THEORY;

EID: 51549103885     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.02.001     Document Type: Article

References (33)

1. Armstrong M.A. Basic Topology (1983), Springer, New York
2. Bertrand G. Simple points, topological numbers, and geodesic neighborhoods in cubic grids. Pattern Recognition Letters 15 (1994) 1003-1011
3. Bertrand G. On P-simple points. Comptes-Rendus de l'Académie des Sciences de Paris, Série I 321 (1995) 1077-1084
4. Bertrand G. A Boolean characterization of three-dimensional simple points. Pattern Recognition Letters 17 (1996) 115-124
5. Björner A. Topological methods. In: Graham R.L., Grötschel M., and Lovász L. (Eds). Handbook of Combinatorics vol. II (1995), MIT Press 1819-1872
6. Brunner D., Brunnett G., and Strand R. A High-Performance Parallel Thinning Approach Using a Non-Cubic Grid Structure. Chemnitzer Informatik-Berichte CSR-06-08 (2006), Faculty of Computer Science, Chemnitz University of Technology
7. Gau C.J., and Kong T.Y. Minimal nonsimple sets of voxels in binary images on a face-centered cubic grid. International Journal of Pattern Recognition and Artificial Intelligence 13 (1999) 485-502
8. Gau C.J., and Kong T.Y. Minimal nonsimple sets in 4D binary images. Graphical Models 65 (2003) 112-130
9. Hall R.W. Tests for connectivity preservation for parallel reduction operators. Topology and its Applications 46 (1992) 199-217
10. Hatcher A. Algebraic Topology (2002), Cambridge University Press
11. Herman G.T. Geometry of Digital Spaces (1998), Birkhäuser
12. Kong T.Y. On the problem of determining whether a parallel reduction operator for n-dimensional binary images always preserves topology. In: Melter R.A., and Wu A.Y. (Eds). Vision Geometry II (Boston, USA, September 1993), Proceedings (1993), Proc. SPIE 2060 69-77
13. Kong T.Y. On topology preservation in 2D and 3D thinning. International Journal of Pattern Recognition and Artificial Intelligence 9 (1995) 813-844
14. Kong T.Y. Minimal non-simple and minimal non-cosimple sets in binary images on cell complexes. In: Kuba A., Nyúl L.G., and Palágyi K. (Eds). Discrete Geometry for Computer Imagery: 13th International Conference (DGCI 2006, Szeged, Hungary, October 2006), Proceedings (2006), Springer 169-188
15. Kong T.Y., and Gau C.J. Minimal nonsimple sets in 4-dimensional binary images with (8, 80)-adjacency. In: Klette R., and Žunić J. (Eds). Combinatorial Image Analysis: 10th International Workshop (IWCIA 2004, Auckland, New Zealand, December 2004), Proceedings (2004), Springer 318-333
16. Kong T.Y., and Roscoe A.W. Characterizations of simply-connected finite polyhedra in 3-space. Bulletin of the London Mathematical Society 17 (1985) 575-578
17. Kong T.Y., Saha P.K., and Rosenfeld A. Strongly normal sets of contractible tiles in N dimensions. Pattern Recognition 40 (2007) 530-543
18. Ma C.M. On topology preservation in 3D thinning. CVGIP: Image Understanding 59 (1994) 328-339
19. Ma C.M., and Wan S.Y. Parallel thinning algorithms on 3D (18, 6) binary images. Computer Vision and Image Understanding 80 (2000) 364-378
20. Maunder C.R.F. Algebraic Topology (1996), Dover Publications
21. Meshulam R. The clique complex and hypergraph matching. Combinatorica 21 (2001) 89-94
22. Moise E.E. Geometric Topology in Dimensions 2 and 3 (1977), Springer
23. Niethammer M., Kalies W.D., Mischaikow K., and Tannenbaum A. On the detection of simple points in higher dimensions using cubical homology. IEEE Transactions on Image Processing 15 (2006) 2462-2469
24. Palágyi K., and Kuba A. A 3D 6-subiteration thinning algorithm for extracting medial lines. Pattern Recognition Letters 19 (1998) 613-627
25. Palágyi K., and Kuba A. A parallel 3D 12-subiteration thinning algorithm. Graphical Models and Image Processing 61 (1999) 199-221
26. N. Passat, M. Couprie, G. Bertrand, Minimal simple pairs in the 3-D cubic grid. Rapports Internes IGM 2007-04, Institut Gaspard Monge, 2007
27. Ronse C. A topological characterization of thinning. Theoretical Computer Science 43 (1986) 31-41
28. Ronse C. Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images. Discrete Applied Mathematics 21 (1988) 67-79
29. Rosenfeld A. A characterization of parallel thinning algorithms. Information and Control 29 (1975) 286-291
30. Rosenfeld A., and Kak A.C. Digital Picture Processing. 2nd ed. vol. 2 (1982), Academic Press
31. Saha P.K., and Chaudhuri B.B. Detection of 3D simple points for topology preserving transformation with applications to thinning. IEEE Transactions on Pattern Analysis and Machine Intelligence 16 (1994) 1028-1032
32. R. Strand, Surface skeletons in grids with non-cubic voxels, in: Proceedings of the 17th International Conference on Pattern Recognition (ICPR 2004, Cambridge, UK, August 2004), vol. 1, IEEE Computer Society, 2004, pp. 548-551
33. Ziegler G.M. Lectures on Polytopes (1995), Springer