scholarly journals Obstacle Avoidance and Environmental Adaptability Analysis of Snake-like Robot Based on Deep Learning

2022 ◽  
Vol 2146 (1) ◽  
pp. 012037
Author(s):  
Ying Zou
Keyword(s):  
Feature Recognition ◽  
Detection Method ◽  
Principal Component ◽  
Depth Map ◽  
Visual Image ◽  
Recognition Algorithm ◽  
Running Time ◽  
Graph Recognition ◽  
Gradient Calculation ◽  
Average Running Time

Abstract Aiming at the problems of high complexity and low accuracy of visual depth map feature recognition, a graph recognition algorithm based on principal component direction depth gradient histogram (pca-hodg) is designed in this study. In order to obtain high-quality depth map, it is necessary to calculate the parallax of the visual image. At the same time, in order to obtain the quantized regional shape histogram, it is necessary to carry out edge detection and gradient calculation on the depth map, then reduce the dimension of the depth map combined with the principal component, and use the sliding window detection method to reduce the dimension again to realize the feature extraction of the depth map. The results show that compared with other algorithms, the pca-hodg algorithm designed in this study improves the average classification accuracy and significantly reduces the average running time. This shows that the algorithm can reduce the running time by reducing the dimension, extract the depth map features more accurately, and has good robustness.

scholarly journals Key Feature Recognition Algorithm of Network Intrusion Signal Based on Neural Network and Support Vector Machine

Symmetry ◽  
2019 ◽  
Vol 11 (3) ◽  
pp. 380 ◽  
Author(s):  
Kai Ye
Keyword(s):  
Neural Network ◽  
Support Vector Machine ◽  
Feature Recognition ◽  
False Positive Rate ◽  
Principal Component ◽  
Recognition Algorithm ◽  
Support Vector ◽  
Data Set ◽  
Network Intrusion ◽  
Key Features

When identifying the key features of the network intrusion signal based on the GA-RBF algorithm (using the genetic algorithm to optimize the radial basis) to identify the key features of the network intrusion signal, the pre-processing process of the network intrusion signal data is neglected, resulting in an increase in network signal data noise, reducing the accuracy of key feature recognition. Therefore, a key feature recognition algorithm for network intrusion signals based on neural network and support vector machine is proposed. The principal component neural network (PCNN) is used to extract the characteristics of the network intrusion signal and the support vector machine multi-classifier is constructed. The feature extraction result is input into the support vector machine classifier. Combined with PCNN and SVM (Support Vector Machine) algorithms, the key features of network intrusion signals are identified. The experimental results show that the algorithm has the advantages of high precision, low false positive rate and the recognition time of key features of R2L (it is a common way of network intrusion attack) data set is only 3.18 ms.

scholarly journals Direction of Groove Detection for Wear Image of Four-Ball Friction Test Based on Gray Difference of Inclination Angle

2020 ◽  
Vol 2020 ◽  
pp. 1-7
Author(s):  
Mei Xiao ◽  
Ying Zhang ◽  
Haiming Wang ◽  
Lei Zhang
Keyword(s):  
Inclination Angle ◽  
Detection Method ◽  
Absolute Error ◽  
Average Absolute Error ◽  
Friction Test ◽  
Running Time ◽  
Subjective Estimation ◽  
Average Running Time ◽  
Simulation Results

In order to avoid subjective estimation of the direction of groove by using a tester in the four-ball friction test, an automatic wear angle detection method based on gray difference of inclination angle is proposed in this paper. First, the gray difference between the pixel and its W × 2W neighborhood pixels is acquired, in which each neighborhood pixel corresponds to an inclination angle. Second, a row’s grayscale difference of inclination angle is calculated, which is the sum of grayscale difference of all pixels in the same row with the same inclination angle. Third, the inclination angle corresponding to the minimum row’s grayscale difference is defined as the approach angles. Finally, the first t approaching angles with the highest frequency determine the wear angles. Compared with true angles determined manually, the simulation results of 200 samples show that the average absolute error is 2.1238° and the average running time is 1.3 s per frame. The influence of the algorithm parameters on detection precision is also analyzed.

scholarly journals An Improved Face Recognition Using Neighborhood Defined Modular Phase Congruency Based Kernel PCA

2012 ◽  
pp. 288-296
Author(s):  
M.Lokeswara Reddy ◽  
P.Ramana Reddy
Keyword(s):  
Face Recognition ◽  
Recognition Rate ◽  
Principal Component ◽  
Visual Image ◽  
Recognition System ◽  
Recognition Algorithm ◽  
Kernel Pca ◽  
Phase Congruency ◽  
Face Images ◽  
Facial Recognition System

A face recognition algorithm based on NMPKPCA algorithm presented in this paper. The proposed algorithm when compared with conventional Principal component analysis (PCA) algorithms has an improved recognition Rate for face images with large variations in illumination, facial expressions. In this technique, first phase congruency features are extracted from the face image so that effects due to illumination variations are avoided by considering phase component of image. Then, face images are divided into small sub images and the kernel PCA approach is applied to each of these sub images. but, dividing into small or large modules creates some problems in recognition. So a special modulation called neighborhood defined modularization approach presented in this paper, so that effects due to facial variations are avoided. Then, kernel PCA has been applied to each module to extract features. So a feature extraction technique for improving recognition accuracy of a visual image based facial recognition system presented in this paper.

Recognition of classroom student state features based on deep learning algorithms and machine learning

2020 ◽  
pp. 1-12
Author(s):  
Hu Jingchao ◽  
Haiying Zhang
Keyword(s):  
Deep Learning ◽  
Feature Recognition ◽  
Subjective Evaluation ◽  
Recognition Algorithm ◽  
Video Data ◽  
State Recognition ◽  
Detection Model ◽  
State Classification ◽  
Intelligent Models ◽  
Model Recognition

The difficulty in class student state recognition is how to make feature judgments based on student facial expressions and movement state. At present, some intelligent models are not accurate in class student state recognition. In order to improve the model recognition effect, this study builds a two-level state detection framework based on deep learning and HMM feature recognition algorithm, and expands it as a multi-level detection model through a reasonable state classification method. In addition, this study selects continuous HMM or deep learning to reflect the dynamic generation characteristics of fatigue, and designs random human fatigue recognition experiments to complete the collection and preprocessing of EEG data, facial video data, and subjective evaluation data of classroom students. In addition to this, this study discretizes the feature indicators and builds a student state recognition model. Finally, the performance of the algorithm proposed in this paper is analyzed through experiments. The research results show that the algorithm proposed in this paper has certain advantages over the traditional algorithm in the recognition of classroom student state features.

scholarly journals A Comparative Study among New Hybrid Root Finding Algorithms and Traditional Methods

Mathematics ◽  
2021 ◽  
Vol 9 (11) ◽  
pp. 1306
Author(s):  
Elsayed Badr ◽  
Sultan Almotairi ◽  
Abdallah El Ghamry
Keyword(s):  
Comparative Study ◽  
Numerical Results ◽  
Traditional Methods ◽  
Running Time ◽  
Root Finding ◽  
Average Running Time ◽  
False Position ◽  
Newton Raphson ◽  
Number Of Iterations

In this paper, we propose a novel blended algorithm that has the advantages of the trisection method and the false position method. Numerical results indicate that the proposed algorithm outperforms the secant, the trisection, the Newton–Raphson, the bisection and the regula falsi methods, as well as the hybrid of the last two methods proposed by Sabharwal, with regard to the number of iterations and the average running time.

scholarly journals A Real-Time Apple Targets Detection Method for Picking Robot Based on Improved YOLOv5

2021 ◽  
Vol 13 (9) ◽  
pp. 1619
Author(s):  
Bin Yan ◽  
Pan Fan ◽  
Xiaoyan Lei ◽  
Zhijie Liu ◽  
Fuzeng Yang
Keyword(s):  
Real Time ◽  
Apple Tree ◽  
Detection Method ◽  
Recognition Algorithm ◽  
Medium Size ◽  
Feature Maps ◽  
Detection Algorithms ◽  
Fusion Mode ◽  
Visual Attention Mechanism ◽  
Tree Image

The apple target recognition algorithm is one of the core technologies of the apple picking robot. However, most of the existing apple detection algorithms cannot distinguish between the apples that are occluded by tree branches and occluded by other apples. The apples, grasping end-effector and mechanical picking arm of the robot are very likely to be damaged if the algorithm is directly applied to the picking robot. Based on this practical problem, in order to automatically recognize the graspable and ungraspable apples in an apple tree image, a light-weight apple targets detection method was proposed for picking robot using improved YOLOv5s. Firstly, BottleneckCSP module was improved designed to BottleneckCSP-2 module which was used to replace the BottleneckCSP module in backbone architecture of original YOLOv5s network. Secondly, SE module, which belonged to the visual attention mechanism network, was inserted to the proposed improved backbone network. Thirdly, the bonding fusion mode of feature maps, which were inputs to the target detection layer of medium size in the original YOLOv5s network, were improved. Finally, the initial anchor box size of the original network was improved. The experimental results indicated that the graspable apples, which were unoccluded or only occluded by tree leaves, and the ungraspable apples, which were occluded by tree branches or occluded by other fruits, could be identified effectively using the proposed improved network model in this study. Specifically, the recognition recall, precision, mAP and F1 were 91.48%, 83.83%, 86.75% and 87.49%, respectively. The average recognition time was 0.015 s per image. Contrasted with original YOLOv5s, YOLOv3, YOLOv4 and EfficientDet-D0 model, the mAP of the proposed improved YOLOv5s model increased by 5.05%, 14.95%, 4.74% and 6.75% respectively, the size of the model compressed by 9.29%, 94.6%, 94.8% and 15.3% respectively. The average recognition speeds per image of the proposed improved YOLOv5s model were 2.53, 1.13 and 3.53 times of EfficientDet-D0, YOLOv4 and YOLOv3 and model, respectively. The proposed method can provide technical support for the real-time accurate detection of multiple fruit targets for the apple picking robot.

Computing Robust Principal Components by A* Search

2018 ◽  
Vol 27 (07) ◽  
pp. 1860013 ◽  
Author(s):  
Swair Shah ◽  
Baokun He ◽  
Crystal Maung ◽  
Haim Schweitzer
Keyword(s):  
State Of The Art ◽  
Principal Component ◽  
Low Rank ◽  
A Algorithm ◽  
Running Time ◽  
Current State ◽  
Dimensionality Reduction Technique ◽  
Related Variant ◽  
Low Rank Representation ◽  
The Cost

Principal Component Analysis (PCA) is a classical dimensionality reduction technique that computes a low rank representation of the data. Recent studies have shown how to compute this low rank representation from most of the data, excluding a small amount of outlier data. We show how to convert this problem into graph search, and describe an algorithm that solves this problem optimally by applying a variant of the A* algorithm to search for the outliers. The results obtained by our algorithm are optimal in terms of accuracy, and are shown to be more accurate than results obtained by the current state-of-the- art algorithms which are shown not to be optimal. This comes at the cost of running time, which is typically slower than the current state of the art. We also describe a related variant of the A* algorithm that runs much faster than the optimal variant and produces a solution that is guaranteed to be near the optimal. This variant is shown experimentally to be more accurate than the current state-of-the-art and has a comparable running time.

scholarly journals An Electronic Component Recognition Algorithm Based on Deep Learning with a Faster SqueezeNet

2020 ◽  
Vol 2020 ◽  
pp. 1-11
Author(s):  
Yuanyuan Xu ◽  
Genke Yang ◽  
Jiliang Luo ◽  
Jianan He
Keyword(s):  
Deep Learning ◽  
Characteristic Curve ◽  
Area Under The Curve ◽  
Principal Component ◽  
Recognition Algorithm ◽  
Electronic Component ◽  
Support Vector ◽  
Learning Networks ◽  
Component Recognition ◽  
And Performance

Electronic component recognition plays an important role in industrial production, electronic manufacturing, and testing. In order to address the problem of the low recognition recall and accuracy of traditional image recognition technologies (such as principal component analysis (PCA) and support vector machine (SVM)), this paper selects multiple deep learning networks for testing and optimizes the SqueezeNet network. The paper then presents an electronic component recognition algorithm based on the Faster SqueezeNet network. This structure can reduce the size of network parameters and computational complexity without deteriorating the performance of the network. The results show that the proposed algorithm performs well, where the Receiver Operating Characteristic Curve (ROC) and Area Under the Curve (AUC), capacitor and inductor, reach 1.0. When the FPR is less than or equal 10 − 6   level, the TPR is greater than or equal to 0.99; its reasoning time is about 2.67 ms, achieving the industrial application level in terms of time consumption and performance.

Sign in / Sign up

Export Citation Format

Share Document