Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (64)

Search Parameters:
Keywords = multigraphs

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
32 pages, 4717 KiB  
Article
MOGAD: Integrated Multi-Omics and Graph Attention for the Discovery of Alzheimer’s Disease’s Biomarkers
by Zhizhong Zhang, Yuqi Chen, Changliang Wang, Maoni Guo, Lu Cai, Jian He, Yanchun Liang, Garry Wong and Liang Chen
Informatics 2025, 12(3), 68; https://doi.org/10.3390/informatics12030068 - 9 Jul 2025
Viewed by 408
Abstract
The selection of appropriate biomarkers in clinical practice aids in the early detection, treatment, and prevention of disease while also assisting in the development of targeted therapeutics. Recently, multi-omics data generated from advanced technology platforms has become available for disease studies. Therefore, the [...] Read more.
The selection of appropriate biomarkers in clinical practice aids in the early detection, treatment, and prevention of disease while also assisting in the development of targeted therapeutics. Recently, multi-omics data generated from advanced technology platforms has become available for disease studies. Therefore, the integration of this data with associated clinical data provides a unique opportunity to gain a deeper understanding of disease. However, the effective integration of large-scale multi-omics data remains a major challenge. To address this, we propose a novel deep learning model—the Multi-Omics Graph Attention biomarker Discovery network (MOGAD). MOGAD aims to efficiently classify diseases and discover biomarkers by integrating various omics data such as DNA methylation, gene expression, and miRNA expression. The model consists of three main modules: Multi-head GAT network (MGAT), Multi-Graph Attention Fusion (MGAF), and Attention Fusion (AF), which work together to dynamically model the complex relationships among different omics layers. We incorporate clinical data (e.g., APOE genotype) which enables a systematic investigation of the influence of non-omics factors on disease classification. The experimental results demonstrate that MOGAD achieves a superior performance compared to existing single-omics and multi-omics integration methods in classification tasks for Alzheimer’s disease (AD). In the comparative experiment on the ROSMAP dataset, our model achieved the highest ACC (0.773), F1-score (0.787), and MCC (0.551). The biomarkers identified by MOGAD show strong associations with the underlying pathogenesis of AD. We also apply a Hi-C dataset to validate the biological rationality of the identified biomarkers. Furthermore, the incorporation of clinical data enhances the model’s robustness and uncovers synergistic interactions between omics and non-omics features. Thus, our deep learning model is able to successfully integrate multi-omics data to efficiently classify disease and discover novel biomarkers. Full article
Show Figures

Figure 1

21 pages, 7528 KiB  
Article
A Fine-Tuning Method via Adaptive Symmetric Fusion and Multi-Graph Aggregation for Human Pose Estimation
by Yinliang Shi, Zhaonian Liu, Bin Jiang, Tianqi Dai and Yuanfeng Lian
Symmetry 2025, 17(7), 1098; https://doi.org/10.3390/sym17071098 - 9 Jul 2025
Viewed by 281
Abstract
Human Pose Estimation (HPE) aims to accurately locate the positions of human key points in images or videos. However, the performance of HPE is often significantly reduced in practical application scenarios due to environmental interference. To address this challenge, we propose a ladder [...] Read more.
Human Pose Estimation (HPE) aims to accurately locate the positions of human key points in images or videos. However, the performance of HPE is often significantly reduced in practical application scenarios due to environmental interference. To address this challenge, we propose a ladder side-tuning method for the Vision Transformer (ViT) pre-trained model based on multi-path feature fusion to improve the accuracy of HPE in highly interfering environments. First, we extract the global features, frequency features and multi-scale spatial features through the ViT pre-trained model, the discrete wavelet convolutional network and the atrous spatial pyramid pooling network (ASPP). By comprehensively capturing the information of the human body and the environment, the ability of the model to analyze local details, textures, and spatial information is enhanced. In order to efficiently fuse these features, we devise an adaptive symmetric feature fusion strategy, which dynamically adjusts the intensity of feature fusion according to the similarity among features to achieve the optimal fusion effect. Finally, a multi-graph feature aggregation method is developed. We construct graph structures of different features and deeply explore the subtle differences among the features based on the dual fusion mechanism of points and edges to ensure the information integrity. The experimental results demonstrate that our method achieves 4.3% and 4.2% improvements in the AP metric on the MS COCO dataset and a custom high-interference dataset, respectively, compared with the HRNet. This highlights its superiority for human pose estimation tasks in both general and interfering environments. Full article
(This article belongs to the Special Issue Symmetry and Asymmetry in Computer Vision and Graphics)
Show Figures

