Nothing Special   »   [go: up one dir, main page]

You seem to have javascript disabled. Please note that many of the page functionalities won't work as expected without javascript enabled.
 
 
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 (105)

Search Parameters:
Keywords = ID embedding

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
15 pages, 941 KiB  
Article
Embedding Tree-Based Intrusion Detection System in Smart Thermostats for Enhanced IoT Security
by Abbas Javed, Muhammad Naeem Awais, Ayyaz-ul-Haq Qureshi, Muhammad Jawad, Jehangir Arshad and Hadi Larijani
Sensors 2024, 24(22), 7320; https://doi.org/10.3390/s24227320 - 16 Nov 2024
Viewed by 422
Abstract
IoT devices with limited resources, and in the absence of gateways, become vulnerable to various attacks, such as denial of service (DoS) and man-in-the-middle (MITM) attacks. Intrusion detection systems (IDS) are designed to detect and respond to these threats in IoT environments. While [...] Read more.
IoT devices with limited resources, and in the absence of gateways, become vulnerable to various attacks, such as denial of service (DoS) and man-in-the-middle (MITM) attacks. Intrusion detection systems (IDS) are designed to detect and respond to these threats in IoT environments. While machine learning-based IDS have typically been deployed at the edge (gateways) or in the cloud, in the absence of gateways, the IDS must be embedded within the sensor nodes themselves. Available datasets mainly contain features extracted from network traffic at the edge (e.g., Raspberry Pi/computer) or cloud servers. We developed a unique dataset, named as Intrusion Detection in the Smart Homes (IDSH) dataset, which is based on features retrievable from microcontroller-based IoT devices. In this work, a Tree-based IDS is embedded into a smart thermostat for real-time intrusion detection. The results demonstrated that the IDS achieved an accuracy of 98.71% for binary classification with an inference time of 276 microseconds, and an accuracy of 97.51% for multi-classification with an inference time of 273 microseconds. Real-time testing showed that the smart thermostat is capable of detecting DoS and MITM attacks without relying on a gateway or cloud. Full article
(This article belongs to the Special Issue Sensor Data Privacy and Intrusion Detection for IoT Networks)
Show Figures

Figure 1

Figure 1
<p>Proposed architecture of embedded IDS for smart thermostats.</p>
Full article ">Figure 2
<p>Dataset collection on smart thermostats.</p>
Full article ">Figure 3
<p>Comparison of IDS implemented with quantization and without quantization.</p>
Full article ">Figure 4
<p>Comparison of IDS implemented with CatBoost and XGBoost on the smart thermostat.</p>
Full article ">
13 pages, 3079 KiB  
Article
Molecular Alterations in Paired Epithelial Ovarian Tumors in Patients Treated with Neoadjuvant Chemotherapy
by Adamantia Nikolaidi, Eirini Papadopoulou, Dimitrios Haidopoulos, Michalis Liontos, Elena Fountzilas, Georgios Tsaousis, Kalliroi Goula, Eleftheria Tsolaki, Athina Christopoulou, Ioannis Binas, Sofia Stamatopoulou, Anna Koumarianou, Sofia Karageorgopoulou, Anna Goussia, Amanda Psyrri, Christos Papadimitriou and Helen Gogas
Cancers 2024, 16(21), 3580; https://doi.org/10.3390/cancers16213580 - 24 Oct 2024
Viewed by 760
Abstract
Background: Neoadjuvant chemotherapy (NACT) followed by interval debulking surgery (IDS) and adjuvant chemotherapy is a therapeutic choice for women with advanced ovarian cancer. Whether NACT affects the tumor’s molecular profile has not been determined. Methods: This was a retrospective study of patients with [...] Read more.
Background: Neoadjuvant chemotherapy (NACT) followed by interval debulking surgery (IDS) and adjuvant chemotherapy is a therapeutic choice for women with advanced ovarian cancer. Whether NACT affects the tumor’s molecular profile has not been determined. Methods: This was a retrospective study of patients with advanced-stage epithelial ovarian cancer treated with NACT at oncology departments affiliated with the Hellenic Cooperative Oncology Group (HeCOG). Tumor molecular profiling was performed on formalin-fixed and paraffin-embedded (FFPE) tumor pre- and post-NACT tissues. Homologous recombination deficiency (HRD), tumor-infiltrating lymphocytes (TILs), tumor molecular alterations, and tumor mutational burden (TMB) via next-generation sequencing analysis were assessed. Results: Overall, tumors from 36 patients were assessed, and molecular profiling was evaluated in 20 paired tumor samples. HRD positivity exhibited no significant change between pre- and post-NACT tumors. The BRCA1/2 mutational status remained constant, irrespective of the treatment administration. Pre-NACT tumors tended to exhibit a lower percentage of intratumoral TILs compared to post-NACT tumors (p = 0.004). Differences in the mutation profile between pre- and post-treatment tissue were observed in 33.33% (6/18) of the cases. The mean tumor cell content (TCC) (p-value: 0.0840) and the mean genomic instability score (p-value: 0.0636) decreased slightly numerically after therapy. A moderate inverse relationship was observed between the pre-NACT TMB and the chemotherapy response score (p-value: 0.038), indicating this correlation is statistically significant. Conclusion: This study provides insights into the effect of NACT on the tumor molecular landscape. While BRCA1/2 and HRD status remained stable, an increase in TIL proportion and changes in the mutational profiles were observed post-treatment. Full article
(This article belongs to the Section Molecular Cancer Biology)
Show Figures

Figure 1

