Exact medial axis with euclidean distance

被引:36
|
作者
Remy, E
Thiel, E
机构
[1] ESIL, CNRS, UMR 6168, LSIS, F-13288 Marseille 9, France
[2] CNRS, UMR 6166, LIF, F-13288 Marseille 9, France
关键词
medial axis; centres of maximal disks; look-up tables; Squared Euclidean Distance Transform; digital shape representation;
D O I
10.1016/j.imavis.2004.06.007
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Medial Axis (MA), also known as Centres of Maximal Disks, is a useful representation of a shape for image description and analysis. MA can be computed on a distance transform, where each point is labelled to its distance to the background. Recent algorithms allow one to compute Squared Euclidean Distance Transform (SEDT) in linear time in any dimension. While these algorithms provide exact measures, the only known method to characterise MA on SEDT, using local tests and Look-Up Tables (LUT), is limited to 2D and small distance values [Borgefors, et al., Seventh Scandinavian Conference on Image Analysis, 1991]. We have proposed [Remy, et al., Pat. Rec. Lett. 23 (2002) 649] an algorithm which computes the LUT and the neighbourhood to be tested in the case of chamfer distances. In this article, we adapt our algorithm for SEDT in arbitrary dimension and show that results have completely different properties. (C) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码:167 / 175
页数:9
相关论文
共 50 条
  • [1] Exact Euclidean Medial Axis in higher resolution
    Saude, Andre Vital
    Couprie, Michel
    Lotufo, Roberto
    [J]. DISCRETE GEOMETRY FOR COMPUTER IMAGERY, PROCEEDINGS, 2006, 4245 : 605 - 616
  • [2] d-Dimensional reverse Euclidean distance transformation and euclidean medial axis extraction in optimal time
    Coeurjolly, D
    [J]. DISCRETE GEOMETRY FOR COMPUTER IMAGERY, PROCEEDINGS, 2003, 2886 : 327 - 337
  • [3] Look-up tables for medial axis on squared Euclidean distance transform
    Remy, E
    Thiel, E
    [J]. DISCRETE GEOMETRY FOR COMPUTER IMAGERY, PROCEEDINGS, 2003, 2886 : 224 - 235
  • [4] Visible Vectors and Discrete Euclidean Medial Axis
    Jérôme Hulin
    Edouard Thiel
    [J]. Discrete & Computational Geometry, 2009, 42 : 759 - 773
  • [5] Visible Vectors and Discrete Euclidean Medial Axis
    Hulin, Jerome
    Thiel, Edouard
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2009, 42 (04) : 759 - 773
  • [6] Exact computation of the medial axis of a polyhedron
    Culver, T
    Keyser, J
    Manocha, D
    [J]. COMPUTER AIDED GEOMETRIC DESIGN, 2004, 21 (01) : 65 - 98
  • [7] Fast Exact Euclidean Distance (FEED) transformation
    Schouten, T
    van den Broek, E
    [J]. PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 3, 2004, : 594 - 597
  • [8] Parallel computation of exact Euclidean distance transform
    Lee, YH
    Horng, SJ
    Kao, TW
    Jaung, FS
    Chen, YJ
    Tsai, HR
    [J]. PARALLEL COMPUTING, 1996, 22 (02) : 311 - 325
  • [9] Optimal separable algorithms to compute the reverse euclidean distance transformation and discrete medial axis in arbitrary dimension
    Coeurjolly, David
    Montanvert, Annick
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2007, 29 (03) : 437 - 448
  • [10] A parallel implementation of exact Euclidean distance transform based on exact dilations
    Bruno, OM
    Costa, LD
    [J]. MICROPROCESSORS AND MICROSYSTEMS, 2004, 28 (03) : 107 - 113