检索结果-内蒙古大学图书馆

An Unmanned Aerial Vehicle Pose Estimation System Guided by Desired Shot

学校读者我要写书评

暂无评论

An Unmanned Aerial Vehicle Pose Estimation System Guided by ...

IEEE International Conference on Automation, Electronics and Electrical engineering (AUTEEE)

作者： Xinglei Dou Qijian Ding Qiao Du Min Yang Yuzhou Huo Xin Wang College of Software Engineering Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineer of Ministry of Education Jilin University Changchun China

ISBN: (数字)9781728150307

ISBN: (纸本)9781728150314

Unmanned aerial vehicles (UAVs) are widely used in aerial photography nowadays for their strong maneuverability, good image quality and high cost performance, while they have limited battery capacity and difficulty in operation. It is difficult to reach the ideal pose and get the desired shot by manual manipulation in a short time. To solve these problems, an UAV pose estimation system guided by desired shot is constructed. Either a sequence of images or a video is taken as input. The user interacts with the system to express the desired shot. The 3D-reconstruction is done by Structure from Motion (SfM). Then the Perspective-n-Point (PnP) problem is solved to estimate the ideal pose of the UAV. The experimental results proves that the system is effective and valid.

关键词： Three-dimensional displays Feature extraction Unmanned aerial vehicles Cameras Pose estimation Software engineering Data mining

Multiple Auxiliary Information Based Deep Model for Collaborative Filtering

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2018年第4期33卷 668-681页

作者： Lin Yue Xiao-Xin Sun Wen-Zhu Gao Guo-Zhong Feng Bang-Zuo Zhang School of Information Science and Technology Northeast Normal University Changchun 130117 China Key Laboratory of Applied Statistics of Ministry of Education Northeast Normal University Changchun 130024 China School of Environment Northeast Normal University Changchun 130117 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China

With the ever-growing dynamicity, complexity, technique is proposed and becomes one of the most effective and volume of information resources, the recommendation techniques for solving the so-called problem of information overload. Traditional recommendation algorithms, such as collaborative filtering based on the user or item, only measure the degree of similarity between users or items with single criterion, i.e., ratings. According to the experience of previous studies, single criterion cannot accurately measure the similarity between user preferences or items. In recent years, the application of deep learning techniques has gained significant momentum in recommender systems for better understanding of user preferences, item characteristics, and historical interactions. In this work, we integrate plot information as auxiliary information into the denoising autoencoder （DAE）, called SemRe-DCF, which aims at learning semantic representations of item descriptions and succeeds in capturing fine-grained semantic regularities by using vector arithmetic to get better rating prediction. The results manifest that the proposed method can effectively improve the accuracy of prediction and solve the cold start problem.

关键词： semantic representation plot information denoising autoencoder collaborative filtering auxiliary information

GEOM-GCN: Geometric graph convolutional networks

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Pei, Hongbin Wei, Bingzhe Chang, Kevin Chen-Chuan Lei, Yu Yang, Bo College of Computer Science and Technology Jilin University China Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign United States Department of Computer Science University of Illinois at Urbana-Champaign United States Department of Computing Hong Kong Polytechnic University Hong Kong Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education China

Message-passing neural networks (MPNNs) have been successfully applied to representation learning on graphs in a variety of real-world applications. However, two fundamental weaknesses of MPNNs' aggregators limit their ability to represent graph-structured data: losing the structural information of nodes in neighborhoods and lacking the ability to capture long-range dependencies in disassortative graphs. Few studies have noticed the weaknesses from different perspectives. From the observations on classical neural network and network geometry, we propose a novel geometric aggregation scheme for graph neural networks to overcome the two weaknesses. The behind basic idea is the aggregation on a graph can benefit from a continuous space underlying the graph. The proposed aggregation scheme is permutation-invariant and consists of three modules, node embedding, structural neighborhood, and bi-level aggregation. We also present an implementation of the scheme in graph convolutional networks, termed Geom-GCN, to perform transductive learning on graphs. Experimental results show the proposed Geom-GCN achieved state-of-the-art performance on a wide range of open datasets of graphs. Copyright © 2020, The Authors. All rights reserved.

关键词： Graphic methods

CircRNAFisher: a systematic computational approach for de novo circular RNA identification

学校读者我要写书评

暂无评论

