메뉴 건너뛰기




Volumn 37, Issue 1, 2004, Pages 79-92

Three-dimensional Euclidean distance transformation and its application to shortest path planning

Author keywords

Distance transformation; Euclidean distance; Image processing; Shortest path planning

Indexed keywords

IMAGE ANALYSIS; MATHEMATICAL TRANSFORMATIONS;

EID: 0242406171     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2003.08.003     Document Type: Article
Times cited : (41)

References (16)
  • 2
    • 0026852378 scopus 로고
    • A mathematical morphology approach to Euclidean distance transformation
    • Shih F.Y. Mitchell O.R. A mathematical morphology approach to Euclidean distance transformation IEEE Trans. Image Process. 1 2 1992 197-204
    • (1992) IEEE Trans. Image Process. , vol.1 , Issue.2 , pp. 197-204
    • Shih, F.Y.1    Mitchell, O.R.2
  • 3
    • 0040466236 scopus 로고
    • Optimization on Euclidean distance transformation using grayscale morphology
    • Shih F.Y. Wu H. Optimization on Euclidean distance transformation using grayscale morphology J. Visual Commun. Image Represent. 3 2 1992 104-114
    • (1992) J. Visual Commun. Image Represent. , vol.3 , Issue.2 , pp. 104-114
    • Shih, F.Y.1    Wu, H.2
  • 4
    • 0028405361 scopus 로고
    • A Euclidean distance transform using grayscale morphology decomposition
    • Huang C.T. Mitchell O.R. A Euclidean distance transform using grayscale morphology decomposition IEEE Trans. Pattern Anal. Mach. Intell. 16 4 1994 443-448
    • (1994) IEEE Trans. Pattern Anal. Mach. Intell. , vol.16 , Issue.4 , pp. 443-448
    • Huang, C.T.1    Mitchell, O.R.2
  • 5
    • 0024479011 scopus 로고
    • Threshold decomposition of gray-scale morphology into binary morphology
    • Shih F.Y. Mitchell O.R. Threshold decomposition of gray-scale morphology into binary morphology IEEE Trans. Pattern Anal. Mach. Intell. 11 1 1989 31-42
    • (1989) IEEE Trans. Pattern Anal. Mach. Intell. , vol.11 , Issue.1 , pp. 31-42
    • Shih, F.Y.1    Mitchell, O.R.2
  • 6
    • 0033350911 scopus 로고    scopus 로고
    • Fast Euclidean distance transformation by propagation using multiple neighborhoods
    • Cuisenaire O. Macq B. Fast Euclidean distance transformation by propagation using multiple neighborhoods Comput. Vision Image Understanding 76 2 1999 163-172
    • (1999) Comput. Vision Image Understanding , vol.76 , Issue.2 , pp. 163-172
    • Cuisenaire, O.1    Macq, B.2
  • 7
    • 0035180507 scopus 로고    scopus 로고
    • Constant-time algorithm for the Euclidean distance transform on reconfigurable meshes
    • Datta A. Soundaralakshmi S. Constant-time algorithm for the Euclidean distance transform on reconfigurable meshes J. Parallel Distributed Comput. 61 2001 1439-1455
    • (2001) J. Parallel Distributed Comput. , vol.61 , pp. 1439-1455
    • Datta, A.1    Soundaralakshmi, S.2
  • 9
    • 0028545498 scopus 로고
    • New algorithms for Euclidean distance transformation of an n-dimensional digitized picture with applications
    • Saito T. Toriwaki J.-I. New algorithms for Euclidean distance transformation of an n-dimensional digitized picture with applications Pattern Recognition 27 11 1994 1551-1565
    • (1994) Pattern Recognition , vol.27 , Issue.11 , pp. 1551-1565
    • Saito, T.1    Toriwaki, J.-I.2
  • 10
  • 11
    • 0020706698 scopus 로고
    • Spatial planning: A configuration apace approach
    • Lozano-Perez T. Spatial planning: A configuration apace approach IEEE Trans. Comput. c-32 1983 108-120
    • (1983) IEEE Trans. Comput. , vol.c-32 , pp. 108-120
    • Lozano-Perez, T.1
  • 12
    • 0020642411 scopus 로고
    • Solving the find path problem by good representation for free apace
    • Brooks R.A. Solving the find path problem by good representation for free apace IEEE Trans. Syst. Man Cybernet. 13 3 1983 190-197
    • (1983) IEEE Trans. Syst. Man Cybernet. , vol.13 , Issue.3 , pp. 190-197
    • Brooks, R.A.1
  • 14
    • 0032140027 scopus 로고    scopus 로고
    • A morphological approach to shortest path planning for rotating objects
    • Pei S.-C. Lai C.-L. Shih F.Y. A morphological approach to shortest path planning for rotating objects Pattern Recognition 31 8 1998 1127-1138
    • (1998) Pattern Recognition , vol.31 , Issue.8 , pp. 1127-1138
    • Pei, S.-C.1    Lai, C.-L.2    Shih, F.Y.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.