A three-dimensional holes closing algorithm

被引:34
作者
Aktouf, Z [1 ]
Bertrand, G [1 ]
Perroton, L [1 ]
机构
[1] ESIEE Cite Descartes, A2SI Lab, F-93162 Noisy Le Grand, France
关键词
digital topology; topological numbers; topological bull; holes; distance transform;
D O I
10.1016/S0167-8655(01)00152-0
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Contrary to the 2D case, a 3D hole is not a subset of the 3D space. It is therefore not possible to use connected components search algorithms for detecting and suppressing 3D holes. In this paper, we propose an algorithm for suppressing 3D holes. It is based on properties of the previously introduced notion of topological number. Our algorithm is linear in time and it allows to control the "size" of the holes which are closed. As far as we know, this is the first ID holes closing algorithm. (C) 2002 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:523 / 531
页数:9
相关论文
共 6 条
[1]   A NEW CHARACTERIZATION OF 3-DIMENSIONAL SIMPLE POINTS [J].
BERTRAND, G ;
MALANDAIN, G .
PATTERN RECOGNITION LETTERS, 1994, 15 (02) :169-175
[2]   SIMPLE POINTS, TOPOLOGICAL NUMBERS AND GEODESIC NEIGHBORHOODS IN CUBIC GRIDS [J].
BERTRAND, G .
PATTERN RECOGNITION LETTERS, 1994, 15 (10) :1003-1011
[3]   A DIGITAL FUNDAMENTAL GROUP [J].
KONG, TY .
COMPUTERS & GRAPHICS, 1989, 13 (02) :159-166
[4]  
[No title captured]
[5]  
[No title captured]
[6]  
[No title captured]