Accelerating computation of Euclidean distance map using the GPU with efficient memory access

Author： Man Duhu Uda Kenji Ito Yasuaki Nakano Koji

ISSN： 1744-5760

Source： International Journal of Parallel, Emergent and Distributed Systems, Vol.28, Iss.5, 2013-10, pp. : 383-406

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Efficient Computation of the Euclidean Distance Transform

By Boxer L. Miller R.

Computer Vision and Image Understanding, Vol. 80, Iss. 3, 2000-12 ,pp. : 379-383

Academic Press

Access to resources Recommend Favorite

Corrigendum to “Efficient Computation of the Euclidean Distance Transform” (doi:10.1006/cviu.2000.0880)

By Boxer L. Miller R.

Computer Vision and Image Understanding, Vol. 86, Iss. 2, 2002-05 ,pp. : 137-140

Academic Press

Access to resources Recommend Favorite

Fast and memory-efficient minimum spanning tree on the GPU

By Rostrup Scott Srivastava Shweta Singhal Kishore

International Journal of Computational Science and Engineering, Vol. 8, Iss. 1, 2013-02 ,pp. : 21-33

Inderscience Publishers

Access to resources Recommend Favorite

Parallel Computation of the Euclidean Distance Transform on the Mesh of Trees and the Hypercube Computer

By Lee Y.H. Horng S.J. Kao T.W. Chen Y.J.

Computer Vision and Image Understanding, Vol. 68, Iss. 1, 1997-10 ,pp. : 109-119

Academic Press

Access to resources Recommend Favorite

Multidimensional Alignment Using the Euclidean Distance Transform

By Kozinska D. Tretiak O.J. Nissanov J. Ozturk C.

Graphical Models and Image Processing, Vol. 59, Iss. 6, 1997-11 ,pp. : 373-387

Academic Press

Access to resources Recommend Favorite