中国药理学报（英文版） 2019年第1期40卷 55-63页

作者： Guo-yi Jia Duo-lin Wang Meng-zhu Xue Yu-wei Liu Yu-chen Pei Ying-qun Yang Jing-mei Xu Yan-chun Liang Peng Wang School of Life Sciences Shanghai University Shanghai 200444 China Laboratory of Systems Biology Shanghai Advanced Research Institute Chinese Academy of SciencesShanghai 201210 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun 130012 China Laboratory of Systems Biology Shanghai Advanced Research Institute Chinese Academy of SciencesShanghai 201210 China Laboratory of Systems Biology Shanghai Advanced Research Institute Chinese Academy of SciencesShanghai 201210 China School of Life Science and Technology Shanghai Tech University Shanghai 201210 China

Circular RNAs (circRNAs) are emerging species of mRNA splicing products with largely unknown *** several computational pipelines for circRNA identification have been developed,these methods strictly rely on uniquely mapped reads overlapping back-splice junctions (BSJs) and lack approaches to model the statistical significance of the identified ***,we reported a systematic computational approach to identify circRNAs by simultaneously utilizing BSJ overlapping reads and discordant BSJ spanning reads to identify ***,we developed a novel procedure to estimate the P-values of the identified circRNAs.A computational cross-validation and experimental validations demonstrated that our method performed favorably compared to existing circRNA detection *** created a standalone tool,CircRNAFisher,to implement the method,which might be valuable to computational and experimental scientists studying circRNAs.

关键词： circRNA RNA-Seq alternative splicing pipeline

Applications of Game Theory in Vehicular Networks: A Survey

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Sun, Zemin Liu, Yanheng Wang, Jian Li, Guofa Anil, Carie Li, Keqiang Guo, Xinyu Sun, Geng Tian, Daxin Cao, Dongpu College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China Institute of Human Factors and Ergonomics College of Mechatronics and Control Engineering Shenzhen University Guangdong Shenzhen518060 China School of Computer Science and Engineering VIT-AP Andhra Pradesh Amaravati522237 India College of Engineering Nanjing Agricultural University Nanjing210031 China State Key Laboratory of Automotive Safety and Energy Department of Automotive Engineering Tsinghua University Beijing100084 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beijing Key Laboratory for Cooperative Vehicle Infrastructure Systems and Safety Control School of Transportation Science and Engineering Beihang University Beijing100191 China Waterloo Cognitive Autonomous Driving Lab University of Waterloo N2L 3G1 Canada

In the Internet of things (IoT) era, vehicles and other intelligent components in an intelligent transportation system (ITS) are connected, forming vehicular networks (VNs) that provide efficient and safe traffic and ubiquitous access to various applications. However, as the number of nodes in an ITS increases, it is challenging to satisfy a varied and large number of service requests with different quality of service (QoS) and security requirements in highly dynamic VNs. Intelligent nodes in VNs can compete or cooperate for limited network resources to achieve the objective for either an individual or a group. Game theory (GT), a theoretical framework designed for strategic interactions among rational decision makers sharing scarce resources, can be used to model and analyze individual or group behaviors of communicating entities in VNs. This paper primarily surveys the recent developments of GT in solving various challenges of VNs. This survey starts with an introduction to the background of VNs. A review of GT models studied in the VNs is then introduced, including the basic concepts, classifications, and applicable vehicular issues. After discussing the requirements of VNs and the motivation of using GT, a comprehensive literature review on GT applications in dealing with the challenges of current VNs is provided. Furthermore, recent contributions of GT to VNs that are integrated with diverse emerging 5G technologies are surveyed. Finally, the lessons learned are given, and several key research challenges and possible solutions of applying GT in VNs are outlined. Copyright © 2021, The Authors. All rights reserved.

关键词： Quality of service

A Fuzzy Clustering Based Collaborative Filtering Algorithm for Time-aware POI Recommendation

学校读者我要写书评

暂无评论

Journal of Physics: Conference Series 2021年第1期1746卷

作者： Minghao Yin Yanheng Liu Xu Zhou Geng Sun College of Computer Science and Technology Jilin University Changchun Jilin China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin China Center for Computer Fundamental Education Jilin University Changchun Jilin China

