A Fast 3D Euclidean Distance Transformation

被引：0
|
作者：
Li, Junli [1 ]
Wang, Xiuying [2 ]
机构：
[1] Sichuan Normal Univ, Coll Comp Sci, Chengdu 610066, Peoples R China
[2] Univ Sydney, Biomed & Multimedia Informat Technol Res Grp, Sch Informat Technol, Sydney, NSW 2006, Australia
来源：
2013 6TH INTERNATIONAL CONGRESS ON IMAGE AND SIGNAL PROCESSING (CISP), VOLS 1-3 | 2013年
关键词：
Euclidean distance transform; Contour scanning; Marked array; Search radius; IMAGES; ALGORITHM;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
A fast distance transform algorithm for 3D image is proposed. The 3D image is changed into slices of 2D images at first; then, two marked arrays for each 2D image are defined, according to which each pixel's distance transformation in the 2D image is figured. Finally, the result of 2D distance transformation is applied to calculate each pixel's distance transformation in the 3D image. The proposed algorithm can be easily implemented and parallel operated. The experimental results demonstrate the significant improvement in reducing time and space complexity when compared to boundary striping and Voronoi-based algorithms.
引用
收藏
页码：875 / 879
页数：5
相关论文
共 50 条
  • [21] An efficient algorithm for the Euclidean distance transformation
    Kato, T
    Hirata, T
    Saito, T
    Kise, K
    SYSTEMS AND COMPUTERS IN JAPAN, 1996, 27 (07) : 18 - 24
  • [22] Cellular architecture for Euclidean distance transformation
    Sudha, N
    Nandi, S
    Sridharan, K
    IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2000, 147 (05): : 335 - 342
  • [23] Parallel Euclidean distance transformation algorithm
    Katholieke Universiteit Leuven, Heverlee, Belgium
    CVIU Comput Vision Image Undersanding, 1 (15-26):
  • [24] Modeling 3D euclidean geometry
    Fontijne, D
    Dorst, L
    IEEE COMPUTER GRAPHICS AND APPLICATIONS, 2003, 23 (02) : 68 - 78
  • [25] A Fast Algorithm for Image Euclidean Distance
    Sun, Bing
    Feng, Jufu
    PROCEEDINGS OF THE 2008 CHINESE CONFERENCE ON PATTERN RECOGNITION (CCPR 2008), 2008, : 122 - 126
  • [26] d-Dimensional reverse Euclidean distance transformation and euclidean medial axis extraction in optimal time
    Coeurjolly, D
    DISCRETE GEOMETRY FOR COMPUTER IMAGERY, PROCEEDINGS, 2003, 2886 : 327 - 337
  • [27] 3D CHANGE DETECTION OF POINT CLOUDS BASED ON DENSITY ADAPTIVE LOCAL EUCLIDEAN DISTANCE
    Chai, J. X.
    Zhang, Y. S.
    Yang, Z.
    Wu, J.
    XXIV ISPRS CONGRESS IMAGING TODAY, FORESEEING TOMORROW, COMMISSION II, 2022, 43-B2 : 523 - 530
  • [28] Voxblox: Incremental 3D Euclidean Signed Distance Fields for On-Board MAV Planning
    Oleynikova, Helen
    Taylor, Zachary
    Fehr, Marius
    Siegwart, Roland
    Nieto, Juan
    2017 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2017, : 1366 - 1373
  • [29] An O(1) time algorithm for the 3D euclidean distance transform on the CRCW PRAM model
    Wang, YR
    Horng, SJ
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2003, 14 (10) : 973 - 982
  • [30] A FAST ALGORITHM FOR EUCLIDEAN DISTANCE MAPS OF A 2-D BINARY IMAGE
    CHEN, L
    CHUANG, HYH
    INFORMATION PROCESSING LETTERS, 1994, 51 (01) : 25 - 29
12345