메뉴 건너뛰기




Volumn , Issue , 2011, Pages 9-16

Ptolemaic indexing of the signature quadratic form distance

Author keywords

[No Author keywords available]

Indexed keywords

CONTENT REPRESENTATION; IMAGE DATABASE; MULTIMEDIA DATA; PIVOT-TABLES; QUADRATIC FORM; RETRIEVAL QUALITY; SEARCH EFFICIENCY; SEARCH METHOD; SIMILARITY MEASURE;

EID: 79960961561     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1995412.1995417     Document Type: Conference Paper
Times cited : (25)

References (28)
  • 10
    • 40549119527 scopus 로고    scopus 로고
    • Features for image retrieval: An experimental comparison
    • T. Deselaers, D. Keysers, and H. Ney. Features for image retrieval: an experimental comparison. Information Retrieval, 11(2):77-107, 2008.
    • (2008) Information Retrieval , vol.11 , Issue.2 , pp. 77-107
    • Deselaers, T.1    Keysers, D.2    Ney, H.3
  • 14
    • 70349767064 scopus 로고    scopus 로고
    • The basic principles of metric indexing
    • C. A. C. Coello, S. Dehuri, and S. Ghosh, editors, of Studies in Computational Intelligence, Springer
    • M. L. Hetland. The basic principles of metric indexing. In C. A. C. Coello, S. Dehuri, and S. Ghosh, editors, Swarm Intelligence for Multi-objective Problems in Data Mining, volume 242 of Studies in Computational Intelligence. Springer, 2009.
    • (2009) Swarm Intelligence for Multi-objective Problems in Data Mining , vol.242
    • Hetland, M.L.1
  • 18
    • 2342650829 scopus 로고    scopus 로고
    • The analysis and applications of adaptive-binning color histograms
    • W. K. Leow and R. Li. The analysis and applications of adaptive-binning color histograms. Computer Vision and Image Understanding, 94(1-3):67-91, 2004.
    • (2004) Computer Vision and Image Understanding , vol.94 , Issue.1-3 , pp. 67-91
    • Leow, W.K.1    Li, R.2
  • 20
    • 0003159276 scopus 로고
    • A new version of the nearest-neighbour approximating and eliminating search algorithm (aesa) with linear preprocessing time and memory requirements
    • M. L. Mico, J. Oncina, and E. Vidal. A new version of the nearest-neighbour approximating and eliminating search algorithm (aesa) with linear preprocessing time and memory requirements. Pattern Recogn. Lett., 15(1):9-17, 1994.
    • (1994) Pattern Recogn. Lett. , vol.15 , Issue.1 , pp. 9-17
    • Mico, M.L.1    Oncina, J.2    Vidal, E.3
  • 22
    • 70449824308 scopus 로고    scopus 로고
    • Analyzing metric space indexes: What for?
    • G. Navarro. Analyzing metric space indexes: What for? In IEEE SISAP 2009, pages 3-10, 2009.
    • (2009) IEEE SISAP 2009 , pp. 3-10
    • Navarro, G.1
  • 25
    • 58549104890 scopus 로고    scopus 로고
    • Counting distance permutations
    • March
    • M. Skala. Counting distance permutations. J. of Discrete Algorithms, 7:49-61, March 2009.
    • (2009) J. of Discrete Algorithms , vol.7 , pp. 49-61
    • Skala, M.1
  • 27
    • 0003046095 scopus 로고
    • New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (AESA)
    • January
    • E. Vidal. New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (AESA). Pattern Recognition Letters, 15(1):1-7, January 1994.
    • (1994) Pattern Recognition Letters , vol.15 , Issue.1 , pp. 1-7
    • Vidal, E.1


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