Location based social network develops and gets widely concern along with the population and widespread use of mobile. Point of interest(POI) recommendation become one of the most widely application among location-based service. To get better POI recommendation performance, a fuzzy clustering based collaborative filtering algorithm (FCCF) for time-aware POI recommendation is proposed in this paper. It first constructs the user feature vector from users' check-in behaviours. Individual's check-in behaviour can be under the influence of location region and time slots, so user's feature consists of two parts. One is the vising frequency of each user in different location regions, and the other is the vising frequency of each user in different time slots. Next fuzzy c-means is adopted due to its simplicity to group users according to user feature vector. Then the user similarity computation can be limited in the similar small user groups. In the end, a collaborative filtering algorithm is applied to recommend a number of top-N POIs at a given time for the target user. Some experiments are conducted and the comparative results on Foursquare and Gowalla show that FCCF has higher precision and recall value than the comparative algorithms.

关键词：

Correction to: MRI enhancement based on visual-attention by adaptive contrast adjustment and image fusion

学校读者我要写书评

暂无评论

Multimedia Tools and Applications 2021年第9期80卷 13019-13019页

作者： Rui Zhu Xiongfei Li Xiaoli Zhang Xiaowei Xu Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China College of Computer Science and Technology Jilin University Changchun China Department of Information Sciences University of Arkansas at Little Rock Little Rock USA

A Correction to this paper has been published: https://***/10.1007/s11042-021-10782-7

关键词：

Learning optimal data augmentation policies via bayesian optimization for image classification tasks

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Zhang, Chunxu Cui, Jiaxu Yang, Bo College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

In recent years, deep learning has achieved remarkable achievements in many fields, including computer vision, natural language processing, speech recognition and others. Adequate training data is the key to ensure the effectiveness of the deep models. However, obtaining valid data requires a lot of time and labor resources. Data augmentation (DA) is an effective alternative, which can generate new labeled data based on existing data using label-preserving transformations. Although we can benefit a lot from DA, designing appropriate DA policies requires a lot of expert experience and time consumption, and the evaluation of searching the optimal policies is costly. So we raise a new question in this paper: how to achieve automated data augmentation at as low cost as possible? We propose a method named BO-Aug for automating the process by finding the optimal DA policies using the Bayesian optimization approach. We validate the BO-Aug on three widely used image classification datasets, including CIFAR-10, CIFAR- 100 and SVHN. Experimental results show that the proposed method can achieve state-of-the-art or near advanced classification accuracy at a relatively low policies search cost, and the searched policies based on a specific dataset are transferable across different neural network architectures or even different datasets. Code to reproduce our experiments is available at https://***/zhangxiaozao/BOAug. Copyright © 2019, The Authors. All rights reserved.

关键词： Image classification

Recruitment-imitation mechanism for evolutionary reinforcement learning

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Lü, Shuai Han, Shuai Zhou, Wenbo Zhang, Junwei Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Ministry of Education Changchun130012 China College of Computer Science and Technology Jilin University Changchun130012 China

Reinforcement learning, evolutionary algorithms and imitation learning are three principal methods to deal with continuous control tasks. Reinforcement learning is sample efficient, yet sensitive to hyper-parameters setting and needs efficient exploration;Evolutionary algorithms are stable, but with low sample efficiency;Imitation learning is both sample efficient and stable, however it requires the guidance of expert data. In this paper, we propose Recruitment-imitation Mechanism (RIM) for evolutionary reinforcement learning, a scalable framework that combines advantages of the three methods mentioned above. The core of this framework is a dual-actors and single critic reinforcement learning agent. This agent can recruit high-fitness actors from the population of evolutionary algorithms, which instructs itself to learn from experience replay buffer. At the same time, low-fitness actors in the evolutionary population can imitate behavior patterns of the reinforcement learning agent and improve their adaptability. Reinforcement and imitation learners in this framework can be replaced with any off-policy actor-critic reinforcement learner or data-driven imitation learner. We evaluate RIM on a series of benchmarks for continuous control tasks in Mujoco. The experimental results show that RIM outperforms prior evolutionary or reinforcement learning methods. The performance of RIM's components is significantly better than components of previous evolutionary reinforcement learning algorithm, and the recruitment using soft update enables reinforcement learning agent to learn faster than that using hard update. Copyright © 2019, The Authors. All rights reserved.

关键词： Evolutionary algorithms