Figure 1

19 pages, 2467 KiB  
Article
Wind Power Forecasting Based on Multi-Graph Neural Networks Considering External Disturbances
by Xiaoyin Xu, Zhumei Luo and Menglong Feng
Energies 2025, 18(11), 2969; https://doi.org/10.3390/en18112969 - 4 Jun 2025
Viewed by 412
Abstract
Wind power forecasting is challenging because of complex, nonlinear relationships between inherent patterns and external disturbances. Though much progress has been achieved in deep learning approaches, existing methods cannot effectively decompose and model intertwined spatio-temporal dependencies. Current methods typically treat wind power as [...] Read more.
Wind power forecasting is challenging because of complex, nonlinear relationships between inherent patterns and external disturbances. Though much progress has been achieved in deep learning approaches, existing methods cannot effectively decompose and model intertwined spatio-temporal dependencies. Current methods typically treat wind power as a unified signal without explicitly separating inherent patterns from external influences, so they have limited prediction accuracy. This paper introduces a novel framework GCN-EIF that decouples external interference factors (EIFs) from inherent wind power patterns to achieve excellent prediction accuracy. Our innovation lies in the physically informed architecture that explicitly models the mathematical relationship: P(t)=Pinherent(t)+EIF(t). The framework adopts a three-component architecture consisting of (1) a multi-graph convolutional network using both geographical proximity and power correlation graphs to capture heterogeneous spatial dependencies between wind farms, (2) an attention-enhanced LSTM network that weights temporal features differentially based on their predictive significance, and (3) a specialized Conv2D mechanism to identify and isolate external disturbance patterns. A key methodological contribution is our signal decomposition strategy during the prediction phase, where an EIF is eliminated from historical data to better learn fundamental patterns, and then a predicted EIF is reintroduced for the target period, significantly reducing error propagation. Extensive experiments across diverse wind farm clusters and different weather conditions indicate that GCN-EIF achieves an 18.99% lower RMSE and 5.08% lower MAE than state-of-the-art methods. Meanwhile, real-time performance analysis confirms the model’s operational viability as it maintains excellent prediction accuracy (RMSE < 15) even at high data arrival rates (100 samples/second) while ensuring processing latency below critical thresholds (10 ms) under typical system loads. Full article
Show Figures

Figure 1

14 pages, 7858 KiB  
Article
MCE-HGCN: Heterogeneous Graph Convolution Network for Analog IC Matching Constraints Extraction
by Yong Zhang, Yong Yin, Ning Xu and Bowen Jia
Micromachines 2025, 16(6), 677; https://doi.org/10.3390/mi16060677 - 3 Jun 2025
Viewed by 464
Abstract
Matching constraints in an analog integrated circuit (IC) are critical to optimizing layout performance. To extract these matching constraints accurately and efficiently from the netlist, we propose the heterogeneous matching constraint extraction graph neural network (MCE-HGCN). First, the netlist is mapped into a [...] Read more.
Matching constraints in an analog integrated circuit (IC) are critical to optimizing layout performance. To extract these matching constraints accurately and efficiently from the netlist, we propose the heterogeneous matching constraint extraction graph neural network (MCE-HGCN). First, the netlist is mapped into a heterogeneous attribute multi-graph, and based on the characteristics of analog IC matching constraints, a mixed-domain attention mechanism is developed to leverage both the topology information and node attributes in the graph to characterize node embeddings. A matching classifier, implemented using the support vector machine (SVM), is then employed to classify different types of matching constraints from the netlist. Additionally, a matching filter is introduced to remove interference terms. Experimental results demonstrate that the MCE-HGCN model converges effectively with small datasets. In the matching prediction process, the mean F1 score reached 0.917 across different netlist processes and circuit types while maintaining a shorter runtime compared to other methods. Ablation experiments also show that incorporating the mixed-domain attention mechanism and the matching filter individually leads to significant performance improvements. Overall, MCE-HGCN excels at extracting matching constraints from various analog circuits and processes, offering valuable insights for placement guidance and enhancing the efficiency of analog IC layout design. Full article
Show Figures

Figure 1

25 pages, 479 KiB  
Article
Persistent Homology on a Lattice of Multigraphs
by Joaquín Díaz Boils
Int. J. Topol. 2025, 2(2), 7; https://doi.org/10.3390/ijt2020007 - 20 May 2025
Viewed by 665
Abstract
A multicomplex structure is defined from an ordered lattice of multigraphs. This structure will help us to observe the features of persistent homology in this context, its interaction with the ordering, and the repercussions of merging multigraphs in the calculation of Betti numbers. [...] Read more.
A multicomplex structure is defined from an ordered lattice of multigraphs. This structure will help us to observe the features of persistent homology in this context, its interaction with the ordering, and the repercussions of merging multigraphs in the calculation of Betti numbers. For the latter, an extended version of the incremental algorithm is provided. The ideas developed here are mainly oriented to the original example described by the author and others in the context of the formalization of the notion of embodiment in Neuroscience. Full article
(This article belongs to the Special Issue Feature Papers in Topology and Its Applications)
Show Figures

Figure 1

24 pages, 3393 KiB  
Article
Kolmogorov–Smirnov-Based Edge Centrality Measure for Metric Graphs
by Christina Durón, Hannah Kravitz and Moysey Brio
Dynamics 2025, 5(2), 16; https://doi.org/10.3390/dynamics5020016 - 2 May 2025
Viewed by 1261
Abstract
In this work, we introduce an edge centrality measure for the Helmholtz equation on metric graphs, a particular flow network, based on spectral edge energy density. This measure identifies influential edges whose removal significantly changes the energy flow on the network, as indicated [...] Read more.
In this work, we introduce an edge centrality measure for the Helmholtz equation on metric graphs, a particular flow network, based on spectral edge energy density. This measure identifies influential edges whose removal significantly changes the energy flow on the network, as indicated by statistically significant p-values from the two-sample Kolmogorov–Smirnov test comparing edge energy densities in the original network to those with a single edge removed. We compare the proposed measure with eight vertex centrality measures applied to a line graph representation of each metric graph, as well as with two edge centrality measures applied directly to each metric graph. Both methods are evaluated on two undirected and weighted metric graphs—a power grid network adapted from the IEEE 14-bus system and an approximation of Poland’s road network—both of which are multigraphs. Two experiments evaluate how each measure’s edge ranking impacts the energy flow on the network. The results demonstrate that the proposed measure effectively identifies influential edges in metric graphs that significantly change the energy distribution. Full article
Show Figures

Figure 1

19 pages, 1294 KiB  
Article
A Dynamic Multi-Graph Convolutional Spatial-Temporal Network for Airport Arrival Flow Prediction
by Yunyang Huang, Hongyu Yang and Zhen Yan
Aerospace 2025, 12(5), 395; https://doi.org/10.3390/aerospace12050395 - 30 Apr 2025
Viewed by 370
Abstract
In air traffic systems, aircraft trajectories between airports are monitored by the radar networking system forming dynamic air traffic flow. Accurate airport arrival flow prediction is significant in implementing large-scale intelligent air traffic flow management. Despite years of studies to improve prediction precision, [...] Read more.
In air traffic systems, aircraft trajectories between airports are monitored by the radar networking system forming dynamic air traffic flow. Accurate airport arrival flow prediction is significant in implementing large-scale intelligent air traffic flow management. Despite years of studies to improve prediction precision, most existing methods only focus on a single airport or simplify the traffic network as a static and simple graph. To mitigate this shortage, we propose a hybrid neural network method, called Dynamic Multi-graph Convolutional Spatial-Temporal Network (DMCSTN), to predict network-level airport arrival flow considering the multiple operation constraints and flight interactions among airport nodes. Specifically, in the spatial dimension, a novel dynamic multi-graph convolutional network is designed to adaptively model the heterogeneous and dynamic airport networks. It enables the proposed model to dynamically capture informative spatial correlations according to the input traffic features. In the temporal dimension, an enhanced self-attention mechanism is utilized to mine the arrival flow evolution patterns. Experiments on a real-world dataset from an ATFM system validate the effectiveness of DMCSTN for arrival flow forecasting tasks. Full article
(This article belongs to the Section Air Traffic and Transportation)
Show Figures

Figure 1

21 pages, 9739 KiB  
Article
AMGNet: An Attention-Guided Multi-Graph Collaborative Decision Network for Safe Medication Recommendation
by Shiji Li, Haitao Wang, Jianfeng He and Xing Chen
Electronics 2025, 14(4), 760; https://doi.org/10.3390/electronics14040760 - 15 Feb 2025
Cited by 1 | Viewed by 960
Abstract
Recommending safe and effective medication (drug) combinations is a key application of artificial intelligence in healthcare. Current methods often focus solely on recommendation accuracy while neglecting drug–drug interactions (DDIs), or overly prioritize reducing DDIs at the cost of model performance. Therefore, we propose [...] Read more.
Recommending safe and effective medication (drug) combinations is a key application of artificial intelligence in healthcare. Current methods often focus solely on recommendation accuracy while neglecting drug–drug interactions (DDIs), or overly prioritize reducing DDIs at the cost of model performance. Therefore, we propose the Attention-guided Multi-Graph collaborative decision Network (AMGNet) for safe medication recommendation, which strikes a balance between improving recommendation accuracy and minimizing DDIs. Specifically, AMGNet designs a patient feature encoder that utilizes a transformer encoder–decoder architecture to learn the temporal dependencies of longitudinal medical features from patient visits, effectively capturing the patient’s medication history and health status to enhance recommendation accuracy. AMGNet is also equipped with a medication feature encoder that integrates diverse knowledge graphs of drug molecular structure, electronic health records(EHRs), and drug–drug interactions(DDIs) through multi-graph representation learning and contrastive learning methods, further reducing the DDI rate of the recommended medication combinations and mitigating the risks associated with drug co-administration. We conducted extensive experiments on the widely used MIMIC-III and MIMIC-IV clinical medical datasets. The results demonstrate that AMGNet achieves competitive performance. Additionally, ablation studies and detailed case analyses further confirm that AMGNet offers high precision and safety in medication recommendation. Full article
Show Figures

Figure 1

18 pages, 1869 KiB  
Article
A Deepfake Image Detection Method Based on a Multi-Graph Attention Network
by Guorong Chen, Chongling Du, Yuan Yu, Hong Hu, Hongjun Duan and Huazheng Zhu
Electronics 2025, 14(3), 482; https://doi.org/10.3390/electronics14030482 - 24 Jan 2025
Viewed by 2248
Abstract
Deep forgery detection plays a crucial role in addressing the challenges posed by the rapid spread of deeply generated content that significantly erodes public trust in online information and media. Deeply forged images typically present subtle but significant artifacts in multiple regions, such [...] Read more.
Deep forgery detection plays a crucial role in addressing the challenges posed by the rapid spread of deeply generated content that significantly erodes public trust in online information and media. Deeply forged images typically present subtle but significant artifacts in multiple regions, such as in the background, lighting, and localized details. These artifacts manifest as unnatural visual distortions, inconsistent lighting, or irregularities in subtle features that break the natural coherence of the real image. To address these features of forged images, we propose a novel and efficient deep image forgery detection method that utilizes Multi-Graph Attention (MGA) techniques to extract global and local features and minimize accuracy loss. Specifically, our method introduces an interactive dual-channel encoder (DIRM), which aims to extract global and channel-specific features and facilitate complex interactions between these feature sets. In the decoding phase, one of the channels is processed as a block and combined with a Dynamic Graph Attention Network (PDGAN), which is capable of recognizing and amplifying forged traces in local information. To further enhance the model’s ability to capture global context, we propose a global Height–Width Graph Attention Module (HWGAN), which effectively extracts and associates global spatial features. Experimental results show that the classification accuracy of our method for forged images in the GenImage and CIFAKE datasets is comparable to that of the optimal benchmark method. Notably, our model achieves 97.89% accuracy on the CIFAKE dataset and has the lowest number of model parameters and lowest computational overhead. These results highlight the potential of our method for deep forgery image detection. Full article
(This article belongs to the Special Issue Application of Machine Learning in Graphics and Images, 2nd Edition)
Show Figures

Figure 1

23 pages, 3684 KiB  
Article
D-MGDCN-CLSTM: A Traffic Prediction Model Based on Multi-Graph Gated Convolution and Convolutional Long–Short-Term Memory
by Linliang Zhang, Shuyun Xu, Shuo Li, Lihu Pan and Su Gong
Sensors 2025, 25(2), 561; https://doi.org/10.3390/s25020561 - 19 Jan 2025
Viewed by 795
Abstract
Real-time and accurate traffic forecasting aids in traffic planning and design and helps to alleviate congestion. Addressing the negative impacts of partial data loss in traffic forecasting, and the challenge of simultaneously capturing short-term fluctuations and long-term trends, this paper presents a traffic [...] Read more.
Real-time and accurate traffic forecasting aids in traffic planning and design and helps to alleviate congestion. Addressing the negative impacts of partial data loss in traffic forecasting, and the challenge of simultaneously capturing short-term fluctuations and long-term trends, this paper presents a traffic forecasting model, D-MGDCN-CLSTM, based on Multi-Graph Gated Dilated Convolution and Conv-LSTM. The model uses the DTWN algorithm to fill in missing data. To better capture the dual characteristics of short-term fluctuations and long-term trends in traffic, the model employs the DWT for multi-scale decomposition to obtain approximation and detail coefficients. The Conv-LSTM processes the approximation coefficients to capture the long-term characteristics of the time series, while the multiple layers of the MGDCN process the detail coefficients to capture short-term fluctuations. The outputs of the two branches are then merged to produce the forecast results. The model is tested against 10 algorithms using the PeMSD7(M) and PeMSD7(L) datasets, improving MAE, RMSE, and ACC by an average of 1.38% and 13.89%, 1% and 1.24%, and 5.92% and 1%, respectively. Ablation experiments, parameter impact analysis, and visual analysis all demonstrate the superiority of our decompositional approach in handling the dual characteristics of traffic data. Full article
(This article belongs to the Section Vehicular Sensing)
Show Figures

Figure 1

26 pages, 1539 KiB  
Article
An Adaptive Spatio-Temporal Traffic Flow Prediction Using Self-Attention and Multi-Graph Networks
by Basma Alsehaimi, Ohoud Alzamzami, Nahed Alowidi and Manar Ali
Sensors 2025, 25(1), 282; https://doi.org/10.3390/s25010282 - 6 Jan 2025
Viewed by 1417
Abstract
Traffic flow prediction is a pivotal element in Intelligent Transportation Systems (ITSs) that provides significant opportunities for real-world applications. Capturing complex and dynamic spatio-temporal patterns within traffic data remains a significant challenge for traffic flow prediction. Different approaches to effectively modeling complex spatio-temporal [...] Read more.
Traffic flow prediction is a pivotal element in Intelligent Transportation Systems (ITSs) that provides significant opportunities for real-world applications. Capturing complex and dynamic spatio-temporal patterns within traffic data remains a significant challenge for traffic flow prediction. Different approaches to effectively modeling complex spatio-temporal correlations within traffic data have been proposed. These approaches often rely on a single model to capture temporal dependencies, which neglects the varying influences of different time periods on traffic flow. Additionally, these models frequently utilize either static or dynamic graphs to represent spatial dependencies, which limits their ability to address complex and overlapping spatial relationships. Moreover, some approaches struggle to fully capture spatio-temporal variations, leading to the exclusion of critical information and ultimately resulting in suboptimal prediction performance. Thus, this paper introduces the Adaptive Spatio-Temporal Attention-Based Multi-Model (ASTAM), an architecture designed to capture spatio-temporal dependencies within traffic data. The ASTAM employs multi-temporal gated convolution with multi-scale temporal input segments to model complex non-linear temporal correlations. It utilizes static and dynamic parallel multi-graphs to facilitate the modeling of complex spatial dependencies. Furthermore, this model incorporates a spatio-temporal self-attention mechanism to adaptively capture the dynamic and long-term spatio-temporal variations in traffic flow. Experiments conducted on four real-world datasets reveal that the proposed architecture outperformed 13 baseline approaches, achieving average reductions of 5.0% in MAE, 13.28% in RMSE, and 6.46% in MAPE across four datasets. Full article
(This article belongs to the Section Intelligent Sensors)
Show Figures

Figure 1

25 pages, 8429 KiB  
Article
Vessel Type Recognition Using a Multi-Graph Fusion Method Integrating Vessel Trajectory Sequence and Dependency Relations
by Lin Ye, Xiaohui Chen, Haiyan Liu, Ran Zhang, Bing Zhang, Yunpeng Zhao and Dewei Zhou
J. Mar. Sci. Eng. 2024, 12(12), 2315; https://doi.org/10.3390/jmse12122315 - 17 Dec 2024
Cited by 2 | Viewed by 866
Abstract
In the field of research into vessel type recognition utilizing trajectory data, researchers have primarily concentrated on developing models based on trajectory sequences to extract the relevant information. However, this approach often overlooks the crucial significance of the spatial dependency relationships among trajectory [...] Read more.
In the field of research into vessel type recognition utilizing trajectory data, researchers have primarily concentrated on developing models based on trajectory sequences to extract the relevant information. However, this approach often overlooks the crucial significance of the spatial dependency relationships among trajectory points, posing challenges for comprehensively capturing the intricate features of vessel travel patterns. To address this limitation, our study introduces a novel multi-graph fusion representation method that integrates both trajectory sequences and dependency relationships to optimize the task of vessel type recognition. The proposed method initially extracts the spatiotemporal features and behavioral semantic features from vessel trajectories. By utilizing these behavioral semantic features, the key nodes within the trajectory that exhibit dependencies are identified. Subsequently, graph structures are constructed to represent the intricate dependencies between these nodes and the sequences of trajectory points. These graph structures are then processed through graph convolutional networks (GCNs), which integrate various sources of information within the graphs to obtain behavioral representations of vessel trajectories. Finally, these representations are applied to the task of vessel type recognition for experimental validation. The experimental results indicate that this method significantly enhances vessel type recognition performance when compared to other baseline methods. Additionally, ablation experiments have been conducted to validate the effectiveness of each component of the method. This innovative approach not only delves deeply into the behavioral representations of vessel trajectories but also contributes to advancements in intelligent water traffic control. Full article
Show Figures

Figure 1

19 pages, 3317 KiB  
Article
Multi-Step Parking Demand Prediction Model Based on Multi-Graph Convolutional Transformer
by Yixiong Zhou, Xiaofei Ye, Xingchen Yan, Tao Wang and Jun Chen
Systems 2024, 12(11), 487; https://doi.org/10.3390/systems12110487 - 13 Nov 2024
Viewed by 1631
Abstract
The increase in motorized vehicles in cities and the inefficient use of parking spaces have exacerbated parking difficulties in cities. To effectively improve the utilization rate of parking spaces, it is necessary to accurately predict future parking demand. This paper proposes a deep [...] Read more.
The increase in motorized vehicles in cities and the inefficient use of parking spaces have exacerbated parking difficulties in cities. To effectively improve the utilization rate of parking spaces, it is necessary to accurately predict future parking demand. This paper proposes a deep learning model based on multi-graph convolutional Transformer, which captures geographic spatial features through a Multi-Graph Convolutional Network (MGCN) module and mines temporal feature patterns using a Transformer module to accurately predict future multi-step parking demand. The model was validated using historical parking transaction volume data from all on-street parking lots in Nanshan District, Shenzhen, from September 2018 to March 2019, and its superiority was verified through comparative experiments with benchmark models. The results show that the MGCN–Transformer model has a MAE, RMSE, and R2 error index of 0.26, 0.42, and 95.93%, respectively, in the multi-step prediction task of parking demand, demonstrating its superior predictive accuracy compared to other benchmark models. Full article
(This article belongs to the Section Artificial Intelligence and Digital Systems Engineering)
Show Figures

Figure 1

29 pages, 10329 KiB  
Article
Efficient Vehicle Detection and Optimization in Multi-Graph Mode Considering Multi-Section Tracking Based on Geographic Similarity
by Yue Chen and Jian Lu
ISPRS Int. J. Geo-Inf. 2024, 13(11), 383; https://doi.org/10.3390/ijgi13110383 - 30 Oct 2024
Viewed by 894
Abstract
Vehicle detection is an important part of modern intelligent transportation systems. At present, complex deep learning algorithms are often used for vehicle detection and tracking, but high-precision detection results are often obtained at the cost of time, and the existing research rarely considers [...] Read more.
Vehicle detection is an important part of modern intelligent transportation systems. At present, complex deep learning algorithms are often used for vehicle detection and tracking, but high-precision detection results are often obtained at the cost of time, and the existing research rarely considers optimization algorithms for vehicle information. Based on this, we propose an efficient method for vehicle detection in multi-graph mode and optimization method considering multi-section tracking based on geographic similarity. In this framework, we design a vehicle extraction method based on multi-graph mode and a vehicle detection technology based on traffic flow characteristics, which can cope with the challenge of vehicle detection under an unstable environment. Further, a multi-section tracking optimization technology based on geographic similarity at a high video frame rate is proposed, which can efficiently identify lane change behavior and match, track, and optimize vehicles. Experiments are carried out on several road sections, and the model performance and optimization effect are analyzed. The experimental results show that the vehicle detection and optimization algorithm proposed in this paper has the best effect and high detection accuracy and robustness. The average results of Recall, Precision, and F1 are 0.9715, 0.979, and 0.9752, respectively, all of which are above 0.97, showing certain competitiveness in the field of vehicle detection. Full article
Show Figures

Figure 1

25 pages, 2169 KiB  
Article
Categorical Multi-Query Subgraph Matching on Labeled Graph
by Yunhao Sun, Xiaoao Chen, Heng Chen, Ruihua Qi and Bo Ning
Electronics 2024, 13(21), 4191; https://doi.org/10.3390/electronics13214191 - 25 Oct 2024
Viewed by 1028
Abstract
Subgraph matching stands as a fundamental issue within the research realm of graph analysis. In this paper, we investigate a novel combinatorial problem that encompasses both multigraph matching and subgraph matching. The objective of this investigation is to identify all data graphs within [...] Read more.
Subgraph matching stands as a fundamental issue within the research realm of graph analysis. In this paper, we investigate a novel combinatorial problem that encompasses both multigraph matching and subgraph matching. The objective of this investigation is to identify all data graphs within a larger graph that are isomorphic to the given query graphs. Firstly, multiple query graphs are collaborated through the design of a categorical graph, which aggregates similar query graphs into a single cluster. Following this, these similarity-clustered query graphs are integrated into a unified categorical graph. Secondly, a minimal isomorphic data graph is derived from a larger data graph, guided by the categorical graph. Additionally, an analysis of the inclusive and equivalence relationships among query nodes is conducted, with the aim of minimizing redundant matching computations. Simultaneously, all subgraph isomorphic mappings of the categorical graph onto the data graph are performed. Extensive empirical evaluations, conducted on both real and synthetic datasets, demonstrate that the proposed methods surpass the state-of-the-art algorithms in performance. Full article
(This article belongs to the Section Computer Science & Engineering)
Show Figures

Figure 1

Back to TopTop