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

Single Object Tracking for Dynamic Programming based on Fine-grained Network

学校读者我要写书评

暂无评论

Journal of Physics: Conference Series 2020年第1期1576卷

作者： Jianguo Jiang Kaiyuan Jin Jingjing Wu Meibin Qi Qian Wang Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei 230601 China

Single target tracking has always been a key and challenging research field in computer vision. Currently, an increasing number of researchers are focusing on extracting better tracking features and designing the best tracker. This paper proposes a new single target tracking network that uses fine-grained features and dynamic programming (DPFNet). In order to extract superior features, we added an attention module to the regression network enabling us to extract finer-grained and discriminative features to achieve regression. Besides, we did observe that different objects have varying moving rates; for different moving targets, the magnitude of the changes in target position within two adjacent frames is not the same either. Although an area search of 4 times the target's size can be applied to most objects, targets with large position changes may appear in other image areas outside the search area and the target would not be located as a result. Aiming at solving this problem, when designing the tracker, this paper analyzes some of the indicators for predicting the location and uses the analysis results to determine whether the search area is appropriate, so as to dynamically adjust the extent of the search area thereby significantly improving the tracking function. In other words, the size of the search area can be dynamically recalibrated for different images. Subsequent experiments prove that the method put forward in this paper achieves State-of-the-Art results.

关键词：

Examining scientific writing styles from the perspective of linguistic complexity

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Lu, Chao Bu, Yi Wang, Jie Ding, Ying Torvik, Vetle Schnaars, Matthew Zhang, Chengzhi School of Economics and Management Nanjing University of Science and Technology Nanjing Jiangsu China School of Informatics Computing and Engineering Indiana University BloomingtonIN United States Center for Complex Networks and Systems Research School of Informatics Computing and Engineering Indiana University BloomingtonIN United States School of Information Management Nanjing University Nanjing Jiangsu China School of Information Management Wuhan University Wuhan Hubei China School of Information Sciences University of Illinois UrbanaIL United States Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing University Nanjing Jiangsu China

Publishing articles in high-impact English journals is difficult for scholars around the world, especially for non-native English-speaking scholars (NNESs), most of whom struggle with proficiency in English. In order to uncover the differences in English scientific writing between native English-speaking scholars (NESs) and NNESs, we collected a large-scale data set containing more than 150,000 full-text articles published in PLoS between 2006 and 2015. We divided these articles into three groups according to the ethnic backgrounds of the first and corresponding authors, obtained by Ethnea, and examined the scientific writing styles in English from a two-fold perspective of linguistic complexity: (1) syntactic complexity, including measurements of sentence length and sentence complexity;and (2) lexical complexity, including measurements of lexical diversity, lexical density, and lexical sophistication. The observations suggest marginal differences between groups in syntactical and lexical complexity. Copyright © 2018, The Authors. All rights reserved.

关键词：

Extremely Short Chinese Text Classification Method Based on Bidirectional Semantic Extension

学校读者我要写书评

暂无评论

Journal of Physics: Conference Series 2020年第1期1437卷

作者： Yongzeng Yue Yuhong Zhang Xuegang Hu Peipei Li Key Laboratory of knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei 23061 China

Short text classification methods have achieved significant progress and wide application on text data such as Twitter and Weibo. However, the extremely short chinese texts like tax invoice data are different with traditional short texts in lackness of contextual semantic information, feature sparseness and extremely short length. The existing short text classification methods are difficult to achieve a satisfactory performance in these texts. To address these problems, this paper proposes a text classification method based on bidirectional semantic extension for extremely short texts like Chinese tax invoice data. More specifically, firstly, the Chinese knowledge graph is introduced for extending bidirectional semantic of texts and label data to expand the extremely short texts and ease the problem of feature sparseness; secondly, the hash vectorization is used to avoid the semantic problem caused by the lackness of contextual information. Experimental results conducted the real tax invoice dataset demonstrate the effectiveness of our proposed method.

关键词：

Neural Combinatorial Optimization Algorithms for Solving Vehicle Routing Problems: A Comprehensive Survey with Perspectives

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wu, Xuan Wang, Di Wen, Lijie Xiao, Yubin Wu, Chunguo Wu, Yuesong Yu, Chaoyu Maskell, Douglas L. Zhou, You The Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education College of Computer Science and Technology Jilin university Changchun130012 China The Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly Nanyang Technological University 639798 Singapore The School of Software Tsinghua University Beijing100084 China The College of Computing and Data Science Nanyang Technological University 639798 Singapore

