메뉴 건너뛰기




Volumn , Issue , 2001, Pages 647-651

Maintenance of connected components in quadtree-based image representation

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

EID: 0012689311     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITCC.2001.918870     Document Type: Conference Paper
Times cited : (2)

References (12)
  • 3
    • 0038425797 scopus 로고    scopus 로고
    • Dynamic connectivity in digital images
    • E. D. Dynamic connectivity in digital images. Information Processing Letters, 62:121-126, 1997.
    • (1997) Information Processing Letters , vol.62 , pp. 121-126
    • E, D.1
  • 4
    • 0026844063 scopus 로고
    • A general approach to connected- components labeling for arbitrary image representations
    • April
    • S. H. Dillencourt M. B. and T. M. A general approach to connected- components labeling for arbitrary image representations. Journal of ACM, 39(2):253-280, April 1992.
    • (1992) Journal of ACM , vol.39 , Issue.2 , pp. 253-280
    • S, H.1    Dillencourt, M.B.2    T, M.3
  • 6
    • 0019173549 scopus 로고
    • Region representation: Quadtrees from binary arrays
    • May
    • S. H. Region representation: Quadtrees from binary arrays. Computer Vision, Graphics and Image Processing, 13(1):88-93, May 1980.
    • (1980) Computer Vision, Graphics and Image Processing , vol.13 , Issue.1 , pp. 88-93
    • S, H.1
  • 7
    • 0019587751 scopus 로고
    • Connected component labeling using quadtrees
    • March
    • S. H. Connected component labeling using quadtrees. Journal of ACM, 23(3):487-501, March 1981.
    • (1981) Journal of ACM , vol.23 , Issue.3 , pp. 487-501
    • S, H.1
  • 8
    • 0019896553 scopus 로고
    • Neighbor finding techniques for images represented by quadtrees
    • S. H. Neighbor finding techniques for images represented by quadtrees. Computer Vision, Graphics and Image Processing, 18:37-57, 1982.
    • (1982) Computer Vision, Graphics and Image Processing , vol.18 , pp. 37-57
    • S, H.1
  • 9
    • 0021644214 scopus 로고
    • The quadtree and related hierarchical data structures
    • June
    • S. H. The quadtree and related hierarchical data structures. Computing Surveys, 16(2):187-260, June 1984.
    • (1984) Computing Surveys , vol.16 , Issue.2 , pp. 187-260
    • S, H.1
  • 11
    • 0020125052 scopus 로고
    • A new conncted components algorithm for virtual memory computers
    • Z. O. L. R. and S. L. A new conncted components algorithm for virtual memory computers. Computer Vision, Graphics and Image Processing, 22:287-300, 1983.
    • (1983) Computer Vision, Graphics and Image Processing , vol.22 , pp. 287-300
    • Z, O.1    L, R.2    S, L.3
  • 12
    • 84976826635 scopus 로고
    • An on-line edge deletion problem
    • January
    • E. S. and S. Y. An on-line edge deletion problem. Journal of ACM, 23(1):1-4, January 1981.
    • (1981) Journal of ACM , vol.23 , Issue.1 , pp. 1-4
    • E, S.1    S, Y.2


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