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

arXiv 2020年

作者： Chen, Liang Liang, Yanchun Shi, Xiaohu Zhou, You Wu, Chunguo Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China Zhuhai Laboratory of Key Laboratory of Symbol Computation Knowledge Engineering of Ministry of Education School of Computer Zhuhai College Jilin University Zhuhai519041 China

Time Delay Neural Network (TDNN) is a well-performing structure for deep neural network-based speaker recognition systems. In this paper we introduce a novel structure, named Crossed-Time Delay Neural Network (CTDNN) to enhance the performance of current TDNN for speaker recognition. Inspired by the multi-filters setting of convolution layers from convolution neural networks, we set multiple time delay units with different context size at the bottom layer and construct a multilayer parallel network. The proposed CTDNN gives significant improvements over original TDNN on both speaker verification and identification tasks. It outperforms in VoxCeleb1 dataset in verification experiment with a 2.6% absolute Equal Error Rate improvement. In few shots condition, CTDNN reaches 90.4% identification accuracy, which doubles the identification accuracy of original TDNN. We also compare the proposed CTDNN with another new variant of TDNN, Factorized-TDNN, which shows that our model has a 36% absolute identification accuracy improvement under few shots condition. Moreover, the proposed CTDNN can handle training with a larger batch more efficiently and hence, utilize calculation resources economically. The code of the new model is released at https://***/chenllliang/CTDNN. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Neural architecture search based on the cartesian genetic programming

arXiv

引用

arXiv 2021年

作者： Wu, Xuan Zhang, Xiuyi Jia, Linhan Chen, Liang Liang, Yanchun Zhou, You Wu, Chunguo Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Changchun130012 China College of Software Jilin University Changchun130012 China School of Computer Science Zhuhai College of Science and Technology Zhuhai519041 China

Neural architecture search (NAS) is a hot topic in the field of automated machine learning and outperforms humans in designing neural architectures on quite a few machine learning tasks. Motivated by the natural representation form of neural networks by Cartesian Genetic Programming (CGP), we propose an evolutionary approach of NAS based on CGP, called CGPNAS, to solve sentence classification task. To evolve the architectures under the framework of CGP, the operations such as convolution are identified as the types of function nodes of CGP, and the evolutionary operations are designed based on Evolutionary Strategy. The experimental results show that the searched architectures are comparable with the performance of human-designed architectures. We verify the ability of domain transfer of our evolved architectures and the transfer experimental results show that the accuracy deterioration is lower than 2-5%. Finally, the ablation study identifies the Attention function as the single key function node and the linear transformations along could keep the accuracy similar with the full evolved architectures, which is worthy of investigation in the future. Copyright © 2021, The Authors. All rights reserved.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A lightweight model LGCSPNet for sitting posture risk management applications

引用

Expert Systems with Applications 2025年 291卷

作者： Dapeng Wang Wei Pang Zheng Cao Lei Song Liying An Xuan Wu Peng Zhao Liupu Wang You Zhou College of Computer Science and Technology Jilin University Qianjin Street Changchun 130012 Jilin China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin China School of Mathematical and Computer Sciences Heriot-Watt University Edinburgh United Kingdom

Current methods for sitting posture recognition typically follow a pipeline involving keypoint extraction and skeleton graph construction, followed by pose classification using Convolutional Neural Networks (CNNs) or Vision Transformers (ViTs). However, CNNs struggle to model long-range dependencies among keypoints, whereas ViTs suffer from high computational costs. Moreover, both approaches tend to introduce redundancy during feature modeling. To improve efficiency, some studies have explored direct classification using keypoint coordinates, but these methods often fail to balance high accuracy with computational efficiency. To this end, this paper proposes a new model LGCSPNet with lightweight graph convolution modules (LGC) and a contrastive learning module. Firstly, LGC enables efficient full-keypoint communication by shifting features across keypoint channels, allowing each keypoint to access global context at minimal computational cost. Building on this, LGC enhances sitting posture detection by computing 3D attention weights via a parameter-free energy function with a closed-form solution, enhancing feature learning for posturally significant keypoints. The contrastive learning module enhances differentiation between similar postures in different categories by strategically selecting feature samples. Experiments on public human posture datasets and our custom sitting posture dataset show that LGCSPNet has only 0.097M parameters while achieving a 99 % recognition rate. It surpasses existing models in terms of parameter quantity and accuracy. Guided by ergonomic metrics, our model enables posture correction and mitigates long-term sitting-related injuries.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mask2Edge: Masking dependencies and dynamically capturing pixel differences in edge detection

引用

Expert Systems with Applications 2025年 286卷

