On critical kernels

Comptes Rendus Mathematique

Volumn 345, Issue 7, 2007, Pages 363-367

  Bertrand, Gilles ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35348842069     PISSN: 1631073X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.crma.2007.09.001     Document Type: Article

References (9)

1. Bertrand G. On P-simple points. C. R. Acad. Sci. Paris, Ser. I 321 (1995) 1077-1084
2. G. Bertrand, M. Couprie, Two-dimensional parallel thinning algorithms based on critical kernels, Internal Report, Université de Marne-la-Vallée, IGM2006-02, also submitted for publication, 2006
3. Bertrand G., and Couprie M. Three-Dimensional Parallel Thinning Algorithms Based on Critical Kernels. Lecture Notes in Computer Science vol. 4245 (2006) pp. 580-591
4. Cohen M.M. A Course in Simple-Homotopy Theory (1973), Springer-Verlag
5. Giblin P. Graphs, Surfaces and Homology (1981), Chapman and Hall
6. Klette R., and Rosenfeld A. Digital Geometry, Geometric Methods for Digital Picture Analysis (2006), Morgan Kaufmann
7. Kong T.Y. On topology preservation in 2-D and 3-D thinning. Int. J. Pattern Recognition and Artificial Intelligence 9 (1995) 813-844
8. Kong T.Y. Topology-preserving deletion of 1's from 2-, 3- and 4-dimensional binary images. Lecture Notes in Computer Science vol. 1347 (1997) 3-18
9. Whitehead J.H.C. Simplicial spaces, nuclei, and m-groups. Proc. London Math. Soc. 45 2 (1939) 243-327