Figure 1
<p>A comparison of the tumor cell content (TCC), genomic instability score (GIS), and tumor mutational burden (TMB) before and after therapy across 20 patients. The mean TCC decreased slightly after therapy, indicating a trend toward a reduction in the tumor cell count. The mean GIS score also showed a decrease after therapy, suggesting a trend towards genomic stability. The mean TMB score showed a slight decrease, but this change is not as pronounced as the others. With diamonds the outliers are visualized.</p>
Full article ">Figure 2
<p>The correlation of the change in percentage for the value of TCC relative to the change in percentage for the value of GIS. The correlation of the change in percentage for the value of TCC relative to the change in percentage for the value of TMB. The relative changes in TMB and GIS before and after therapy do not correlate with the extent of the change in the TCC.</p>
Full article ">Figure 3
<p>Comparison of tumor cell content (TCC), genomic instability score (GIS), and tumor mutational burden (TMB) before and after therapy, stratified by HRD status. Upper charts: HRD-positive patients (8 participants), Bottom Charts: HRD-negative patients (12 participants). With diamonds the outliers are visualized.</p>
Full article ">Figure 4
<p>A comparison of the distribution of Variant Allele Frequency (VAF) values for HRD-positive (<b>a</b>) and HRD-negative (<b>b</b>) patients before and after therapy. There seems to be a higher decrease in the VAF values among HRD-positive patients after therapy. With diamonds the outliers are visualized.</p>
Full article ">Figure 5
<p>Correlation between CRS and TMB values.</p>
Full article ">Figure 6
<p>Correlation between CRS and TP53 mutation Variant Allele Frequency.</p>
Full article ">
16 pages, 715 KiB  
Article
Sentence Embeddings and Semantic Entity Extraction for Identification of Topics of Short Fact-Checked Claims
by Krzysztof Węcel, Marcin Sawiński, Włodzimierz Lewoniewski, Milena Stróżyna, Ewelina Księżniak and Witold Abramowicz
Information 2024, 15(10), 659; https://doi.org/10.3390/info15100659 - 21 Oct 2024
Viewed by 936
Abstract
The objective of this research was to design a method to assign topics to claims debunked by fact-checking agencies. During the fact-checking process, access to more structured knowledge is necessary; therefore, we aim to describe topics with semantic vocabulary. Classification of topics should [...] Read more.
The objective of this research was to design a method to assign topics to claims debunked by fact-checking agencies. During the fact-checking process, access to more structured knowledge is necessary; therefore, we aim to describe topics with semantic vocabulary. Classification of topics should go beyond simple connotations like instance-class and rather reflect broader phenomena that are recognized by fact checkers. The assignment of semantic entities is also crucial for the automatic verification of facts using the underlying knowledge graphs. Our method is based on sentence embeddings, various clustering methods (HDBSCAN, UMAP, K-means), semantic entity matching, and terms importance assessment based on TF-IDF. We represent our topics in semantic space using Wikidata Q-ids, DBpedia, Wikipedia topics, YAGO, and other relevant ontologies. Such an approach based on semantic entities also supports hierarchical navigation within topics. For evaluation, we compare topic modeling results with claims already tagged by fact checkers. The work presented in this paper is useful for researchers and practitioners interested in semantic topic modeling of fake news narratives. Full article
Show Figures

Figure 1

Figure 1
<p>Hierarchy of classes.</p>
Full article ">Figure 2
<p>Workflow of the system.</p>
Full article ">Figure 3
<p>Distribution of words among topics for PolitiFact subset modeled with LDA with 20 topics and DMM with 80 topics.</p>
Full article ">Figure 4
<p>Distribution of terms among topics for custom methods.</p>
Full article ">Figure 5
<p>Distribution of ontology terms among topics for custom methods.</p>
Full article ">Figure 6
<p>Accuracy of various topic modeling methods, for PolitiFact with 80 topics.</p>
Full article ">Figure 7
<p>Accuracy of custom methods, for various tag assignment approaches.</p>
Full article ">Figure 8
<p>Coherence of 20 topics for various topic modeling methods.</p>
Full article ">Figure 9
<p>Coherence of topics produced by our methods.</p>
Full article ">Figure A1
<p>Full set of term frequencies for two datasets, with two clustering methods and various generalization schemes, part 1. The same terms are encoded with the same color.</p>
Full article ">Figure A1 Cont.
<p>Full set of term frequencies for two datasets, with two clustering methods and various generalization schemes, part 1. The same terms are encoded with the same color.</p>
Full article ">Figure A2
<p>Full set of term frequencies for two datasets, with two clustering methods and various generalization schemes, part 2. The same terms are encoded with the same color.</p>
Full article ">Figure A2 Cont.
<p>Full set of term frequencies for two datasets, with two clustering methods and various generalization schemes, part 2. The same terms are encoded with the same color.</p>
Full article ">
11 pages, 1312 KiB  
Article
Co-Occurrence of Two Plasmids Encoding Transferable blaNDM-1 and tet(Y) Genes in Carbapenem-Resistant Acinetobacter bereziniae
by Andrés Opazo-Capurro, Kyriaki Xanthopoulou, Rocío Arazo del Pino, Paulina González-Muñoz, Maximiliano Matus-Köhler, Luis Amsteins-Romero, Christian Jerez-Olate, Juan Carlos Hormazábal, Rodrigo Vera, Felipe Aguilera, Sebastián Fuller, Paul G. Higgins and Gerardo González-Rocha
Genes 2024, 15(9), 1213; https://doi.org/10.3390/genes15091213 - 17 Sep 2024
Viewed by 950
Abstract
Acinetobacter bereziniae has emerged as a significant human pathogen, acquiring multiple antibiotic resistance genes, including carbapenemases. This study focuses on characterizing the plasmids harboring the blaNDM-1 and tet(Y) genes in two carbapenem-resistant A. bereziniae isolates (UCO-553 and UCO-554) obtained in Chile [...] Read more.
Acinetobacter bereziniae has emerged as a significant human pathogen, acquiring multiple antibiotic resistance genes, including carbapenemases. This study focuses on characterizing the plasmids harboring the blaNDM-1 and tet(Y) genes in two carbapenem-resistant A. bereziniae isolates (UCO-553 and UCO-554) obtained in Chile during the COVID-19 pandemic. Methods: Antibiotic susceptibility testing was conducted on UCO-553 and UCO-554. Both isolates underwent whole-genome sequencing to ascertain their sequence type (ST), core genome multilocus sequence-typing (cgMLST) profile, antibiotic resistance genes, plasmids, and mobile genetic elements. Conjugation experiments were performed for both isolates. Results: Both isolates exhibited broad resistance, including resistance to carbapenems, third-generation cephalosporins, fluoroquinolones, tetracycline, cotrimoxazole, and aminoglycosides. Both isolates belong to sequence type STPAS1761, with a difference of 17 out of 2984 alleles. Each isolate carried a 47,274 bp plasmid with blaNDM-1 and aph(3′)-VI genes and two highly similar plasmids: a 35,184 bp plasmid with tet(Y), sul2, aph(6)-Id, and aph(3″)-Ib genes, and a 6078 bp plasmid containing the ant(2″)-Ia gene. Quinolone-resistance mutations were identified in the gyrA and parC genes of both isolates. Importantly, blaNDM-1 was located within a Tn125 transposon, and tet(Y) was embedded in a Tn5393 transposon. Conjugation experiments successfully transferred blaNDM-1 and tet(Y) into the A. baumannii ATCC 19606 strain, indicating the potential for horizontal gene transfer. Conclusions: This study highlights the critical role of plasmids in disseminating resistance genes in A. bereziniae and underscores the need for the continued genomic surveillance of this emerging pathogen. The findings emphasize the importance of monitoring A. bereziniae for its potential to cause difficult-to-treat infections and its capacity to spread resistance determinants against clinically significant antibiotics. Full article
Show Figures

