Matching Measures in the Context of CBIR: A Comparative Study in Terms of Effectiveness and Efficiency
| Autor: | Bachir Boucheham, Mawloud Mosbah |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Matching (statistics)
Similarity (geometry) Computer science Search engine indexing 020206 networking & telecommunications Context (language use) 02 engineering and technology computer.software_genre Euclidean distance Histogram Component (UML) 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Data mining Divergence (statistics) computer |
| Zdroj: | Advances in Intelligent Systems and Computing ISBN: 9783319565378 WorldCIST (2) |
| DOI: | 10.1007/978-3-319-56538-5_26 |
| Popis: | In this paper, we compare between many matching measures (distances, quasi-distances, similarities and divergences), in the context of CBIR, in terms of effectiveness and efficiency. The major effort put up to now, within the area of CBIR, is usually made into the indexing stage. This work then highlights the importance of the matching process, as an important component within the CBIR system, through making under experimentation a large number of matching measures. The experiments, conducted on the Wang database (COREL1 K) and using two signatures: histograms and color moments, reveal that Euclidean distance, usually used in the context of CBIR, gives less performances comparing to the Ruzicka similarity, Manhattan distance and Neyman-X 2 . |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|