
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Masafumi Miyazawa, Peifeng Zeng, Naoyuki Iso, Tomio Hirata, "A Systolic Algorithm for Euclidean Distance Transform," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 28, no. 7, pp. 11271134, July, 2006.  
BibTex  x  
@article{ 10.1109/TPAMI.2006.133, author = {Masafumi Miyazawa and Peifeng Zeng and Naoyuki Iso and Tomio Hirata}, title = {A Systolic Algorithm for Euclidean Distance Transform}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {28}, number = {7}, issn = {01628828}, year = {2006}, pages = {11271134}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2006.133}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  A Systolic Algorithm for Euclidean Distance Transform IS  7 SN  01628828 SP1127 EP1134 EPD  11271134 A1  Masafumi Miyazawa, A1  Peifeng Zeng, A1  Naoyuki Iso, A1  Tomio Hirata, PY  2006 KW  Euclidean distance transform KW  systolic array KW  hardware algorithm KW  image processing. VL  28 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] G. Borgefors, “Distance Transformations in Digital Images,” Computer Graphics and Image Processing, vol. 34, pp. 344371, 1986.
[2] H. Brue, J. Gil, D. Kirkpatrick, and M. Werman, “Linear Time Euclidean Distance Transform Algorithms,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 5, pp. 529533, May 1995.
[3] L. Chen and H. Chuang, “A Fast Algorithm for Euclidean Distance Maps of a 2D Binary Image,” Information Processing letters, vol. 51, pp. 2529, 1994.
[4] L. Chen and H. Chuang, “Designing Systolic Architechtures for Complete Euclidean Distance Transform,” J. VLSI Signal Processing, vol. 10, pp. 169179, 1995.
[5] L. Chen and H. Chuang, “An Efficient Algorithm for Complete Euclidean Distance Transform on MeshConnected SIMD,” Parallel Computing, vol. 21, no. 5, pp. 841852, 1995.
[6] O. Cuisenaire, “Distance Transformations: Fast Algorithms and Applications to Medical Image Processing,” PhD thesis, Universitá Catholique de Louvain, Belgium, Oct. 1999.
[7] P. Danielsson, “Euclidean Distance Mapping,” Computer Graphics and Image Processing, vol. 14, pp. 227248, 1980.
[8] A. Fujiwara, T. Masuzawa, and H. Fujiwara, “An Optimal Parallel Algorithm for the Euclidean Distance Maps of 2D Binary Images,” Information Processing Letters, vol. 54, no. 5, pp. 295300, June 1995.
[9] T. Hirata, “A Unified LinearTime Algorithm for Computing Distance Maps,” Information Processing Letters, vol. 58, pp. 129133, 1996.
[10] M. Kolountzakis and K. Kutulakos, “Fast Computation of Euclidean Distance Maps for Binary Images,” Information Processing Letters, vol. 43, pp. 181184, 1992.
[11] Y. Lee, S. Horng, T. Kao, and Y. Chen, “Parallel Computation of the Euclidean Distance Transform on the Mesh of Trees and the Hypercube Computer,” Computer Vision Image Understanding, vol. 68, no. 1, pp. 109119, 1997.
[12] F. Leymarie and M. Levine, “Fast RasterScan Distance Propagation on the Discrete Rectangular Lattice,” CVGIP: Image Understanding, vol. 55, pp. 8594, 1992.
[13] C. Maurer, R. Qi, and V. Raghavan, “A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, pp. 265270, 2003.
[14] A. Meijster, J. Roerdink, and W. Hesselink, “A General Algorithm for Computing Distance Transforms in Linear Time,” Proc. Int'l Symp. Memory Management, pp. 331340, 2000.
[15] D. Paglieroni, “A Unified Distance Transformation Algorithm and Architecture,” Machine Vision Applications, vol. 5, pp. 4755, 1992.
[16] I. Ragnemarm, “Neighborhoods for Distance Transformations Using Ordered Propagation,” CVGIP: Image Understanding, vol. 56, pp. 399409, 1992.
[17] A. Rosenfelt and J. Pfalts, “Sequential Operations in Digital Picture Processing,” J. ACM, vol. 13, pp. 471494, 1966.
[18] H. Yamada, “Complete Euclidean Distance Transformation by Parallel Operation,” Proc. Seventh Int'l Conf. Pattern Recognition, vol. 1, pp. 6971, 1984