Neighboring Features Research Articles

Efficient Semantic Segmentation for Large-Scale Agricultural Nursery Managements via Point Cloud-Based Neural Network

Remote sensing technology has found extensive application in agriculture, providing critical data for analysis. The advancement of semantic segmentation models significantly enhances the utilization of point cloud data, offering innovative technical support for modern horticulture in nursery environments, particularly in the area of plant cultivation. Semantic segmentation results aid in obtaining tree components, like canopies and trunks, and detailed data on tree growth environments. However, obtaining precise semantic segmentation results from large-scale areas can be challenging due to the vast number of points involved. Therefore, this paper introduces an improved model aimed at achieving superior performance for large-scale points. The model incorporates direction angles between points to improve local feature extraction and ensure rotational invariance. It also uses geometric and relative distance information for better adjustment of different neighboring point features. An external attention module extracts global spatial features, and an upsampling feature adjustment strategy integrates features from the encoder and decoder. A specialized dataset was created from real nursery environments for experiments. Results show that the improved model surpasses several point-based models, achieving a Mean Intersection over Union (mIoU) of 87.18%. This enhances the precision of nursery environment analysis and supports the advancement of autonomous nursery managements.

Pre-connected and trainable adjacency matrix-based GCN and neighbor feature approximation for industrial fault diagnosis

Industrial fault diagnosis methods based on graph convolution network (GCN) becomes a hot topic for its great feature extraction ability to multivariate time-series data. However, GCNs ignore inter-sample temporality when constructing the adjacency matrix (AM), leading to low prediction accuracy. A novel fault diagnosis method based on pre-connected and trainable AM-based GCN and neighbor feature approximation (PTGCN-FA) is proposed at the node-level task. Firstly, PTGCN-FA introduces the temporal nearest neighbors into spatial nearest neighbors to pre-connect and construct the AM. Then, the AM is trained only where the samples are connected, which makes the best weights obtained and reduces the time complexity of the model. Finally, after the GCN layers, the trained AM is introduced into the approximation of features, which are neighbors in the original sample space. Two process industry cases are carried out, and the simulation results including diagnosis accuracy, confusion matrix, study to the ratio of labeled data and an ablation experiment verify PTGCN-FA has more efficient and accurate diagnostic performance than related methods. Additionally, the analysis of the temporal neighborhood weight parameter shows that the performance of fault diagnosis can be improved by considering both temporal and spatial information between samples.

Enhancing IoT intrusion detection through machine learning with AN-SFS: a novel approach to high performing adaptive feature selection

The vast volume of redundant and irrelevant network traffic data poses significant hurdles for intrusion detection. Effective feature selection is crucial for eliminating irrelevant information. Presently, most filtering and embedded methods rely on fixed thresholds or ratios, necessitating prior knowledge. Conversely, wrapper methods are computationally intensive, and individual feature selection methods may introduce biases in evaluation. To address these challenges, this study introduces Adaptive Neighborhood based Feature Selection (AN-SFS), a dynamic feature selection approach that adapts to local statistical properties of the data. Unlike traditional methods, AN-SFS adjusts its threshold based on the characteristics of the current feature subset and incorporates statistical measures of neighboring features, capturing subtle relationships and dependencies. This adaptability enables AN-SFS to achieve robust and effective feature selection outcomes. Using NSL-KDD and UNSW-NB15 datasets, our model demonstrates superiority over conventional ML classifiers in detection rate, precision, and recall, achieving outstanding accuracy rates of 99.3% on NSL-KDD and 97.5% on UNSW-NB15, significantly outperforming contemporary methods. To further demonstrate the effectiveness of our feature selection approach, we conducted a series of comparisons with other statistical methods, including ANOVA, Pearson correlation, and the chi-square test. In each comparison, our approach consistently outperformed these alternatives, underscoring its superior efficacy.

KAN-HyperMP: An Enhanced Fault Diagnosis Model for Rolling Bearings in Noisy Environments

Rolling bearings often produce non-stationary signals that are easily obscured by noise, particularly in high-noise environments, making fault detection a challenging task. To address this challenge, a novel fault diagnosis approach based on the Kolmogorov–Arnold Network-based Hypergraph Message Passing (KAN-HyperMP) model is proposed. The KAN-HyperMP model is composed of three key components: a neighbor feature aggregation block, a feature fusion block, and a KANLinear block. Firstly, the neighbor feature aggregation block leverages hypergraph theory to integrate information from more distant neighbors, aiding in the reduction of noise impact, even when nearby neighbors are severely affected. Subsequently, the feature fusion block combines the features of these higher-order neighbors with the target node’s own features, enabling the model to capture the complete structure of the hypergraph. Finally, the smoothness properties of B-spline functions within the Kolmogorov–Arnold Network (KAN) are employed to extract critical diagnostic features from noisy signals. The proposed model is trained and evaluated on the Southeast University (SEU) and Jiangnan University (JNU) Datasets, achieving accuracy rates of 99.70% and 99.10%, respectively, demonstrating its effectiveness in fault diagnosis under both noise-free and noisy conditions.

Identification method for micro–nano defects in Si3N4 ceramic bearing rollers

In response to the surface micro–nano defects of small Si3N4 ceramic bearing rollers during use, as well as the poor generalization ability and low accuracy of the object detection model trained on the micro and nano defect dataset, an enhanced recognition algorithm based on deep convolutional generative adversarial networks is proposed. Due to the limited size of the dataset, the DCGAN model is reconstructed to effectively expand the micro–nano defect dataset. In addition, noise generalization is applied to stabilize DCGAN model training, creating a low-dimensional manifold distribution to ensure significant overlap between the data and the original dataset, and activating Jensen–Shannon (JS) divergence for stable training. To verify the effectiveness of the enhanced dataset, synthetic micro–nano defects are used to improve the YOLO-v4-tiny object detection model. By comparing t-distributed stochastic neighbor embedding (t-SNE) and feature vectors, it can be found that the images generated by the optimized DCGAN have higher grayscale feature diversity and better visual consistency. After generations of enhancements, the micro–nano defect detection speed has reached 226FPS, and the accuracy has reached 97.41%.

VQGNet: An Unsupervised Defect Detection Approach for Complex Textured Steel Surfaces

Defect detection on steel surfaces with complex textures is a critical and challenging task in the industry. The limited number of defect samples and the complexity of the annotation process pose significant challenges. Moreover, performing defect segmentation based on accurate identification further increases the task’s difficulty. To address this issue, we propose VQGNet, an unsupervised algorithm that can precisely recognize and segment defects simultaneously. A feature fusion method based on aggregated attention and a classification-aided module is proposed to segment defects by integrating different features in the original images and the anomaly maps, which direct the attention to the anomalous information instead of the irregular complex texture. The anomaly maps are generated more confidently using strategies for multi-scale feature fusion and neighbor feature aggregation. Moreover, an anomaly generation method suitable for grayscale images is introduced to facilitate the model’s learning on the anomalous samples. The refined anomaly maps and fused features are both input into the classification-aided module for the final classification and segmentation. VQGNet achieves state-of-the-art (SOTA) performance on the industrial steel dataset, with an I-AUROC of 99.6%, I-F1 of 98.8%, P-AUROC of 97.0%, and P-F1 of 80.3%. Additionally, ViT-Query demonstrates robust generalization capabilities in generating anomaly maps based on the Kolektor Surface-Defect Dataset 2.

ScMGATGRN: a multiview graph attention network-based method for inferring gene regulatory networks from single-cell transcriptomic data.

The gene regulatory network (GRN) plays a vital role in understanding the structure and dynamics of cellular systems, revealing complex regulatory relationships, and exploring disease mechanisms. Recently, deep learning (DL)-based methods have been proposed to infer GRNs from single-cell transcriptomic data and achieved impressive performance. However, these methods do not fully utilize graph topological information and high-order neighbor information from multiple receptive fields. To overcome those limitations, we propose a novel model based on multiview graph attention network, namely, scMGATGRN, to infer GRNs. scMGATGRN mainly consists of GAT, multiview, and view-level attention mechanism. GAT can extract essential features of the gene regulatory network. The multiview model can simultaneously utilize local feature information and high-order neighbor feature information of nodes in the gene regulatory network. The view-level attention mechanism dynamically adjusts the relative importance of node embedding representations and efficiently aggregates node embedding representations from two views. To verify the effectiveness of scMGATGRN, we compared its performance with 10 methods (five shallow learning algorithms and five state-of-the-art DL-based methods) on seven benchmark single-cell RNA sequencing (scRNA-seq) datasets from five cell lines (two in human and three in mouse) with four different kinds of ground-truth networks. The experimental results not only show that scMGATGRN outperforms competing methods but also demonstrate the potential of this model in inferring GRNs. The code and data of scMGATGRN are made freely available on GitHub (https://github.com/nathanyl/scMGATGRN).

Distance Enhanced Hypergraph Learning for Dynamic Node Classification

Dynamic node classification aims to predict the labels of nodes in the dynamic networks. Existing methods primarily utilize the graph neural networks to acquire the node features and original graph structure features. However, these approaches ignore the high-order relationships between nodes and may lead to the over-smoothing issue. To address these issues, we propose a distance enhanced hypergraph learning (DEHL) method for dynamic node classification. Specifically, we first propose a time-adaptive pre-training component to generate the time-aware representations of each node. Then we utilize a dual-channel convolution module to construct the local and global hypergraphs which contain the corresponding local and global high-order relationships. Moreover, we adopt the K-nearest neighbor algorithm to construct the global hypergraph in the embedding space. After that, we adopt the node convolution and hyperedge convolution to aggregate the features of neighbors on the hypergraphs to the target node. Finally, we combine the temporal representations and the distance enhanced representations of the target node to predict its label. In addition, we conduct extensive experiments on two public dynamic graph datasets, i.e., Wikipedia and Reddit. The experimental results show that DEHL outperforms the state-of-the-art baselines in terms of AUC.

Dynamic category-sensitive hypergraph inferring and homo-heterogeneous neighbor feature learning for drug-related microbe prediction.

The microbes in human body play a crucial role in influencing the functions of drugs, as they can regulate the activities and toxicities of drugs. Most recent methods for predicting drug-microbe associations are based on graph learning. However, the relationships among multiple drugs and microbes are complex, diverse, and heterogeneous. Existing methods often fail to fully model the relationships. In addition, the attributes of drug-microbe pairs exhibit long-distance spatial correlations, which previous methods have not integrated effectively. We propose a new prediction method named DHDMP which is designed to encode the relationships among multiple drugs and microbes and integrate the attributes of various neighbor nodes along with the pairwise long-distance correlations. First, we construct a hypergraph with dynamic topology, where each hyperedge represents a specific relationship among multiple drug nodes and microbe nodes. Considering the heterogeneity of node attributes across different categories, we developed a node category-sensitive hypergraph convolution network to encode these diverse relationships. Second, we construct homogeneous graphs for drugs and microbes respectively, as well as drug-microbe heterogeneous graph, facilitating the integration of features from both homogeneous and heterogeneous neighbors of each target node. Third, we introduce a graph convolutional network with cross-graph feature propagation ability to transfer node features from homogeneous to heterogeneous graphs for enhanced neighbor feature representation learning. The propagation strategy aids in the deep fusion of features from both types of neighbors. Finally, we design spatial cross-attention to encode the attributes of drug-microbe pairs, revealing long-distance correlations among multiple pairwise attribute patches. The comprehensive comparison experiments showed our method outperformed state-of-the-art methods for drug-microbe association prediction. The ablation studies demonstrated the effectiveness of node category-sensitive hypergraph convolution network, graph convolutional network with cross-graph feature propagation, and spatial cross-attention. Case studies on three drugs further showed DHDMP's potential application in discovering the reliable candidate microbes for the interested drugs. Source codes and supplementary materials are available at https://github.com/pingxuan-hlju/DHDMP.

Graph Representation Learning Based on Specific Subgraphs for Biomedical Interaction Prediction.

Discovering the novel associations of biomedical entities is of great significance and can facilitate not only the identification of network biomarkers of disease but also the search for putative drug targets.Graph representation learning (GRL) has incredible potential to efficiently predict the interactions from biomedical networks by modeling the robust representation for each node.> However, the current GRL-based methods learn the representation of nodes by aggregating the features of their neighbors with equal weights. Furthermore, they also fail to identify which features of higher-order neighbors are integrated into the representation of the central node. In this work, we propose a novel graph representation learning framework: a multi-order graph neural network based on reconstructed specific subgraphs (MGRS) for biomedical interaction prediction. In the MGRS, we apply the multi-order graph aggregation module (MOGA) to learn the wide-view representation by integrating the multi-hop neighbor features. Besides, we propose a subgraph selection module (SGSM) to reconstruct the specific subgraph with adaptive edge weights for each node. SGSM can clearly explore the dependency of the node representation on the neighbor features and learn the subgraph-based representation based on the reconstructed weighted subgraphs. Extensive experimental results on four public biomedical networks demonstrate that the MGRS performs better and is more robust than the latest baselines.

Multi-scale deep learning and clustering-based tabletop object instance segmentation for robot manipulation

3D object instance segmentation plays a vital role in various applications such as autonomous driving, robotics and virtual reality. However, tabletop scenes exhibit diverse object complexities and size variations. The challenge is to enhance the accuracy of segmenting these scenes for multiple object instances. This limitation directly impacts robots’ capabilities to effectively grasp and manipulate objects. In this paper, we propose a multi-scale deep learning and clustering-based approach for object instance segmentation in tabletop scenes. Our approach incorporates a multi-scale neighborhood feature sampling (MNFS) module specifically designed to extract local features, and a clustering algorithm to eliminate noise and preserve instance integrity. Furthermore, we combine the strength of both methods through ScoreNet and non-maximal suppression. We conducted extensive experiments on TO-Scene, the first large-scale dataset of 3D tabletop scenes, and observed an average mIoU improvement of approximately 4.07% compared to existing methods. This highlights the superior performance of our proposed method. In addition, we tested our algorithm on a real-scene robotics platform and showed that it has good performance and generalization capabilities to support future applications such as robot grasping.

Semantic Segmentation of Point Cloud Scene via Multi-Scale Feature Aggregation and Adaptive Fusion

Point cloud semantic segmentation is a key step in 3D scene understanding and analysis. In recent years, deep learning–based point cloud semantic segmentation methods have received extensive attention from researchers. Multi-scale neighborhood feature learning methods are suitable for inhomogeneous density point clouds, but different scale branching feature learning increases the computational complexity and makes it difficult to accurately fuse different scale features to express local information. In this study, a point cloud semantic segmentation network based on RandLA-Net with multi-scale local feature aggregation and adaptive fusion is proposed. The designed structure can reduce computational complexity and accurately express local features. The mean intersection-over-union is improved by 1.1% on the SemanticKITTI data set with an inference speed of nine frames per second, while the mean intersection-over-union is improved by 0.9% on the S3DIS data set, compared with RandLA-Net. We also conduct ablation studies to validate the effectiveness of the proposed key structure.

Graph Transformer for 3D point clouds classification and semantic segmentation

Recently, graph-based and Transformer-based deep learning have demonstrated excellent performances on various point cloud tasks. Most of the existing graph-based methods rely on static graph, which take a fixed input to establish graph relations. Moreover, many graph-based methods apply maximizing and averaging to aggregate neighboring features, so that only a single neighboring point affects the feature of centroid or different neighboring points own the same influence on the centroid’s feature, which ignoring the correlation and difference between points. Most Transformer-based approaches extract point cloud features based on global attention and lack the feature learning on local neighbors. To solve the above issues of graph-based and Transformer-based models, we propose a new feature extraction block named Graph Transformer and construct a 3D point cloud learning network called GTNet to learn features of point clouds on local and global patterns. Graph Transformer integrates the advantages of graph-based and Transformer-based methods, and consists of Local Transformer that use intra-domain cross-attention and Global Transformer that use global self-attention. Finally, we use GTNet for shape classification, part segmentation and semantic segmentation tasks in this paper. The experimental results show that our model achieves good learning and prediction ability on most tasks. The source code and pre-trained model of GTNet will be released on https://github.com/NWUzhouwei/GTNet.

Programmable Assembly of Semiconductor Mesostructures Via Inorganic Phototropism

Plants exhibit a phototropic response and direct the addition of new biomass to optimize collection of solar insolation. Analogous inorganic phototropism growth enables the programmable assembly of complex 3D nanoarchitectures with instruction by an incoherent, unstructured, mW cm-2 intensity light beam. Inorganic phototropism has been demonstrated via the light-mediated electrochemical assembly of semiconductor deposits from solution-phase precursor ions. No structured light field (no photomask), no lithographic processes and no templating agents (ligands, surfactants, etc.) are utilized. Nevertheless, ordered nanoscale features are conformally assembled over full macroscale (cm2) areas with feature heights on the order of several um with growth times < 5 min. In-plane anisotropy is a function of the input polarization. Isotropic morphologies consisting of ordered arrays of nanoscale holes were generated using unpolarized illumination whereas linearly polarized light resulted in anisotropic lamellar structures with in-plane orientations set by the polarization direction. The structure pitch was dependent on the spectral distribution of the input light with shorter wavelengths effecting higher feature densities. The out-of-plane growth direction is related to the propagation direction of the input light. Time-varying optical inputs enable programming of 3D intricacy by evolving the in-plane structure along the out-of-plane dimension, e.g. an abrupt reduction in the input wavelength results in a concomitant increase in the interfacial density resulting in tuning fork structures. Additional morphological control has also been effected by using multiple simultaneous illumination inputs. Modeling of the growth using a combination of full-wave electromagnetic simulations of light absorption and scattering coupled with Monte Carlo simulations of mass addition successfully reproduced the experimentally observed morphologies and indicated that assembly was directed by evolution of the growth front to maximize anisotropic light collection. The assembly was observed to be a highly emergent phenomenon involving optical communication between neighboring features including cooperative scattering and synergistic absorption.

GFedKG: GNN-based federated embedding model for knowledge graph completion

Knowledge Graph (KG) completion through reasoning over KGs is one of the most concerned issue in research around knowledge graphs. Current work focuses more on studying individual KG, while a series of related multi-source KGs are more common in real applications. In order to effectively exert their complementary roles in completing each KG under the premise of ensuring data privacy, federated learning becomes the focus of attention. However, existing methods ignore the explicit complementarity among KGs in terms of structural information. And they generally align embeddings of overlapping instances across clients, which constrains flexibility of each client model. Based on this, we propose the first GNN-based federated embedding framework for multiple knowledge graph completion, GFedKG. It focuses on the complementary role among KGs in topology structures and adaptively generates different aggregated neighboring features for entities in distinct clients. Such treatment achieves some consistency among clients while retaining the flexibility of each client model to characterize respective KG. Moreover, entity embeddings that represent the features of entities are better privacy-preserved since neighboring embeddings are transmitted instead of them. And with the aim of realizing more refined and accurate aggregation of neighboring features from multiple clients, we innovatively propose a context-aware graph neural network, along with the context-enhanced evaluation function. Homophily neighbors are also taken into account to cope with the low-homophily aspect of KGs. Extensive experiments demonstrate the advantages of GFedKG.

Multi-graph attention fusion graph neural network for remaining useful life prediction of rolling bearings

Abstract Graph neural network (GNN) has the proven ability to learn feature representations from graph data, and has been utilized for the tasks of predicting the machinery remaining useful life (RUL). However, existing methods only focus on a single graph structure and cannot integrate the correlation information contained in multi-graph structures. To address these issues, a multi-graph structure GNN prediction method with attention fusion (MGAFGNN) is proposed in this paper for GNN-based bearing RUL prediction. Specifically, a multi-channel graph attention module is designed to effectively learn the similar features of node neighbors from different graph data and capture the multi-scale latent features of nodes through the nonlinear transformation. Furthermore, a multi-graph attention fusion module (MGAFM) is proposed to extract the collaborative features from the interaction graph, thereby fusing the feature embeddings from different graph structures. The fused feature representation is sent to the long short-term memory network to further learn the temporal features and achieve RUL prediction. The experimental results on two bearing datasets demonstrate that MGAFGNN outperforms existing methods in terms of prediction performance by effectively incorporating multi-graph structural information.

Fabric defect detection based on feature enhancement and complementary neighboring information

Abstract Fabric defect detection is a crucial aspect of quality control in the textile industry. Given the complexities of fabric backgrounds, the high similarity between patterned backgrounds and defects, and the variety of defect scales, we propose a fabric defect detection method based on feature enhancement and complementary neighboring information . The core of this method lies in two main components: the feature enhancement module and the neighboring information complementation strategy. The feature enhancement module includes two sub-modules: similarity feature enhancement(SFE) and edge detail feature enhancement(EDFE). The SFE aims to capture the similarities between features to strengthen the distinction between defects and complex backgrounds, thereby highlighting the correlations among defects and the differences between defects and the background. The EDFE focuses on improving the network's ability to capture the edge details of fabrics, preventing edge information from becoming blurred or lost due to deeper network layers. The neighboring information complementation strategy consists of shallow-level information complementation(SLIC) and top-down information fusion complementation(TDIFC). The SLIC integrates newly introduced shallow features with neighboring features that have a smaller semantic gap, injecting richer detail information into the network. The TDIFC adaptively guides the interaction of information between adjacent feature maps, effectively aggregating multi-scale features to ensure information complementarity between features of different scales. Additionally, to further optimize model performance, we introduced partial convolution(PConv) in the backbone of the feature extraction network. PConv reduces redundant computations and decreases the model's parameter count. Experimental results show that our proposed method achieved an mAP@50 of 82.4%, which is a 6.6% improvement over the baseline model YOLOv8s. The average inference frame rate reached 61.8 FPS, meeting the real-time detection requirements for fabric defects. Moreover, the model demonstrated good generalization capabilities, effectively adapting to detecting defects in different types and colors of fabrics.

Optimizing urban park locations with addressing environmental justice in park access and utilization by using dynamic demographic features derived from mobile phone data

Urban parks play a critical role in improving the quality of life of local residents and creating sustainable and resilient urban environments. As urban parks are essential public services, it is important that they be accessible, sufficient, and of high quality so all city residents can access and benefit from them to advocate environmental justice. To make park services more equitable, it is crucial to evaluate the distribution and quality of existing urban parks and consider potential locations for new urban parks, in terms of both park access and utilization. By adopting a new type of dynamic population data based on mobile phone-based tracking, we assessed urban park access by vulnerable populations, particularly economically marginalized older adults, and employed dynamic demographic features and neighboring environmental features of existing urban parks and park candidate sites to estimate park utilization. Ultimately, we developed an advanced multi-objective location optimization model considering park access, utilization, and construction cost. The three objectives of maximizing utilization of the candidate sites when urban parks are established, maximizing the number of vulnerable people who can be covered by the urban parks, and minimizing the total establishment cost for the urban parks were optimized in locating urban parks among candidate sites. The proposed methodology was validated with an application to Ulsan Metropolitan City in the Republic of Korea.

High-frequency and low-frequency dual-channel graph attention network

Most existing graph convolution layers use learnable or fixed weights to sum up neighbor features to aggregate neighbor information. Since the attention values are always positive, these graph convolution layers perform as low-pass filters, which may result in their poor performance on heterophilic graphs. In this paper, two graph convolutional layers are proposed, HLGAT and NGAT. NGAT is a convolution network using only negative attention values, which only make the aggregation of high-frequency information of neighbor nodes. HLGAT makes the aggregation of low-frequency and high-frequency information by two channels, respectively, and fuses two outputs by using a learnable way. On node-classification task, both NGAT and HLGAT offer significant performance improvement compared to existing methods. The results clearly show that: (1) High-frequency information of neighborhoods plays a decisive role in heterophilic graphs. (2) The aggregation of low-frequency and high-frequency information of neighbor nodes can significantly improve the performance on heterophilic graphs.

MLBSNet: Mutual Learning and Boosting Segmentation Network for RGB-D Salient Object Detection

RGB-D saliency object detection (SOD) primarily segments the most salient objects from a given scene by fusing RGB images and depth maps. Due to the inherent noise in the original depth map, fusion failures may occur, leading to performance bottlenecks. To address this issue, this paper proposes a mutual learning and boosting segmentation network (MLBSNet) for RGB-D saliency object detection, which consists of a deep optimization module (DOM), a semantic alignment module (SAM), a cross-modal integration (CMI) module, and a separate reconstruct decoder (SRD). Specifically, the deep optimization module aims to obtain optimal depth information by learning the similarity between the original and predicted depth maps. To eliminate the uncertainty of single-modal neighboring features and capture the complementary features of multiple modalities, a semantic alignment module and a cross-modal integration module are introduced. Finally, a separate reconstruct decoder based on a multi-source feature integration mechanism is constructed to overcome the accuracy loss caused by segmentation. Through comparative experiments, our method outperforms 13 existing methods on five RGB-D datasets and achieves excellent performance on four evaluation metrics.