Skip to main content

Advertisement

Log in

Multi-hash chain based multimedia search technology optimized for distributed environments using IoT devices

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Recently, research has been active in various fields in relation to multimedia data retrieval to reduce the accuracy and calculation costs of multimedia retrieval. In particular, various search methods using multimedia has been developed. However, in many applications currently operating in the system, large multimedia data is distributed across servers or sites at different locations, so assembling multimedia data only as a hash presents huge computational, communication, and storage costs. In this paper, when searching for multimedia information stored in distributed environments using IoT devices, multiple hash chain-based multimedia retrieval techniques are proposed to minimize accuracy and calculation costs. The proposed technique is aimed at improving the accuracy of multimedia by using IoT devices to divide-and-conquer multimedia information that is collected and stored distributed. The proposed technique provides probability values for each segmented multimedia information by disaggregating the various attribute information that is composed of multimedia as much as possible, thereby increasing the accuracy of the multimedia that users want. Suggestion techniques determine the group size of multimedia data according to the priority of layered multimedia data. Multimedia group data include multimedia data contained in higher layers and subdivides the various attribute information constituting multimedia data. In addition, the proposed techniques improve the accessibility of multimedia data over existing ones by linking priority information between multimedia data.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Amato F, Castiglione A, Moscato V, Picariello A, Sperli G (2018) Multimedia summarization using social media content. Multimed Tools Appl 77(14):17803–17827

    Article  Google Scholar 

  2. Babenko A and Lempitsky V (2016) “Efficient indexing of billion-scale datasets of deep descriptors,” In Proc. of 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2055–2063

  3. Chen C-C, Hsieh S-L (2015) Using binarization and hashing for efficient SIFT matching. J Vis Commun Image Represent 30:86–93

    Article  Google Scholar 

  4. Chen Q, Lang B, Liu X, Gu Z (2016) “DisITQ: A distributed iterative quantization hashing learning algorithm,” In Proc. of 2016 9th International Symposium on Computational Intelligence and Design (ISCID), vol. 2, pp. 118–123

  5. Chowdhury M, Kundu MK (2017) Erratum to: comparative assessment of efficiency for content based image retrieval systems using different wavelet features and pre-classifier. Multimed Tools Appl 76(20):21839–21839

    Article  Google Scholar 

  6. Do T-T, Doan A-Z, Cheung N-M (2015) “Discrete hashing with deep neural network,” CoRR, pp. 1–5

  7. Ge T, He K, Ke Q, Sun J (2013) “Optimized product quantization for approximate nearest neighbor search,” In Proc. of 2013 IEEE Conference on Computer Vision and Pattern Recognition, pp 2946-2953

  8. Guo D, Li C, Wu L (2016) Parametric and nonparametric residual vector quantization optimizations for ANN search. Neurocomputing 217:92–102

    Article  Google Scholar 

  9. He K, Wen F, Sun J (2013) “K-means hashing: An affinity-preserving quantization method for learning binary compact codes,” In Proc. of 2013 IEEE Conference on Computer Vision and Pattern Recognition, pp. 2938-2945

  10. Jain M, Jegou H, Gros P (2011) “Asymmetric Hamming embedding: Taking the best of our bits for large scale image search,” In Proc. of 19th ACM international conference on Multimedia, pp. 1441–1444

  11. Jegou H, Douze M, Schmid C (2011) Product quantization for nearest neighbor search. IEEE Trans Pattern Anal Mach Intell 33(1):117–128

    Article  Google Scholar 

  12. Kalantidis Y, Avrithis Y (2014) “Locally optimized product quantization for approximate nearest neighbor search,” In Proc. of 2014 IEEE Conference on Computer Vision and Pattern Recognition, pp 2329-2336

  13. Kamen A et al (2016) Automatic tissue differentiation based on confocal endomicroscopic images for intraoperative guidance in neurosurgery. Biomed Res Int 2016:1–9

    Article  Google Scholar 

  14. Laurent E, Gligor VD (2002) “A key-management scheme for distributed sensor networks,” In Proc. of 9th ACM Conference on Computer and Communications Security, ACM Press, pp. 41–47

  15. Li F, Wu K, Lei J, Wen M, Ren Y (2018) Unsupervised steganalysis over social networks based on multi-reference sub-image sets. Multimed Tools Appl 77(14):17953–17971

    Article  Google Scholar 

  16. Lin K, Yang H-F, Hsiao J-H, Chen C-S (2015) “Deep learning of binary hash codes for fast image retrieval,” In Proc. of 2015 IEEE Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), pp. 27–35

  17. Lin J, Morere O, Petta J, Chandrasekhar V, Veillard A (2016) “Tiny descriptors for image retrieval with unsupervised triplet hashing,” In Proc. of 2016 Data Compression Conference (DCC), pp. 397–406

  18. Liu W, Wang J, Chang SF (2011) “Hashing with graphs,” In Proc. of 28th International Conference on International Conference on Machine Learning, pp. 1–8

  19. Liu W, Wang J, Ji R, Jiang Y-G, Chang S-F (2012) “Supervised hashing with kernels,” In Proc. of 2012 IEEE Conference on Computer Vision and Pattern Recognition, pp 2074-2081

  20. Norouzi M, Fleet D (2011) “Minimal loss hashing for compact binary codes,” In Proc. of 28th International Conference on International Conference on Machine Learning, pp. 353–360

  21. Ren G, Cai J, Li S, Yu N, Tian Q (2014) “Scalable image search with reliable binary code,” In Proc. of 22nd ACM international conference on Multimedia, pp. 769–772

  22. Salakhutdinov R, Hinton G (2009) Semantic hashing. Int J Approx Reason 50(7):969–978

    Article  Google Scholar 

  23. Song J, Yang Y, Li X, Huang Z, Yang Y (2014) Robust hashing with local models for approximate similarity search. IEEE Trans Cybern 44(7):1225–1236

    Article  Google Scholar 

  24. Song J, Gao L, Yan Y, Zhang D, Sebe N (2015) “Supervised hashing with pseudo labels for scalable multimedia retrieval,” In Proc. of 23rd ACM international conference on Multimedia, pp. 827–830

  25. Wang J, Kumar S, Chang SF (2012) Semi-supervised hashing for largescale search. IEEE Trans Pattern Anal Mach Intell 34(12):2393–2406

    Article  Google Scholar 

  26. Wang D, Cui P, Ou M, Zhu W (2015) Learning compact hash codes for multimodal representations using orthogonal deep structure. IEEE Trans Multimedia 17(9):1404–1416

    Article  Google Scholar 

  27. Weiss Y, Torralba A, Fergus R (2008) “Spectral hashing,” In: Proc. of 21st International Conference on Neural Information Processing Systems, Cambridge: MIT Press, vol. 21, pp. 1753–1760

  28. Xia R, Pan Y, Lai H, Liu C, Yan S (2014) “Supervised hashing for image retrieval via image representation learning,” In Proc. of AAAI Publications, Twenty-Eighth AAAI Conference on Artificial Intelligence, pp. 2156–2162

  29. Xie H, Gao K, Zhang Y, Tang S, Li J, Liu Y (2011) Efficient feature detection and effective post-verification for large scale near-duplicate image search. IEEE Trans Multimedia 13(6):1319–1332

    Article  Google Scholar 

  30. Yang D, Xie H, Yin J, Liu Y, Yan C (2017) “Supervised deep quantization for efficient image search,” In Proc. of 2017 IEEE International Conference on Multimedia & Expo Workshops(ICMEW), pp. 525–530

  31. Zhai D, Zhao D (2018) Supervised distributed hashing for large-scale multimedia retrieval. IEEE Trans Multimedia 20(3):675–686

    Article  Google Scholar 

  32. Zhang D, Wang J, Cai D, Lu J (2010) “Self-taught hashing for fast similarity search,” In Proc. of 33rd International ACM SIGIR Conference on Research and development in information retrieval, pp. 18–25

  33. Zhang L, Zhang Y, Gu X, Tang J, Tian Q (2014) Scalable similarity search with topology preserving hashing. IEEE Trans Image Process 23(7):3025–3039

    Article  MathSciNet  Google Scholar 

  34. Zhang X, Dou H, Ju T, Xu J, Zhang S (2016) Fusing heterogeneous features from stacked sparse autoencoder for histopathological image analysis. IEEE J Biomed Health Inf 20(5):1377–1383

    Article  Google Scholar 

  35. Zheng L, Wang S, Wang J, Tian Q (2016) Accurate image search with multi-scale contextual evidences. Int J Comput Vis 120(1):1–13

    Article  MathSciNet  Google Scholar 

  36. Zhou W, Lu Y, Li H, Tian Q (2012) “Scalar quantization for large scale image search,” In Proc. of 20th ACM international conference on Multimedia, pp. 169–178

  37. Zhou W, Yang M, Li H, Wang X, Lin Y, Tian Q (2014) Towards codebook-free: scalable cascaded hashing for mobile image search. IEEE Trans Multimedia 16(3):601–611

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yoon-Su Jeong.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jeong, YS. Multi-hash chain based multimedia search technology optimized for distributed environments using IoT devices. Multimed Tools Appl 80, 34661–34678 (2021). https://doi.org/10.1007/s11042-020-08772-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-020-08772-2

Keywords