Yapei Zhao, Qingzeng Song, Xuechun Wang, Yijie Zhang, Guanghao Jin
{"title":"De-speckling Convolutional Neural Network and Classification Method for SAR Images","authors":"Yapei Zhao, Qingzeng Song, Xuechun Wang, Yijie Zhang, Guanghao Jin","doi":"10.1109/ICACI49185.2020.9177503","DOIUrl":"https://doi.org/10.1109/ICACI49185.2020.9177503","url":null,"abstract":"In real-world applications, different problems can adopt different models. Most of the existing denoising methods use the framework of deep learning, and the most commonly used denoised algorithm evaluation indicators, such as PSNR, MSE, etc., all without exception, require pictures’ ground truth which is needed as a reference. However, there are few real and noise-free pictures in the field of image denoising, only the noise reduction map can be compared with the noise map, which seems to be less persuasive. Therefore, this paper proposes a new criterion for judging the denoising model. The most important thing is that this method does not require noiseless images compared to PSNR when testing. Moreover, we improved the denoising model and verified the reliability of the criterion. At the same time, we conduct statistics on the recognition rate of different types of targets, and analyze the trend of misjudgment. In this paper, the synthetic aperture radar (SAR) image dataset is used as an experimental sample, and different noise parameters are used to obtain denoising data sets with different noise levels. Then we use different denoising models such as DN-CNN to process the data set. Finally, the CNN classification model is used for screening comparison. In this paper, the experimental results show that it is feasible to use classification to judge denoising, so based on this feasibility, this paper modified the denoising network and used classification to judge. The results show that the denoising effect is better and the classification accuracy is higher, that is, the denoising and classification are a complementary relationship.","PeriodicalId":137804,"journal":{"name":"2020 12th International Conference on Advanced Computational Intelligence (ICACI)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125137517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A 3D Grid Mapping System Based on Depth Prediction from a Monocular Camera","authors":"Peifeng Yan, Yuqing Lan, Shaowu Yang","doi":"10.1109/ICACI49185.2020.9177824","DOIUrl":"https://doi.org/10.1109/ICACI49185.2020.9177824","url":null,"abstract":"In complex unknown 3D environments, an accurate 3D volumetric representation of the environment is important for an intelligent robot. Simultaneous Localization and Mapping (SLAM) is considered as a fundamental direction in this area. RGB-D information is very important in traditional SLAM methods. The depth information obtained by sensors like some RGB-D cameras has limits in precision and accuracy. High-precision sensors like lasers and radars are often very expensive. Efficient algorithms should be adopted into those traditional SLAM system. They can not only improve the system efficiency in poorly-equipped conditions but also reduce the resources consumption of robots. To tackle the trade-off between performance and cost, this paper proposes a system producing a 3D grid map that can be used for navigation with a monocular camera and IMU of small size. Our system uses a deep neural network to predict the depth information of a monocular image and utilize the dynamic frame hopping strategy to make a smoother prediction result. Furthermore, we complete a 3D grid map directly used for navigation. The whole grid mapping process occupies little computation and storage resource at the same time. We adopt the octree structure and a keyframe method in the process of the 3D grid mapping to reduce resource consumption. Experiments in a real-world environment show that our approach achieves good results in depth prediction and can well update the 3D grid map for navigation.","PeriodicalId":137804,"journal":{"name":"2020 12th International Conference on Advanced Computational Intelligence (ICACI)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125802358","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Sparse Nonnegative Matrix Factorization Based on a Hyperbolic Tangent Approximation of L0-Norm and Neurodynamic Optimization","authors":"Xinqi Li, Jun Wang, S. Kwong","doi":"10.1109/ICACI49185.2020.9177819","DOIUrl":"https://doi.org/10.1109/ICACI49185.2020.9177819","url":null,"abstract":"Sparse nonnegative matrix factorization (SNMF) attracts much attention in the past two decades because its sparse and part-based representations are desirable in many machine learning applications. Due to the combinatorial nature of the sparsity constraint in form of l0, the problem is hard to solve. In this paper, a hyperbolic tangent function is introduced to approximate the l0-norm. A discrete-time neurodynamic approach is developed for solving the proposed formulation. The stability and the convergence behavior are shown for the state vectors. Experiment results are discussed to demonstrate the superiority of the approach. The results show that this approach outperforms other sparse NMF approaches with the smallest relative reconstruction error and the required level of sparsity.","PeriodicalId":137804,"journal":{"name":"2020 12th International Conference on Advanced Computational Intelligence (ICACI)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126129536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jie Yu, S. Gu, Jiwei Wang, Zhi-Yong Jia, Yunpeng Zhao
{"title":"The Intelligent Decision-making based on Multisource Heterogeneous Data Fusion in Manufacturing","authors":"Jie Yu, S. Gu, Jiwei Wang, Zhi-Yong Jia, Yunpeng Zhao","doi":"10.1109/ICACI49185.2020.9177661","DOIUrl":"https://doi.org/10.1109/ICACI49185.2020.9177661","url":null,"abstract":"In the complex manufacturing environment, the information collected from various information sources often has a certain degree of uncertainty and ambiguity, and even be contradictory which is difficult to support decision-making effectively. In this paper, an efficient intelligent decision-making method based on multi-source heterogeneous data fusion is proposed. Firstly, under the rough set theory, the attribute reduction method based on the improved particle swarm optimization is proposed to efficiently obtain decision-related attributes. Secondly, using the improved Dempster-Shafer (D-S) evidence theory to fuse and calculate the reduced information sources to obtain the final decision results. Finally, a space factory was taken as the application object to verify the feasibility of proposed technology.","PeriodicalId":137804,"journal":{"name":"2020 12th International Conference on Advanced Computational Intelligence (ICACI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123576367","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yufei Zhao, Liu Chen, Guangping Zeng, Chunguang Zhang
{"title":"Knowledge Link Inference of Graph Structure Based on Holographic Model","authors":"Yufei Zhao, Liu Chen, Guangping Zeng, Chunguang Zhang","doi":"10.1109/ICACI49185.2020.9177812","DOIUrl":"https://doi.org/10.1109/ICACI49185.2020.9177812","url":null,"abstract":"For current knowledge link inference methods, whether it is traditional translation models, semantic matching models, or convolutional neural network models, it is impossible to obtain rich semantic information. This paper mainly uses a pre-training layer based on the holographic model, and combines the knowledge structure to perform the knowledge link inference. Firstly, the pre-training layer is used as the model initialization. Secondly, the graph structure encoder layer not only combines the information of entities and relationships directly related to the current entity, but also considers the information including multi-hop neighbor nodes and auxiliary relationships. Finally, ConvKB is used as a decoder to score the triples. The model is evaluated on two benchmark datasets WN18RR and FB237, that is slightly better than the previous embedding models on some indicators.","PeriodicalId":137804,"journal":{"name":"2020 12th International Conference on Advanced Computational Intelligence (ICACI)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125285796","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xinhai Chen, Jie Liu, Chunye Gong, Yufei Pang, Bo Chen
{"title":"An Airfoil Mesh Quality Criterion using Deep Neural Networks","authors":"Xinhai Chen, Jie Liu, Chunye Gong, Yufei Pang, Bo Chen","doi":"10.1109/ICACI49185.2020.9177713","DOIUrl":"https://doi.org/10.1109/ICACI49185.2020.9177713","url":null,"abstract":"The quality of the mesh is one of the most critical aspects for solving partial differential equations (PDEs) in applications of Computational Fluid Dynamics. Many geometry criteria have been proposed and are widely used in business preprocessing software like ICEM CFD, PointWise, Gambit. However, these traditional geometry criteria fail to recognize some quality features that seriously affect the accuracy of numerical calculations, such as density and distribution of mesh elements. These quality features are usually evaluated based on engineering experience, which heavily increases the pre-processing cost and requires extensive engineering experience. In this paper, we introduce a deep learning model to solve the mentioned issues by offline learning. The proposed model is small and fast and can be embedded in pre-processing software. Experiment results show that the derived model is capable of performing the quality evaluating task and achieve an accuracy of 93.8%.","PeriodicalId":137804,"journal":{"name":"2020 12th International Conference on Advanced Computational Intelligence (ICACI)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129727732","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Application of New Method in Location of Logistics Centers","authors":"Shihui Dong, Hongye Xiong, Zhiping Wang, Xu Li","doi":"10.1109/ICACI49185.2020.9177670","DOIUrl":"https://doi.org/10.1109/ICACI49185.2020.9177670","url":null,"abstract":"The logistics center plays an essential role in the modern supply chain. The selection of a suitable logistics center can realize high effectively resource utilization in the surrounding areas. This paper creatively proposed a new method to measure the merits of candidate locations by establishing a two-stage model of Hesitant Fuzzy Preference Relationship (HFPR). In two-stage, the scores of candidate sites under different factors are obtained in the factor stage, and the weights of each criterion are received in the criterion stage. Then, the scores of each candidate site are obtained comprehensively. The method can effectively utilize the information, avoid data loss or distortion because of the standardization. The tight relationship between the two-stages in the model makes it better to solve practical problems. Finally, this paper provided the feasibility of this kind of new method by an example.","PeriodicalId":137804,"journal":{"name":"2020 12th International Conference on Advanced Computational Intelligence (ICACI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129118383","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Task Scheduling Problem in Mobile Robot Fulfillment Systems","authors":"Wei Yuan, Hui Sun","doi":"10.1109/ICACI49185.2020.9177514","DOIUrl":"https://doi.org/10.1109/ICACI49185.2020.9177514","url":null,"abstract":"This paper studies a task scheduling problem in the context of the mobile robot fulfillment system (MRFS), a parts-to-picker storage system where mobile robots bring movable racks to workstations. It determines the assignment of tasks of transporting racks to a fleet of robots with the objective of makespan minimization. A mixed integer programming model is presented to describe the problem. Aimed at quickly finding good solutions to this NP-hard problem, two heuristic rules and an ant colony optimization algorithm are developed. Computational experiments are conducted to evaluate the performance of the proposed heuristic solution procedures. It shows that the ant colony optimization algorithm generally has the best performance.","PeriodicalId":137804,"journal":{"name":"2020 12th International Conference on Advanced Computational Intelligence (ICACI)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121304596","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fusion Network Combined With Bidirectional LSTM Network and Multiscale CNN for Remaining Useful Life Estimation","authors":"Yijie Jiang, Yi Lyu, Yonghua Wang, Pin Wan","doi":"10.1109/icaci49185.2020.9177774","DOIUrl":"https://doi.org/10.1109/icaci49185.2020.9177774","url":null,"abstract":"","PeriodicalId":137804,"journal":{"name":"2020 12th International Conference on Advanced Computational Intelligence (ICACI)","volume":"353 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116364819","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Basic Algorithm for Zero-One Unconstrained Quadratic Programming Problem with k-diagonal Matrix","authors":"Shenshen Gu, Xinyi Chen","doi":"10.1109/ICACI49185.2020.9177717","DOIUrl":"https://doi.org/10.1109/ICACI49185.2020.9177717","url":null,"abstract":"In real life, many problems can be expressed as zero-one quadratic programming problems. Therefore, it is of great significance to study how to solve the zero-one quadratic programming problem. In this paper, zero-one unconstrained quadratic programming problem with a special form is researched. We call it the k-diagonal matrix zero-one unconstrained quadratic programming problem. For this kind of special problem, targeted algorithm which is obtained by observing the characteristics of Q matrix is proposed. This paper shows the feasibility of the algorithm through derivation. And through practical examples, the algorithm is easy to be understood. In the experiments, the dimension of the problem and the value of k are changed so as to study the relationship between the speed of the algorithm and them. We can see that this algorithm is suitable for high dimensional problems and have considerable computational power.","PeriodicalId":137804,"journal":{"name":"2020 12th International Conference on Advanced Computational Intelligence (ICACI)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126413507","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}