MINIMAL NONSIMPLE SETS OF VOXELS IN BINARY IMAGES ON A FACE-CENTERED CUBIC GRID

Author:

GAU C. J.1,KONG T. Y.2

Affiliation:

1. Department of Computer Science, Graduate School and University Center, City University of New York, New York, NY 10036, USA

2. Department of Computer Science, Queens College, City University of New York, Flushing, NY 11367, USA

Abstract

One can prove that a specified parallel thinning algorithm always preserves the topology of the input binary image by verifying that no iteration of that algorithm can ever delete a minimal non-simple ("MNS") set of 1's of an image. For binary images on a 3D face-centered cubic ("FCC") grid, we determine which sets of voxels can be MNS, and also determine which of those sets can be MNS without being a component of the 1's. These two problems are complicated by the fact that there are (at least) three reasonable ways of defining connectedness for sets of 1's and 0's in a binary image on an FCC grid, since one can: (a) use 18-connectedness for sets of 1's and 12-connectedness for sets of 0's; (b) use 12-connectedness both for sets of 1's and for sets of 0's; (c) use 12-connectedness for sets of 1's and 18-connectedness for sets of 0's. We solve the two problems in all three cases. The analogous problems for binary images on Cartesian grids were first solved by Ronse (in the 2D case) and Ma (in the 3D case). However, our treatment of simple 1's and MNS sets is rather different from theirs, in that it is based on the attachment sets of 1's in binary images. This concept was introduced in an earlier paper [T. Y. Kong, "On topology preservation in 2-D and 3-D thinning," Int. J. Pattern Recognition and Artificial Intelligence9 (1995) 813–844] and we use the same general approach to MNS sets as was used there. The voxels of an FCC grid are rhombic dodecahedra, which are rather more difficult to visualize and draw than the cubical voxels of a 3D Cartesian grid. An advantage of working with attachment sets is that such sets can be shown in a planar Schlegel diagram of a voxel, which is easy to draw.

Publisher

World Scientific Pub Co Pte Lt

Subject

Artificial Intelligence,Computer Vision and Pattern Recognition,Software

Cited by 14 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3