{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:06:38Z","timestamp":1760144798448,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2024,5,15]],"date-time":"2024-05-15T00:00:00Z","timestamp":1715731200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Imaging"],"abstract":"<jats:p>In graph theory, the weighted Laplacian matrix is the most utilized technique to interpret the local and global properties of a complex graph structure within computer vision applications. However, with increasing graph nodes, the Laplacian matrix\u2019s dimensionality also increases accordingly. Therefore, there is always the \u201ccurse of dimensionality\u201d; In response to this challenge, this paper introduces a new approach to reducing the dimensionality of the weighted Laplacian matrix by utilizing the Gershgorin circle theorem by transforming the weighted Laplacian matrix into a strictly diagonal domain and then estimating rough eigenvalue inclusion of a matrix. The estimated inclusions are represented as reduced features, termed GC features; The proposed Gershgorin circle feature extraction (GCFE) method was evaluated using three publicly accessible computer vision datasets, varying image patch sizes, and three different graph types. The GCFE method was compared with eight distinct studies. The GCFE demonstrated a notable positive Z-score compared to other feature extraction methods such as I-PCA, kernel PCA, and spectral embedding. Specifically, it achieved an average Z-score of 6.953 with the 2D grid graph type and 4.473 with the pairwise graph type, particularly on the E_Balanced dataset. Furthermore, it was observed that while the accuracy of most major feature extraction methods declined with smaller image patch sizes, the GCFE maintained consistent accuracy across all tested image patch sizes. When the GCFE method was applied to the E_MNSIT dataset using the K-NN graph type, the GCFE method confirmed its consistent accuracy performance, evidenced by a low standard deviation (SD) of 0.305. This performance was notably lower compared to other methods like Isomap, which had an SD of 1.665, and LLE, which had an SD of 1.325; The GCFE outperformed most feature extraction methods in terms of classification accuracy and computational efficiency. The GCFE method also requires fewer training parameters for deep-learning models than the traditional weighted Laplacian method, establishing its potential for more effective and efficient feature extraction in computer vision tasks.<\/jats:p>","DOI":"10.3390\/jimaging10050121","type":"journal-article","created":{"date-parts":[[2024,5,15]],"date-time":"2024-05-15T11:31:52Z","timestamp":1715772712000},"page":"121","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Overcoming Dimensionality Constraints: A Gershgorin Circle Theorem-Based Feature Extraction for Weighted Laplacian Matrices in Computer Vision Applications"],"prefix":"10.3390","volume":"10","author":[{"given":"Sahaj Anilbhai","family":"Patel","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer, University of Alabama at Birmingham, Birmingham, AL 35205, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2014-8283","authenticated-orcid":false,"given":"Abidin","family":"Yildirim","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer, University of Alabama at Birmingham, Birmingham, AL 35205, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2024,5,15]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.aiopen.2021.01.001","article-title":"Graph neural networks: A review of methods and applications","volume":"1","author":"Zhou","year":"2020","journal-title":"AI Open"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1021\/ci00047a033","article-title":"Applications of graph theory in chemistry","volume":"25","author":"Balaban","year":"1985","journal-title":"J. Chem. Inf. Comput. Sci."},{"key":"ref_3","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"},{"key":"ref_4","unstructured":"Norcliffe-Brown, W., Vafeias, S., and Parisot, S. (2018, January 3\u20138). Learning conditioned graph structures for interpretable visual question answering. Proceedings of the Advances in Neural Information Processing Systems, Montreal, QC, Canada."},{"key":"ref_5","unstructured":"Belkin, M., and Niyogi, P. (2001, January 3\u20138). Laplacian eigenmaps and spectral techniques for embedding and clustering. Proceedings of the Advances in Neural Information Processing Systems, Vancouver, BC, Canada."},{"key":"ref_6","unstructured":"He, X., and Niyogi, P. (2003, January 8\u201313). Locality preserving projections. Proceedings of the Advances in Neural Information Processing Systems, Vancouver, BC, Canada."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","article-title":"Nonlinear dimensionality reduction by locally linear embedding","volume":"290","author":"Roweis","year":"2000","journal-title":"Science"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","article-title":"A global geometric framework for nonlinear dimensionality reduction","volume":"290","author":"Tenenbaum","year":"2000","journal-title":"Science"},{"key":"ref_9","unstructured":"He, X., Cai, D., and Niyogi, P. (2005, January 5\u20138). Laplacian score for feature selection. Proceedings of the Advances in Neural Information Processing Systems, Vancouver, BC, Canada."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1080\/14786440109462720","article-title":"LIII. On lines and planes of closest fit to systems of points in space","volume":"2","author":"Pearson","year":"1901","journal-title":"Lond. Edinb. Dublin Philos. Mag. J. Sci."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Sch\u00f6lkopf, B., Smola, A., and M\u00fcller, K.-R. (1997, January 8\u201310). Kernel Principal Component Analysis. Proceedings of the International Conference on Artificial Neural Networks, Lausanne, Switzerland.","DOI":"10.1007\/BFb0020217"},{"key":"ref_12","first-page":"1","article-title":"Learning the Kernel Matrix with Semidefinite Programming","volume":"3","author":"Chapelle","year":"2002","journal-title":"J. Mach. Learn. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s11263-007-0075-7","article-title":"Incremental Learning for Robust Visual Tracking","volume":"77","author":"Ross","year":"2008","journal-title":"Int. J. Comput. Vis."},{"key":"ref_14","first-page":"749","article-title":"\u00dcber die Abgrenzung der Eigenwerte einer Matrix","volume":"6","author":"Gershgorin","year":"1931","journal-title":"Izv. Akad. Nauk. SSSR"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"4541","DOI":"10.12988\/ces.2018.89504","article-title":"A stability test for non linear systems of ordinary differential equations based on the gershgorin circles","volume":"11","author":"Bejarano","year":"2018","journal-title":"Contemp. Eng. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"2814","DOI":"10.1109\/TSP.2020.2988784","article-title":"Graph sampling for matrix completion using recurrent Gershgorin disc shift","volume":"68","author":"Wang","year":"2020","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Xie, X., Huang, J., Tan, E., He, F., and Liu, Z. (2022). Stability Criterion and Stability Analysis of Three-Phase Grid-Connected Rectifier System Based on Gerschgorin Circle Theorem. Electronics, 11.","DOI":"10.3390\/electronics11203270"},{"key":"ref_18","first-page":"15","article-title":"On Ger\u0161gorin-type problems and ovals of Cassini","volume":"8","author":"Varga","year":"1999","journal-title":"Electron. Trans. Numer. Anal."},{"key":"ref_19","unstructured":"Varga, R.S. (2010). Ger\u0161gorin and His Circles, Springer."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Vapnik, V.N. (1995). The Nature of Statistical Learning Theory, Springer.","DOI":"10.1007\/978-1-4757-2440-0"},{"key":"ref_21","first-page":"130","article-title":"Decision tree methods: Applications for classification and prediction","volume":"27","author":"Song","year":"2015","journal-title":"Shanghai Arch. Psychiatry"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1038\/323533a0","article-title":"Learning representations by back-propagating errors","volume":"323","author":"Rumelhart","year":"1986","journal-title":"Nature"},{"key":"ref_23","unstructured":"Krizhevsky, A., Sutskever, I., and Hinton, G.E. (2012, January 3\u20136). Imagenet classification with deep convolutional neural networks. Proceedings of the Advances in Neural Information Processing Systems, Lake Tahoe, NV, USA."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Cohen, G., Afshar, S., Tapson, J., and Schaik, A.V. (2017, January 14\u201319). EMNIST: Extending MNIST to handwritten letters. Proceedings of the 2017 International Joint Conference on Neural Networks, Anchorage, AK, USA.","DOI":"10.1109\/IJCNN.2017.7966217"},{"key":"ref_25","unstructured":"(2024, February 01). Kaggle Dogs vs. Cats. Kaggle 2013. Available online: https:\/\/www.kaggle.com\/c\/dogs-vs-cats."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"e4568","DOI":"10.7717\/peerj.4568","article-title":"pre-trained convolutional neural networks as feature extractors toward improved malaria parasite detection in thin blood smear images","volume":"6","author":"Rajaraman","year":"2018","journal-title":"PeerJ"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1081160","DOI":"10.3389\/fninf.2023.1081160","article-title":"Non-stationary neural signal to image conversion framework for image-based deep learning algorithms","volume":"17","author":"Patel","year":"2023","journal-title":"Front. Neuroinform."},{"key":"ref_28","unstructured":"Patel, S.A. (2024, February 12). Image_GCFE[Sourecode]. Available online: https:\/\/github.com\/sahaj432\/Image_GCFE.git."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Zhang, Z., and Wang, J. (2006, January 4). MLLE: Modified locally linear embedding using multiple weights. Proceedings of the Advances in Neural Information Processing Systems, Vancouver, BC, Canada.","DOI":"10.7551\/mitpress\/7503.003.0204"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"5591","DOI":"10.1073\/pnas.1031596100","article-title":"Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data","volume":"100","author":"Donoho","year":"2003","journal-title":"Proc. Natl. Acad. Sci. USA"}],"container-title":["Journal of Imaging"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2313-433X\/10\/5\/121\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T14:43:00Z","timestamp":1760107380000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2313-433X\/10\/5\/121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,15]]},"references-count":30,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2024,5]]}},"alternative-id":["jimaging10050121"],"URL":"https:\/\/doi.org\/10.3390\/jimaging10050121","relation":{},"ISSN":["2313-433X"],"issn-type":[{"type":"electronic","value":"2313-433X"}],"subject":[],"published":{"date-parts":[[2024,5,15]]}}}