메뉴 건너뛰기




Volumn 30, Issue 12, 2008, Pages 2204-2217

Euclidean skeletons of digital image and volume data in linear time by the integer medial axis transform

Author keywords

Euclidean skeletonization; Feature transform; Integer medial axis; Integer perpendicular bisector

Indexed keywords

CLUSTERING ALGORITHMS; THREE DIMENSIONAL;

EID: 56549102821     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2008.21     Document Type: Article
Times cited : (100)

References (29)
  • 1
    • 77955377432 scopus 로고
    • Computer Representation of Planar Regions by Their Skeletons
    • J.L. Pfaltz and A. Rosenfeld, "Computer Representation of Planar Regions by Their Skeletons," Comm. ACM, vol. 10, pp. 119-125, 1972.
    • (1972) Comm. ACM , vol.10 , pp. 119-125
    • Pfaltz, J.L.1    Rosenfeld, A.2
  • 4
    • 0028463912 scopus 로고
    • Digital Skeletons in Euclidean and Geodesic Spaces
    • S. Beucher, "Digital Skeletons in Euclidean and Geodesic Spaces," Signal Processing, vol. 38, pp. 127-141, 1994.
    • (1994) Signal Processing , vol.38 , pp. 127-141
    • Beucher, S.1
  • 9
    • 0025751787 scopus 로고
    • Efficient Computation of Various Types of Skeletons
    • Feb
    • L. Vincent, "Efficient Computation of Various Types of Skeletons," Proc. SPIE Symp. Medical Imaging, pp. 297-311, Feb. 1991.
    • (1991) Proc. SPIE Symp. Medical Imaging , pp. 297-311
    • Vincent, L.1
  • 10
    • 0029264215 scopus 로고
    • A Skeletonization Algorithm by Maxima Tracking on Euclidean Distance Transform
    • F.Y. Shih and C.C. Pu, "A Skeletonization Algorithm by Maxima Tracking on Euclidean Distance Transform," Pattern Recognition, vol. 28, no. 3, pp. 331-341, 1995.
    • (1995) Pattern Recognition , vol.28 , Issue.3 , pp. 331-341
    • Shih, F.Y.1    Pu, C.C.2
  • 13
    • 0033165433 scopus 로고    scopus 로고
    • Computing Skeletons in Three Dimensions
    • G. Borgefors, I. Nystrom, and G.S.D. Baja, "Computing Skeletons in Three Dimensions," Pattern Recognition, vol. 32, no. 7, pp. 1225-1236, 1999.
    • (1999) Pattern Recognition , vol.32 , Issue.7 , pp. 1225-1236
    • Borgefors, G.1    Nystrom, I.2    Baja, G.S.D.3
  • 15
    • 0000241895 scopus 로고    scopus 로고
    • A Unified Linear-Time Algorithm for Computing Distance Maps
    • T. Hirata, "A Unified Linear-Time Algorithm for Computing Distance Maps," Information Processing Letters, vol. 58, pp. 129-133, 1996.
    • (1996) Information Processing Letters , vol.58 , pp. 129-133
    • Hirata, T.1
  • 16
  • 17
    • 0037325736 scopus 로고    scopus 로고
    • A Linear Time Algorithm for Computing the Euclidean Distance Transform in Arbitrary Dimensions
    • Feb
    • C.R. Maurer Jr., R. Qi, and V. Raghavan, "A Linear Time Algorithm for Computing the Euclidean Distance Transform in Arbitrary Dimensions," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 2, pp. 265-270, Feb. 2003.
    • (2003) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.25 , Issue.2 , pp. 265-270
    • Maurer Jr., C.R.1    Qi, R.2    Raghavan, V.3
  • 18
    • 84883815813 scopus 로고    scopus 로고
    • A Linear Time Algorithm for Computing the Euclidean Distance Transform in Arbitrary Dimensions
    • C.R. Maurer Jr., V. Raghavan, and R. Qi, "A Linear Time Algorithm for Computing the Euclidean Distance Transform in Arbitrary Dimensions," Information Processing in Medical Imaging, pp. 358-364, 2001.
    • (2001) Information Processing in Medical Imaging , pp. 358-364
    • Maurer Jr., C.R.1    Raghavan, V.2    Qi, R.3
  • 20
    • 0031233471 scopus 로고    scopus 로고
    • Computing and Simplifying 2D and 3D Continuous Skeletons
    • D. Attali and A. Montanvert, "Computing and Simplifying 2D and 3D Continuous Skeletons," Computer Vision and Image Understanding, vol. 67, no. 3, pp. 161-273, 1997.
    • (1997) Computer Vision and Image Understanding , vol.67 , Issue.3 , pp. 161-273
    • Attali, D.1    Montanvert, A.2
  • 24
    • 33947528909 scopus 로고    scopus 로고
    • A Linear-Time Algorithm for Euclidean Feature Transform Sets
    • W.H. Hesselink, "A Linear-Time Algorithm for Euclidean Feature Transform Sets," Information Processing Letters, vol. 102, pp. 181-186, 2007.
    • (2007) Information Processing Letters , vol.102 , pp. 181-186
    • Hesselink, W.H.1
  • 25
    • 0242460261 scopus 로고    scopus 로고
    • Dimensional Reverse Euclidean Distance Transformation and Euclidean Medial Axis Extraction in Optimal Time
    • D. Coeurjolly, "d-Dimensional Reverse Euclidean Distance Transformation and Euclidean Medial Axis Extraction in Optimal Time," Proc. Int'l Conf. Discrete Geometry for Computer Imagery, pp. 327-337, 2003.
    • (2003) Proc. Int'l Conf. Discrete Geometry for Computer Imagery , vol.500 , pp. 327-337
    • Coeurjolly, D.1
  • 26
    • 24344490385 scopus 로고    scopus 로고
    • Discrete Bisector Function and Euclidean Skeleton
    • E. Andres, G. Damiand, and P. Lienhardt, eds, pp, Springer
    • M. Couprie and R. Zrour, "Discrete Bisector Function and Euclidean Skeleton," Discrete Geometry for Computer Imagery, E. Andres, G. Damiand, and P. Lienhardt, eds., pp. 216-227, Springer, 2005.
    • (2005) Discrete Geometry for Computer Imagery , pp. 216-227
    • Couprie, M.1    Zrour, R.2
  • 27
    • 84867188624 scopus 로고    scopus 로고
    • Integral Medial Axis and the Distance between Closest Points
    • W. van der Kallen, "Integral Medial Axis and the Distance between Closest Points," Regular and Chaotic Dynamics, vol. 12, no. 6, pp. 734-743, 2007.
    • (2007) Regular and Chaotic Dynamics , vol.12 , Issue.6 , pp. 734-743
    • van der Kallen, W.1
  • 29
    • 56549092280 scopus 로고    scopus 로고
    • A. Telea and J.J. van Wijk, An Augmented Fast Marching Method for Computing Skeletons and Centerlines, Proc. Eurographics - IEEE TCVG Symp. Data Visualization, D. Ebert, P. Brunet, and I. Navazo, eds., pp. 251-ff, 2002.
    • A. Telea and J.J. van Wijk, "An Augmented Fast Marching Method for Computing Skeletons and Centerlines," Proc. Eurographics - IEEE TCVG Symp. Data Visualization, D. Ebert, P. Brunet, and I. Navazo, eds., pp. 251-ff, 2002.


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