메뉴 건너뛰기




Volumn 1, Issue , 2003, Pages 370-377

Applying the information bottleneck principle to unsupervised clustering of discrete and continuous image representations

Author keywords

[No Author keywords available]

Indexed keywords

CONTENT BASED RETRIEVAL; DATABASE SYSTEMS; INFORMATION THEORY; MAXIMUM PRINCIPLE; PROBABILITY DISTRIBUTIONS;

EID: 0344120262     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/iccv.2003.1238368     Document Type: Conference Paper
Times cited : (77)

References (15)
  • 3
    • 0033872355 scopus 로고    scopus 로고
    • Hierarchical browsing and search of large image databases
    • March
    • J. Chen, C.A. Bouman, and J.C. Dalton. Hierarchical browsing and search of large image databases. IEEE transactions on Image Processing, 9(3):442-455, March 2000.
    • (2000) IEEE Transactions on Image Processing , vol.9 , Issue.3 , pp. 442-455
    • Chen, J.1    Bouman, C.A.2    Dalton, J.C.3
  • 6
    • 0344077233 scopus 로고    scopus 로고
    • Unsupervised image clustering using the information bottleneck method
    • J. Goldberger, H. Greenspan, and S. Gordon. Unsupervised image clustering using the information bottleneck method. In DAGM, 2002.
    • (2002) DAGM
    • Goldberger, J.1    Greenspan, H.2    Gordon, S.3


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