Figure 1

Figure 1
<p>Graphical representation of 47,274 bp plasmids harbored by <span class="html-italic">A. bereziniae</span> UCO-553 and UCO-554 strains. Arrows indicate the length and directions of genes and ORFs. Tn<span class="html-italic">125</span> is indicated in the red line. Genes annotations were performed by the NCBI Prokaryotic Genome Annotation Pipeline (PGAP), whereas the plasmid was visualized using Proksee and edited using Inkscape v1.2.</p>
Full article ">Figure 2
<p>Comparative linear maps of the <span class="html-italic">tet</span>(Y)-encoding plasmids harbored by UCO-553 and UCO-554 strains. Arrows indicate the length and directions of genes and ORFs. Antibiotics-resistant genes (ARGs) are marked in red, insertions sequences (IS) and transposases are in green, plasmid mobilization proteins genes in yellow, other genes are in blue and hypothetical proteins in white. Tn<span class="html-italic">5393</span> is denoted in the red rectangle. Gene annotations were performed by the NCBI Prokaryotic Genome Annotation Pipeline (PGAP), whereas genomic alignment was facilitated by clinker v0.0.23 [<a href="#B31-genes-15-01213" class="html-bibr">31</a>] and the figure was processed using Inkscape v1.2.</p>
Full article ">
28 pages, 605 KiB  
Article
A Convolutional Neural Network with Hyperparameter Tuning for Packet Payload-Based Network Intrusion Detection
by Ammar Boulaiche, Sofiane Haddad and Ali Lemouari
Symmetry 2024, 16(9), 1151; https://doi.org/10.3390/sym16091151 - 4 Sep 2024
Viewed by 1082
Abstract
In the last few years, the use of convolutional neural networks (CNNs) in intrusion detection domains has attracted more and more attention. However, their results in this domain have not lived up to expectations compared to the results obtained in other domains, such [...] Read more.
In the last few years, the use of convolutional neural networks (CNNs) in intrusion detection domains has attracted more and more attention. However, their results in this domain have not lived up to expectations compared to the results obtained in other domains, such as image classification and video analysis. This is mainly due to the datasets used, which contain preprocessed features that are not compatible with convolutional neural networks, as they do not allow a full exploit of all the information embedded in the original network traffic. With the aim of overcoming these issues, we propose in this paper a new efficient convolutional neural network model for network intrusion detection based on raw traffic data (pcap files) rather than preprocessed data stored in CSV files. The novelty of this paper lies in the proposal of a new method for adapting the raw network traffic data to the most suitable format for CNN models, which allows us to fully exploit the strengths of CNNs in terms of pattern recognition and spatial analysis, leading to more accurate and effective results. Additionally, to further improve its detection performance, the structure and hyperparameters of our proposed CNN-based model are automatically adjusted using the self-adaptive differential evolution (SADE) metaheuristic, in which symmetry plays an essential role in balancing the different phases of the algorithm, so that each phase can contribute in an equal and efficient way to finding optimal solutions. This helps to make the overall performance more robust and efficient when solving optimization problems. The experimental results on three datasets, KDD-99, UNSW-NB15, and CIC-IDS2017, show a strong symmetry between the frequency values implemented in the images built for each network traffic and the different attack classes. This was confirmed by a good predictive accuracy that goes well beyond similar competing models in the literature. Full article
(This article belongs to the Section Computer)
Show Figures

Figure 1

Figure 1
<p>The block diagram of our proposed intrusion detection framework.</p>
Full article ">Figure 2
<p>Overall structure of our CNN model before hyperparameter tuning.</p>
Full article ">Figure 3
<p>Accuracy curves during the training of our three multiclass classification models.</p>
Full article ">Figure 4
<p>Loss curves during the training of our three multiclass classification models.</p>
Full article ">Figure 5
<p>Confusion matrix of our CNN model on KDD’99.</p>
Full article ">Figure 6
<p>Confusion matrix of our CNN model on UNSW-NB15.</p>
Full article ">Figure 7
<p>Confusion matrix of our CNN model on CICIDS2017.</p>
Full article ">Figure 8
<p>Performance of the KDD-based CNN model.</p>
Full article ">Figure 9
<p>Performance of the UNSW15-based CNN model.</p>
Full article ">Figure 10
<p>Performance of the CICIDS2017-based CNN model.</p>
Full article ">
15 pages, 634 KiB  
Article
RGMeta: Enhancing Cold-Start Recommendations with a Residual Graph Meta-Embedding Model
by Fuzhe Zhao, Chaoge Huang, Han Xu, Wen Yang and Wenlin Han
Electronics 2024, 13(17), 3473; https://doi.org/10.3390/electronics13173473 - 1 Sep 2024
Viewed by 601
Abstract
Traditional recommendation models grapple with challenges such as the scarcity of similar user or item references and data sparsity, rendering the cold-start problem particularly formidable. Meta-learning has emerged as a promising avenue to address these issues, particularly in solving the item cold-start problem [...] Read more.
Traditional recommendation models grapple with challenges such as the scarcity of similar user or item references and data sparsity, rendering the cold-start problem particularly formidable. Meta-learning has emerged as a promising avenue to address these issues, particularly in solving the item cold-start problem by generating meta-embeddings for new items as their initial ID embeddings. This approach has shown notable success in enhancing the accuracy of click-through rate predictions. However, prevalent meta-embedding models often focus solely on the attribute features of the item, neglecting crucial user information associated with it during the generation of initial ID embeddings for new items. This oversight hinders the exploitation of valuable user-related information to enhance the quality and accuracy of the initial ID embedding. To tackle this limitation, we introduce the residual graph meta-embedding model (RGMeta). RGMeta adopts a comprehensive approach by considering both the attribute features and target users of both old and new items. Through the integration of residual connections, the model effectively combines the representation information of the old neighbor items with the intrinsic features of the new item, resulting in an improved initial ID embedding generation. Experimental results demonstrate that RGMeta significantly enhances the performance of the cold-start phase, showcasing its effectiveness in overcoming challenges associated with sparse data and limited reference points. Our proposed model presents a promising step forward in leveraging both item attributes and user-related information to address cold-start problems in recommendation systems. Full article
Show Figures

