메뉴 건너뛰기




Volumn 32, Issue 2, 2002, Pages 228-236

Efficient parallel algorithms for distance maps of 2-D binary images using an optical bus

Author keywords

Distance map; Euclidean distance transform (ETD); Image analysis; Parallel algorithm; Reconfigurable optical bus; Time complexity

Indexed keywords

DISTANCE MAPS;

EID: 0036510690     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCA.2002.1021110     Document Type: Article
Times cited : (11)

References (28)
  • 3
    • 0029307841 scopus 로고
    • An efficient algorithm for complete Euclidean distance transform on mesh-connected SIMD
    • (1995) Parallel Comput. , vol.21 , pp. 841-852
  • 8
    • 0033903632 scopus 로고    scopus 로고
    • Efficient deterministic and probabilistic simulations of PRAMs on linear arrays with reconfigurable pipelined bus systems
    • Feb.
    • (2000) J. Supercomput. , vol.15 , pp. 163-181
    • Li, K.1    Pan, Y.2    Zheng, S.-Q.3
  • 9
    • 0001509853 scopus 로고    scopus 로고
    • Pipelined time-division multiplexing optical bus with conditional delays
    • Sept.
    • (1997) Opt. Eng. , vol.36 , pp. 2417-2424
  • 14
    • 85047694054 scopus 로고
    • O(1) time quadtree algorithm and its application for image geometric properties on a mesh-connected computer
    • Dec.
    • (1995) IEEE Trans. Syst., Man Cybern. , vol.25 , pp. 1640-1648


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