Minimal non-simple and minimal non-cosimple sets in binary images on cell complexes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4245 LNCS, Issue , 2006, Pages 169-188

  Kong, T Yung ^a  

^a CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CODES; PROBLEM SOLVING; SET THEORY;

BINARY IMAGES; CELL COMPLEXES; CUBICAL COMPLEXES; MINIMAL NON COSIMPLE SETS;

IMAGE ANALYSIS;

EID: 33845208224     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11907350_15     Document Type: Conference Paper

References (21)

1. Bertrand, G.: On P-simple points. C. R. Acad. Sci. Paris, Série I 321 (1995) 1077-1084
2. Bertrand, G.: A Boolean characterization of three-dimensional simple points. Pattern Recognition Letters 17 (1996) 115-124
3. Björner, A.: Topological methods. In: R.L. Graham, M. Grötschel, and L. Lovász, editors, Handbook of Combinatorics, Vol. II, pages 1819-1872, MIT Press (1995)
4. Gau, C.J., 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
5. Gau, C.J., Kong, T.Y.: Minimal nonsimple sets in 4D binary images. Graphical Models 65 (2003) 112-130
6. Hall, R.W.: Tests for connectivity preservation for parallel reduction operators. Topology and Its Applications 46 (1992) 199-217
7. Herman, G.T.: Geometry of Digital Spaces. Birkhäuser (1998)
8. Hilditch, C.J.: Linear skeletons from square cupboards. In: B. Meltzer and D. Michie, editors, Machine Intelligence IV, pages 403-420, Edinburgh University Press (1969)
9. Kong, T.Y.: On the problem of determining whether a parallel reduction operator for n-dimensional binary images always preserves topology. In: R.A. Melter and A.Y. Wu, editors, Vision Geometry II (Boston, September 1993), Proceedings, pages 69-77. Proc. SPIE 2060 (1993)
10. Kong, T.Y.: On topology preservation in 2D and 3D thinning. International Journal of Pattern Recognition and Artificial Intelligence 9 (1995) 813-844
11. Kong, T.Y., Gau, C.J.: Minimal nonsimple sets in 4-dimensional binary images with (8,80)-adjacency. In: R. Klette and J. Žunić, editors, Combinatorial Image Analysis: 10th International Workshop (IWCIA 2004, Auckland, New Zealand, December 2004), Proceedings, pages 318-333. Springer (2004)
12. Kong, T.Y., Roscoe, A.W.: Characterizations of simply-connected finite polyhedra in 3-space. Bulletin of the London Mathematical Society 17 (1985) 575-578
13. Kong, T.Y., Saha, P.K., Rosenfeld, A.: Strongly normal sets of contractible tiles in N dimensions. Pattern Recognition, in press
14. Kovalevsky, V.A.: Discrete topology and contour definition. Pattern Recognition Letters 2 (1984) 281-288
15. Ma, C.M.: On topology preservation in 3D thinning. CVGIP: Image Understanding 59 (1994) 328-339
16. Maunder, C.R.F.: Algebraic Topology. Dover Publications (1996)
17. Moise, E.E.: Geometric Topology in Dimensions 2 and 3. Springer (1977)
18. Ronse, C.: A topological characterization of thinning. Theoretical Computer Science 43 (1986) 31-41
19. Ronse, C.: Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images. Discrete Applied Mathematics 21 (1988) 67-79
20. Rosenfeld, A.: Connectivity in digital pictures. Journal of the Association for Computing Machinery 17 (1970) 146-160
21. Saha, P.K., 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