Figure 1

Figure 1
<p>A typical deep learning recommendation model.</p>
Full article ">Figure 2
<p>Example of ID embeddings for new and old items.</p>
Full article ">Figure 3
<p>The framework of RGMeta.</p>
Full article ">Figure 4
<p>Performance in the warm-up phase on the DNN prediction model. (<b>a</b>) MovieLens-1M (<b>b</b>) Taobao Ad.</p>
Full article ">Figure 5
<p>Effect of the equilibrium coefficient (the main prediction model is DNN).</p>
Full article ">Figure 6
<p>Effect of the number of neighborhood items (main prediction model is DNN).</p>
Full article ">
20 pages, 12214 KiB  
Article
MIMA: Multi-Feature Interaction Meta-Path Aggregation Heterogeneous Graph Neural Network for Recommendations
by Yang Li, Shichao Yan, Fangtao Zhao, Yi Jiang, Shuai Chen, Lei Wang and Li Ma
Future Internet 2024, 16(8), 270; https://doi.org/10.3390/fi16080270 - 29 Jul 2024
Viewed by 4377
Abstract
Meta-path-based heterogeneous graph neural networks have received widespread attention for better mining the similarities between heterogeneous nodes and for discovering new recommendation rules. Most existing models depend solely on node IDs for learning node embeddings, failing to leverage attribute information fully and to [...] Read more.
Meta-path-based heterogeneous graph neural networks have received widespread attention for better mining the similarities between heterogeneous nodes and for discovering new recommendation rules. Most existing models depend solely on node IDs for learning node embeddings, failing to leverage attribute information fully and to clarify the reasons behind a user’s interest in specific items. A heterogeneous graph neural network for recommendation named MIMA (multi-feature interaction meta-path aggregation) is proposed to address these issues. Firstly, heterogeneous graphs consisting of user nodes, item nodes, and their feature nodes are constructed, and the meta-path containing users, items, and their attribute information is used to capture the correlations among different types of nodes. Secondly, MIMA integrates attention-based feature interaction and meta-path information aggregation to uncover structural and semantic information. Then, the constructed meta-path information is subjected to neighborhood aggregation through graph convolution to acquire the correlations between different types of nodes and to further facilitate high-order feature fusion. Furthermore, user and item embedding vector representations are obtained through multiple iterations. Finally, the effectiveness and interpretability of the proposed approach are validated on three publicly available datasets in terms of NDCG, precision, and recall and are compared to all baselines. Full article
(This article belongs to the Special Issue Deep Learning in Recommender Systems)
Show Figures

Figure 1

Figure 1
<p>The heterogeneous graph with attributes and meta-path construction.</p>
Full article ">Figure 2
<p>Meta-path encoding and aggregation strategy.</p>
Full article ">Figure 3
<p>The aggregation layer of the MIMA algorithm.</p>
Full article ">Figure 4
<p>The comprehensive model architecture diagram illustrating the proposed MIMA algorithm.</p>
Full article ">Figure 5
<p>The impact of different feature extraction methods and the presence or absence of meta-paths on the MIMA model.</p>
Full article ">Figure 6
<p>The impact of different regularization coefficients on the results of the MIMA model.</p>
Full article ">Figure 7
<p>The impact of key parameter feature embedding dimensions on the results of the MIMA model.</p>
Full article ">Figure 8
<p>(<b>a</b>) The result of the BPR loss function changing with training time. (<b>b</b>) The result of the MF loss function value changing with training time.</p>
Full article ">Figure 9
<p>The impact of the length of the meta-path on the results.</p>
Full article ">Figure 10
<p>Interpretability analysis of MIMA model on KuaiRec dataset.</p>
Full article ">
16 pages, 714 KiB  
Article
A Multimodal Graph Recommendation Method Based on Cross-Attention Fusion
by Kai Li, Long Xu, Cheng Zhu and Kunlun Zhang
Mathematics 2024, 12(15), 2353; https://doi.org/10.3390/math12152353 - 28 Jul 2024
Viewed by 986
Abstract
Research on recommendation methods using multimodal graph information presents a significant challenge within the realm of information services. Prior studies in this area have lacked precision in the purification and denoising of multimodal information and have insufficiently explored fusion methods. We introduce a [...] Read more.
Research on recommendation methods using multimodal graph information presents a significant challenge within the realm of information services. Prior studies in this area have lacked precision in the purification and denoising of multimodal information and have insufficiently explored fusion methods. We introduce a multimodal graph recommendation approach leveraging cross-attention fusion. This model enhances and purifies multimodal information by embedding the IDs of items and their corresponding interactive users, thereby optimizing the utilization of such information. To facilitate better integration, we propose a cross-attention mechanism-based multimodal information fusion method, which effectively processes and merges related and differential information across modalities. Experimental results on three public datasets indicated that our model performed exceptionally well, demonstrating its efficacy in leveraging multimodal information. Full article
(This article belongs to the Section Mathematics and Computer Science)
Show Figures

Figure 1

