SCOPUS 정보 검색 플랫폼

Volumn 15, Issue 4, 1982, Pages 287-298

Split-and-link algorithms for image segmentation

Author keywords

Linking; Pyramids; Quadtrees; Segmentation; Split and merge

Indexed keywords

LINKING.; PYRAMIDS; QUADTREES+ SPLIT AND MERGE; SEGMENTATION;

IMAGE PROCESSING;

EID: 0020336348 PISSN: 00313203 EISSN: None Source Type: Journal
DOI: 10.1016/0031-3203(82)90031-0 Document Type: Article

Times cited : (23)

References (7)

1
- 0016943204
- Picture segmentation by a tree traversal algorithm
- (1976) J. Ass. comput. Mach. , vol.23 , pp. 368-388
- Horowitz¹ Pavlidis²

2
- 0018478429
- Segmentation by texture using a co-occurrence matrix and a split-and-merge algorithm
- (1979) Comput. Graphics Image Process. , vol.10 , pp. 172-182
- Chen¹ Pavlidis²

4
- 84910430797
- Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD
- (1980) Multi-resolution pixel linking for image smoothing and segmentation, TR-977
- Silberberg¹ Peleg² Rosenfeld³

5
- 84910426539
- Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD
- (1980) Iterative image smoothing and segmentation by weighted pyramid linking, TR-989
- Narayanan¹ Peleg² Rosenfeld³ Silberberg⁴

6
- 84910424975
- Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD
- (1981) Multiband pyramid linking, TR-1025
- Hong¹ Rosenfeld²

7
- 84910399996
- Computer Vision Laboratory, Computer Science Center, University of Maryland, College Park, MD
- (1981) Image segmentation by texture using pyramid node linking, TR-1008
- Pietikäinen¹ Rosenfeld²

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