메뉴 건너뛰기




Volumn 21, Issue 10, 2000, Pages 899-906

Fast mapping algorithm for histogram to binary set conversion

Author keywords

Binary color set; Computation complexity; Histogram based image retrieval

Indexed keywords

ALGORITHMS; COLOR IMAGE PROCESSING; COMPUTATIONAL COMPLEXITY; INFORMATION RETRIEVAL SYSTEMS; SIGNAL FILTERING AND PREDICTION;

EID: 0034259577     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(00)00056-8     Document Type: Article
Times cited : (7)

References (9)
  • 1
    • 0029375609 scopus 로고
    • Query by image and video content: The QBIC system
    • Flickner M.et al. Query by image and video content: the QBIC system. IEEE Comput. 28(9):1995;23-32.
    • (1995) IEEE Comput. , vol.28 , Issue.9 , pp. 23-32
    • Flickner, M.1
  • 2
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • Boston, MA
    • Guttman, A., 1984. R-trees: a dynamic index structure for spatial searching. In: Proc. ACM SIGMOD, Boston, MA.
    • (1984) In: Proc. ACM SIGMOD
    • Guttman, A.1
  • 7
    • 0031189791 scopus 로고    scopus 로고
    • Visually searching the web for content
    • Smith J.R., Chang S.-F. Visually searching the web for content. IEEE Multimedia. 43(3):1997;12-20.
    • (1997) IEEE Multimedia , vol.43 , Issue.3 , pp. 12-20
    • Smith, J.R.1    Chang, S.-F.2


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