Although several surveys on Neural Combinatorial Optimization (NCO) solvers specifically designed to solve Vehicle Routing Problems (VRPs) have been conducted. These existing surveys did not cover the state-of-the-art (SOTA) NCO solvers emerged recently. More importantly, to provide a comprehensive taxonomy of NCO solvers with up-to-date coverage, based on our thorough review of relevant publications and preprints, we divide all NCO solvers into four distinct categories, namely Learning to Construct, Learning to Improve, Learning to Predict-Once, and Learning to Predict-Multiplicity solvers. Subsequently, we present the inadequacies of the SOTA solvers, including poor generalization, incapability to solve large-scale VRPs, inability to address most types of VRP variants simultaneously, and difficulty in comparing these NCO solvers with the conventional Operations Research algorithms. Simultaneously, we propose promising and viable directions to overcome these inadequacies. In addition, we compare the performance of representative NCO solvers from the Reinforcement, Supervised, and Unsupervised Learning paradigms across both small- and large-scale VRPs. Finally, following the proposed taxonomy, we provide an accompanying web page as a live repository for NCO solvers. Through this survey and the live repository, we hope to make the research community of NCO solvers for VRPs more thriving. Copyright © 2024, The Authors. All rights reserved.

关键词： Taxonomies

Retracted: Measurement and analysis of Chinese journal discriminative capacity

学校读者我要写书评

暂无评论

Journal of Informetrics 2021年第1期15卷

作者： Baolong Zhang Hao Wang Sanhong Deng Xinning Su School of Information Management Nanjing University Nanjing 210023 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing 210023 China

Dense residual network: Enhancing global dense feature flow for character recognition

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zhang, Zhao Tang, Zemin Wang, Yang Zhang, Zheng Zhan, Choujun Zha, Zhengjun Wang, Meng School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei230009 China School of Computer Science and Technology Soochow University Suzhou215006 China Shenzhen China School of Computer South China Normal University Guangzhou510631 China Deparmtment of Computer Science and Technology University of Science and Technology of China Hefei China

Deep Convolutional Neural Networks (CNNs), such as Dense Convolutional Network (DenseNet), have achieved great success for image representation learning by capturing deep hierarchical features. However, most existing network architectures of simply stacking the convolutional layers fail to enable them to fully discover local and global feature information between layers. In this paper, we mainly investigate how to enhance the local and global feature learning abilities of DenseNet by fully exploiting the hierarchical features from all convolutional layers. Technically, we propose an effective convolutional deep model termed Dense Residual Network (DRN) for the task of optical character recognition. To define DRN, we propose a refined residual dense block (r-RDB) to retain the ability of local feature fusion and local residual learning of original RDB, which can reduce the computing efforts of inner layers at the same time. After fully capturing local residual dense features, we utilize the sum operation and several r-RDBs to construct a new block termed global dense block (GDB) by imitating the construction of dense blocks to adaptively learn global dense residual features in a holistic way. Finally, we use two convolutional layers to design a down-sampling block to reduce the global feature size and extract more informative deeper features. Extensive results show that our DRN can deliver enhanced results, compared with other related deep models. Copyright © 2020, The Authors. All rights reserved.

关键词： Convolution

UAV-enabled Collaborative Beamforming via Multi-Agent Deep Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liu, Saichao Sun, Geng Li, Jiahui Liang, Shuang Wu, Qingqing Wang, Pengfei Niyato, Dusit The College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China The College of Computing and Data Science Nanyang Technological University 639798 Singapore The School of Information Science and Technology Northeast Normal University Changchun130117 China The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai200240 China The School of Computer Science and Technology Dalian University of Technology Dalian116024 China

