M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Distinctive Image Features from Scale-Invariant Keypoints
International Journal of Computer Vision
An efficient parts-based near-duplicate and sub-image retrieval system
Proceedings of the 12th annual ACM international conference on Multimedia
Image retrieval using sub-image matching in photos using MPEG-7 descriptors
AIRS'05 Proceedings of the Second Asia conference on Asia Information Retrieval Technology
Proximity-Based order-respecting intersection for searching in image databases
AMR'10 Proceedings of the 8th international conference on Adaptive Multimedia Retrieval: context, exploration, and fusion
Geometric consistency checks for kNN based image classification relying on local features
Proceedings of the Fourth International Conference on SImilarity Search and APplications
| Hi-index | 0.00 |
The complexity of search in current business intelligence systems, academic research, or even the home audiovisual databases grows up rapidly. Users require searching by the content of their data. For example, the user sees a cathedral while watching a movie and by taking a snapshot, his or her private collection of holiday photos can be searched for images containing that cathedral, as demonstrated in Figure 1. In practice, it is not sufficient to store data and search in it by exact match but rather by means of similarity, i.e. retrieving data items similar to a query item. Similarity searching is especially requested in multimedia databases, digital right management systems, computer aided diagnosis, but also in natural sciences and psychology. In these fields, theoretical primal background for querying by similarity is already defined.