메뉴 건너뛰기




Volumn 12, Issue 1-2, 1998, Pages 69-83

Parallel mesh algorithms for grid graph shortest paths with application to separation of touching chromosomes

Author keywords

Chromosome image segmentation; Feature extraction; Grid graph; Mesh connected computer; Parallel algorithm; Shortest path

Indexed keywords

CHROMOSOMES; COMPUTATIONAL COMPLEXITY; COMPUTER AIDED ANALYSIS; COMPUTER GRAPHICS; FEATURE EXTRACTION; IMAGE SEGMENTATION;

EID: 0031701319     PISSN: 09208542     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1007929410673     Document Type: Article
Times cited : (8)

References (16)
  • 1
    • 0043036475 scopus 로고
    • Geometric Arithmetic Parallel Processor: Architecture and implementation
    • V. K. Prasanna, editor, Academic Press, San Diego, CA
    • E. L. Cloud. Geometric Arithmetic Parallel Processor: Architecture and implementation. In V. K. Prasanna, editor, Parallel Architectures and Algorithms for Image Understanding. Academic Press, San Diego, CA, 1991.
    • (1991) Parallel Architectures and Algorithms for Image Understanding
    • Cloud, E.L.1
  • 2
    • 34147120474 scopus 로고
    • A note on two problems in connection with graphs
    • E. W. Dijkstra. A note on two problems in connection with graphs. Numerische Mathematik, 1:269-271, 1959.
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 5
    • 0024937048 scopus 로고
    • Intelligent splitting in the chromosome domain
    • L. Ji. Intelligent splitting in the chromosome domain. Pattern Recognition, 22:519-532, 1989.
    • (1989) Pattern Recognition , vol.22 , pp. 519-532
    • Ji, L.1
  • 6
    • 0028114701 scopus 로고
    • Fully automatic chromosome segmentation
    • November
    • L. Ji. Fully automatic chromosome segmentation. Cytometry, 17(3):196-208, November 1994.
    • (1994) Cytometry , vol.17 , Issue.3 , pp. 196-208
    • Ji, L.1
  • 7
    • 84976789814 scopus 로고
    • Efficient algorithms for shortest paths in sparse networks
    • March
    • D. B. Johnson. Efficient algorithms for shortest paths in sparse networks. Journal of the ACM, 24(1):1-13, March 1977.
    • (1977) Journal of the ACM , vol.24 , Issue.1 , pp. 1-13
    • Johnson, D.B.1
  • 9
    • 0003630039 scopus 로고
    • MasPar Computer Corporation, 749 North Mary Avenue, Sunnyvale, CA
    • MasPar Computer Corporation, 749 North Mary Avenue, Sunnyvale, CA. MP-1 Family Data-Parallel Computers, 1990.
    • (1990) MP-1 Family Data-Parallel Computers
  • 14
    • 0029405635 scopus 로고
    • Parallel path planning on the distributed array processor
    • C. Shu and H. Buxton. Parallel path planning on the distributed array processor. Parallel Computing, 21:1749-1767, 1995.
    • (1995) Parallel Computing , vol.21 , pp. 1749-1767
    • Shu, C.1    Buxton, H.2
  • 15
    • 0005040968 scopus 로고
    • An evolving SIMD architecture approach for a changing image processing environment
    • October
    • M. S. Tomassi and R. D. Jackson. An evolving SIMD architecture approach for a changing image processing environment. DSP & Multimedia Technology, pages 1-7, October 1994.
    • (1994) DSP & Multimedia Technology , pp. 1-7
    • Tomassi, M.S.1    Jackson, R.D.2
  • 16
    • 0028424325 scopus 로고
    • Segmentation of merged characters by neural networks and shortest path
    • J. Wang and J. Jean. Segmentation of merged characters by neural networks and shortest path. Pattern Recognition, 27(5):649-658, 1994.
    • (1994) Pattern Recognition , vol.27 , Issue.5 , pp. 649-658
    • Wang, J.1    Jean, J.2


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