Minimal Non-simple Sets in 4-Dimensional Binary Images with (8,80)-Adjacency

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

Volumn 3322, Issue , 2004, Pages 318-333

  Yung Kong, T ^a   Gau, Chyi Jou ^a,b  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BINS; IMAGE ANALYSIS;

GENERAL METHOD; PARALLEL THINNING ALGORITHMS; SIMPLE++;

BINARY IMAGES;

EID: 35048886997     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (16)

1. G. Bertrand. On P-simple points. C. R. Acad. Sci. Paris, Série I, 321:1077-1084, 1995.
2. G. Bertrand. A Boolean characterization of three-dimensional simple points. Pattern Recogn. Lett., 17:115-124, 1996.
3. C. J. Gau and T. Y. Kong. Minimal nonsimple sets of voxels in binary images on a face-centered cubic grid. Int. J. Pattern Recogn. Artif. Intell., 13:485-502, 1999.
4. C. J. Gau and T. Y. Kong. Minimal nonsimple sets in 4D binary images. Graph. Models, 05:112-130, 2003.
5. R. W. Hall. Tests for connectivity preservation for parallel reduction operators. Topology and Its Applications, 46:199-217, 1992.
6. R. W. Hall. Parallel connectivity-preserving thinning algorithms. In T. Y. Kong and A. Rosenfeld, editors, Topological Algorithms for Digital Image Processing, pages 145-179. Elsevier/North-Holland, 1996.
7. L. C. Kinsey. Topology of Surfaces. Springer, 1993.
8. R. Klette and P. Zamperoni. Handbook of Image Processing Operators. Wiley, 1996.
9. T. Y. Kong. 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. T. Y. Kong. On topology preservation in 2D and 3D thinning. Int. J. Pattern Recogn. Artif. Intell., 9:813-844, 1995.
11. T. Y. Kong. Topology preserving deletion of 1's from 2-, 3- and 4-dimensional binary images. In E. Ahronovitz and C. Fiorio, editors, Discrete Geometry for Computer Imagery: 7th International Workshop (DGCI '97, Alontpellier, France, December 1997), Proceedings, pages 3-18. Springer, 1997.
12. T. Y. Kong and A. Rosenfeld. Digital topology: Introduction and survey. Computer Vision, Graphics, and Image Processing, 48:357-393, 1989.
13. C. M. Ma. On topology preservation in 3D thinning. CVGIP: Image. Understanding, 59:328-339, 1994.
14. C. Ronse. Minimal test patterns for connectivity preservation in parallel thinning algorithms for binary digital images. Discrete Appl Math., 21:67-79, 1988.
15. A. Rosenfeld. A characterization of parallel thinning algorithms. Information and Control, 29:286-291, 1975.
16. E. H. Spanier. Algebraic Topology. Springer, 1989.