{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:30:22Z","timestamp":1760236222118,"version":"build-2065373602"},"reference-count":25,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>There is spiking interest in graph analysis, mainly sparked by social network analysis done for various purposes. With social network graphs often achieving very large size, there is a need for capable tools to perform such an analysis. In this article, we contribute to this area by presenting an original approach to calculating various graph morphisms, designed with overall performance and scalability as the primary concern. The proposed method generates a list of candidates for further analysis by first decomposing a complex network into a set of sub-graphs, transforming sub-graphs into intermediary structures, which are then used to generate grey-scaled bitmap images, and, eventually, performing image comparison using Fast Fourier Transform. The paper discusses the proof-of-concept implementation of the method and provides experimental results achieved on sub-graphs in different sizes randomly chosen from a reference dataset. Planned future developments and key considered areas of application are also described.<\/jats:p>","DOI":"10.3390\/info12110454","type":"journal-article","created":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T22:21:34Z","timestamp":1635805294000},"page":"454","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Graph Analysis Using Fast Fourier Transform Applied on Grayscale Bitmap Images"],"prefix":"10.3390","volume":"12","author":[{"given":"Pawel","family":"Baszuro","sequence":"first","affiliation":[{"name":"Bugolka, 02-654 Warsaw, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2214-6989","authenticated-orcid":false,"given":"Jakub","family":"Swacha","sequence":"additional","affiliation":[{"name":"Department of IT in Management, University of Szczecin, 71-004 Szczecin, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,11,1]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0378-7206(03)00078-8","article-title":"Team structure and team performance in IS development: A social network perspective","volume":"41","author":"Yang","year":"2004","journal-title":"Inf. Manag."},{"key":"ref_2","unstructured":"Avesani, P., Bazzanella, C., Perini, A., and Susi, A. (2021, October 28). Supporting the Requirements Prioritization Process. A Machine Learning Approach. Available online: https:\/\/www.researchgate.net\/profile\/Anna-Perini-2\/publication\/221390930_Supporting_the_Requirements_Prioritization_Process_A_Machine_Learning_approach\/links\/00463519e064cd7643000000\/Supporting-the-Requirements-Prioritization-Process-A-Machine-Learning-approach.pdf."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Wu, W., Xiao, Y., Wang, W., He, Z., and Wang, Z. (2010, January 22\u201326). K-Symmetry Model for Identity Anonymization in Social Networks. Proceedings of the 13th International Conference on Extending Database Technology, Lausanne, Switzerland.","DOI":"10.1145\/1739041.1739058"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Leung, C.W., Lim, E.-P., Lo, D., and Weng, J. (2010, January 26\u201330). Mining Interesting Link Formation Rules in Social Networks. Proceedings of the 19th ACM International Conference on Information and Knowledge Management, Toronto, Canada.","DOI":"10.1145\/1871437.1871468"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1142\/S0218194017500073","article-title":"Structural Process Pattern Matching Based on Graph Morphism Detection","volume":"27","author":"Pahl","year":"2017","journal-title":"Int. J. Softw. Eng. Knowl. Eng."},{"key":"ref_6","unstructured":"Szanto, A. (2021, October 28). Defuse the News: Predicting Misinformation and Bias in News on Social Networks via Content-Blind Learning. Available online: https:\/\/dash.harvard.edu\/bitstream\/handle\/1\/38811538\/SZANTO-SENIORTHESIS-2018.pdf?sequence=3&isAllowed=y."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1961189.1961194","article-title":"Social Network Analysis and Mining for Business Applications","volume":"2","author":"Bonchi","year":"2011","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1016\/j.ijinfomgt.2017.04.007","article-title":"Co-citation and cluster analyses of extant literature on social networks","volume":"37","author":"Shiau","year":"2017","journal-title":"Int. J. Inf. Manag."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","article-title":"An Algorithm for Subgraph Isomorphism","volume":"23","author":"Ullmann","year":"1976","journal-title":"J. ACM"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1017\/S0269888912000331","article-title":"A survey of frequent subgraph mining algorithms","volume":"28","author":"Jiang","year":"2013","journal-title":"Knowl. Eng. Rev."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Chen, C., Yan, X., Zhu, F., and Han, J. (2007, January 28\u201331). GApprox: Mining Frequent Approximate Patterns from a Massive Network. Proceedings of the Seventh IEEE International Conference on Data Mining (ICDM 2007), IEEE, Omaha, NE, USA.","DOI":"10.1109\/ICDM.2007.36"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Sakr, S., Pardede, E., and Taniar, D. (2012). G-Hash: Towards Fast Kernel-Based Similarity Search in Large Graph Databases. Graph Data Management: Techniques and Applications, IGI Global. Advances in data mining and database management.","DOI":"10.4018\/978-1-61350-053-8"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Yan, X., Yu, P.S., and Han, J. (2004, January 14\u201316). Graph Indexing. Proceedings of the 2004 ACM SIGMOD International Conference on Management of Data-SIGMOD \u201904, Paris, France.","DOI":"10.1145\/1007568.1007607"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Lud\u00e4scher, B., and Mamoulis, N. (2008). RAM: Randomized Approximate Graph Mining. Scientific and Statistical Database Management, Springer .","DOI":"10.1007\/978-3-540-69497-7"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/j.cja.2013.07.011","article-title":"Description of shape characteristics through Fourier and wavelet analysis","volume":"27","author":"Yuan","year":"2014","journal-title":"Chin. J. Aeronaut."},{"key":"ref_16","unstructured":"Burrus, C.S. (2021, October 28). Fast Fourier Transforms. OpenStax CNX. Available online: http:\/\/cnx.org\/contents\/82e6ba6f-b828-42ef-9db1-8de4b448b869@22.1."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Mantoro, T., and Alfiah, F. (2017, January 23\u201325). Comparison Methods of DCT, DWT and FFT Techniques Approach on Lossy Image Compression. Proceedings of the 2017 International Conference on Computing, Engineering, and Design (ICCED), Kuala Lumpur, Malaysia.","DOI":"10.1109\/CED.2017.8308126"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"9059","DOI":"10.1109\/TGRS.2019.2924684","article-title":"Fast and Robust Matching for Multimodal Remote Sensing Image Registration","volume":"57","author":"Ye","year":"2019","journal-title":"IEEE Trans. Geosci. Remote Sens."},{"key":"ref_19","first-page":"61","article-title":"An Image Matching Method Based on Fourier and LOG-Polar Transform","volume":"169","author":"Zhang","year":"2014","journal-title":"Sens. Transducers"},{"key":"ref_20","unstructured":"Scellato, S. (2021, October 28). NetworkX: Network Analysis with Python. Available online: https:\/\/www.cl.cam.ac.uk\/~cm542\/teaching\/2010\/stna-pdfs\/stna-lecture8.pdf."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1038\/s41592-019-0686-2","article-title":"SciPy 1.0: Fundamental algorithms for scientific computing in Python","volume":"17","author":"Virtanen","year":"2020","journal-title":"Nat. Methods"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Yang, J., and Leskovec, J. (2012, January 10\u201313). Community-Affiliation Graph Model for Overlapping Network Community Detection. Proceedings of the 2012 IEEE 12th International Conference on Data Mining, Brussels, Belgium.","DOI":"10.1109\/ICDM.2012.139"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Junttila, T., and Kaski, P. (2007, January 6). Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs. Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX), New Orleans, LA, USA.","DOI":"10.1137\/1.9781611972870.13"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1080\/00029890.1975.11993805","article-title":"Infinite Families of Nontrivial Trivalent Graphs Which Are Not Tait Colorable","volume":"82","author":"Isaacs","year":"1975","journal-title":"Am. Math. Mon."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Majeed, A., and Rauf, I. (2020). Graph Theory: A Comprehensive Survey about Graph Theory Applications in Computer Science and Social Networks. Inventions, 5.","DOI":"10.3390\/inventions5010010"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/12\/11\/454\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:24:27Z","timestamp":1760167467000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/12\/11\/454"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,1]]},"references-count":25,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2021,11]]}},"alternative-id":["info12110454"],"URL":"https:\/\/doi.org\/10.3390\/info12110454","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2021,11,1]]}}}