Dataset Information

Geometric Feature Extraction of Point Cloud of Chemical Reactor Based on Dynamic Graph Convolution Neural Network.

ABSTRACT: Geometric features are an important factor for the classification of drugs and other transport objects in chemical reactors. The moving speed of drugs and other transport objects in chemical reactors is fast, and it is difficult to obtain their features by imaging and other methods. In order to avoid the mistaken and missed distribution of drugs and other objects, a method of extracting geometric features of the drug's point cloud in a chemical reactor based on a dynamic graph convolution neural network (DGCNN) is proposed. In this study, we first use MATLAB R2019a to add a random number of noise points in each point cloud file and label the point cloud. Second, k-nearest neighbor (KNN) is used to construct the adjacency relationship of all nodes, and the effect of DGCNN under different k values and the confusion matrix under the optimal k value are analyzed. Finally, we compare the effect of DGCNN with PointNet and PointNet++. The experimental results show that when k is 20, the accuracy, precision, recall, and F1 score of DGCNN are higher than those of other k values, while the training time is much shorter than that of k = 25, 30, and 35; in addition, the effect of DGCNN in extracting geometric features of the point cloud is better than that of PointNet and PointNet++. The results show that it is feasible to use DGCNN to analyze the geometric characteristics of drug point clouds in a chemical reactor. This study fills the gap of the end-to-end extraction method for a point cloud's corresponding geometric features without a data set. In addition, this study promotes the institutionalization, standardization, and intelligent design of safe production and management of drugs and other objects in the chemical reactor, and it has positive significance for the production cost and resource utilization of the whole pharmaceutical process. At the same time, it provides a new method for the intelligent processing of point cloud data.

SUBMITTER: Xing Z

PROVIDER: S-EPMC8388001 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Similar Datasets

Project description:Protein point mutations are an essential component of the evolutionary and experimental analysis of protein structure and function. While many manually curated databases attempt to index point mutations, most experimentally generated point mutations and the biological impacts of the changes are described in the peer-reviewed published literature. We describe an application, Mutation GraB (Graph Bigram), that identifies, extracts, and verifies point mutations from biomedical literature. The principal problem of point mutation extraction is to link the point mutation with its associated protein and organism of origin. Our algorithm uses a graph-based bigram traversal to identify these relevant associations and exploits the Swiss-Prot protein database to verify this information. The graph bigram method is different from other models for point mutation extraction in that it incorporates frequency and positional data of all terms in an article to drive the point mutation-protein association. Our method was tested on 589 articles describing point mutations from the G protein-coupled receptor (GPCR), tyrosine kinase, and ion channel protein families. We evaluated our graph bigram metric against a word-proximity metric for term association on datasets of full-text literature in these three different protein families. Our testing shows that the graph bigram metric achieves a higher F-measure for the GPCRs (0.79 versus 0.76), protein tyrosine kinases (0.72 versus 0.69), and ion channel transporters (0.76 versus 0.74). Importantly, in situations where more than one protein can be assigned to a point mutation and disambiguation is required, the graph bigram metric achieves a precision of 0.84 compared with the word distance metric precision of 0.73. We believe the graph bigram search metric to be a significant improvement over previous search metrics for point mutation extraction and to be applicable to text-mining application requiring the association of words.

Project description:ReasonPedestrian recognition has great practical value and is a vital step toward applying path planning and intelligent obstacle avoidance in autonomous driving. In recent years, laser radar has played an essential role in pedestrian detection and recognition in unmanned driving. More accurate high spatial dimension and high-resolution data could be obtained by building a three-dimensional point cloud. However, the point cloud data collected by laser radar is often massive and contains a lot of redundancy, which is not conducive to transmission and storage. So, the processing speed grows slow when the original point cloud data is used for recognition. On the other hand, the compression processing of many laser radar point clouds could save computing power and speed up the recognition processing.MethodologyThe article utilizes the fusion point cloud data from laser radar to investigate the fast pedestrian recognition algorithm. The focus is to compress the collected point cloud data based on the boundary and feature value extraction and then use the point cloud pedestrian recognition algorithm based on image mapping to detect pedestrians. This article proposes a point cloud data compression method based on feature point extraction and reduced voxel grid.ResultsThe Karlsruhe Institute of Technology and Toyota Technological Institute data set is used to investigate the proposed algorithm experimentally. The outcomes indicate that the peak signal-to-noise ratio of the compression algorithm is improved by 6.02%. The recognition accuracy is improved by 16.93%, 17.2%, and 16.12%, corresponding to simple, medium, and difficult scenes, respectively, when compared with the point cloud pedestrian recognition method based on image mapping, which uses the random sampling method to compress the point cloud data.ConclusionThe proposed method could achieve data compression better and ensure that many feature points are retained in the compressed Point Cloud Data (PCD). Thus, the compressed PCD achieves pedestrian recognition through an image-based mapping recognition algorithm.

Dataset Information

Geometric Feature Extraction of Point Cloud of Chemical Reactor Based on Dynamic Graph Convolution Neural Network.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets