{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T02:01:18Z","timestamp":1779242478898,"version":"3.51.4"},"reference-count":52,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2021,7,22]],"date-time":"2021-07-22T00:00:00Z","timestamp":1626912000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BDCC"],"abstract":"<jats:p>The indexing and retrieval of multimedia content is generally implemented by employing feature graphs. These graphs typically contain a significant number of nodes and edges to reflect the level of detail in feature detection. A higher level of detail increases the effectiveness of the results, but also leads to more complex graph structures. However, graph traversal-based algorithms for similarity are quite inefficient and computationally expensive, especially for large data structures. To deliver fast and effective retrieval especially for large multimedia collections and multimedia big data, an efficient similarity algorithm for large graphs in particular is desirable. Hence, in this paper, we define a graph projection into a 2D space (Graph Code) and the corresponding algorithms for indexing and retrieval. We show that calculations in this space can be performed more efficiently than graph traversals due to the simpler processing model and the high level of parallelization. As a consequence, we demonstrate experimentally that the effectiveness of retrieval also increases substantially, as the Graph Code facilitates more levels of detail in feature fusion. These levels of detail also support an increased trust prediction, particularly for fused social media content. In our mathematical model, we define a metric triple for the Graph Code, which also enhances the ranked result representations. Thus, Graph Codes provide a significant increase in efficiency and effectiveness, especially for multimedia indexing and retrieval, and can be applied to images, videos, text and social media information.<\/jats:p>","DOI":"10.3390\/bdcc5030033","type":"journal-article","created":{"date-parts":[[2021,7,22]],"date-time":"2021-07-22T22:06:48Z","timestamp":1626991608000},"page":"33","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Fast and Effective Retrieval for Large Multimedia Collections"],"prefix":"10.3390","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2100-7589","authenticated-orcid":false,"given":"Stefan","family":"Wagenpfeil","sequence":"first","affiliation":[{"name":"Faculty of Mathematics and Computer Science, University of Hagen, Universit\u00e4tsstrasse 1, D-58097 Hagen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8567-1193","authenticated-orcid":false,"given":"Binh","family":"Vu","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Computer Science, University of Hagen, Universit\u00e4tsstrasse 1, D-58097 Hagen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Mc Kevitt","sequence":"additional","affiliation":[{"name":"Academy for International Science & Research (AISR), Derry BT48 7JL, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Hemmje","sequence":"additional","affiliation":[{"name":"Faculty of Mathematics and Computer Science, University of Hagen, Universit\u00e4tsstrasse 1, D-58097 Hagen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,7,22]]},"reference":[{"key":"ref_1","unstructured":"Spyrou, E. (2017). Semantic Multimedia Analysis and Processing, CRC Press."},{"key":"ref_2","unstructured":"Clement, J. (2020, August 23). Social Media\u2014Statistics & Facts. Available online: https:\/\/www.statista.com\/topics\/1164\/social-networks\/."},{"key":"ref_3","unstructured":"W3C.org (2020, August 23). W3C Semantic Web Activity. Available online: http:\/\/w3.org\/2001\/sw."},{"key":"ref_4","unstructured":"Neo4J Inc. (2020, November 24). Neo4J. Available online: https:\/\/neo4j.com\/top-ten-reasons\/."},{"key":"ref_5","unstructured":"CXL.com (2021, January 13). Reduce Your Server Response Time for Happy Users, Higher Rankings. Available online: https:\/\/cxl.com\/blog\/server-response-time\/."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Beyerer, C. (2017). Pattern Recognition\u2014Introduction, Walter de Gruyter GmbH & Co KG.","DOI":"10.1515\/9783110537949"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Kurland, O. (2021, March 14). Fusion in Information Retrieval: SIGIR 2018 Half-Day Tutorial. Available online: https:\/\/doi.org\/10.1145\/3209978.3210186.","DOI":"10.1145\/3209978.3210186"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Buhte, A., Meshram, B., and Harsha, B. (2012). Multimedia Indexing and Retrieval Techniques: A Review. Int. J. Comput. Appl., 35\u201342.","DOI":"10.5120\/9264-3443"},{"key":"ref_9","unstructured":"Subrahmanian, V. (1998). Principles of Multimedia Database Systems, Morgan Kaufmann Publishers."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Leveling, J. (2021, May 17). Interpretation of Coordinations. Available online: https:\/\/doi.org\/10.1145\/2484028.2484115.","DOI":"10.1145\/2484028.2484115"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Lew, M. (2021, May 17). Content-Based Multimedia Information Retrieval: State of the Art and Challenges. Available online: https:\/\/doi.org\/10.1145\/1126004.1126005.","DOI":"10.1145\/1126004.1126005"},{"key":"ref_12","unstructured":"Hernandez, C. (2020, August 23). Data Fusion and Label Weighting for Image Retrieval Based on Spatio-Conceptual Information. Available online: https:\/\/dl.acm.org\/doi\/10.5555\/1937055.1937072."},{"key":"ref_13","unstructured":"MIT\u2014Massachutsetts Institute of Technology (2020, August 23). Description of Exif File Format. Available online: http:\/\/media.mit.edu\/pia\/Research\/deepview\/exif.html."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Dufour, R. (December, January 13). Local and Global Models for Spontaneous Speech Segment Detection and Characterization. Proceedings of the 2009 IEEE Workshop on Automatic Speech Recognition & Understanding, Moreno, Italy.","DOI":"10.1109\/ASRU.2009.5372928"},{"key":"ref_15","unstructured":"FFMpeg.org (2020, August 23). Ffmpeg Documentation. Available online: http:\/\/ffmpeg.org."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Mu (2021, May 17). Content-Based Video Retrieval: Does Video\u2019s Semantic Visual Feature Matter?. Available online: https:\/\/doi.org\/10.1145\/1148170.1148314.","DOI":"10.1145\/1148170.1148314"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1109\/76.927421","article-title":"Overview of the MPEG-7 standard","volume":"11","author":"Chang","year":"2001","journal-title":"IEEE Trans. Circuits Syst. Video Technol."},{"key":"ref_18","unstructured":"Jean-Baptiste, A., Recasens, A., Schneider, R., Arandjelovic, R., Ramapuram, J., De Fauw, J., Smaira, L., Dieleman, S., and Zisserman, A. (2020). Self-supervised multimodal versatile networks. arXiv."},{"key":"ref_19","unstructured":"Wagenpfeil, S. (2020, August 23). GMAF Prototype. Available online: http:\/\/diss.step2e.de:8080\/GMAFWeb\/."},{"key":"ref_20","unstructured":"Wagenpfeil, S. (2020, September 25). Github Repository of GMAF and MMFVG. Available online: https:\/\/github.com\/stefanwagenpfeil\/GMAF\/."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Wagenpfeil, S., and Hemmje, M. (2020, January 29\u201330). Towards AI-bases semantic multimedia indexing and retrieval for social media on smartphones. Proceedings of the 2020 15th International Workshop on Semantic and Social Media Adaptation and Personalization, Zakynthos, Greece.","DOI":"10.1109\/SMAP49528.2020.9248445"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Wagenpfeil, S. (2021, May 17). AI-Based Semantic Multimedia Indexing and Retrieval for Social Media on Smartphones. Available online: https:\/\/www.mdpi.com\/2078-2489\/12\/1\/43.","DOI":"10.3390\/info12010043"},{"key":"ref_23","unstructured":"Gurski, F., Komander, D., and Rehs, C. (2021, May 17). On Characterizations for Subclasses of Directed Co-Graphs. Available online: http:\/\/arxiv.org\/abs\/1907.00801."},{"key":"ref_24","unstructured":"yWorks GmbH (2020, August 23). yEd Graph Editor. Available online: https:\/\/www.yworks.com\/products\/yed."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Fischer, G. (2014). Lineare Algebra, Springer Publishing.","DOI":"10.1007\/978-3-658-03945-5"},{"key":"ref_26","unstructured":"Mathworld, W. (2021, March 12). Adjacency Matrix. Available online: https:\/\/mathworld.wolfram.com\/AdjacencyMatrix.html."},{"key":"ref_27","unstructured":"Mathworld, W. (2021, February 14). Eigenvalue Method. Available online: https:\/\/mathworld.wolfram.com\/Eigenvalue.html."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Yuan (2021, May 17). Graph Similarity Search on Large Uncertain Graph Databases. Available online: https:\/\/doi.org\/10.1007\/s00778-014-0373-y.","DOI":"10.1007\/s00778-014-0373-y"},{"key":"ref_29","unstructured":"Needham, M. (2019). Graph Algorithms, O\u2019Reilly UK Ltd.. Available online: https:\/\/neo4j.com\/graph-algorithms-book\/."},{"key":"ref_30","unstructured":"Qiu, J., Dong, Y., Ma, H., Li, J., Wang, K., and Tang, J. (2021, May 17). Network Embedding as Matrix Factorization: Unifying DeepWalk. Available online: http:\/\/arxiv.org\/abs\/1710.02971."},{"key":"ref_31","first-page":"535","article-title":"Billion-scale similarity search with gpus","volume":"7","author":"Jeff","year":"2019","journal-title":"IEEE Trans. Big Data"},{"key":"ref_32","unstructured":"Text Retrieval Conference (2021, May 17). Datasets, Available online: https:\/\/trec.nist.gov\/data.html."},{"key":"ref_33","unstructured":"Towards Data Science (2018, November 13). Over 1.5 TBs of Labeled Audio Datasets. Available online: https:\/\/towardsdatascience.com\/a-data-lakes-worth-of-audio-datasets-b45b88cd4ad."},{"key":"ref_34","unstructured":"Google.com (2021, January 05). A Large and Diverse Labeled Video Dataset for Video Understanding Research. Available online: http:\/\/research.google.com\/youtube8m\/."},{"key":"ref_35","unstructured":"Young, P. (2021, January 14). From Image Descriptions to Visual Denotations: New Similarity Metrics for Semantic Inference over Event Descriptions. Available online: http:\/\/shannon.cs.illinois.edu\/DenotationGraph\/."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Agustsson, E. (2021, May 17). NTIRE 2017 Challenge on Single Image Super-Resolution: Dataset and Study. Available online: http:\/\/www.vision.ee.ethz.ch\/timofter\/publications\/Agustsson-CVPRW-2017.pdf.","DOI":"10.1109\/CVPRW.2017.150"},{"key":"ref_37","unstructured":"Grubinger, M. (2006, January 22). The IAPR TC12 Benchmark: A New Evaluation Resource for Visual Information Systems. Proceedings of the International Workshop Ontoimage, Genoa, Italy."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s11263-009-0275-4","article-title":"The PASCAL Visual Object Classes (VOC) Challenge","volume":"88","author":"Everingham","year":"2010","journal-title":"Int. J. Comput. Vis."},{"key":"ref_39","unstructured":"Wikipedia (2020, December 13). List of Dictionaries by Number of Words. Available online: https:\/\/en.wikipedia.org\/wiki\/List_of_dictionaries_by_number_of_words."},{"key":"ref_40","unstructured":"W3C.org (2020, August 23). SPARQL Query Language for RDF. Available online: https:\/\/www.w3.org\/TR\/sparql11-overview\/."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Jung (2021, May 17). Automated Conversion from Natural Language Query to SPARQL Query. Available online: https:\/\/doi.org\/10.1007\/s10844-019-00589-2.","DOI":"10.1007\/s10844-019-00589-2"},{"key":"ref_42","unstructured":"Schmitt, I., Schulz, N., and Herstel, T. (2005, January 12\u201314). WS-QBE: A QBE-Like Query Language for Complex Multimedia Queries. Proceedings of the 11th International Multimedia Modelling Conference, Melbourne, Australia."},{"key":"ref_43","unstructured":"Nvidia.com (2020, November 10). RTX 2080. Available online: https:\/\/www.nvidia.com\/de-de\/geforce\/graphics-cards\/rtx-2080\/."},{"key":"ref_44","unstructured":"Wikipedia (2020, October 28). Apple A14 Bionic. Available online: https:\/\/en.wikipedia.org\/wiki\/Apple_A14."},{"key":"ref_45","unstructured":"Oracle.com (2020, August 23). Java Enterprise Edition. Available online: https:\/\/www.oracle.com\/de\/java\/technologies\/java-ee-glance.html."},{"key":"ref_46","unstructured":"Apple.com (2020, November 21). Apple Development Programme. Available online: http:\/\/developer.apple.com."},{"key":"ref_47","unstructured":"Apple (2020, October 27). Apple IPad Pro. Available online: https:\/\/www.apple.com\/ipad-pro\/."},{"key":"ref_48","unstructured":"Jupyter.org (2020, October 27). The Jupyter Notebook. Available online: https:\/\/jupyter.org."},{"key":"ref_49","unstructured":"Neo4J Inc. (2020, December 14). Neo4J Graph Database System. Available online: https:\/\/neo4j.com."},{"key":"ref_50","unstructured":"Gamma, E., Helm, R., Johnson, R., and Vlissides, J. (1994). Design Patterns\u2014Elements of Reusable Object Oriented Software, Addison Wesley."},{"key":"ref_51","unstructured":"Adobe.com (2020, October 02). Adobe Stock. Available online: https:\/\/stock.adobe.com."},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Scherer, R. (2020). Computer Vision Methods for Fast Image Classification and Retrieval, Springer.","DOI":"10.1007\/978-3-030-12195-2"}],"container-title":["Big Data and Cognitive Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2504-2289\/5\/3\/33\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T06:33:21Z","timestamp":1760164401000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2504-2289\/5\/3\/33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,22]]},"references-count":52,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2021,9]]}},"alternative-id":["bdcc5030033"],"URL":"https:\/\/doi.org\/10.3390\/bdcc5030033","relation":{},"ISSN":["2504-2289"],"issn-type":[{"value":"2504-2289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,22]]}}}