作者： Zhou, Jianhang Zhao, Hongwei Qu, Daikun Xing, Long College of Computer Science and Technology Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin Changchun130012 China Army Artillery and Air Defense Academy Sergeant School Liaoning Shenyang110000 China

Edge detection plays an important role in computer vision tasks. Deep learning-based edge detectors commonly rely on encoding the long and short-term dependencies of pixel values to mine contextual information. They strongly focus on all positions in the image, ignoring the potential issue of over-encoding. Furthermore, most of these models have not attempted to leverage the inherent properties of edges. In this paper, we introduce a query-based edge detector named Mask2Edge, which is capable of masking dependencies and dynamically capturing pixel differences. Specifically, we first devise a masking strategy based on the sparsity of edges to alleviate the over-encoding issue. We propose a Region-guided Masked Attention, which adapts to edge detection and is capable of constraining cross-attention with appropriate masking intensity to extract relatively complete local features. Subsequently, we design a structure to capture the pixel differences that can help identify edges. We introduce dynamic convolutions into edge detection and refine the application scope and generation method of attention weights to effectively perceive changes in pixel gradients. Extensive experiments demonstrate the superiority of Mask2Edge compared with state-of-the-art methods. The source code is available at https://***/zhoujh2020/Mask2Edge. © 2025 Elsevier Ltd

关键词： Edge detection

来源：评论

学校读者我要写书评

暂无评论

An unmanned aerial vehicle pose estimation system guided by desired shot 2

An unmanned aerial vehicle pose estimation system guided by ...

引用

2nd IEEE International Conference on Automation, Electronics and Electrical engineering, AUTEEE 2019

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

ISBN: (纸本)9781728150291

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. © 2019 IEEE.

关键词： Aerial photography

来源：评论

学校读者我要写书评

暂无评论

Efficient Self-Learning Evolutionary Neural Architecture Search

SSRN

引用

SSRN 2023年

作者： Qiu, Zhengzhong Bi, Wei Xu, Dong Guo, Hua Ge, Hongwei Liang, Yanchun Lee, Heow Pueh Wu, Chunguo Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University Jilin Changchun130012 China YGSOFT INC Guangdong Zhuhai519085 China Department of Electrical Engineering and Computer Science Informatics Institute Christopher S. Bond Life Sciences Center University of Missouri ColumbiaMO65211 United States College of Computer Science and Technology Dalian University of Technology Liaoning Dalian116081 China School of Computer Science Zhuhai College of Science and Technology Guangdong Zhuhai519041 China Department of Mechanical Engineering National University of Singapore 9 Engineering Drive 1 117575 Singapore

The evolutionary algorithm has become a major method for neural architecture search recently. However, the fixed probability distribution adopted by the traditional evolutionary algorithm makes the algorithm unable to control the increase or decrease of the individual architecture size and thus cannot guarantee the lightweight and inference efficiency of the candidate architecture. In addition, the existing approaches cannot learn the optimal sampling probability distribution relevant to the specific problem from the empirical information accumulated through the search process. What’s more, the algorithm needs to evaluate the performance of all the individual architectures, which requires huge computing resources and time overhead. To overcome these problems and challenges, an Efficient Self-learning Evolutionary Neural Architecture Search method, called ESE-NAS, is presented in this paper. Firstly, we propose a Model Size Control module, which generates the probability distribution for sampling the type of mutation operators according to the current model size, so as to control both the node number of network architecture and the sparsity of links, therefore ensuring that neural architectures can remain compact and efficient as they evolve. Thereafter, a Mutation Candidate Credit Assignment method is proposed, which enables the algorithm to dynamically adjust the probability distribution for available types of node operations and directed links according to the empirical information from individuals’ performance evaluation, which can guide the evolutionary direction of neural architecture and shorten the first hitting time of the optimal architecture. Finally, a neural architecture performance predictor is formulated, and the accuracy of each individual architecture is predicted by using the simplified input features, to further improve the efficiency of neural architecture search. Experiments show that the ESE-NAS method proposed in this paper can learn a highly i

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

GEOM-GCN: GEOMETRIC GRAPH CONVOLUTIONAL NETWORKS 8

GEOM-GCN: GEOMETRIC GRAPH CONVOLUTIONAL NETWORKS

引用

8th International Conference on Learning Representations, ICLR 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 Urbana-Champaign United States Department of Computer Science University of Illinois Urbana-Champaign United States Department of Computing Hong Kong Polytechnic University Hong Kong Key Laboratory of Symbolic Computation and Knowledge Engineering of 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. © 2020 8th International Conference on Learning Representations, ICLR 2020. All rights reserved.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

knowledge Compilation Methods Based on the Clausal Relevance and Extension Rule

引用

Chinese Journal of Electronics 2018年第5期27卷 1037-1042页