Figure 1
<p>(<b>I</b>) The overall framework. (<b>II</b>) The multimodal information refinement method enhanced by item and interaction user ID features. (<b>III</b>) The multimodal feature fusion module based on cross-attention mechanism.</p>
Full article ">Figure 2
<p>Performance Comparison with different modalities.</p>
Full article ">Figure 3
<p>Performance comparison of different numbers of neighbors <span class="html-italic">k</span>.</p>
Full article ">Figure 4
<p>The distribution of representations in visual modality.</p>
Full article ">Figure 5
<p>The distribution of representations in text modality.</p>
Full article ">
22 pages, 989 KiB  
Article
Intra-Frame Graph Structure and Inter-Frame Bipartite Graph Matching with ReID-Based Occlusion Resilience for Point Cloud Multi-Object Tracking
by Shaoyu Sun, Chunhao Shi, Chunyang Wang, Qing Zhou, Rongliang Sun, Bo Xiao, Yueyang Ding and Guan Xi
Electronics 2024, 13(15), 2968; https://doi.org/10.3390/electronics13152968 - 27 Jul 2024
Viewed by 538
Abstract
Three-dimensional multi-object tracking (MOT) using lidar point cloud data is crucial for applications in autonomous driving, smart cities, and robotic navigation. It involves identifying objects in point cloud sequence data and consistently assigning unique identities to them throughout the sequence. Occlusions can lead [...] Read more.
Three-dimensional multi-object tracking (MOT) using lidar point cloud data is crucial for applications in autonomous driving, smart cities, and robotic navigation. It involves identifying objects in point cloud sequence data and consistently assigning unique identities to them throughout the sequence. Occlusions can lead to missed detections, resulting in incorrect data associations and ID switches. To address these challenges, we propose a novel point cloud multi-object tracker called GBRTracker. Our method integrates an intra-frame graph structure into the backbone to extract and aggregate spatial neighborhood node features, significantly reducing detection misses. We construct an inter-frame bipartite graph for data association and design a sophisticated cost matrix based on the center, box size, velocity, and heading angle. Using a minimum-cost flow algorithm to achieve globally optimal matching, thereby reducing ID switches. For unmatched detections, we design a motion-based re-identification (ReID) feature embedding module, which uses velocity and the heading angle to calculate similarity and association probability, reconnecting them with their corresponding trajectory IDs or initializing new tracks. Our method maintains high accuracy and reliability, significantly reducing ID switches and trajectory fragmentation, even in challenging scenarios. We validate the effectiveness of GBRTracker through comparative and ablation experiments on the NuScenes and Waymo Open Datasets, demonstrating its superiority over state-of-the-art methods. Full article
(This article belongs to the Section Computer Science & Engineering)
Show Figures

Figure 1

Figure 1
<p>Our tracker pipeline.</p>
Full article ">Figure 2
<p>Overview of GBRTracker architecture. First, we design a graph-enhanced detector to improve spatial features and reduce occlusion-related detection errors. Then, we design a pairwise cost matrix to represent the bipartite graph matching between tracks and detections, minimizing ID switches. Finally, for unmatched detections, we design motion-based ReID and track features to reconnect, initialize, or terminate trajectories, handling temporary occlusions effectively.</p>
Full article ">Figure 3
<p>KNN voxel graph visualization. (<b>a</b>) VoxelNet detector extracts voxel features, (<b>b</b>) KNN graph is constructed in feature space, not D Euclidean space; (<b>c</b>) adaptive GraphConv is used on each edge, and features are aggregated by max-pooling.</p>
Full article ">Figure 4
<p>Bipartite graph matching for data association. The current frame is processed by the detector, and features from the last frame’s tracks are used for bipartite graph matching, which reduces computational redundancy compared to an adjacency matrix. We design an objective function and a cost matrix, applying the minimum-cost algorithm to achieve the final matching results.</p>
Full article ">Figure 5
<p>Trajectory management and track update. We use the ranked score to choose the detection for matching. By computing the unmatched detections and the last-frame of trajectories based on ReID embedding feature similarity, we can improve the accuracy of tracking. Specifically, we use softmax to normalize the similarity for association probability within maximum-age frames.</p>
Full article ">Figure 6
<p>Comparison of AMOTA results overall and for seven classes, namely, bicycle, bus, car, motorcycle, pedestrian, trailer, and truck, on NuScenes validation set.</p>
Full article ">Figure 7
<p>Temporal occlusion tracking. (<b>a</b>) A tracking scenario with two objects, marked by yellow stars. (<b>b</b>) An unmatched low detection score for the pink object and an ID switch to the blue pedestrian. (<b>c</b>) An ID switch from a vehicle to a pedestrian. (<b>d</b>) Correct ID. (<b>e</b>) A temporal ID switch and re-tracking of the object with the correct ID.</p>
Full article ">Figure 8
<p>Comparison of AMOTA results for cars and pedestrians with different K values on the NuScenes validation set.</p>
Full article ">Figure 9
<p>An ablation study of the impact of a detection-to-track score on track assignment and confidence score.</p>
Full article ">Figure 10
<p>Failure cases. (<b>1</b>) Object Suddenly Appears with Delayed Tracking: The black bounding box represents the ground truth, pink indicates low detection confidence, red shows high detection confidence, and blue represents invalid states. In this scenario, the object suddenly appears with low confidence and is not immediately initialized as a new track, leading to a delayed tracking response. (<b>2</b>) Tracking Failure Due to Complete Occlusion: The object is completely occluded by other objects, causing the tracking algorithm to fail, as the detector cannot predict the proposal for the occluded object.</p>
Full article ">
14 pages, 835 KiB  
Article
Deep-Autoencoder-Based Radar Source Recognition: Addressing Large-Scale Imbalanced Data and Edge Computing Constraints
by Yuehua Liu, Xiaoyu Li and Jifei Fang
Electronics 2024, 13(15), 2891; https://doi.org/10.3390/electronics13152891 - 23 Jul 2024
Viewed by 946
Abstract
Radar radiation source recognition technology is vital in electronic countermeasures, electromagnetic control, and air traffic management. Its primary function is to identify radar signals in real time by computing and inferring the parameters of intercepted signals. With the rapid advancement of AI technology, [...] Read more.
Radar radiation source recognition technology is vital in electronic countermeasures, electromagnetic control, and air traffic management. Its primary function is to identify radar signals in real time by computing and inferring the parameters of intercepted signals. With the rapid advancement of AI technology, deep learning algorithms have shown promising results in addressing the challenges of radar radiation source recognition. However, significant obstacles remain: the radar radiation source data often exhibit large-scale, unbalanced sample distribution and incomplete sample labeling, resulting in limited training data resources. Additionally, in practical applications, models must be deployed on outdoor edge computing terminals, where the storage and computing capabilities of lightweight embedded systems are limited. This paper focuses on overcoming the constraints posed by data resources and edge computing capabilities to design and deploy large-scale radar radiation source recognition algorithms. Initially, it addresses the issues related to large-scale radar radiation source samples through data analysis, preprocessing, and feature selection, extracting and forming prior knowledge information. Subsequently, a model named RIR-DA (Radar ID Recognition based on Deep Learning Autoencoder) is developed, integrating this prior knowledge. The RIR-DA model successfully identified 96 radar radiation source targets with an accuracy exceeding 95% in a dataset characterized by a highly imbalanced sample distribution. To tackle the challenges of poor migration effects and low computational efficiency on lightweight edge computing platforms, a parallel acceleration scheme based on the embedded microprocessor T4240 is designed. This approach achieved a nearly eightfold increase in computational speed while maintaining the original training performance. Furthermore, an integrated solution for a radar radiation source intelligent detection system combining PC devices and edge devices is preliminarily designed. Experimental results demonstrate that, compared to existing radar radiation source target recognition algorithms, the proposed method offers superior model performance and greater practical extensibility. This research provides an innovative exploratory solution for the industrial application of deep learning models in radar radiation source recognition. Full article
(This article belongs to the Section Computer Science & Engineering)
Show Figures

