Abstract
In recognition that in modern applications billions of images are stored into distributed databases in different logical or physical locations, we propose a similarity search strategy over the cloud based on the dimensions value cardinalities of image descriptors. Our strategy has low preprocessing requirements by dividing the computational cost of the preprocessing steps into several nodes over the cloud and locating the descriptors with similar dimensions value cardinalities logically close. New images are inserted into the distributed databases over the cloud efficiently, by supporting dynamical update in real-time. The proposed insertion algorithm has low computational complexity, depending exclusively on the dimensionality of descriptors and a small subset of descriptors with similar dimensions value cardinalities. Finally, an efficient query processing algorithm is proposed, where the dimensions of image descriptors are prioritized in the searching strategy, assuming that dimensions of high value cardinalities have more discriminative power than the dimensions of low ones. The computation effort of the query processing algorithm is divided into several nodes over the cloud infrastructure. In our experiments with seven publicly available datasets of image descriptors, we show that the proposed similarity search strategy outperforms competitive methods of single node, parallel and cloud-based architectures, in terms of preprocessing cost, search time and accuracy.
Supplemental Material
Available for Download
Supplemental movie, appendix, image and software files for, A reward-and-punishment-based approach for concept detection using adaptive ontology rules
- M. Aly, M. Munich, and P. Perona. 2011. Distributed kd-trees for retrieval from very large image collections. In Proceedings of the British Machine Vision Conference (BMVC'11).Google Scholar
- A. Babenko and V. Lempitsky. 2012. The inverted multi-index. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 3069--3076. Google Scholar
Digital Library
- M. Batko, D. Novak, F. Falchi, and P. Zezula. 2008. Scalability comparison of peer-to-peer similarity search structures. Future Generation Computer Syst. 24, 8, 834--848. Google Scholar
Digital Library
- H. Bay, T. Tuytelaars, and L. V. Gool. 2008. SURF: Speeded Up Robust Features. Comput. Vision Image Understanding 110, 3, 346--359. Google Scholar
Digital Library
- T. Bozkaya and M. Ozsoyoglu. 1999. Indexing large metric spaces for similarity search queries. ACM Trans. Database Syst. 24, 3, 361--404. Google Scholar
Digital Library
- B. Carbunar, R. Potharaju, M. Pearce, V. Vasudevan, and M. Needham. 2013. A framework for network aware caching for video on demand systems. ACM Trans. Multimedia Comput. Commun. Appl. 9, 4. Google Scholar
Digital Library
- S. A. Chatzichristos and Y. S. Boutalis. 2008. CEDD: Color and edge directivity descriptor: A compact descriptor for image indexing and retrieval. In Proceedings of the International Conference on Computer Vision Systems. Lecture Notes in Computer Science, vol. 5008, 312--322. Google Scholar
Digital Library
- H. Cheng, K. A. Hua, K. Vu, and D. Liu. 2008. Semi-supervised dimensionality reduction in image feature space. In Proceedings of the ACM Symposium on Applied Computing. 1207--1211. Google Scholar
Digital Library
- M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni. 2004. Locality-sensitive hashing scheme based on p-stable distributions. In Proceedings of the Symposium on Computational Geometry. 253--262. Google Scholar
Digital Library
- O. De Rooij and M. Worring. 2012. Efficient targeted search using a focus and context video browser. ACM Trans. Multimedia Comput. Commun. Appl. 8, 4. Google Scholar
Digital Library
- A. W.-C. Fu, P. M.-S. Chan, Y.-L. Cheung, and Y. S. Moon. 2000. Dynamic vp-tree indexing for n-nearest neighbor search given pair-wise distances. Int. J. VLDB 9, 2, 154--173. Google Scholar
Digital Library
- A. Gionis, P. Indyk, and Motwani R. 1999. Similarity search in high dimensions via hashing. In Proceedings of the International Conference on Very Large Data Bases. 518--529. Google Scholar
Digital Library
- Y. Gong and S. Lazebnik. 2011. Iterative quantization: a Procrustean approach to learning binary codes. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 817--824. Google Scholar
Digital Library
- J. He, R. Radhakrishnan, S.F Chang, and Bauer C. 2011. Compact hashing with joint optimization of search accuracy and time. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 753--760. Google Scholar
Digital Library
- J. P. Heo, Y. Lee, J. He, S. Chang, and S. Yoon. 2012. Spherical hashing. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. IEEE, 2957--2964. Google Scholar
Digital Library
- K. A. Hua. 2013. Online video delivery: Past, present, and future. ACM Trans. on Multimedia Computing, Communications, and Applications 9, 1s (2013). Google Scholar
Digital Library
- Z. Huang, H. T. Shen, J. Liu, and X. Zhou. 2011. Effective data co-reduction for multimedia similarity search. In Proceedings of ACM SIGMOD. ACM, 1021--1032. Google Scholar
Digital Library
- K. Jarrah and L. Guan. 2008. Content-based image retrieval via distributed databases. In Proceedings of the International Conference on Image and Video Retrieval (CIVR'08). 389--394. Google Scholar
Digital Library
- H. Jegou, M. Douze, and C. Schmid. 2011. Product quantization for nearest neighbor search. IEEE Trans. Pattern Anal. Mach. Intell. 33, 1, 117--128. Google Scholar
Digital Library
- Y. Jia, J. Wang, G. Zeng, H. Zha, and X. S. Hua. 2010. Optimizing kd-trees for scalable visual descriptor indexing. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 3392--3399.Google Scholar
- A. Joly and O. Buisson. 2011. Random maximum margin hashing. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. IEEE, 873--880. Google Scholar
Digital Library
- Peter Knees and Markus Schedl. 2013. A survey of music similarity and recommendation from music context data. ACM Trans. Multimedia Comput. Commun. Appl. 10, 1, Article 2. Google Scholar
Digital Library
- L. Liang, X. Wang, B. Yang, and J. Peng. 2010. Image dimensionality reduction based on the HSV feature. In Proceedings of the 9th IEEE International Conference on Cognitive Informatics. 127--131.Google Scholar
- Xianglong Liu, Yadong Mu, Bo Lang, and Shih-Fu Chang. 2014. Mixed image-keyword query adaptive hashing over multilabel images. ACM Trans. Multimedia Comput. Commun. Appl. 10, 2, Article 22, 21 pages. Google Scholar
Digital Library
- D. Lowe. 2004. Distinctive image features from scale-invariant keypoints. Int. J. Computer Vision 60, 2, 91--110. Google Scholar
Digital Library
- M. Muja and D. G. Lowe. 2009. Fast approximate nearest neighbors with automatic algorithm configuration. In Proceedings of the International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications (VISAPP'09). 331--340.Google Scholar
- M. Muja and D. G. Lowe. 2014. Scalable nearest neighbor algorithms for high dimensional data. IEEE Trans. Pattern Anal. Mach. Intell. 36, 11, 2227--2240.Google Scholar
- M. Norouzi and D. J. Fleet. 2011. Minimal loss hashing for compact binary codes. In Proceedings of the International Conference on Machine Learning (ICML'11).Google Scholar
- M. Norouzi and D. J. Fleet. 2013. Cartesian K-Means. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. IEEE, 3017--3024. Google Scholar
Digital Library
- M. Norouzi, A. Punjani, and D. J. Fleet. 2014. Fast Exact Search in Hamming Space with Multi-Index Hashing. IEEE Trans. Pattern Anal. Mach. Intell. 36, 6, 1107--1119. Google Scholar
Digital Library
- D. Novak, M. Batko, and P. Zezula. 2008. Web-scale system for image similarity search: When the dreams are coming true. In Proceedings of the 6th International Workshop on Content-Based Multimedia Indexing. IEEE.Google Scholar
- D. Novak, M. Batko, and P. Zezula. 2012. Large-scale similarity data management with distributed Metric Index. Inf. Process. Management 48, 855--872. Google Scholar
Digital Library
- A. Oliva and A. Torralba. 2001. Modeling the shape of the scene: A holistic representation of the spatial envelope. Int. J. Comput. Vision 42, 3, 145--175. Google Scholar
Digital Library
- M. Raginsky and S. Lazebnik. 2009. Locality-sensitive binary codes from shift-invariant kernels. In Proceedings of NIPS'09. 1509--1517.Google Scholar
- S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Scenker. 2001. A scalable content-addressable network. In Proceedings of the ACM SIGCOMM Data Communications Festival, Vol. 31. 161--172. Google Scholar
Digital Library
- C. Silpa-Anan and R. Hartley. 2008. Optimised KD-trees for fast image descriptor matching. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 1--8.Google Scholar
- R. O. Stehling, M. A. Nascimento, and A. X. Falcao. 2002. A compact and efficient image retrieval approach based on border/interior pixel classification. In Proceedings of the International Conference on Information and Knowledge Management. 102--109. Google Scholar
Digital Library
- E. Tiakas, D. Rafailidis, A. Dimou, and P. Daras. 2013. MSIDX: Multi-Sort Indexing for Efficient Content-based Image Search and Retrieval. IEEE Trans. Multimedia 15, 6, 1415--1430. Google Scholar
Digital Library
- Y. Tian, J. Srivastava, T. Huang, and N. Contractor. 2010. Social Multimedia Computing 43, 8, 27--37. Google Scholar
Digital Library
- R. H. Van Leuken and R. C. Veltkamp. 2011. Selecting vantage objects for similarity indexing. ACM Trans. Multimedia Comput. Commun. Appl. 10, 7, 3 (2011). Google Scholar
Digital Library
- A. Vlachou, C. Doulkeridis, and Y. Kotidis. 2012. Metric-Based Similarity Search in Unstructured Peer-to-Peer Systems. Springer.Google Scholar
- J. Wang, J. Wang, G. Zeng, R. Gan, S. Li, and B. Guo. 2013. Fast neighborhood graph search using Cartesian concatenation. In Proceedings of the IEEE International Conference on Computer Vision. 2128--2135. Google Scholar
Digital Library
- J. Wang, J. Wang, G. Zeng, Z. Tu, R. Gan, and S. Li. 2012. Scalable k-NN graph construction for visual descriptors. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 1106--1113. Google Scholar
Digital Library
- J. Wang, N. Wang, Y. Jia, J. Li, G. Zeng, H. Zha, and X. S. Hua. 2014. Trinary-projection trees for approximate nearest neighbor search. IEEE Trans. Pattern Anal. Mach. Intell. 36, 2, 388--403. Google Scholar
Digital Library
- J. Wang, S. Wu, H. Gao, J. Li, and B. C. Ooi. 2010. Indexing multi-dimensional data in a cloud system. In Proceedings of the ACM SIGMOD International Conference on Management of Data. 591--602. Google Scholar
Digital Library
- Z. Wang and H. Binbin. 2011. Locality perserving projections algorithm for hyperspectral image dimensionality reduction. In Proceedings of the 19th International Conference on Geoinformatics. 1--4.Google Scholar
- Y. Weiss, A. Torralba, and R. Fergus. 2008. Spectral hashing. In Proceedings of NIPS'08. 1753--1760.Google Scholar
- Lei Zhang and Yong Rui. 2013. Image Search-from Thousands to Billions in 20 Years. ACM Trans. Multimedia Comput. Commun. Appl. 9, 1s, Article 36. Google Scholar
Digital Library
- M. Zhu, D. Shen, Y. Kou, T. Nie, and G. Yu. 2012. An adaptive distributed index for similarity queries in metric spaces. In Web-Age Information Retrieval. Lecture Notes in Computer Science, vol. 7418, 222--227.Google Scholar
Cross Ref
- W. Zhu, C. Luo, J. Wang, and S. Li. 2011. Multimedia cloud computing. IEEE Signal Process. Mag. 28, 3, 59--69.Google Scholar
Cross Ref
Index Terms
Similarity Search over the Cloud Based on Image Descriptors' Dimensions Value Cardinalities
Recommendations
Parallel similarity search based on the dimensions value cardinalities of image descriptor vectors
SAC '15: Proceedings of the 30th Annual ACM Symposium on Applied ComputingIn this paper, we propose a parallel similarity search strategy based on the dimensions value cardinalities, an inherit characteristic of image descriptor vectors. Our strategy has low preprocessing requirements by dividing the computational cost of the ...
Histogram refinement for texture descriptor based image retrieval
Texture descriptors such as local binary patterns (LBP) have been successfully employed for feature extraction in image retrieval algorithms because of their high discriminating ability and computational efficiency. In this paper, we propose histogram ...
Multi-Scale Local Spatial Binary Patterns for Content-Based Image Retrieval
AMT 2013: Proceedings of the 9th International Conference on Active Media Technology - Volume 8210Content-based image retrieval (CBIR) has been widely studied in recent years. CBIR usually employs feature descriptors to describe the concerned characters of images, such as geometric descriptor and texture descriptor. Many texture descriptors in ...






Comments