Proceedings of the 2021 5th International Conference on Innovation in Artificial Intelligence最新文献

筛选
英文 中文
Scale adaptive and lightweight super-resolution with a selective hierarchical residual network 具有选择性分层残差网络的规模自适应轻量级超分辨率
Jiawang Dan, Zhaowei Qu, Xiaoru Wang, Fu Li, Jiahang Gu, Bing Ma
{"title":"Scale adaptive and lightweight super-resolution with a selective hierarchical residual network","authors":"Jiawang Dan, Zhaowei Qu, Xiaoru Wang, Fu Li, Jiahang Gu, Bing Ma","doi":"10.1145/3461353.3461376","DOIUrl":"https://doi.org/10.1145/3461353.3461376","url":null,"abstract":"Deep convolutional neural networks have made remarkable achievements in single-image super-resolution tasks in recent years. However, current methods do not consider the characteristics of super-resolution that the adjacent areas carry similar information. In this paper, we propose a scale adaptive and lightweight super-resolution with a selective hierarchical residual network (SHRN), which utilizes the repeated texture features. Specifically, SHRN is stacked by several selective hierarchical residual blocks (SHRB). The SHRB mainly contains a hierarchical feature fusion structure (HFFS) and a selective feature fusion structure (SFFS). The HFFS uses multiple branches to obtain multiscale features due to the varying texture size of objects. The SFFS fuses features of adjacent branches to select effective information. Plenty of experiments demonstrate that our lightweight model achieves better performance against other methods by extracting scale adaptive features and utilizing the repeated texture structure.","PeriodicalId":114871,"journal":{"name":"Proceedings of the 2021 5th International Conference on Innovation in Artificial Intelligence","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115815779","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
Foggy Image Detection Based on DehazeNet with improved SSD 基于改进SSD的DehazeNet雾图像检测
Yahong Ma, Jinfan Cai, Jiaxin Tao, Qin Yang, Yujie Gao, Xiaojiao Fan
{"title":"Foggy Image Detection Based on DehazeNet with improved SSD","authors":"Yahong Ma, Jinfan Cai, Jiaxin Tao, Qin Yang, Yujie Gao, Xiaojiao Fan","doi":"10.1145/3461353.3461363","DOIUrl":"https://doi.org/10.1145/3461353.3461363","url":null,"abstract":"In order to improve the ability of pedestrian detection in foggy scenes, a method is proposed to improve the performance of pedestrian detection in foggy scenes. DehazeNet convolution is combined with the improved SSD target detection algorithm to realize vehicle and pedestrian detection in foggy scene. Target detection model training was carried out by using the fog images after fog removal treatment and the original fog images, and vehicle and pedestrian detection was carried out in traffic environment with different fog concentration levels. The results showed that the mAP value of DehazeNet with SSD network could reach 79.7%, 5.4% higher than the mAP value of SSD algorithm.","PeriodicalId":114871,"journal":{"name":"Proceedings of the 2021 5th International Conference on Innovation in Artificial Intelligence","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132234782","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
Multiple Biases-incorporated Latent Factorization of Tensors for Dynamic Network Link Prediction 基于多偏差的张量潜在分解的动态网络链路预测
Xuke Wu, Juan Wang, Hao Wu
{"title":"Multiple Biases-incorporated Latent Factorization of Tensors for Dynamic Network Link Prediction","authors":"Xuke Wu, Juan Wang, Hao Wu","doi":"10.1145/3461353.3461356","DOIUrl":"https://doi.org/10.1145/3461353.3461356","url":null,"abstract":"The topological information of a dynamic network varies over time, making it crucial to capture its temporal patterns for predicting missing links accurately. A latent factorization of tensors (LFT)-based model has proven to be efficient to solve this problem, where a dynamic network is represented as a three-way high-dimensional and sparse (HiDS) tensor. However, currently LFT-based models do not consider multiple biases in analyzing an HiDS tensor for accomplishing dynamic link prediction. To address this issue, this paper proposes a multiple biases-incorporated latent factorization of tensors (MBLFT) model, which integrates short-term bias, preprocessing bias and long-term bias into an LFT model. Empirical studies on two large-scale dynamic networks from real applications show that compared with state-of-the-art predictors, an MBLFT model achieves higher prediction accuracy and computational efficiency for missing links in dynamic network.","PeriodicalId":114871,"journal":{"name":"Proceedings of the 2021 5th International Conference on Innovation in Artificial Intelligence","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133493940","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
Learning Navigation Policies for Mobile Robots in Deep Reinforcement Learning with Random Network Distillation 基于随机网络蒸馏深度强化学习的移动机器人导航策略学习
Lifan Pan, Anyi Li, Jun Ma, Jianmin Ji
{"title":"Learning Navigation Policies for Mobile Robots in Deep Reinforcement Learning with Random Network Distillation","authors":"Lifan Pan, Anyi Li, Jun Ma, Jianmin Ji","doi":"10.1145/3461353.3461365","DOIUrl":"https://doi.org/10.1145/3461353.3461365","url":null,"abstract":"Learning navigation policies considers the task of training a model that can find collision-free paths for mobile robots, where various Deep Reinforcement Learning (DRL) methods have been applied with promising results. However, the natural reward function for the task is usually sparse, i.e., obtaining a penalty for the collision and a positive reward for arriving the target position, which makes it difficult to learn. In particular, for some complex navigation environments, it is hard to search a collision-free path by the random exploration, which leads to a rather slow learning speed and solutions with poor performance. In this paper, we propose a DRL based approach to train an end-to-end navigation planner, i.e, the policy neural network, that directly translates the local grid map and the relative goal of the robot into its moving actions. To handle the sparse reward problem, we augment the normal extrinsic reward from the environment with intrinsic reward signals measured by random network distillation (RND). In specific, the intrinsic reward is calculated by two different networks from RND, which encourages the agent to explore a state that has not been seen before. The experimental results show that by augmenting the reward function with intrinsic reward signals by RND, solutions with better performance can be learned more efficiently and more stably in our approach. We also deploy the trained model to a real robot, which can perform collision avoidance in navigation tasks without any parameter tuning. A video of our experiments can be found at https://youtu.be/b1GJrWfO8pw.","PeriodicalId":114871,"journal":{"name":"Proceedings of the 2021 5th International Conference on Innovation in Artificial Intelligence","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133201732","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 Speed Planning Method Based on Time Domain of Unmanned Ground Vehicle 基于时域的无人地面车辆速度规划方法
Shenmin Zhang, Shaobin Wu, Derun Li
{"title":"A Speed Planning Method Based on Time Domain of Unmanned Ground Vehicle","authors":"Shenmin Zhang, Shaobin Wu, Derun Li","doi":"10.1145/3461353.3461379","DOIUrl":"https://doi.org/10.1145/3461353.3461379","url":null,"abstract":"Speed planning ensures safety and ride comfort, and gives a reasonable driving speed for unmanned ground vehicles. Most velocity planning methods based on arc-length of a given local path are inconvenient when considering comfort constraints such as jerk and safe constraints such as lateral acceleration. In this paper, an innovative method is proposed to establish a speed curve model of multiple segment quadratic curves with respect to time domain, and the adjustment method which is dividing quadratic curves units and preinstalling jerk of local velocity curves under the constraint of different velocity correlation variables is described. In practice, the velocity profile satisfying the constraint is obtained through three steps. The first is multiple iterations which are necessary to change the speed profile. The second is jerk boundary adjustment including safety and comfort. The third step is assigning the velocity value to each point of the local path. Furthermore, Simulation result of unmanned vehicle road entrance ramp merging scenario shows the effectiveness of the proposed method through presetting driving conditions and constraints.","PeriodicalId":114871,"journal":{"name":"Proceedings of the 2021 5th International Conference on Innovation in Artificial Intelligence","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125649828","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
Street-level Air Quality Inference Based on Geographically Context-aware Random Forest Using Opportunistic Mobile Sensor Network 基于地理环境感知随机森林的街道级空气质量推断利用机会移动传感器网络
Xuening Qin, T. Do, J. Hofman, Esther Rodrigo, Valerio La Manna Panzica, N. Deligiannis, Wilfried Philips
{"title":"Street-level Air Quality Inference Based on Geographically Context-aware Random Forest Using Opportunistic Mobile Sensor Network","authors":"Xuening Qin, T. Do, J. Hofman, Esther Rodrigo, Valerio La Manna Panzica, N. Deligiannis, Wilfried Philips","doi":"10.1145/3461353.3461370","DOIUrl":"https://doi.org/10.1145/3461353.3461370","url":null,"abstract":"The spatial heterogeneity and temporal variability of air pollution in urban environments make air quality inference for fine-grained air pollution monitoring extremely challenging. Most of the existing work estimates the air quality using sparse measurements collected from a limited number of fixed monitoring stations or make use of computationally demanding physicochemical models simulating the source and fate of pollutants across multiple spatial scales. In this work, we propose a geographically context-aware random forest model for street-level air quality inference using high spatial resolution data collected by an opportunistic mobile sensor network. Compared with a traditional random forest model, the proposed method builds a local model for each location by considering the neighbors in both geographical and feature space. The model is evaluated on our real air quality dataset collected from mobile sensors in Antwerp, Belgium. The experimental results show that the proposed method outperforms a series of commonly used methods including Ordinary Kriging (OK), Inverse Distance Weighting (IDW) and Random forest (RF).","PeriodicalId":114871,"journal":{"name":"Proceedings of the 2021 5th International Conference on Innovation in Artificial Intelligence","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127822530","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
Parallel Attention with Weighted Efficient Network for Video-Based Person Re-Identification 基于加权高效网络的并行关注视频人物再识别
Junting Yang, Z. Yang, Jing Zhou, Yong Zhao, Qifei Dai, Fuchi Li
{"title":"Parallel Attention with Weighted Efficient Network for Video-Based Person Re-Identification","authors":"Junting Yang, Z. Yang, Jing Zhou, Yong Zhao, Qifei Dai, Fuchi Li","doi":"10.1145/3461353.3461357","DOIUrl":"https://doi.org/10.1145/3461353.3461357","url":null,"abstract":"In this paper, we propose a new way to solve the problems of temporal and spatial independence, shallow feature extraction, and large computation which are not solved by traditional video-based Re-ID methods. Insufficient ability to extract features based on traditional networks can cause problems with bad ripple effect later, therefore we design an attention network named Parallel Spatio-Temporal Attention (PSTA) to fuse spatio-temporal features. After extracting deep features, existed methods need stack convolutional operation to model large receptive fields, so we use Non-local operation to capture long-range dependencies directly. For Non-local method, we propose an Attention-Like Similarity (ALS) to learn the weights of similarity matrix adaptively, then filter out redundant similarities. To solve the high complexity brought by Non-local method and maintain accuracy, we perform Spatial Pyramid Pooling (SPP) in Non-local structure to reduce complexity and combine multi-scale features. Extensive experiments with ablation analysis show the effectiveness of our methods, and state-of-the-art results are achieved on large-scale video datasets.","PeriodicalId":114871,"journal":{"name":"Proceedings of the 2021 5th International Conference on Innovation in Artificial Intelligence","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123320563","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
Acquisition of Cooperative Behavior in a Soccer Task Using Reward Shaping 基于奖励塑造的足球任务合作行为习得
Takashi Abe, R. Orihara, Y. Sei, Yasuyuki Tahara, Akihiko Ohsuga
{"title":"Acquisition of Cooperative Behavior in a Soccer Task Using Reward Shaping","authors":"Takashi Abe, R. Orihara, Y. Sei, Yasuyuki Tahara, Akihiko Ohsuga","doi":"10.1145/3461353.3461360","DOIUrl":"https://doi.org/10.1145/3461353.3461360","url":null,"abstract":"In this research, soccer task is investigated among the numerous tasks of deep reinforcement learning. The soccer task requires cooperative behavior. However, it is difficult for the agents to acquire the behavior, because a reward is sparsely given. Moreover, the behaviors of the allies and opponents must be considered by the agents. In addition, in the soccer task, if the agents attempt to acquire high-level cooperative behavior from low-level movements, such as ball kicking, a huge amount of time will be needed to learn a model. In this research, we conduct experiments in which reward shaping is incorporated into deep reinforcement learning. This enables the agents to efficiently acquire cooperative behavior from low-level movements in a soccer task. The findings of this research indicate that reward shaping with a designer's domain knowledge positively influences the agent's attempt to acquire cooperative behavior from low-level movements.","PeriodicalId":114871,"journal":{"name":"Proceedings of the 2021 5th International Conference on Innovation in Artificial Intelligence","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129616486","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
Few-Shot Text Classification with External Knowledge Expansion 基于外部知识扩展的小样本文本分类
Jian Guan, Rui Xu, Jing Ya, Qiu Tang, Jidong Xue, Ni Zhang
{"title":"Few-Shot Text Classification with External Knowledge Expansion","authors":"Jian Guan, Rui Xu, Jing Ya, Qiu Tang, Jidong Xue, Ni Zhang","doi":"10.1145/3461353.3461389","DOIUrl":"https://doi.org/10.1145/3461353.3461389","url":null,"abstract":"The performance of most current models for text classification drops dramatically when annotated data is scarce. In such challenging scenarios, the existing models for few-shot text classification are not accurate or robust enough due to limited capture of semantic knowledge. In this paper, we propose a method of few-shot text classification based on external knowledge expansion and two strategies of expansion to supervise richer information during training and prediction, by leveraging WordNet and pre-trained model BERT. We split texts into sentences, develop techniques to select terms to semantically expand sentences based on knowledge and measure the text instance representation after knowledge expansion. In this way, we find the method is capable of improving the performance on the task of few-shot text classification. We evaluate our method on two English text classification datasets - IMDB and ASRS across a range of training set sizes. Experiment results show that by knowledge expansion, our method is robust and yields better or comparable performance to the state-of-the-art methods on both datasets, which achieves 2.7% relative improvement compared with previous method on the ASRS test set with the training set size of 380.","PeriodicalId":114871,"journal":{"name":"Proceedings of the 2021 5th International Conference on Innovation in Artificial Intelligence","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132437454","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
Target detection algorithm based on CNN and its FPGA implementation 基于CNN的目标检测算法及其FPGA实现
Yan Yan, Yonghui Zhang, Jian Zhang, Ruonan Liu
{"title":"Target detection algorithm based on CNN and its FPGA implementation","authors":"Yan Yan, Yonghui Zhang, Jian Zhang, Ruonan Liu","doi":"10.1145/3461353.3461385","DOIUrl":"https://doi.org/10.1145/3461353.3461385","url":null,"abstract":"When the deep learning algorithm is deployed on FPGA platform, it is difficult to deploy different network structures with a single hardware structure. The iteration of the algorithm becomes complex and increases the iteration time. Aiming at these problems of Deploying deep learning algorithm on FPGA platforms, This paper presents a neural network accelerator based on FPGA, the proposed accelerator has high adaptability to different networks, the accelerator beneficial to accelerate and optimize the hardware of convolutional neural network for image recognition, efficiently use the limited resources on FPGA chip to realize the calculation of large-scale convolutional neural network, our work explores a high-performance, low-power and low-cost embedded solution for image recognition applications. Finally, this paper takes the Xilinx FPGA platform ultra96v2 as the hardware platform, we realizes the deployment of the accelerator on the FPGA platform, implements and verifies the yolov3 algorithm on the platform and achieves good detection results.","PeriodicalId":114871,"journal":{"name":"Proceedings of the 2021 5th International Conference on Innovation in Artificial Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132529383","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信