메뉴 건너뛰기




Volumn 3066, Issue , 2004, Pages 580-585

K-means indiscernibility relation over pixels

Author keywords

Approximation; Classification; Digital image processing; K means clustering; Rough sets

Indexed keywords

APPROXIMATION THEORY; CERAMIC MATERIALS; DECISION MAKING; PROBLEM SOLVING; SET THEORY; APPROXIMATION ALGORITHMS; CLASSIFICATION (OF INFORMATION); EQUIVALENCE CLASSES; IMAGE PROCESSING; PIXELS;

EID: 9444251754     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-25929-9_71     Document Type: Conference Paper
Times cited : (15)

References (6)
  • 4
    • 0000672424 scopus 로고
    • Fast learning in networks of locally-tuned processing units
    • J. Moody, C.J. Darken, Fast learning in networks of locally-tuned processing units, Neural Computation 1(2), 1989, 281-294.
    • (1989) Neural Computation , vol.1 , Issue.2 , pp. 281-294
    • Moody, J.1    Darken, C.J.2


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