메뉴 건너뛰기




Volumn 17, Issue 1, 1996, Pages 11-17

A new definition of neighborhood of a point in multi-dimensional space

Author keywords

Classification; Clustering; Image processing; Neighborhood; Pattern recognition

Indexed keywords

CALCULATIONS; COMPUTATIONAL GEOMETRY; CONSTRAINT THEORY; IMAGE PROCESSING; ITERATIVE METHODS;

EID: 0029669422     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-8655(95)00093-3     Document Type: Article
Times cited : (101)

References (8)
  • 1
    • 0024875178 scopus 로고
    • Extraction of early perceptual structures in dot patterns: Integrating regions, boundary and component gestalt
    • Ahuja, N. and M. Tuceryan (1989). Extraction of early perceptual structures in dot patterns: Integrating regions, boundary and component gestalt. Computer Vision, Graphics, and Image Processing 48, 304-356.
    • (1989) Computer Vision, Graphics, and Image Processing , vol.48 , pp. 304-356
    • Ahuja, N.1    Tuceryan, M.2
  • 2
    • 0028494945 scopus 로고
    • How to choose a representative subset from a set of data in multi-dimensional space
    • Chaudhuri, B.B. (1994). How to choose a representative subset from a set of data in multi-dimensional space. Pattern Recognition Lett. 15, 893-899.
    • (1994) Pattern Recognition Lett. , vol.15 , pp. 893-899
    • Chaudhuri, B.B.1
  • 4
    • 0026376348 scopus 로고
    • An optimum convex hull algorithm and new results on cutting
    • Chazelle, B. (1991). An optimum convex hull algorithm and new results on cutting. Proc. Foundations of Computer Science 32, 29-38.
    • (1991) Proc. Foundations of Computer Science , vol.32 , pp. 29-38
    • Chazelle, B.1
  • 5
    • 0015680655 scopus 로고
    • Clustering using a similarity measure based on shared near neighbors
    • Jarvis, R.A. and E.A. Patrick (1973). Clustering using a similarity measure based on shared near neighbors, IEEE Trans. Comput. 22 (11), 1025-1034.
    • (1973) IEEE Trans. Comput. , vol.22 , Issue.11 , pp. 1025-1034
    • Jarvis, R.A.1    Patrick, E.A.2
  • 6
    • 0020845843 scopus 로고
    • Linear programming in linear time when the dimension is fixed
    • Megiddo, N. (1984). Linear programming in linear time when the dimension is fixed. J. ACM 31, 114-127.
    • (1984) J. ACM , vol.31 , pp. 114-127
    • Megiddo, N.1
  • 7
    • 0016578224 scopus 로고
    • An alternative definition for "neighborhood of a point"
    • O'Callaghan, J.F. (1975). An alternative definition for "neighborhood of a point". IEEE Trans. Comput. 24, 1121-1125.
    • (1975) IEEE Trans. Comput. , vol.24 , pp. 1121-1125
    • O'Callaghan, J.F.1
  • 8
    • 84999827683 scopus 로고
    • On the shape of a set of points
    • G.T. Toussaint, Ed., North-Holland, Amsterdam
    • Radke, J.D. (1988). On the shape of a set of points. In: G.T. Toussaint, Ed., Computational Morphology. North-Holland, Amsterdam, 105-136.
    • (1988) Computational Morphology , pp. 105-136
    • Radke, J.D.1


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