Tomas Homola
Pavel Zezula
ABSTRACT
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.
- }}O. Chum, M. Perdoch, and J. Matas. Geometric min-hashing: Finding a (thick) needle in a haystack. CVPR, pages 17--24, 2009.Google Scholar
Cross Ref
- }}P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In VLDB, pages 426--435. Morgan Kaufmann, 1997. Google ScholarDigital Library
- }}T. Homola, V. Dohnal, and P. Zezula. Proximity-based order-respecting intersection for searching in image databases. In Proceedings of the 8th International Workshop on Adaptive Multimedia Retrieval (AMR 2010), 2010. Google ScholarDigital Library
- }}Y. Ke, R. Sukthankar, L. Huston, Y. Ke, and R. Sukthankar. Efficient near-duplicate detection and sub-image retrieval. In In ACM Multimedia, pages 869--876, 2004. Google ScholarDigital Library
- }}D. G. Lowe. Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vision, 60(2):91--110, 2004. Google ScholarDigital Library
- }}M.-S. Ryu, S.-J. Park, and C. S. Won. Image retrieval using sub-image matching in photos using mpeg-7 descriptors. In AIRS, pages 366--373, 2005. Google ScholarDigital Library
Index Terms
- Sub-image searching through intersection of local descriptors
Recommendations
Fast k-Nearest Neighbor Searching in Static Objects
The k-nearest neighbor searching is a classical problem that has been seriously studied, due to its many important applications. The paper proposes an efficient algorithm to search the k-nearest neighbors for static objects. Since locations of static ...
Comments