-
Notifications
You must be signed in to change notification settings - Fork 0
/
edt.bib
899 lines (777 loc) · 30.1 KB
/
edt.bib
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
@Book{klette_rosen,
author = {R. Klette and A. Rosenfeld},
ALTeditor = {},
title = {Digital Geometry, Geometric Methods for Digital Picture Analysis},
publisher = {Morgan Kaufmann},
year = {2004},
OPTkey = {},
OPTvolume = {},
OPTnumber = {},
series = {Series in Computer Graphics and Geometric Modeling},
OPTaddress = {},
OPTedition = {},
OPTmonth = {},
OPTnote = {},
OPTannote = {}
}
@InProceedings{hesselink_ISMM,
author = {W.~H. Hesselink and M. Visser and J.~B.~T.~M. Roerdink},
title = {Euclidean skeletons of 3D data sets in linear time by the integer medial axis transform},
booktitle = {Mathematical Morphology: 40 Years On (Proc. 7th Intern. Symp. on Mathematical Morphology)},
pages = {259--268},
year = 2005,
editor = {C. Ronse and L. Najman and E. Decenci\`ere},
month = apr,
publisher = {Springer}
}
@Article{LeymarieL92,
title = "Simulating the Grassfire Transform Using an Active
Contour Model",
author = "F.~F. Leymarie and M.~D. Levine",
journal = "IEEE Transactions on Pattern Analysis Machine Intelligence",
year = "1992",
number = "1",
volume = "14",
bibdate = "2004-09-02",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/journals/pami/pami14.html#LeymarieL92",
pages = "56--75",
}
@InProceedings{conf/iccv/GiblinK99,
title = "On the Local Form and Transitions of Symmetry Sets,
Medial Axes, and Shocks",
author = "P.~J. Giblin and B.~B. Kimia",
year = "1999",
bibdate = "2002-03-14",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/conf/iccv/iccv1999-1.html#GiblinK99",
booktitle = "ICCV",
pages = "385--391"
}
@InProceedings{conf/eccv/GiblinK02,
title = "Transitions of the 3{D} Medial Axis under a
One-Parameter Family of Deformations",
author = "Peter J. Giblin and Benjamin B. Kimia",
bibdate = "2004-05-12",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/conf/eccv/eccv2002-2.html#GiblinK02",
booktitle = "ECCV (2)",
booktitle = "Computer Vision - {ECCV} 2002, 7th European Conference
on Computer Vision, Copenhagen, Denmark, May 28-31,
2002, Proceedings, Part {II}",
publisher = "Springer",
year = "2002",
volume = "2351",
editor = "Anders Heyden and Gunnar Sparr and Mads Nielsen and
Peter Johansen",
ISBN = "3-540-43744-4",
pages = "718--734",
series = "Lecture Notes in Computer Science",
}
@InProceedings{conf/cvpr/LeymarieK03,
title = "Computation of the Shock Scaffold for Unorganized
Point Clouds in 3{D}",
author = "Frederic F. Leymarie and Benjamin B. Kimia",
publisher = "IEEE Computer Society",
year = "2003",
bibdate = "2004-08-17",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/conf/cvpr/cvpr2003-1.html#LeymarieK03",
booktitle = "CVPR",
crossref = "conf/cvpr/2003",
ISBN = "0-7695-1900-8",
pages = "821--827",
}
@InProceedings{conf/icpr/LeymarieKG04,
title = "Towards Surface Regularization via Medial Axis
Transitions",
author = "Frederic F. Leymarie and Benjamin B. Kimia and Peter
J. Giblin",
year = "2004",
bibdate = "2004-10-14",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/conf/icpr/icpr2004-3.html#LeymarieKG04",
booktitle = "ICPR (3)",
pages = "123--126",
}
@InProceedings{ICCV2-99*828,
author = "K. Siddiqi and S. Bouix and A. Tannenbaum and S.
Zucker",
title = "The Hamilton-Jacobi Skeleton",
pages = "828--834",
booktitle = "Proceedings of the 7th {IEEE} International Conference
on Computer Vision ({ICCV}-99)",
month = sep # " ~20--27",
volume = "II",
publisher = "IEEE",
address = "Los Alamitos, CA",
year = "1999",
}
@InProceedings{Nagy05,
title = "A Comparison Among Distances Based on Neighborhood
Sequences in Regular Grids",
author = "B.~ Nagy",
year = 2005,
booktitle = "Image Analysis, 14th Scandinavian Conference",
publisher = "Springer",
series = "LNCS",
number = 3540,
pages = "1027--1036",
}
@InProceedings{ThielAttaliBT95,
title = "Pruning Discrete and Semiocontinuous Skeletons",
author = "D.~ Attali and G.~ Sanniti di Baja and
E.~ Thiel",
year = "1995",
booktitle = "8th International Conference on Image Analysis and Processing",
pages = "488--493",
}
@article{Fitzpatrick,
author = {Y.~Ge and J.~M.~ Fitzpatrick},
title = {On the Generation of Skeletons from Discrete Euclidean Distance Maps},
journal = {IEEE Transactions on Pattern Analysis Machine Intelligence},
volume = {18},
number = {11},
year = {1996},
issn = {0162-8828},
pages = {1055--1066},
doi = {http://dx.doi.org/10.1109/34.544075},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
}
@Article{mukherjee,
author = {J.~ Mukherjee and P.~P.~ Das and M.~ Aswatha Kumarb and B.~N. Chatterjib },
title = {On approximating Euclidean metrics by digital distances in 2D and 3D},
journal = {Pattern Recognition Letters},
year = 2000,
volume = 21,
number = {6--7},
pages = {573--582}
}
@Article{MalandainF98,
title = "Euclidean skeletons",
author = "G.~ Malandain and S.~ Fern{\'a}ndez-Vidal",
journal = "Image Vision Comput",
year = "1998",
number = "5",
volume = "16",
bibdate = "2004-03-15",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/journals/ivc/ivc16.html#MalandainF98",
pages = "317--327",
}
@Article{journals/vc/CorneaSYB05,
title = "Computing hierarchical curve-skeletons of 3{D}
objects",
author = "Nicu D. Cornea and Deborah Silver and Xiaosong Yuan
and Raman Balasubramanian",
journal = "The Visual Computer",
year = "2005",
number = "11",
volume = "21",
bibdate = "2006-02-09",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/journals/vc/vc21.html#CorneaSYB05",
pages = "945--955",
}
@Article{bb18000,
author = "J. H. Chuang and C. H. Tsai and M. C. Ko",
title = "Skeletonization of Three-Dimensional Object Using
Generalized Potential Field",
journal = "IEEE Trans. Pattern Analysis and Machine
Intelligence",
volume = "22",
year = "2000",
number = "11",
month = nov,
pages = "1241--1251",
}
@Article{journals/ijcv/PizerSSDZ03,
title = "Multiscale Medial Loci and Their Properties",
author = "Stephen M. Pizer and Kaleem Siddiqi and G{\'a}bor
Sz{\'e}kely and James N. Damon and Steven W. Zucker",
journal = "International Journal of Computer Vision",
year = "2003",
number = "2-3",
volume = "55",
bibdate = "2005-04-25",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/journals/ijcv/ijcv55.html#PizerSSDZ03",
pages = "155--179",
}
@Article{Cuisenaire1999_268,
Author = {O.~Cuisenaire and B.~Macq},
Title = {Fast Euclidean distance transformations by propagation using multiple neighbourhoods},
Journal = {Computer Vision and Image Understanding},
Volume = 76,
Year = 1999,
pages = "163--172",
number = 2,
month = nov,
}
@ARTICLE{Thiel_CMA,
REFNAME = {Rem},
AUTHOR = {E. Remy and E. Thiel},
TITLE = {Medial Axis for Chamfer Distances:
computing Look-Up Tables and Neighbourhoods in 2{D} or 3{D}},
JOURNAL = {Pattern Recognition Letters},
YEAR = {2002},
PAGES = {649-661},
VOLUME = {23},
NUMBER = {6},
NOTE = {},
QUOI = {},
}
@ARTICLE{Thiel_EMA,
REFNAME = {Rem},
AUTHOR = {E. Remy and E. Thiel},
TITLE = {Exact Medial Axis with Euclidean Distance},
JOURNAL = {Image and Vision Computing},
YEAR = {2005},
PAGES = {167-175},
VOLUME = {23},
NUMBER = {2},
NOTE = {},
QUOI = {},
}
@ARTICLE{fouard:ivc:2005,
AUTHOR = {C.~ Fouard and G.~ Malandain},
JOURNAL = {Image and Vision Computing},
TITLE = {3-D chamfer distances and norms in anisotropic grids},
YEAR = 2005,
MONTH = {February},
NUMBER = 2,
PAGES = {143--158},
VOLUME = 23,
KEYWORDS = {chamfer distance, anisotropic lattice, Farey triangulation},
PDF = {ftp://ftp-sop.inria.fr/epidaure/Publications/Fouard/Fouard_Malandain_IVC_2004.pdf},
ABSTRACT = {Chamfer distances are widely used in image analysis and many authors have investigated the computation of optimal chamfer mask coefficients. Unfortunately, these methods are not systematized: calculations have to be conducted manually for every mask size or image anisotropy. Since image acquisition (e.g. medical imaging) can lead to discrete anisotropic grids with unpredictable anisotropy value, automated calculation of chamfer mask coefficients becomes mandatory for e cient distance map computations. This article presents an automatic construction for chamfer masks of arbitrary sizes. This allows, first, to derive analytically the relative error with respect to the Euclidean distance, in any 3-D anisotropic lattice, and second, to compute optimal chamfer coefficients. In addition, the resulting chamfer map verifies discrete norm conditions.}
}
@Article{journals/ijcv/GiblinK03,
title = "On the Local Form and Transitions of Symmetry Sets,
Medial Axes, and Shocks",
author = "Peter Giblin and Benjamin B. Kimia",
journal = "International Journal of Computer Vision",
year = "2003",
number = "1-3",
volume = "54",
bibdate = "2005-04-25",
bibsource = "DBLP,
http://dblp.uni-trier.de/db/journals/ijcv/ijcv54.html#GiblinK03",
pages = "143--157",
}
@article{citeulike:677854,
abstract = {This paper proposes a novel hypergraph skeletal representation for 3D shape based on a formal derivation of the generic structure of its medial axis. By classifying each skeletal point by its order of contact, we show that, genetically, the medial axis consists of five types of points, which are then organized into sheets, curves, and points: 1) sheets (manifolds with boundary) which are the locus of bitangent spheres with regular tangency A/sub 1//sup 2/ (A/sub k//sup n/ notation means n distinct k-fold tangencies of the sphere of contact, as explained in the text); two types of curves, 2) the intersection curve of three sheets and the locus of centers of tritangent spheres, A/sub 1//sup 3/, and 3) the boundary of sheets, which are the locus of centers of spheres whose radius equals the larger principal curvature, i.e., higher order contact A/sub 3/ points; and two types of points, 4) centers of quad-tangent spheres, A/sub 1//sup 4/, and 5) centers of spheres with one regular tangency and one higher order tangency, A/sub 1/A/sub 3/. The geometry of the 3D medial axis thus consists of sheets (A/sub 1//sup 2/) bounded by one type of curve (A/sub 3/) on their free end, which corresponds to ridges on the surface, and attached to two other sheets at another type of curve (A/sub 1//sup 3/), which support a generalized cylinder description. The A/sub 3/ curves can only end in A/sub 1/ A/sub 3/ points where they must meet an A/sub 1//sup 3/ curve. The A/sub 1//sup 3/ curves meet together in fours at an A/sub 1//sup 4/ point. This formal result leads to a compact representation for 3D shape, referred to as the medial axis hypergraph representation consisting of nodes (A/sub 1//sup 4/ and A/sub 1/ A/sub 3/ points), links between pairs of nodes (A/sub 1//sup 3/ and A/sub 3/ curves) and hyperlinks between groups of links (A/sub 1//sup 2/ sheets). The description of the local geometry at nodes by itself is sufficient to capture qualitative aspects of shapes, in analogy to 2D. We derive a pointwise reconstruction formula to reconstruct a surface from this medial axis hypergraph together with the radius function. Thus, this information completely characterizes 3D shape and lays the theoretical foundation for its use in recognition, morphing, design, and man- ipulation of shapes.},
author = {Giblin, P. and Kimia, B. B. },
citeulike-article-id = {677854},
journal = {IEEE Transactions on Pattern Analysis and Machine Intelligence},
keywords = {axis medial},
number = {2},
pages = {238--251},
priority = {2},
title = {A formal classification of 3D medial axis points and their local geometry},
volume = {26},
year = {2004}
}
@article{kimmel,
title = "Skeletonization via Distance Maps and Level Sets",
author = " R.~ Kimmel and D.~ Shaked and N.~ Kiryati and A.~M.~ Bruckstein",
year = 1995,
journal= "Computer Vision and Image Understanding",
volume= 62,
number= 3,
pages = {381--391},
abstract = "The medial axis transform (MAT) of a shape, better
known as its skeleton, is frequently used in shape
analysis and related areas. In this paper a new
approach for determining the skeleton of an object, is
presented. The boundary is segmented at points of
maximal positive curvature and a distance map from each
of the segments is calculated. The skeleton is then
located by applying simple rules to the zero sets of
distance maps differences. A framework is proposed for
numerical approximation of distance maps that is
consistent with the continuous case, hence does not
suffer from digitization bias due to metrication errors
of the implementation on the grid. Subpixel accuracy in
distance map calculation is obtained by using gray
level information along the boundary of the shape in
the numerical scheme. The accuracy of the resulting
efficient skeletonization algorithm is demonstrated by
several examples. Keywords: Differential Geometry,
Distance Map, Medial Axis Transform, Shape Analysis,
S..."
}
@Article{BoissonnatEtAl96,
author = "J.~D.~ Boissonnat and A.~Cerezo and O.Devillers and J.~Duquesne and
M.~Yvinec",
title = "An Algorithm for Constructing the Convex Hull of a Set
of Spheres in Dimension d",
journal = "Computational Geometry: Theory and
Applications",
volume = 6,
number = 2,
pages = {123--130},
year = 1996,
}
@Article{Aurenhammer:1987:PDP,
author = "F. Aurenhammer",
title = "Power Diagrams: Properties, Algorithms, and
Applications",
journal = "SIAM Journal on Computing",
volume = "16",
number = "1",
pages = "78--96",
month = feb,
year = "1987",
CODEN = "SMJCAT",
ISSN = "0097-5397 (print), 1095-7111 (electronic)",
MRclass = "68U05 (11H50 52-04 90C10)",
MRnumber = "88d:68096",
bibdate = "Sat Jan 18 18:03:50 MST 1997",
acknowledgement = ack-nhfb,
annote = "A",
keywords = "discrete geometry, and design of algorithms, and
geometric transformations, and duality, and
{Vorono{\u{\i}}} diagrams, and convex hull, and
arrangements, and d-dimensional, and distance, and
weighted.",
mrnumber-url = "http://www.ams.org/mathscinet-getitem?mr=88d%3a68096",
}
@Article{AmeChoKol01,
author = "N.~Amenta and S.~Choi and R.~K.~ Kolluri",
title = "The Power Crust, Unions of Balls, and the Medial Axis
Transform",
journal = "Computational Geometry: Theory and
Applications",
volume = 19,
number = {2-3},
pages = {127--153},
year = 2001,
}
@Article{GotLin95,
author = "C.~Gotsman and M.~Lindenbaum",
title = "Euclidean Voronoi Labelling on the Multidimensional
Grid",
journal = "Pattern Recognition Letters",
volume = 16,
year = 1995,
pages = "409--415",
}
@Book{schmitt,
author = {M.~Schmitt and J.~Mattioli},
title = {Morpholohgie Math{\'e}matique},
publisher = {Masson},
year = 1993
}
@Article{borgefors_min,
author = {G. Borgefors and I. Nystr{\"o}m},
title = {Efficient shape representation by minimizing the set of centers of maximal discs/spheres},
journal = {Pattern Recognition Letters},
year = 1997,
volume = 18,
pages = {465--472}
}
@Article{attal,
author = {D. Attali and A. Montanvert},
title = {Computing and Simplifying 2D and 3D Continuous Skeletons},
journal = {Computer Vision and Image Understanding},
year = 1997,
volume = 67,
number = 3,
pages = {161--273}
}
@Article{satio_redt,
author = {T. Saito and J.-I. Toriwaki},
title = {Reverse Distance Transformation and Skeletons Based upon the Euclidean Metric for $n$-Dimensionnal Digital Pictures},
journal = {IECE Trans. Inf. \& Syst.},
year = 1994,
volume = {E77-D},
number = 9,
pages = {1005--1016},
month = sep
}
@Article{Baja85,
author = "C. Arcelli and G. Sanniti di Baja",
title = "A Width-Independent Fast Thinning Algorithm",
year = "1985",
journal = "IEEE Transactions on Pattern Analysis and Machine
Intelligence",
volume = "7",
institution = "CNR",
pages = "463--474",
keywords = "IMAGE PART PROCESSING",
}
@Article{Kimmel:1995:SDM,
author = "R.~ Kimmel and D.~ Shaked and N.~ Kiryati and
A.~M. Bruckstein",
title = "Skeletonization via Distance Maps and Level Sets",
journal = "Computer Vision and Image Understanding: CVIU",
volume = 62,
number = 3,
pages = "382--391",
month = nov,
year = 1995,
}
@Article{Nilsson:1997:FMS,
author = "F. Nilsson and P.-E. Danielsson",
title = "Finding the Minimal Set of Maximum Disks for Binary
Objects",
journal = "Graphical models and image processing",
volume = 59,
number = 1,
pages = "55--60",
month = jan,
year = 1997,
ISSN = "1077-3169",
bibdate = "Wed Mar 8 15:09:14 MST 2000",
acknowledgement = ack-nhfb,
doi = "10.1006/gmip.1996.0412",
}
@Article{arcelli,
author = { C. Arcelli and G. {Sanniti di Baja}},
title = {Ridge Points in Euclidean Distance Maps},
journal = {Pattern Recognition Letters},
year = 1992,
volume = 13,
pages = {237--243}
}
@PhdThesis{rang_thesis,
author = {I. Ragnemalm},
title = {The Euclidean Distance Transform},
school = {Link{\"o}ping University, Link{\"o}ping, Sweden},
year = 1993
}
@Article{sann94,
author = "G. Sanniti di Baja",
title = "Well-Shaped, Stable, and Reversible Skeletons from the
(3,4)-Distance Transform",
journal = "J. Visual Communication and Image Representation",
year = "1994",
volume = "5",
pages = "107--115",
annote = "imagery",
}
@Article{montanari,
author = {U. Montanari},
title = {Continuous skeletons from digitized images},
journal = {Journal of the Association for Computing Machinery},
year = 1969,
volume = 16,
number = 4,
pages = {534--549},
month = oct
}
@InProceedings{Blum:1964,
author = "H. Blum",
year = 1967,
keywords = "SHAPE SKELETON VISION OCCLUSION",
institution = "U. Mass-CS",
title = "A transformation for extracting descriptors of shape",
booktitle = "Models for the Perception of Speech and Visual Forms",
publisher= "MIT Press",
pages = "362--380",
annote = "This is an early paper which putted forth the concept
of Medial Axis Transform (MAT) for shape description.
Author has mainly addressed the problem of 2-D shape
description and showed how a MAF (Medial Axis Function)
can be effectively used for the purpose. An MAF is
generated by locating the corners of intersection of
waves, which travel at constant speed in direction
normal to contour. MAF has many interesting properties
eg. stability, invariance and invertibility. MAF can be
used to infer about curvatures of parent contour. It is
shown that MAF can be utilized for pattern recognition
even in the presence of occlusion. Relation of MAF with
psychology and physiology are also indicated. Finally
author talks about an experimental system build for
getting MAF. On a whole, this paper seems to be a must
for understanding concepts of MAF. - RBA 7/94"
}
@Article{maurer_pami,
author = {C.~R.~Maurer and R.~Qi and V. Raghavan},
title = {A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions},
journal = {IEEE Transactions on Pattern Analysis and
Machine Intelligence},
year = 2003,
volume = 25,
number = 2,
pages = {265-270},
month = feb
}
@InProceedings{maurer,
author = {C.R. {Maurer~Jr.} and V. Raghavan and R. Qi},
title = { A Linear Time Algorithm for Computing the
Euclidean Distance Transform in Arbitrary Dimensions},
booktitle = {Information Processing in Medical Imaging},
pages = {358--364},
year = 2001
}
@PhdThesis{dcoeurjo_these,
author = {D. Coeurjolly},
title = {Algorithmique et géométrie discrète pour la caractérisation des courbes et des surfaces},
school = {Université Lumière Lyon 2, Bron},
year = 2002,
address = {Laboratoire ERIC},
month = {dec}
}
@PHDTHESIS{Thiel_hdr,
REFNAME = {Thi},
AUTHOR = {E. Thiel},
TITLE = {Géométrie des distances de chanfrein},
TYPE = {{H}abilitation à {D}iriger des {R}echerches},
SCHOOL = {Université de la Méditerranée},
ADDRESS = {Aix-Marseille 2},
YEAR = 2001,
MONTH = {Déc},
}
@Book{P16,
author = "{F. P. Preparata} and { M. I. Shamos}",
title = "Computational Geometry~: An Introduction",
publisher = "Springer-Verlag",
year = "1985",
}
@Article{BreuEtAl95,
author = "H. Breu and J. Gil and D. Kirkpatrick and M. Werman",
title = "Linear Time Euclidean Distance Transform Algorithms",
journal = "IEEE Transactions on Pattern Analysis and
Machine Intelligence",
volume = 17,
number = 5,
pages = "529--533",
year = 1995
}
@Article{Guan,
author = "W. Guan and S. Ma",
title = "A List-Processing Approach to Compute Voronoi Diagrams and the Euclidean Distance Transform",
journal = "IEEE Transactions on Pattern Analysis and
Machine Intelligence",
volume = 20,
pages = "757--761",
number = 7,
year = 1998
}
@Article{SaitTori:94,
author = "T. Saito and J.~I. Toriwaki",
title = "New algorithms for {E}uclidean distance
transformations of an {$n$}-dimensional digitized
picture with applications",
journal = "Pattern Recognition",
year = 1994,
volume = 27,
pages = "1551--1565",
}
@Article{ROSEN_66,
author = "A. Rosenfeld and J. L. Pfaltz",
title = "Sequential Operations in Digital Picture Processing",
journal = "Journal of the ACM",
volume = "13",
number = "4",
pages = "471--494",
month = oct,
year = "1966",
coden = "JACOAH",
ISSN = "0004-5411",
bibdate = "Tue Nov 1 09:40:47 1994",
acknowledgement = ack-nhfb,
}
@Article{ROSEN_68,
author = "A. Rosenfeld and J. L. Pfalz",
title = "Distance functions on digital pictures",
journal = "Pattern Recognition",
volume = "1",
year = "1968",
pages = "33--61",
annote = "imagery",
}
@Article{KOLO_92,
author = "M. N. Kolountzakis and K. N. Kutulakos",
title = "Fast computation of the {Euclidian} distance maps for
binary images",
journal = "Information Processing Letters",
volume = 43,
number = 4,
pages = "181--184",
day = 28,
month = sep,
year = 1992,
coden = "IFPLAT",
ISSN = "0020-0190",
mrclass = "68U05 (68Q22 68T10)",
mrnumber = "93g:68140",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
annote = "Yes, the title has `Euclidian' instead of
`Euclidean'.",
classification = "C1250 (Pattern recognition); C4240 (Programming and
algorithm theory); C6130B (Graphics techniques)",
corpsource = "Dept. of Math., Stanford Univ., CA, USA",
keywords = "binary images; computer graphics; Euclidian distance
maps; fast computation; image processing; parallel
algorithms; parallel machine; pattern recognition;
running time",
treatment = "P Practical; T Theoretical or Mathematical",
}
@Article{MULL_92,
author = "J.~C. Mullikin",
title = "The Vector Distance Transform in Two and Three
Dimensions",
journal = "Computer Vision, Graphics, and Image Processing.
Graphical Models and Image Processing",
volume = 54,
number = 6,
pages = "526--535",
month = nov,
year = 1992,
coden = "CGMPE5",
ISSN = "1049-9652",
bibdate = "Sat Sep 14 09:14:28 MDT 1996",
acknowledgement = ack-nhfb,
affiliation = "Fac. of Appl. Phys., Delft Univ. of Technol.,
Netherlands",
classification = "B0290Z (Other numerical methods); B6140C (Optical
information and image processing); C1250 (Pattern
recognition); C4190 (Other numerical methods); C5260B
(Computer vision and picture processing)",
keywords = "2-D images; 3-D images; Anisotropic sampling; Confocal
scanning laser microscope; Dilations; Distance
measurements; Erosions; Image analysis; Image
processing; Skeletonizations; Three-dimensional image
data; Two dimensional image data; Vector distance
transform",
thesaurus = "Image recognition; Transforms",
}
@Article{verwer,
author = {B.~J. H Verwer},
title = {Local distances for distance transformations in two and three dimensions},
journal = {Pattern Recognition Letters},
year = 1991,
volume = 12,
pages = {671--682},
month = {november}
}
@InBook{ragnemalm,
title = "Contour processing distance transforms",
publisher = "World Scientific",
year = "1990",
author = "I.~Ragnemalm",
pages = "204--211",
}
@PhdThesis{cuisenaire,
author = {O. Cuisenaire},
title = {Distance Transformations : Fast Algorithms and Applications to Medical Image Processing},
school = {Universit{\'e} Catholique de Louvain},
year = 1999,
month = {oct}
}
@Article{danielson,
author = "P.-E. Danielsson",
year = 1980,
title = "Euclidean Distance Mapping",
journal = "Computer Graphics and Image Processing",
volume = 14,
pages = "227--248"
}
@Article{borgefors,
author = "G. Borgefors",
title = "Distance Transformations in Digital Images",
journal = "Computer Vision, Graphics, and Image Processing",
volume = "34",
number = "3",
pages = "344--371",
month = jun,
year = "1986",
coden = "CVGPDB",
ISSN = "0734-189X",
bibdate = "Sat Jul 05 17:01:22 1997",
acknowledgement = ack-nhfb,
affiliation = "FOA",
affiliationaddress = "Natl Defence Research Inst, Linkoping, Swed",
classification = "723; 741",
journalabr = "Comput Vision Graphics Image Process",
keywords = "computer programming --- Algorithms; digital images;
distance transformations; image part processing; image
processing; kernel point; pattern recognition",
}
@InProceedings{Yamada84b,
author = "H. Yamada",
title = "Complete Euclidean Distance Transformation by Parallel
Operation",
booktitle = "Seventh International Conference on Pattern
Recognition",
year = 1984,
series = "IEEE Publ. 84CH2046-1",
institution = "ETL",
pages = "69--71",
keywords = "IMAGE PART PROCESSING",
}
@Article{Paglieroni:1992:DTP,
author = "D. W. Paglieroni",
title = "Distance Transforms: Properties and Machine Vision
Applications",
journal = "Computer Vision, Graphics, and Image Processing.
Graphical Models and Image Processing",
volume = 54,
number = 1,
pages = "56--74",
month = jan,
year = 1992,
coden = "CGMPE5",
ISSN = "1049-9652",
bibdate = "Fri Feb 07 17:29:07 1997",
acknowledgement = ack-nhfb,
classification = "C1130 (Integral transforms); C1250 (Pattern
recognition); C5260B (Computer vision and picture
processing)",
keywords = "Adaptive matching; Binary function geometrical
transforms; Cross-correlations; Distance transform;
Machine vision; Rotation; Translation",
thesaurus = "Computer vision; Transforms",
}
@INPROCEEDINGS{Thiel_IWCIA7,
REFNAME = {Rem},
AUTHOR = {E. Remy and E. Thiel},
TITLE = {Optimizing 3{D} Chamfer Masks with Norm Constraints},
BOOKTITLE = {International Workshop on Combinatorial Image Analysis},
MONTH = jul,
YEAR = {2000},
ADDRESS = {Caen},
PAGES = {39-56},
QUOI = {},
}
@Article{Hirata,
author = "T. Hirata",
title = "A unified linear-time algorithm for computing distance
maps",
journal = "Information Processing Letters",
volume = "58",
number = "3",
pages = "129--133",
day = "13",
month = may,
year = "1996",
coden = "IFPLAT",
ISSN = "0020-0190",
mrclass = "68U10",
mrnumber = "97j:68137",
bibdate = "Wed Nov 11 12:16:26 MST 1998",
acknowledgement = ack-nhfb,
classification = "C1250 (Pattern recognition); C4240C (Computational
complexity); C5260B (Computer vision and image
processing techniques)",
corpsource = "Fac. of Eng., Nagoya Univ., Japan",
keywords = "binary image; chamfer; chessboard; city block;
computational complexity; computer vision; distance
maps; Euclidean; Euclidean distance; Euclidean distance
transform; image processing; machine vision; matrix
searching; octagonal",
treatment = "T Theoretical or Mathematical",
}
@InProceedings{roerdnik,
author = {A. Meijster and J.B.T.M. Roerdink and W. H. Hesselink},
title = { A general algorithm for computing distance transforms in linear time},
booktitle = {Mathematical Morphology and its Applications to Image and Signal Processing},
pages = {331--340},
year = 2000,
publisher = {Kluwer}
}