首页 > 最新文献

2021 IEEE International Conference on Computer Science, Artificial Intelligence and Electronic Engineering (CSAIEE)最新文献

英文 中文
Research on C4.5 Algorithm Optimization For User Churn 针对用户流失的C4.5算法优化研究
Chao Deng, Zhaohui Ma
Decision tree is a kind of machine learning method which can decide a corresponding result according to the probability of different eigenvalues, The effective decision number constructed can provide help for our data analysis. The generation of decision tree is a recursive process, It mainly uses the optimal partition attribute as the corresponding tree node, and then uses various values of the attribute to construct branches. In this way, until the data reaches a certain purity, the leaf nodes are obtained, and a decision tree in accordance with the rules is constructed. Among the traditional decision tree algorithms, C4.5 algorithm has a gain rate because of its attribute division. This leads to another obvious disadvantage, that is, it has a preference for the attributes with a small number of values, so that the accuracy of the decision tree is often not particularly ideal. In view of this, this paper proposes an improved E-C4.5 algorithm, which combines information gain and information gain rate to generate a new attribute partition criterion. The attribute partition method greatly eliminates the shortcoming of C4.5 algorithm which has a preference for the attributes with a small number of values, and further improves the decision accuracy of decision tree generation. In this paper, the actual data sets are used to verify the accuracy of the decision tree generated by the improved algorithm compared with the traditional C4.5 algorithm.
决策树是一种根据不同特征值的概率来决定相应结果的机器学习方法,所构造的有效决策数可以为我们的数据分析提供帮助。决策树的生成是一个递归过程,主要是将最优分区属性作为对应的树节点,然后利用该属性的各种值构造分支。这样,直到数据达到一定的纯度,得到叶节点,并根据规则构造决策树。在传统的决策树算法中,C4.5算法由于其属性划分而具有一定的增益率。这导致了另一个明显的缺点,即它偏爱具有少量值的属性,因此决策树的准确性往往不是特别理想。鉴于此,本文提出了一种改进的E-C4.5算法,该算法结合信息增益和信息增益率生成新的属性划分准则。该属性划分方法极大地消除了C4.5算法偏爱值较少的属性的缺点,进一步提高了决策树生成的决策精度。本文利用实际数据集,对比传统C4.5算法,验证改进算法生成的决策树的准确性。
{"title":"Research on C4.5 Algorithm Optimization For User Churn","authors":"Chao Deng, Zhaohui Ma","doi":"10.1109/CSAIEE54046.2021.9543367","DOIUrl":"https://doi.org/10.1109/CSAIEE54046.2021.9543367","url":null,"abstract":"Decision tree is a kind of machine learning method which can decide a corresponding result according to the probability of different eigenvalues, The effective decision number constructed can provide help for our data analysis. The generation of decision tree is a recursive process, It mainly uses the optimal partition attribute as the corresponding tree node, and then uses various values of the attribute to construct branches. In this way, until the data reaches a certain purity, the leaf nodes are obtained, and a decision tree in accordance with the rules is constructed. Among the traditional decision tree algorithms, C4.5 algorithm has a gain rate because of its attribute division. This leads to another obvious disadvantage, that is, it has a preference for the attributes with a small number of values, so that the accuracy of the decision tree is often not particularly ideal. In view of this, this paper proposes an improved E-C4.5 algorithm, which combines information gain and information gain rate to generate a new attribute partition criterion. The attribute partition method greatly eliminates the shortcoming of C4.5 algorithm which has a preference for the attributes with a small number of values, and further improves the decision accuracy of decision tree generation. In this paper, the actual data sets are used to verify the accuracy of the decision tree generated by the improved algorithm compared with the traditional C4.5 algorithm.","PeriodicalId":376014,"journal":{"name":"2021 IEEE International Conference on Computer Science, Artificial Intelligence and Electronic Engineering (CSAIEE)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116906979","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}
引用次数: 1
CTR Prediction Model Using xDeepFM and Bayesian optimization 基于xDeepFM和贝叶斯优化的点击率预测模型
Yiying Zhang
With the development of internet, increasing people tends to consume online, which is convenient and timesaving. Taobao is the largest online shopping site in China. In this paper, we use the data from Taobao to predict the click-through-rate (CTR), an important metrics that measures the number of clicks advertisers receive on their ads per number of impressions. We introduce xDeepFM model to predict CTR and use Bayesian optimization to optimize. The xDeepFM model is a combined model, composed by DNN and CIN, like Wide&Deep. Based on it, the xDeepFM model enables to catch features of different dimensions: implicit high-order interactions and explicit high-order interactions. In addition, we use the Bayesian optimization to get the optimal hyperparameters. The metrics we used is Auc Roc, and the higher Auc-Roc is, the better performance the model will gain. The Auc Roc of our modle is 0.651 higher 0.031 and 0.012 respectively than LightGBM and DeepFM.
随着互联网的发展,越来越多的人倾向于网上消费,这是方便和节省时间。淘宝是中国最大的在线购物网站。在本文中,我们使用来自淘宝的数据来预测点击率(CTR),这是一个重要的指标,用来衡量广告商在每一次展示中收到的广告点击次数。我们引入xDeepFM模型来预测点击率,并使用贝叶斯优化进行优化。xDeepFM模型是一个组合模型,由DNN和CIN组成,就像Wide&Deep一样。在此基础上,xDeepFM模型能够捕捉不同维度的特征:隐式高阶交互和显式高阶交互。此外,我们使用贝叶斯优化来获得最优的超参数。我们使用的指标是Auc-Roc, Auc-Roc越高,模型的性能就越好。我们的模型的Auc Roc分别比LightGBM和DeepFM高0.031和0.012,分别为0.651。
{"title":"CTR Prediction Model Using xDeepFM and Bayesian optimization","authors":"Yiying Zhang","doi":"10.1109/CSAIEE54046.2021.9543277","DOIUrl":"https://doi.org/10.1109/CSAIEE54046.2021.9543277","url":null,"abstract":"With the development of internet, increasing people tends to consume online, which is convenient and timesaving. Taobao is the largest online shopping site in China. In this paper, we use the data from Taobao to predict the click-through-rate (CTR), an important metrics that measures the number of clicks advertisers receive on their ads per number of impressions. We introduce xDeepFM model to predict CTR and use Bayesian optimization to optimize. The xDeepFM model is a combined model, composed by DNN and CIN, like Wide&Deep. Based on it, the xDeepFM model enables to catch features of different dimensions: implicit high-order interactions and explicit high-order interactions. In addition, we use the Bayesian optimization to get the optimal hyperparameters. The metrics we used is Auc Roc, and the higher Auc-Roc is, the better performance the model will gain. The Auc Roc of our modle is 0.651 higher 0.031 and 0.012 respectively than LightGBM and DeepFM.","PeriodicalId":376014,"journal":{"name":"2021 IEEE International Conference on Computer Science, Artificial Intelligence and Electronic Engineering (CSAIEE)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127214159","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}
引用次数: 0
Video motions classification based on CNN 基于CNN的视频动作分类
Yue Luo, Boyuan Yang
There are more and more videos appearing on the internet these years, new ways should be developed to recognize and manage them. Since video is composed of images, this work builds a CNN network to do video classification. The work uses the UCF 101 dataset, which contains 101 different categories, to train the model. Then a simple CNN network containing five layers is built with PyTorch and trained with UCF 101 dataset on GPU. The result shows that it's underfitting and its accuracy won't be improved much by changing parameters. However, adding more layers, including the dropout layer and batchnorm layer can greatly improve its accuracy. Then a C3D method is also applied to improve the accuracy. Finally, the highest accuracy reaches 69 percentage. In this work, a simple and effective way to recognize actions in a small video is developed to help people supervise and manage the video resources online.
近年来,互联网上出现了越来越多的视频,应该开发新的方法来识别和管理它们。由于视频是由图像组成的,因此本工作构建了一个CNN网络来对视频进行分类。这项工作使用了包含101个不同类别的UCF 101数据集来训练模型。然后用PyTorch构建了一个包含五层的简单CNN网络,并在GPU上使用UCF 101数据集进行训练。结果表明,该方法存在欠拟合,改变参数对其精度的提高不大。然而,增加更多的层,包括dropout层和batchnorm层,可以大大提高其精度。然后采用C3D方法提高了精度。最后,最高准确率达到69%。本文提出了一种简单有效的小视频动作识别方法,以帮助人们对在线视频资源进行监督和管理。
{"title":"Video motions classification based on CNN","authors":"Yue Luo, Boyuan Yang","doi":"10.1109/CSAIEE54046.2021.9543398","DOIUrl":"https://doi.org/10.1109/CSAIEE54046.2021.9543398","url":null,"abstract":"There are more and more videos appearing on the internet these years, new ways should be developed to recognize and manage them. Since video is composed of images, this work builds a CNN network to do video classification. The work uses the UCF 101 dataset, which contains 101 different categories, to train the model. Then a simple CNN network containing five layers is built with PyTorch and trained with UCF 101 dataset on GPU. The result shows that it's underfitting and its accuracy won't be improved much by changing parameters. However, adding more layers, including the dropout layer and batchnorm layer can greatly improve its accuracy. Then a C3D method is also applied to improve the accuracy. Finally, the highest accuracy reaches 69 percentage. In this work, a simple and effective way to recognize actions in a small video is developed to help people supervise and manage the video resources online.","PeriodicalId":376014,"journal":{"name":"2021 IEEE International Conference on Computer Science, Artificial Intelligence and Electronic Engineering (CSAIEE)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126343758","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}
引用次数: 2
Res-Attention Net: An Image Dehazing Network 重新注意网络:一种图像去雾网络
Shuai Song, Ren-Yuan Zhang, Zhipeng Qiu, Jiawei Jin, Shangbin Yu
In the image dehazing task, there are three key subtasks need to be performed. The first one is extracting the finer scale features, e.g. the detail textures of objects, covered by haze. The second one is retaining the coarser scale features, e.g. the contours of objects, as complete as possible. And third one is fusing the finer scale features and the coarser scale features together. Aiming at the three points, we propose a single image dehazing network named Res-Attention Net based on the encoding-decoding structure similar to U -Net. The encoder and decoder of Res-Attention Net are designed for the objective that extracting the detail textures and retrieving the contours at the same time. We construct the encoder of the Res-Attention Net by the residual blocks (RBs) with different depths and downsampling for performing the first two subtasks, i.e. extracting the multiscale image features from the original hazy image. The decoder of the Res-Attention is based on the attention gates (AGs) and upsampling. The decoder can retrieve the coarser scale features from the output of the encoder and can also fuse them with the multiscale features from the encoder together. That is to say, the decoder is for performing the last two subtasks. The experimental results show that the Res-Attention Net proposed performs better than several state-of-the-art methods.
在图像去雾任务中,有三个关键的子任务需要完成。第一个是提取更精细的尺度特征,例如被雾霾覆盖的物体的细节纹理。第二种方法是尽可能完整地保留较粗的尺度特征,例如物体的轮廓。第三个是将细尺度特征和粗尺度特征融合在一起。针对这三点,我们提出了一种基于类似于U -Net的编码-解码结构的单幅图像去雾网络——re - attention Net。以提取细节纹理和提取轮廓为目标,设计了re - attention Net的编码器和解码器。我们通过不同深度的残差块(RBs)和下采样构造了re - attention Net的编码器,用于执行前两个子任务,即从原始模糊图像中提取多尺度图像特征。re - attention的解码器基于注意门(AGs)和上采样。解码器可以从编码器的输出中检索粗尺度特征,也可以将它们与编码器的多尺度特征融合在一起。也就是说,解码器是用来执行最后两个子任务的。实验结果表明,所提出的re - attention Net比目前几种方法的性能更好。
{"title":"Res-Attention Net: An Image Dehazing Network","authors":"Shuai Song, Ren-Yuan Zhang, Zhipeng Qiu, Jiawei Jin, Shangbin Yu","doi":"10.1109/CSAIEE54046.2021.9543298","DOIUrl":"https://doi.org/10.1109/CSAIEE54046.2021.9543298","url":null,"abstract":"In the image dehazing task, there are three key subtasks need to be performed. The first one is extracting the finer scale features, e.g. the detail textures of objects, covered by haze. The second one is retaining the coarser scale features, e.g. the contours of objects, as complete as possible. And third one is fusing the finer scale features and the coarser scale features together. Aiming at the three points, we propose a single image dehazing network named Res-Attention Net based on the encoding-decoding structure similar to U -Net. The encoder and decoder of Res-Attention Net are designed for the objective that extracting the detail textures and retrieving the contours at the same time. We construct the encoder of the Res-Attention Net by the residual blocks (RBs) with different depths and downsampling for performing the first two subtasks, i.e. extracting the multiscale image features from the original hazy image. The decoder of the Res-Attention is based on the attention gates (AGs) and upsampling. The decoder can retrieve the coarser scale features from the output of the encoder and can also fuse them with the multiscale features from the encoder together. That is to say, the decoder is for performing the last two subtasks. The experimental results show that the Res-Attention Net proposed performs better than several state-of-the-art methods.","PeriodicalId":376014,"journal":{"name":"2021 IEEE International Conference on Computer Science, Artificial Intelligence and Electronic Engineering (CSAIEE)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114273877","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}
引用次数: 3
Teacher-Student Network for Low-quality Remote Sensing Ship Detection 面向低质量遥感船舶探测的师生网络
Shitian He, H. Zou, Runlin Li, Xu Cao, Fei Cheng, Juan Wei
Most CNN-based detectors rely on high-quality images, and the detection performance may be damaged as the image quality decreases. To enhance ship detection for low-quality images, we propose a distillation network which utilize a “teacher” detector with high-quality input images to guide the training of the original “student” detector. In this way, the student detector can learn the advantage information from the teacher and thus achieves improved detection performance. We feed images with different sampling ratios to our network, and the experimental results on HRSC2016 dataset validate the effectiveness of our method. Moreover, we apply our method to different backbones, and the experimental results demonstrate the generality of our method.
大多数基于cnn的检测器依赖于高质量的图像,随着图像质量的下降,检测性能可能会受到影响。为了增强对低质量图像的船舶检测,我们提出了一种蒸馏网络,该网络利用具有高质量输入图像的“教师”检测器来指导原始“学生”检测器的训练。这样,学生检测器可以从老师那里学习到优势信息,从而提高检测性能。我们将不同采样比例的图像输入到网络中,在HRSC2016数据集上的实验结果验证了我们方法的有效性。并将该方法应用于不同的骨干网,实验结果证明了该方法的通用性。
{"title":"Teacher-Student Network for Low-quality Remote Sensing Ship Detection","authors":"Shitian He, H. Zou, Runlin Li, Xu Cao, Fei Cheng, Juan Wei","doi":"10.1109/CSAIEE54046.2021.9543185","DOIUrl":"https://doi.org/10.1109/CSAIEE54046.2021.9543185","url":null,"abstract":"Most CNN-based detectors rely on high-quality images, and the detection performance may be damaged as the image quality decreases. To enhance ship detection for low-quality images, we propose a distillation network which utilize a “teacher” detector with high-quality input images to guide the training of the original “student” detector. In this way, the student detector can learn the advantage information from the teacher and thus achieves improved detection performance. We feed images with different sampling ratios to our network, and the experimental results on HRSC2016 dataset validate the effectiveness of our method. Moreover, we apply our method to different backbones, and the experimental results demonstrate the generality of our method.","PeriodicalId":376014,"journal":{"name":"2021 IEEE International Conference on Computer Science, Artificial Intelligence and Electronic Engineering (CSAIEE)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114323476","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}
引用次数: 0
Application of Active Learning in Decoding 主动学习在解码中的应用
Yunfei Quan
Improved technology has resulted in numerous computing devices. The more people spend time interacting with these computing devices, the more we become interested in coming up with new interaction methods that could help to facilitate application of active learning in decoding with the computing devices. Application of active learning in decoding technology will help achieve the goal of this journal as it helps to overcome eye limitations in speed and efficiency. Application of Active Learning Decoding for Python3 programming language was mainly created because it was flexible, easy to extend, and developed some other small models. The machine learning algorithm in python is often lying beneath the scikit-learn python library. The user can easily modify and build another new model to predict the model learning algorithm. The model can also design a good and quality novel model algorithm that can be used more easily.
技术的改进产生了许多计算设备。人们花越多的时间与这些计算设备进行交互,我们就越有兴趣提出新的交互方法,这些方法可以帮助促进主动学习在计算设备解码中的应用。主动学习在解码技术中的应用将有助于实现本期刊的目标,因为它有助于克服眼睛在速度和效率方面的限制。主要创建了Python3编程语言的主动学习解码应用,因为它灵活,易于扩展,并开发了一些其他的小模型。python中的机器学习算法通常位于scikit-learn python库之下。用户可以很容易地修改和建立另一个新的模型来预测模型的学习算法。该模型还可以设计出质量好、使用方便的新型模型算法。
{"title":"Application of Active Learning in Decoding","authors":"Yunfei Quan","doi":"10.1109/CSAIEE54046.2021.9543424","DOIUrl":"https://doi.org/10.1109/CSAIEE54046.2021.9543424","url":null,"abstract":"Improved technology has resulted in numerous computing devices. The more people spend time interacting with these computing devices, the more we become interested in coming up with new interaction methods that could help to facilitate application of active learning in decoding with the computing devices. Application of active learning in decoding technology will help achieve the goal of this journal as it helps to overcome eye limitations in speed and efficiency. Application of Active Learning Decoding for Python3 programming language was mainly created because it was flexible, easy to extend, and developed some other small models. The machine learning algorithm in python is often lying beneath the scikit-learn python library. The user can easily modify and build another new model to predict the model learning algorithm. The model can also design a good and quality novel model algorithm that can be used more easily.","PeriodicalId":376014,"journal":{"name":"2021 IEEE International Conference on Computer Science, Artificial Intelligence and Electronic Engineering (CSAIEE)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130025680","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}
引用次数: 0
K-means clustering algorithm and Python implementation K-means聚类算法和Python实现
BoKai Wu
K-means is a commonly used algorithm in machine learning. It is an unsupervised learning algorithm. It is regularly used for data clustering. Only the number of clusters are needed to be specified for it to automatically aggregate the data into multiple categories, the similarity between data in the same cluster is high, thus, the similarity of data in different clusters is low. K-means algorithm is a typical distance-based clustering algorithm. It takes distance as the evaluation index of similarity, that is, the closer the distance between two objects, the greater similarity. Clustering is also extremely extensive in practical applications, such as: market segmentation, social network analysis, organized computing clusters, and astronomical data analysis. This paper is my own attempt to make K-means code and API, using Python and Java to jointly complete a project. The Python is mainly used to write the framework of the core algorithm of K-means, and the Java to create experimental data. In this research report, I will describe the simple data model provided by K-means, as well as the design and implementation of K-means.
K-means是机器学习中常用的算法。这是一种无监督学习算法。它经常用于数据聚类。它只需要指定簇数就可以自动将数据聚合成多个类别,同一簇中的数据相似度高,因此不同簇中的数据相似度低。K-means算法是一种典型的基于距离的聚类算法。它以距离作为相似度的评价指标,即两个物体之间的距离越近,相似度越大。聚类在实际应用中也非常广泛,如:市场细分、社会网络分析、有组织的计算集群、天文数据分析等。本文是我自己尝试制作K-means代码和API,使用Python和Java共同完成的一个项目。主要使用Python编写K-means核心算法的框架,使用Java创建实验数据。在这篇研究报告中,我将描述K-means提供的简单数据模型,以及K-means的设计和实现。
{"title":"K-means clustering algorithm and Python implementation","authors":"BoKai Wu","doi":"10.1109/CSAIEE54046.2021.9543260","DOIUrl":"https://doi.org/10.1109/CSAIEE54046.2021.9543260","url":null,"abstract":"K-means is a commonly used algorithm in machine learning. It is an unsupervised learning algorithm. It is regularly used for data clustering. Only the number of clusters are needed to be specified for it to automatically aggregate the data into multiple categories, the similarity between data in the same cluster is high, thus, the similarity of data in different clusters is low. K-means algorithm is a typical distance-based clustering algorithm. It takes distance as the evaluation index of similarity, that is, the closer the distance between two objects, the greater similarity. Clustering is also extremely extensive in practical applications, such as: market segmentation, social network analysis, organized computing clusters, and astronomical data analysis. This paper is my own attempt to make K-means code and API, using Python and Java to jointly complete a project. The Python is mainly used to write the framework of the core algorithm of K-means, and the Java to create experimental data. In this research report, I will describe the simple data model provided by K-means, as well as the design and implementation of K-means.","PeriodicalId":376014,"journal":{"name":"2021 IEEE International Conference on Computer Science, Artificial Intelligence and Electronic Engineering (CSAIEE)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133035343","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}
引用次数: 3
A multi-scale surface target recognition algorithm based on attention fusion mechanism 基于注意融合机制的多尺度表面目标识别算法
Runze Guo, Shaojing Su, Zhen Zuo, Bei Sun
With the growing demand for marine environment supervision in China, surface target recognition has attracted more attention. To address the problems of complex water scenes with scale changes, much background information and inability to focus on key features, this paper proposes a multi-scale surface target recognition algorithm based on attention fusion mechanism. First, the network extracts different features from surface targets by multi-scale convolutional neural network. Then, discriminative features are enhanced by the fusion of channel attention module and spatial attention module. Finally, the feature representation of surface targets is formed by a joint loss function with localization loss and category loss. Tests are conducted on the VOC2007 dataset and the self-built surface target dataset, and the results show that the algorithm outperforms than other typical recognition on surface targets.
随着中国海洋环境监测需求的不断增长,海面目标识别受到越来越多的关注。针对复杂水场景尺度变化大、背景信息多、重点特征无法集中的问题,提出了一种基于注意融合机制的多尺度水面目标识别算法。首先,利用多尺度卷积神经网络提取表面目标的不同特征;然后,通过融合通道注意模块和空间注意模块增强识别特征;最后,用包含局部损失和类别损失的联合损失函数来表示表面目标的特征。在VOC2007数据集和自建表面目标数据集上进行了测试,结果表明该算法在表面目标识别上优于其他典型算法。
{"title":"A multi-scale surface target recognition algorithm based on attention fusion mechanism","authors":"Runze Guo, Shaojing Su, Zhen Zuo, Bei Sun","doi":"10.1109/CSAIEE54046.2021.9543180","DOIUrl":"https://doi.org/10.1109/CSAIEE54046.2021.9543180","url":null,"abstract":"With the growing demand for marine environment supervision in China, surface target recognition has attracted more attention. To address the problems of complex water scenes with scale changes, much background information and inability to focus on key features, this paper proposes a multi-scale surface target recognition algorithm based on attention fusion mechanism. First, the network extracts different features from surface targets by multi-scale convolutional neural network. Then, discriminative features are enhanced by the fusion of channel attention module and spatial attention module. Finally, the feature representation of surface targets is formed by a joint loss function with localization loss and category loss. Tests are conducted on the VOC2007 dataset and the self-built surface target dataset, and the results show that the algorithm outperforms than other typical recognition on surface targets.","PeriodicalId":376014,"journal":{"name":"2021 IEEE International Conference on Computer Science, Artificial Intelligence and Electronic Engineering (CSAIEE)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127835354","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}
引用次数: 1
Rule-Based Approach to the Automatic Detection of Individual Tree Crowns in RGB Satellite Images 基于规则的RGB卫星图像单个树冠自动检测方法
Tanqiu Jiang, Ziyu Xiong
Along with the rapid growth of wildfire events around the globe, the appeal to a better forest management strategy is becoming increasingly stronger recently. “Tree Delineation”, which refers to the process of identifying each individual tree from images, is a crucial element in the fields of forest management and remote sensing. Many efforts have been done to locate each individual tree in an image, but the vast majority of the researches were not based on the RGB images that are the most common and the most easily available at a large scale. In our study, we used RGB satellite images from Google Earth and attempted to identify each tree in the images with a rule-based methodology. Our method involves steps including recognizing vegetation, isolating trees, and locating local maxima. The result of our algorithm is comparable to labeling trees manually, and the robustness was confirmed by repeating the same approach on multiple images of different locations.
随着全球野火事件的快速增长,对更好的森林管理战略的呼吁越来越强烈。“树木圈定”是指从图像中识别每棵树的过程,是森林管理和遥感领域的一个关键要素。已经做了很多努力来定位图像中的每棵树,但是绝大多数的研究都不是基于最常见和最容易大规模获得的RGB图像。在我们的研究中,我们使用了来自Google Earth的RGB卫星图像,并试图用基于规则的方法识别图像中的每棵树。我们的方法包括识别植被、隔离树木和定位局部最大值等步骤。我们的算法的结果与手动标记树相当,并且通过在不同位置的多幅图像上重复相同的方法来验证鲁棒性。
{"title":"Rule-Based Approach to the Automatic Detection of Individual Tree Crowns in RGB Satellite Images","authors":"Tanqiu Jiang, Ziyu Xiong","doi":"10.1109/CSAIEE54046.2021.9543379","DOIUrl":"https://doi.org/10.1109/CSAIEE54046.2021.9543379","url":null,"abstract":"Along with the rapid growth of wildfire events around the globe, the appeal to a better forest management strategy is becoming increasingly stronger recently. “Tree Delineation”, which refers to the process of identifying each individual tree from images, is a crucial element in the fields of forest management and remote sensing. Many efforts have been done to locate each individual tree in an image, but the vast majority of the researches were not based on the RGB images that are the most common and the most easily available at a large scale. In our study, we used RGB satellite images from Google Earth and attempted to identify each tree in the images with a rule-based methodology. Our method involves steps including recognizing vegetation, isolating trees, and locating local maxima. The result of our algorithm is comparable to labeling trees manually, and the robustness was confirmed by repeating the same approach on multiple images of different locations.","PeriodicalId":376014,"journal":{"name":"2021 IEEE International Conference on Computer Science, Artificial Intelligence and Electronic Engineering (CSAIEE)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125701484","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}
引用次数: 0
Temporal Attention Based TCN-BIGRU Model for Energy Time Series Forecasting 基于时间关注的TCN-BIGRU模型能源时间序列预测
Liang Li, Min Hu, Fuji Ren, Haijun Xu
Over the years, energy time series forecasting has been widely studied and has played an important role in various fields, such as electric energy forecasting, solar energy forecasting, etc. In energy time series forecasting, it is crucial to building forecasting models for long series in order to obtain accurate forecasting results. Since the use of long series can cause the accuracy of the model to decrease. In this paper, we propose a deep learning model (TCNTA-BiGRU) based on a bi-directional gated cyclic unit (BiGRU) with a temporal attention mechanism to address the problem of accuracy degradation in long sequence tasks. First, in order to capture long-term dependencies, this paper divide the dataset and input it into a temporal convolutional network (TCN) to transform long sequences into multiple short sequences, which not only solves the problem that to cause gradient explosion or disappearance when processing long sequences, but also reduces the spatial complexity. Then, BiGRU is used to learn historical and future information and capture more short-term dependencies. Moreover, in order to enhance the model's ability to focus on data periodicity, a temporal attention mechanism is introduced. Additionally the autoregressive module is used to increase the linear fitting ability of the model. The model proposed in this paper is applied to the Electricity and Solar Energy datasets and the results show a better performance relate to existing deep learning models.
多年来,能源时间序列预测得到了广泛的研究,并在电能预测、太阳能预测等各个领域发挥了重要作用。在能源时间序列预测中,为了获得准确的预测结果,建立长时间序列的预测模型至关重要。由于使用长序列会导致模型的精度降低。在本文中,我们提出了一种基于双向门控循环单元(BiGRU)的深度学习模型(TCNTA-BiGRU),该模型具有时间注意机制,以解决长序列任务中的精度下降问题。首先,为了捕获长期依赖关系,本文将数据集进行分割并输入到时序卷积网络(temporal convolutional network, TCN)中,将长序列转化为多个短序列,既解决了处理长序列时造成梯度爆炸或消失的问题,又降低了空间复杂度。然后,使用BiGRU来学习历史和未来信息,并捕获更多的短期依赖关系。此外,为了增强模型对数据周期性的关注能力,引入了时间关注机制。此外,采用自回归模型提高了模型的线性拟合能力。将本文提出的模型应用于电力和太阳能数据集,结果表明与现有的深度学习模型相比,该模型具有更好的性能。
{"title":"Temporal Attention Based TCN-BIGRU Model for Energy Time Series Forecasting","authors":"Liang Li, Min Hu, Fuji Ren, Haijun Xu","doi":"10.1109/CSAIEE54046.2021.9543210","DOIUrl":"https://doi.org/10.1109/CSAIEE54046.2021.9543210","url":null,"abstract":"Over the years, energy time series forecasting has been widely studied and has played an important role in various fields, such as electric energy forecasting, solar energy forecasting, etc. In energy time series forecasting, it is crucial to building forecasting models for long series in order to obtain accurate forecasting results. Since the use of long series can cause the accuracy of the model to decrease. In this paper, we propose a deep learning model (TCNTA-BiGRU) based on a bi-directional gated cyclic unit (BiGRU) with a temporal attention mechanism to address the problem of accuracy degradation in long sequence tasks. First, in order to capture long-term dependencies, this paper divide the dataset and input it into a temporal convolutional network (TCN) to transform long sequences into multiple short sequences, which not only solves the problem that to cause gradient explosion or disappearance when processing long sequences, but also reduces the spatial complexity. Then, BiGRU is used to learn historical and future information and capture more short-term dependencies. Moreover, in order to enhance the model's ability to focus on data periodicity, a temporal attention mechanism is introduced. Additionally the autoregressive module is used to increase the linear fitting ability of the model. The model proposed in this paper is applied to the Electricity and Solar Energy datasets and the results show a better performance relate to existing deep learning models.","PeriodicalId":376014,"journal":{"name":"2021 IEEE International Conference on Computer Science, Artificial Intelligence and Electronic Engineering (CSAIEE)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2021-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116228351","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}
引用次数: 3
期刊
2021 IEEE International Conference on Computer Science, Artificial Intelligence and Electronic Engineering (CSAIEE)
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1