In this paper, we investigate an unmanned aerial vehicle (UAV)-assistant air-to-ground communication system, where multiple UAVs form a UAV-enabled virtual antenna array (UVAA) to communicate with remote base stations by utilizing collaborative beamforming. To improve the work efficiency of the UVAA, we formulate a UAV-enabled collaborative beamforming multi-objective optimization problem (UCBMOP) to simultaneously maximize the transmission rate of the UVAA and minimize the energy consumption of all UAVs by optimizing the positions and excitation current weights of all UAVs. This problem is challenging because these two optimization objectives conflict with each other, and they are non-concave to the optimization variables. Moreover, the system is dynamic, and the cooperation among UAVs is complex, making traditional methods take much time to compute the optimization solution for a single task. In addition, as the task changes, the previously obtained solution will become obsolete and invalid. To handle these issues, we leverage the multi-agent deep reinforcement learning (MADRL) to address the UCBMOP. Specifically, we use the heterogeneous-agent trust region policy optimization (HATRPO) as the basic framework, and then propose an improved HATRPO algorithm, namely HATRPO-UCB, where three techniques are introduced to enhance the performance. Simulation results demonstrate that the proposed algorithm can learn a better strategy compared with other methods. Moreover, extensive experiments also demonstrate the effectiveness of the proposed techniques. Copyright © 2024, The Authors. All rights reserved.

关键词： Reinforcement learning

Triplet Deep Subspace Clustering via Self-Supervised data Augmentation

学校读者我要写书评

暂无评论

Triplet Deep Subspace Clustering via Self-Supervised Data Au...

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Xianzhen Li Haijun Zhang Yi Yang Shuicheng Yan Meng Wang School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) & Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China School of Computer Science and Technology Soochow University Suzhou China Harbin Institute of Technology (Shenzhen) Shenzhen China Centre for Artificial Intelligence University of Technology Sydney Sydney NSW Australia Sea AI Lab (SAIL) & National University of Singapore Singapore

ISBN: (纸本)9781665423991

Deep subspace clustering (DSC) with the auto-encoder and self-expression layer is of great concern due to encouraging performance. However, existing methods usually adopt a “single-task” strategy based on a single dataset, without considering other related tasks or data. As such, they cannot discover other useful information to improve the clustering task. Besides, the local structure preservation of the latent codes in mapping is usually ignored. In this paper, we therefore present an effective “multi-task” strategy via the self-supervised data augmentation, and propose a new end-to-end trainable Triplet Deep Subspace Clustering Network (TDSC-net). Specifically, TDSC-net firstly generates triplet data (i.e., anchor, positive and negative data) from input data by a spectral clustering module and a self-supervised data augmentation module. This can enable it to inherit the merits of self-supervised learning and multitask learning implicitly. After that, TDSC-net builds a triplet deep autoencoder network with a self-expression layer, which takes the triplet data as input, where they share the common network layers (i.e., autoencoder and self-expression layers) over the triple tasks for complementary learning and mutual supervision. A triplet loss is also included to retain the local information of deep latent codes, which will also benefit the self-expression. Furthermore, TDSC-net separates the self-expression layer from decoding process to improve the efficiency of reconstruction. Extensive results on several public datasets demonstrate the effectiveness of our triplet-task DSC strategy.

关键词： Codes Conferences Multitasking Decoding data mining Task analysis

On the Stability and Generalization of Triplet Learning

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Chen, Jun Chen, Hong Jiang, Xue Gu, Bin Li, Weifu Gong, Tieliang Zheng, Feng College of Informatics Huazhong Agricultural University Wuhan430070 China College of Science Huazhong Agricultural University Wuhan430070 China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan430070 China Key Laboratory of Smart Farming for Agricultural Animals Wuhan430070 China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China Mohamed bin Zayed University of Artificial Intelligence Abu Dhabi United Arab Emirates School of Computer Science and Technology Xi'an Jiaotong University Xi’an710049 China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Ministry of Education Xi’an710049 China

Triplet learning, i.e. learning from triplet data, has attracted much attention in computer vision tasks with an extremely large number of categories, e.g., face recognition and person re-identification. Albeit with rapid progress in designing and applying triplet learning algorithms, there is a lacking study on the theoretical understanding of their generalization performance. To fill this gap, this paper investigates the generalization guarantees of triplet learning by leveraging the stability analysis. Specifically, we establish the first general high-probability generalization bound for the triplet learning algorithm satisfying the uniform stability, and then 1 obtain the excess risk bounds of the order (Equation presented). for both stochastic gradient descent (SGD) and regularized risk minimization (RRM), where 2n is approximately equal to the number of training samples. Moreover, an optimistic generalization bound in expectation as fast as O(n−1) is derived for RRM in a low noise case via the on-average stability analysis. Finally, our results are applied to triplet metric learning to characterize its theoretical underpinning. Copyright © 2023, The Authors. All rights reserved.

关键词： Learning algorithms