Content-Based Copy Retrieval Using Distortion-Based Probabilistic Similarity Search
Top Cited Papers
- 22 January 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 9 (2) , 293-306
- https://doi.org/10.1109/tmm.2006.886278
Abstract
Content-based copy retrieval (CBCR) aims at retrieving in a database all the modified versions or the previous versions of a given candidate object. In this paper, we present a copy-retrieval scheme based on local features that can deal with very large databases both in terms of quality and speed. We first propose a new approximate similarity search technique in which the probabilistic selection of the feature space regions is not based on the distribution in the database but on the distribution of the features distortion. Since our CBCR framework is based on local features, the approximation can be strong and reduce drastically the amount of data to explore. Furthermore, we show how the discrimination of the global retrieval can be enhanced during its post-processing step, by considering only the geometrically consistent matches. This framework is applied to robust video copy retrieval and extensive experiments are presented to study the interactions between the approximate search and the retrieval efficiency. Largest used database contains more than 1 billion local features corresponding to 30000 h of videoKeywords
This publication has 39 references indexed in Scilit:
- Robust Object Recognition in Images and the Related Database ProblemsMultimedia Tools and Applications, 2004
- Independent quantization: an index compression technique for high-dimensional data spacesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- PAC nearest neighbor queries: Approximate and controlled search in high-dimensional and metric spacesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Clustering for approximate similarity search in high-dimensional spacesIEEE Transactions on Knowledge and Data Engineering, 2002
- Density-based indexing for approximate nearest-neighbor queriesPublished by Association for Computing Machinery (ACM) ,1999
- Approximate similarity retrieval with M-treesThe VLDB Journal, 1998
- The pyramid-techniqueACM SIGMOD Record, 1998
- Approximate nearest neighborsPublished by Association for Computing Machinery (ACM) ,1998
- FastMapPublished by Association for Computing Machinery (ACM) ,1995
- The R*-tree: an efficient and robust access method for points and rectanglesPublished by Association for Computing Machinery (ACM) ,1990