Minimal non-simple sets in 4D binary images

✍ Scribed by C.J. Gau; T. Yung Kong

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 221 KB
• Volume: 65
• Category: Article
• ISSN: 1524-0703
• DOI: 10.1016/s1524-0703(03)00010-9

✦ Synopsis

One way to verify that a proposed parallel thinning algorithm ''preserves topology'' is to check that no iteration can ever delete a minimal non-simple (''MNS'') set. This is a practical verification method because few types of set can be MNS without being a component. Ronse, Hall, Ma, and the authors have solved the problem of finding all such types of set for 2D and 3D Cartesian grids, 2D hexagonal grids, and 3D face-centered cubic grids. Here we solve this problem for a 4D Cartesian grid, in the case where 80-adjacency is used on 1Õs and 8-adjacency on 0Õs.