作者： NIU Dangdang LIU Lei LYU Shuai College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering (Jilin University) Ministry of Education

We introduce the concepts of Relevancematrix(RM) and Relevance-set(RS). And we construct the association between RM and the knowledge compilation(KC) methods based on Extension rule(ER). Based on the basic parameters of RS and the relationship between RM and the KC methods based on ER, we design two efficient heuristics, called M2S(maximum sum of elements in RS and sum of literals in RS) and MNE(minimum number of maximum terms not extended by RS). Both of above heuristics intend to find the minimum set of maximum terms which cannot be extended by RS. Furthermore,we apply M2S and MNE on KCER. M2S KCER(KCER with M2S) and MNE KCER(KCER with MNE) are designed and implemented based on M2S and MNE, respectively. Experimentally, for the SAT instances with random lengths of clauses, M2S KCER and MNE KCER can improve the efficiency and quality of KCER sharply, and they are two best KC algorithms of EPCCL(each pair contains complementary literal) theory in all KC algorithms based on KCER.

关键词： Extension rule knowledge compilation Clausal relevance Heuristic strategy

来源：评论

学校读者我要写书评

暂无评论

Simulation and Field Testing of Multiple Vehicles Collision Avoidance Algorithms

引用

IEEE/CAA Journal of Automatica Sinica 2020年第4期7卷 1045-1063页

作者： Chaoyue Zu Chao Yang Jian Wang Wenbin Gao Dongpu Cao Fei-Yue Wang the College of Computer Science and Technology Jilin UniversityChangchun 130012China Jiangsu XCMG Construction Machinery Research Institute Ltd. Xuzhou 221004China the College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of EducationJilin UniversityChangchun 130012 Chongqing Xibu Automobile Proving Ground Management Co.Ltd. Chongqing 404100China the State Grid JIBEI Electric Power Company Limited Management Training Center China the Advanced Vehicle Engineering Center Cranfield UniversityCranfield MK430ALUK the State Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of SciencesBeijing 100190China

A global planning algorithm for intelligent vehicles is designed based on the A* algorithm, which provides intelligent vehicles with a global path towards their destinations. A distributed real-time multiple vehicle collision avoidance(MVCA)algorithm is proposed by extending the reciprocal n-body collision avoidance method. MVCA enables the intelligent vehicles to choose their destinations and control inputs independently,without needing to negotiate with each other or with the coordinator. Compared to the centralized trajectory-planning algorithm, MVCA reduces computation costs and greatly improves the robustness of the system. Because the destination of each intelligent vehicle can be regarded as private, which can be protected by MVCA, at the same time MVCA can provide a real-time trajectory planning for intelligent vehicles. Therefore,MVCA can better improve the safety of intelligent vehicles. The simulation was conducted in MATLAB, including crossroads scene simulation and circular exchange position simulation. The results show that MVCA behaves safely and reliably. The effects of latency and packet loss on MVCA are also statistically investigated through theoretically formulating broadcasting process based on one-dimensional Markov chain. The results uncover that the tolerant delay should not exceed the half of deciding cycle of trajectory planning, and shortening the sending interval could alleviate the negative effects caused by the packet loss to an extent. The cases of short delay(< 100100 ms) and low packet loss(< 5%) can bring little influence to those trajectory planning algorithms that only depend on V2 V to sense the context, but the unpredictable collision may occur if the delay and packet loss are further worsened. The MVCA was also tested by a real intelligent vehicle, the test results prove the operability of MVCA.

关键词： Collision avoidance intelligent vehicles intervehicle communication simulation testing trajectory planning

来源：评论

学校读者我要写书评

暂无评论

2-Thumbs Typing: A Novel Bimanual Text Entry Method in Virtual Reality Environments

2-Thumbs Typing: A Novel Bimanual Text Entry Method in Virtu...

引用

Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW), IEEE Conference on

作者： Zigang Zhang Minghui Sun BoYu Gao Limin Wang College of Software Jilin University Changchun China 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 College of Information Science and Technology/Cyber Security Jinan University Guangzhou China

We propose a new technique named 2-Thumbs Typing (2TT) enabling text entry with a touchpad in HTC VIVE controller using two thumbs. 2TT method works similarly with bimanual handwriting input but using new designed uni-stroke gestures considering only strokes' direction. We first design a set of gestures and improve them to finish the final design by a preliminary study through memory, performance efficiency and ease of use. The initial results show that the 2TT technique is easy and comfortable to use, no additional equipment required and supporting eyes-free entry. 2TT can reach 8.5 words per minute with extensive training.

关键词： Training Three-dimensional displays Conferences Memory management Thumb Virtual reality User interfaces

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：