Figure 1

Figure 1
<p>The distribution ratio of radar source target category rid in the different sample sets.</p>
Full article ">Figure 2
<p>The RIR-DA model framework.</p>
Full article ">Figure 3
<p>RIR-DA model network structure diagram.</p>
Full article ">Figure 4
<p>Radar radiation source signal intelligent identification system infrastructure.</p>
Full article ">Figure 5
<p>Convergence of RIR-DA model loss on different sample sets.</p>
Full article ">Figure 6
<p>The change in categorical accuracy of RIR-DA during training on the different sample sets.</p>
Full article ">
15 pages, 17295 KiB  
Article
Progressive Discriminative Feature Learning for Visible-Infrared Person Re-Identification
by Feng Zhou, Zhuxuan Cheng, Haitao Yang, Yifeng Song and Shengpeng Fu
Electronics 2024, 13(14), 2825; https://doi.org/10.3390/electronics13142825 - 18 Jul 2024
Viewed by 706
Abstract
The visible-infrared person re-identification (VI-ReID) task aims to retrieve the same pedestrian between visible and infrared images. VI-ReID is a challenging task due to the huge modality discrepancy and complex intra-modality variations. Existing works mainly complete the modality alignment at one stage. However, [...] Read more.
The visible-infrared person re-identification (VI-ReID) task aims to retrieve the same pedestrian between visible and infrared images. VI-ReID is a challenging task due to the huge modality discrepancy and complex intra-modality variations. Existing works mainly complete the modality alignment at one stage. However, aligning modalities at different stages has positive effects on the intra-class and inter-class distances of cross-modality features, which are often ignored. Moreover, discriminative features with identity information may be corrupted in the processing of modality alignment, further degrading the performance of person re-identification. In this paper, we propose a progressive discriminative feature learning (PDFL) network that adopts different alignment strategies at different stages to alleviate the discrepancy and learn discriminative features progressively. Specifically, we first design an adaptive cross fusion module (ACFM) to learn the identity-relevant features via modality alignment with channel-level attention. For well preserving identity information, we propose a dual-attention-guided instance normalization module (DINM), which can well guide instance normalization to align two modalities into a unified feature space through channel and spatial information embedding. Finally, we generate multiple part features of a person to mine subtle differences. Multi-loss optimization is imposed during the training process for more effective learning supervision. Extensive experiments on the public datasets of SYSU-MM01 and RegDB validate that our proposed method performs favorably against most state-of-the-art methods. Full article
(This article belongs to the Special Issue Deep Learning-Based Image Restoration and Object Identification)
Show Figures

Figure 1

