research-article

Similarity Search over the Cloud Based on Image Descriptors' Dimensions Value Cardinalities

Authors:

Stefanos Antaris,

Dimitrios RafailidisAuthors Info & Claims

ACM Transactions on Multimedia Computing, Communications, and Applications (TOMM), Volume 11, Issue 4

Article No.: 51, Pages 1 - 23

https://doi.org/10.1145/2716315

Published: 02 June 2015 Publication History

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.

Supplementary Material

a51-antaris-app.pdf (antaris.zip)

Supplemental movie, appendix, image and software files for, A reward-and-punishment-based approach for concept detection using adaptive ontology rules

Download
790.61 KB

References

[1]

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).

[2]

A. Babenko and V. Lempitsky. 2012. The inverted multi-index. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 3069--3076.

Digital Library

[3]

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.

Digital Library

[4]

H. Bay, T. Tuytelaars, and L. V. Gool. 2008. SURF: Speeded Up Robust Features. Comput. Vision Image Understanding 110, 3, 346--359.

Digital Library

[5]

T. Bozkaya and M. Ozsoyoglu. 1999. Indexing large metric spaces for similarity search queries. ACM Trans. Database Syst. 24, 3, 361--404.

Digital Library

[6]

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.

Digital Library

[7]

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.

Digital Library

[8]

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.

Digital Library

[9]

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.

Digital Library

[10]

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.

Digital Library

[11]

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.

Digital Library

[12]

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.

Digital Library

[13]

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.

Digital Library

[14]

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.

Digital Library

[15]

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.

Digital Library

[16]

K. A. Hua. 2013. Online video delivery: Past, present, and future. ACM Trans. on Multimedia Computing, Communications, and Applications 9, 1s (2013).

Digital Library

[17]

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.

Digital Library

[18]

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.

Digital Library

[19]

H. Jegou, M. Douze, and C. Schmid. 2011. Product quantization for nearest neighbor search. IEEE Trans. Pattern Anal. Mach. Intell. 33, 1, 117--128.

Digital Library

[20]

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.

[21]

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.

Digital Library

[22]

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.

Digital Library

[23]

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.

[24]

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.

Digital Library

[25]

D. Lowe. 2004. Distinctive image features from scale-invariant keypoints. Int. J. Computer Vision 60, 2, 91--110.

Digital Library

[26]

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.

[27]

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.

[28]

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).

[29]

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.

Digital Library

[30]

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.

Digital Library

[31]

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.

[32]

D. Novak, M. Batko, and P. Zezula. 2012. Large-scale similarity data management with distributed Metric Index. Inf. Process. Management 48, 855--872.

Digital Library

[33]

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.

Digital Library

[34]

M. Raginsky and S. Lazebnik. 2009. Locality-sensitive binary codes from shift-invariant kernels. In Proceedings of NIPS'09. 1509--1517.

[35]

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.

Digital Library

[36]

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.

[37]

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.

Digital Library

[38]

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.

Digital Library

[39]

Y. Tian, J. Srivastava, T. Huang, and N. Contractor. 2010. Social Multimedia Computing 43, 8, 27--37.

Digital Library

[40]

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).

Digital Library

[41]

A. Vlachou, C. Doulkeridis, and Y. Kotidis. 2012. Metric-Based Similarity Search in Unstructured Peer-to-Peer Systems. Springer.

[42]

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.

Digital Library

[43]

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.

Digital Library

[44]

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.

Digital Library

[45]

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.

Digital Library

[46]

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.

[47]

Y. Weiss, A. Torralba, and R. Fergus. 2008. Spectral hashing. In Proceedings of NIPS'08. 1753--1760.

[48]

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.

Digital Library

[49]

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.

[50]

W. Zhu, C. Luo, J. Wang, and S. Li. 2011. Multimedia cloud computing. IEEE Signal Process. Mag. 28, 3, 59--69.

Cited By

Rodriguez-Arauz MRodriguez-Mazahua LArrioja-Rodriguez MAntonieta Abud-Figueroa MPelaez-Camarena S(2020)Horizontal Fragmentation of Multimedia Databases to Optimize Content-based Queries: A Review2020 17th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)10.1109/CCE50788.2020.9299166(1-6)Online publication date: 11-Nov-2020
https://doi.org/10.1109/CCE50788.2020.9299166
Antaris SRafailidis D(2018)In-Memory Stream Indexing of Massive and Fast Incoming Multimedia ContentIEEE Transactions on Big Data10.1109/TBDATA.2017.26974414:1(40-54)Online publication date: 1-Mar-2018
https://doi.org/10.1109/TBDATA.2017.2697441
Rafailidis D(2016)Supervised Hashing Based on the Dimensions’ Value Cardinalities of Image DescriptorsIEEE Signal Processing Letters10.1109/LSP.2016.259990123:10(1479-1483)Online publication date: Oct-2016
https://doi.org/10.1109/LSP.2016.2599901
Show More Cited By

Index Terms

Similarity Search over the Cloud Based on Image Descriptors' Dimensions Value Cardinalities
1. Information systems
  1. Information retrieval

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 Computing

In 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 8210

Content-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

Information & Contributors

Information

Published In

cover image ACM Transactions on Multimedia Computing, Communications, and Applications

ACM Transactions on Multimedia Computing, Communications, and Applications Volume 11, Issue 4

April 2015

231 pages

ISSN:1551-6857

EISSN:1551-6865

DOI:10.1145/2788342

Editor:
Ralf Steinmetz
Technische Universität Darmstadt, Germany

Issue’s Table of Contents

Copyright © 2015 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 June 2015

Accepted: 01 January 2015

Revised: 01 August 2014

Received: 01 March 2014

Published in TOMM Volume 11, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
180
Total Downloads

Downloads (Last 12 months)3
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Rodriguez-Arauz MRodriguez-Mazahua LArrioja-Rodriguez MAntonieta Abud-Figueroa MPelaez-Camarena S(2020)Horizontal Fragmentation of Multimedia Databases to Optimize Content-based Queries: A Review2020 17th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)10.1109/CCE50788.2020.9299166(1-6)Online publication date: 11-Nov-2020
https://doi.org/10.1109/CCE50788.2020.9299166
Antaris SRafailidis D(2018)In-Memory Stream Indexing of Massive and Fast Incoming Multimedia ContentIEEE Transactions on Big Data10.1109/TBDATA.2017.26974414:1(40-54)Online publication date: 1-Mar-2018
https://doi.org/10.1109/TBDATA.2017.2697441
Rafailidis D(2016)Supervised Hashing Based on the Dimensions’ Value Cardinalities of Image DescriptorsIEEE Signal Processing Letters10.1109/LSP.2016.259990123:10(1479-1483)Online publication date: Oct-2016
https://doi.org/10.1109/LSP.2016.2599901
Rafailidis DAntaris S(2015)Indexing media storms on FlinkProceedings of the 2015 IEEE International Conference on Big Data (Big Data)10.1109/BigData.2015.7364094(2836-2838)Online publication date: 29-Oct-2015
https://dl.acm.org/doi/10.1109/BigData.2015.7364094

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents