Search

Robotic arms have been widely used in industrial fields. However, researchers have seldom considered the factors affecting the actual factory environment. For example, when objects are conveyed in a factory, conveyor belts are often used to dynamically plan the overall production line. In addition, each object requires multiple checkpoints for repeated audits and inspections to ensure its quality. In this study, a vision-based robotic arm system equipped with multiple functionalities was developed. The development process consisted of three steps: detecting multiple dynamic objects, determining the size of each object, and identifying object defects. In the first step, You Only Look Once was used to detect multiple dynamic objects on a conveyor belt in real time. In the second step, the original image of the object was converted into a grayscale image, and the edge contour of the object was drawn using a Canny edge detection algorithm. Objects in the image were then rotated for vertical and horizontal projections, and then an artificial neural network (ANN) was used to calculate the size of each object. In the third step, a convolutional fuzzy neural network (CFNN) was used to identify object defects. This network was divided into an input layer, a convolution pooling layer, a feature fusion layer, a fuzzy layer, a regular layer, and a defuzzification layer. According to the experimental results, the standard error of the mean between the object size obtained by the ANN and the actual size was 0.009. In addition, the accuracy, recall, precision, and F1-score obtained by the CFNN in object defect detection were 0.9580, 0.9535, 0.9535, and 0.9535, respectively. Compared with other deep neural network models, such as AlexNet and LeNet, the proposed CFNN has fewer parameters and higher performance. [ABSTRACT FROM AUTHOR]

Spiking Neural Network (SNN) has been recognized as the third generation of neural networks. Conventionally, a SNN can be converted from a pre-trained Artificial Neural Network (ANN) with less computation and memory than training from scratch. But, these converted SNNs are vulnerable to adversarial attacks. Numerical experiments demonstrate that the SNN trained by optimizing the loss function will be more adversarial robust, but the theoretical analysis for the mechanism of robustness is lacking. In this paper, we provide a theoretical explanation by analyzing the expected risk function. Starting by modeling the stochastic process introduced by the Poisson encoder, we prove that there is a positive semidefinite regularizer. Perhaps surprisingly, this regularizer can make the gradients of the output with respect to input closer to zero, thus resulting in inherent robustness against adversarial attacks. Extensive experiments on the CIFAR10 and CIFAR100 datasets support our point of view. For example, we find that the sum of squares of the gradients of the converted SNNs is 13 ∼ 160 times that of the trained SNNs. And, the smaller the sum of the squares of the gradients, the smaller the degradation of accuracy under adversarial attack. • The adversarial robustness of SNNs based on rate encoder is explained mathematically. • A regularizer distinguishes the directly trained SNN from the converted SNN. • The coding length can also change the gradient of the input to affect the robustness. • We compare more types of the trained SNN with the converted SNN. [ABSTRACT FROM AUTHOR]

The precision of the machining tool in computer numerical control (CNC) machining is affected by several factors. For example, cutting parameters considerably affect machining accuracy and tool wear. Tool wear results in the manufacture of substandard products. Therefore, predicting tool wear is crucial in CNC machining. In this study, we proposed a backpropagation neural network (BPNN) to predict tool wear. In machine learning, backpropagation is a widely used algorithm for training artificial neural networks. The proposed BPNN considered the variation of tool wear with different cutting parameters, such as the spindle speed, feed, cutting depth, and cutting time. The experimental results revealed that the root mean square error of the BPNN prediction model was less than that of the linear regression prediction model. Furthermore, the proposed model achieved a coefficient of determination (R2) of 0.9964, which indicated that the BPNN model can accurately predict tool wear. [ABSTRACT FROM AUTHOR]

The aim of this paper is to distinguish the vehicle detection and count the class number in each classification from the inputs. We proposed the use of Fuzzy Guided Scale Choice (FGSC)-based SSD deep neural network architecture for vehicle detection and class counting with parameter optimization. The 'FGSC' blocks are integrated into the convolutional layers of the model, which emphasize essential features while ignoring less important ones that are not significant for the operation. We created the passing detection lines and class counting windows and connected them with the proposed FGSC-SSD deep neural network model. The 'FGSC' blocks in the convolution layer emphasize essential features and find out unnecessary features by using the scale choice method at the training stage and eliminate that significant speedup of the model. In addition, FGSC blocks avoided many unusable parameters in the saturation interval and improved the performance efficiency. In addition, the Fuzzy Sigmoid Function (FSF) increases the activation interval through fuzzy logic. While performing operations, the FGSC-SSD model reduces the computational complexity of convolutional layers and their parameters. As a result, the model tested Frames Per Second (FPS) on edge artificial intelligence (AI) and reached a real-time processing speed of 38.4 and an accuracy rate of more than 94%. Therefore, this work might be considered an improvement to the traffic monitoring approach by using edge AI applications. [ABSTRACT FROM AUTHOR]

• We propose a unified two-stage framework for automatic model compression. • We propose Dynamic BN to predict the performance of each compression policy. • We propose a solving algorithm to search for the compression ratio allocation. Deep Neural Networks have become ubiquitous in various domains. Meanwhile, the problems of massive storage and computation costs have hindered the deployment of these models to real-world applications. This paper proposes a novel and unified two-stage framework for automatic model compression. To determine the compression ratio of each layer, we improve the optimization from two aspects. First, to predict the performance of each compression policy, we propose Dynamic BN, which improves the correlation significantly with little computation overhead. Second, to search for the compression ratio allocation, we propose an efficient and hyperparameter-free solving algorithm based on the proposed Hessian matrix approximation and Knapsack problem reformulation. Moreover, comprehensive experiments and analyses are conducted on the CIFAR-100&ImageNet datasets and various network architectures to demonstrate its performance advantages over existing model compression methods under the quantization-only, pruning-only, and pruning-quantization settings. [ABSTRACT FROM AUTHOR]

Channel Pruning is one of the most widespread techniques used to compress deep neural networks while maintaining their performances. Currently, a typical pruning algorithm leverages neural architecture search to directly find networks with a configurable width, the key step of which is to identify representative subnet for various pruning ratios by training a supernet. However, current methods mainly follow a serial training strategy to optimize supernet, which is very time-consuming. In this work, we introduce PSE-Net, a novel parallel-subnets estimator for efficient channel pruning. Specifically, we propose a parallel-subnets training algorithm that simulate the forward–backward pass of multiple subnets by droping extraneous features on batch dimension, thus various subnets could be trained in one round. Our proposed algorithm facilitates the efficiency of supernet training and equips the network with the ability to interpolate the accuracy of unsampled subnets, enabling PSE-Net to effectively evaluate and rank the subnets. Over the trained supernet, we develop a prior-distributed-based sampling algorithm to boost the performance of classical evolutionary search. Such algorithm utilizes the prior information of supernet training phase to assist in the search of optimal subnets while tackling the challenge of discovering samples that satisfy resource constraints due to the long-tail distribution of network configuration. Extensive experiments demonstrate PSE-Net outperforms previous state-of-the-art channel pruning methods on the ImageNet dataset while retaining superior supernet training efficiency. For example, under 300M FLOPs constraint, our pruned MobileNetV2 achieves 75.2% Top-1 accuracy on ImageNet dataset, exceeding the original MobileNetV2 by 2.6 units while only cost 30%/16% times than BCNet/AutoAlim. • We propose PSE-Net, a novel parallel-subnets estimator for efficient channel pruning. • The prior-distributed-based sampling algorithm to facilitate subnets search. • 30%/16% total time for estimator training compared with BCNet/AutoSlim. • Exceeds the SOTAs on ImageNet and downstream tasks for a variety of FLOPs budgets. [ABSTRACT FROM AUTHOR]