Figure 1
<p>(<b>a</b>) Illustration of metric learning. These methods constrain the network to obtain discriminative and modality-shared features with specifically designed loss functions. (<b>b</b>) Illustration of image translation-based methods. These methods alleviate the modality discrepancy by converting two different modalities to an intermediate modality. (<b>c</b>) Illustration of proposed PDFL. The motivation of our PDFL is to align visible features with infrared features by instance normalization (IN) while preserving identity information, which is important for identification but likely to be damaged in the alignment process.</p>
Full article ">Figure 2
<p>(<b>a</b>–<b>d</b>) show the intra-class and inter-class distances of cross-modality features when using instance normalization (IN) at different stages of feature extraction. The intra-class and inter-class distances are indicated in blue and green colors, respectively. The vertical lines are the means of inter-class and intra-class distances.</p>
Full article ">Figure 3
<p>Framework of the proposed PDFL. (1) The features of two modalities are sent into the ACFM and DINM to alleviate the modality discrepancy progressively while maintaining the identity information. (2) PFL generates different body part features of one person to learn more discriminative features. The output of the last DINM <math display="inline"><semantics> <msub> <mi mathvariant="bold-italic">f</mi> <mi>d</mi> </msub> </semantics></math> is concatenated with the generated body part features for identity prediction after global average pooling.</p>
Full article ">Figure 4
<p>The operation of X Pooling and Y Pooling in DINM. (<b>a</b>) X Pooling, (<b>b</b>) Y Pooling.</p>
Full article ">Figure 5
<p>The comparison results on the SYSU-MM01 dataset. (<b>a</b>) The person re-identification results of the baseline model. (<b>b</b>) The person re-identification results of our PDFL.</p>
Full article ">Figure 6
<p>Ablation result with different numbers of the body part in part-level feature learning.</p>
Full article ">Figure 7
<p>The learned features is visualized via t-SNE. Different colors represent different identities in the testing set of SYSU-MM01. The circles and crosses indicate the visible features and infrared features, separately. (<b>a</b>) Feature distribution of the baseline method that is only pre-trained on ImageNet; (<b>b</b>) feature distribution of the baseline method; (<b>c</b>) feature distribution of PDFL.</p>
Full article ">Figure 8
<p>Attention maps extracted by the baseline and PDFL. The middle row and the bottom row are extracted by the baseline and PDFL, separately.</p>
Full article ">
18 pages, 1594 KiB  
Article
Performance Study on the Use of Genetic Algorithm for Reducing Feature Dimensionality in an Embedded Intrusion Detection System
by João Lobo Silva, Rui Fernandes and Nuno Lopes
Systems 2024, 12(7), 243; https://doi.org/10.3390/systems12070243 - 8 Jul 2024
Viewed by 1174
Abstract
Intrusion Detection Systems play a crucial role in a network. They can detect different network attacks and raise warnings on them. Machine Learning-based IDSs are trained on datasets that, due to the context, are inherently large, since they can contain network traffic from [...] Read more.
Intrusion Detection Systems play a crucial role in a network. They can detect different network attacks and raise warnings on them. Machine Learning-based IDSs are trained on datasets that, due to the context, are inherently large, since they can contain network traffic from different time periods and often include a large number of features. In this paper, we present two contributions: the study of the importance of Feature Selection when using an IDS dataset, while striking a balance between performance and the number of features; and the study of the feasibility of using a low-capacity device, the Nvidia Jetson Nano, to implement an IDS. The results, comparing the GA with other well-known techniques in Feature Selection and Dimensionality Reduction, show that the GA has the best F1-score of 76%, among all feature/dimension sizes. Although the processing time to find the optimal set of features surpasses other methods, we observed that the reduction in the number of features decreases the GA processing time without a significant impact on the F1-score. The Jetson Nano allows the classification of network traffic with an overhead of 10 times in comparison to a traditional server, paving the way to a near real-time GA-based embedded IDS. Full article
(This article belongs to the Special Issue Intelligent Systems and Cybersecurity)
Show Figures

Figure 1

Figure 1
<p>System architecture.</p>
Full article ">Figure 2
<p>Genetic encoding of dataset.</p>
Full article ">Figure 3
<p>Single-Point Crossover.</p>
Full article ">Figure 4
<p>Multiple-Point Crossover.</p>
Full article ">Figure 5
<p>Number of features vs. F1-score (XX axis is in log scale).</p>
Full article ">Figure 6
<p>Time vs. number of features (YY axis is in log scale).</p>
Full article ">Figure 7
<p>Time vs. number of features in the Jetson Nano (YY axis is in log scale).</p>
Full article ">
14 pages, 4243 KiB  
Article
Multi-Object Tracking with Grayscale Spatial-Temporal Features
by Longxiang Xu and Guosheng Wu
Appl. Sci. 2024, 14(13), 5900; https://doi.org/10.3390/app14135900 - 5 Jul 2024
Viewed by 842
Abstract
In recent multiple object tracking (MOT) research, there have not been many traditional methods and optimizations for matching. Most of today’s popular tracking methods are implemented using deep learning. But many monitoring devices do not have high computing power, so real-time tracking via [...] Read more.
In recent multiple object tracking (MOT) research, there have not been many traditional methods and optimizations for matching. Most of today’s popular tracking methods are implemented using deep learning. But many monitoring devices do not have high computing power, so real-time tracking via neural networks is difficult. Furthermore, matching takes less time than detection and embedding, but it still takes some time, especially for many targets in a scene. Therefore, in order to solve these problems, we propose a new method by using grayscale maps to obtain spatial-temporal features based on traditional methods. Using this method allows us to directly find the position and region in previous frames of the target and significantly reduce the number of IDs that the target needs to match. At the same time, compared to some end-to-end paradigms, our method can quickly obtain spatial-temporal features using traditional methods, which reduces some calculations. Further, we joined embedding and matching to further reduce the time spent on tracking. Our method reduces the calculations in feature extraction and reduces unnecessary matching in the matching stage. Our method was evaluated on benchmark dataset MOT16, and it achieved great performance; the tracking accuracy metric MOTA reached 46.7%. The tracking FPS reached 17.6, and it ran only on a CPU without GPU acceleration. Full article
(This article belongs to the Special Issue Artificial Intelligence in Computer Vision and Object Detection)
Show Figures

Figure 1

Figure 1
<p>The framework of our method.</p>
Full article ">Figure 2
<p>Target spatial-temporal features and region spatial-temporal features. The red bounding box is target-STF, the purple bounding box is region-STF.</p>
Full article ">Figure 3
<p>The process of obtaining spatial-temporal features. In the image <math display="inline"><semantics> <mrow> <mi mathvariant="bold-italic">P</mi> <mi mathvariant="bold-italic">s</mi> <msub> <mi mathvariant="bold-italic">I</mi> <mi mathvariant="bold-italic">t</mi> </msub> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi mathvariant="bold-italic">R</mi> <mi mathvariant="bold-italic">s</mi> <msub> <mi mathvariant="bold-italic">I</mi> <mi mathvariant="bold-italic">t</mi> </msub> </mrow> </semantics></math>, for the convenience of observation, different grayscale values are chosen for the target.</p>
Full article ">Figure 4
<p>The spatial-temporal feature matching process. The blue rectangular box is the detected target. The red rectangular box is the set of target-STF. The green rectangular box is the set of region-STFs. The black rectangular box is the set of targets.</p>
Full article ">Figure 5
<p>The ID matching process. The red box represents the detected target. The green box represents the continuously detected target. The blue box represents re-detected target or new target.</p>
Full article ">Figure 6
<p>Examples of long-term occlusion. The top row is the visualization result of the tracker on MOT16-09. The bottom row is the visualization result of the tracker on MOT16-02.</p>
Full article ">
23 pages, 4379 KiB  
Article
Enhancing Multi-Class Attack Detection in Graph Neural Network through Feature Rearrangement
by Hong-Dang Le and Minho Park
Electronics 2024, 13(12), 2404; https://doi.org/10.3390/electronics13122404 - 19 Jun 2024
Cited by 1 | Viewed by 1395
Abstract
As network sizes grow, attack schemes not only become more varied but also increase in complexity. This diversification leads to a proliferation of attack variants, complicating the identification and differentiation of potential threats. Enhancing system security necessitates the implementation of multi-class intrusion detection [...] Read more.
As network sizes grow, attack schemes not only become more varied but also increase in complexity. This diversification leads to a proliferation of attack variants, complicating the identification and differentiation of potential threats. Enhancing system security necessitates the implementation of multi-class intrusion detection systems. This approach enables the categorization of incoming network traffic into distinct intrusion types and illustrates the specific attack encountered within the Internet. Numerous studies have leveraged deep learning (DL) for Network-based Intrusion Detection Systems (NIDS), aiming to improve intrusion detection. Among these DL algorithms, Graph Neural Networks (GNN) stand out for their ability to efficiently process unstructured data, especially network traffic, making them particularly suitable for NIDS applications. Although NIDS usually monitors incoming and outgoing flows in a network, represented as edge features in graph format, traditional GNN studies only consider node features, overlooking edge features. This oversight can result in losing important flow data and diminish the system’s ability to detect attacks effectively. To address this limitation, our research makes several key contributions: (1) Emphasize the significance of edge features for enhancing GNN for multi-class intrusion detection, (2) Utilize port information, which is essential for identifying attacks but often overlooked during training, (3) Reorganize features embedded within the graph. By doing this, the graph can represent close to the actual network, which is the node showing endpoint identification information such as IP addresses and ports; the edge contains information related to flow such as Duration, Number of Packet/s, and Length…; (4) Compared to traditional methods, our experiments demonstrate significant performance improvements on both CIC-IDS-2017 (98.32%) and UNSW-NB15 (96.71%) datasets. Full article
(This article belongs to the Special Issue AI Security and Safety)
Show Figures

Figure 1

Figure 1
<p>Classification methods (<b>a</b>) Binary classification (<b>b</b>) Multi-class classification.</p>
Full article ">Figure 2
<p>Structured and Unstructured data (<b>a</b>) Structured Data (<b>b</b>) Unstructured Data.</p>
Full article ">Figure 3
<p>GNN Architecture for Network Flow Data Analysis.</p>
Full article ">Figure 4
<p>GraphSAGE framework.</p>
Full article ">Figure 5
<p>Inductive Learning and Transductive Learning.</p>
Full article ">Figure 6
<p>Network Flow Visualization (<b>a</b>) Two edges in the same node (<b>b</b>) One edge for each pair of nodes.</p>
Full article ">Figure 7
<p>Graph Construction.</p>
Full article ">Figure 8
<p>Node Embedding Process.</p>
Full article ">Figure 9
<p>Model Framework.</p>
Full article ">Figure 10
<p>ExperimentWorkflow.</p>
Full article ">Figure 11
<p>Model accuracy in train and test phrases.</p>
Full article ">Figure 12
<p>Accuracy of algorithms in CIC-IDS-2017 dataset.</p>
Full article ">Figure 13
<p>Accuracy of algorithms in UNSW-NB15 dataset.</p>
Full article ">Figure 14
<p>Average accuracy between algorithms using two benchmark datasets.</p>
Full article ">Figure 15
<p>UMAP visualization of embedding of CIC-IDS-2017 dataset by the proposed model.</p>
Full article ">Figure 16
<p>UMAP visualization of embedding of UNSW-NB15 dataset by the proposed model.</p>
Full article ">
22 pages, 2903 KiB  
Article
Implementation of Lightweight Machine Learning-Based Intrusion Detection System on IoT Devices of Smart Homes
by Abbas Javed, Amna Ehtsham, Muhammad Jawad, Muhammad Naeem Awais, Ayyaz-ul-Haq Qureshi and Hadi Larijani
Future Internet 2024, 16(6), 200; https://doi.org/10.3390/fi16060200 - 5 Jun 2024
Cited by 2 | Viewed by 2040
Abstract
Smart home devices, also known as IoT devices, provide significant convenience; however, they also present opportunities for attackers to jeopardize homeowners’ security and privacy. Securing these IoT devices is a formidable challenge because of their limited computational resources. Machine learning-based intrusion detection systems [...] Read more.
Smart home devices, also known as IoT devices, provide significant convenience; however, they also present opportunities for attackers to jeopardize homeowners’ security and privacy. Securing these IoT devices is a formidable challenge because of their limited computational resources. Machine learning-based intrusion detection systems (IDSs) have been implemented on the edge and the cloud; however, IDSs have not been embedded in IoT devices. To address this, we propose a novel machine learning-based two-layered IDS for smart home IoT devices, enhancing accuracy and computational efficiency. The first layer of the proposed IDS is deployed on a microcontroller-based smart thermostat, which uploads the data to a website hosted on a cloud server. The second layer of the IDS is deployed on the cloud side for classification of attacks. The proposed IDS can detect the threats with an accuracy of 99.50% at cloud level (multiclassification). For real-time testing, we implemented the Raspberry Pi 4-based adversary to generate a dataset for man-in-the-middle (MITM) and denial of service (DoS) attacks on smart thermostats. The results show that the XGBoost-based IDS detects MITM and DoS attacks in 3.51 ms on a smart thermostat with an accuracy of 97.59%. Full article
(This article belongs to the Special Issue IoT Security: Threat Detection, Analysis and Defense)
Show Figures

Figure 1

Figure 1
<p>System architecture for distributed IDS.</p>
Full article ">Figure 2
<p>Dataset collection on smart thermostat.</p>
Full article ">Figure 3
<p>Comparison of XGBoost-, RF-, DT-, and ANN-based IDS implementation on smart thermostat using Ton_IoT dataset.</p>
Full article ">Figure 4
<p>Comparison of XGBoost-, RF-, DT-, and ANN-based IDS implementation on smart thermostat using IDSH dataset.</p>
Full article ">
Back to TopTop