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

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

来源：评论

学校读者我要写书评

暂无评论

Dual-proxies Contrast-focused Loss in Domain Generalization

引用

Expert Systems with Applications 2025年

作者： Shihao Liu Pingping Liu Qiuzhan Zhou College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China School of Mechanical Science and Engineering Jilin University Changchun 130025 China College of Communication Engineering Jilin University Changchun 130012 China

Domain generalization aims to train a model that can directly generalize to unseen domains after learning from different source domains. Due to the significant distribution discrepancy between training domains and the unseen target domain, model performance can be significantly affected. To address the issue, one current trend is to develop contrastive learning frameworks that achieve clustering effects by aligning features in the embedding space. Among existing solutions under contrastive learning frameworks, contrastive-based methods interact with intra-class and inter-class samples indiscriminately with equal intensity. Such indiscriminate interaction can be insufficient for effectively clustering domains with large gaps due to the influence of domain discrepancy. In contrast, metric learning frameworks, as traditional approaches for embedding space optimization, widely implement constructing class proxies as their central technique. However, when applied in domain generalization, proxy-based methods tend to neglect the rich semantic relationships between samples and fail to account for the domain-specific distributional relationships among classes. To resolve these limitations, we integrate contrastive-based methods with proxy-based methods, proposing a dual-proxy contrastive learning framework. Focusing on sample relations, we pay special attention to same-class cross-domain samples and assign greater interaction intensity to reduce feature discrepancy across domains. For class relations, we build two groups of centroid proxies: random proxy groups that adjust class-internal distributions along model optimization and mean proxy groups that represent statistical information to calibrate class-external distributions. Ultimately, we integrate the explorations from both the sample and class perspectives. We evaluate our method on five benchmark datasets, including PACS, VLCS, OfficeHome, TerraIncognita, and DomainNet, and the results validate its effectiveness with

关键词：

来源：评论

学校读者我要写书评

暂无评论

Image retrieval algorithm based on response value center weighted convolution feature

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (engineering and Technology Edition) 2022年第11期52卷 2669-2675页

作者： Li, Xiao-Ning Zhao, Hong-Wei Zhang, Dan-Yang Zhang, Yuan College of Computer Science and Technology Jilin University Changchun130012 China College of Computer Science and Technology Changchun Normal University Changchun130032 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China

A novel cross-entropy-based loss is proposed，which is applied to a classical convolutional neural network to obtain a better embedding space. A convolutional feature aggregation algorithm based on the weighting of the center of the response value is designed to process the three-dimensional convolutional features obtained by the neural network. The algorithm obtains the spatial weighting coefficient of the feature map by calculating the current position response value and the Gaussian center. The algorithm reduces the loss of information when the 3D convolution feature map is reduced to a 1D image feature descriptor and realizes the enhancement of the target area. Finally，the obtained image feature descriptors are used for retrieval tasks. On the CUB-200-2011 dataset，the effectiveness of the loss function and the response value center weighting algorithm are respectively verified by ablation experiments. Compared with the current retrieval methods，higher precision and recall rates have been obtained on the four datasets of Paris6k，Oxford5k，CUB-200-2011 and CARS196. © 2022 Editorial Board of Jilin University. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Discover the Binding Domain of Transmembrane Proteins Based on Structural Universality

Discover the Binding Domain of Transmembrane Proteins Based ...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yihang Bao Fei He Weixi Wang Han Wang Minglong Dong School of Information Science and Technology Northeast Normal University Changchun China School of Information Science and Technology Northeast Normal University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China School of Biological Sciences Nanyang Technological University Singapore Singapore

ISBN: (纸本)9781665429825

Transmembrane proteins (TMPs) serve as drug targets for more than half of the drugs currently available in the market. However, it had not been clearly explained how they realize their drug effects through multiple complex molecules bindings actions. Research into TMPs bindings and corresponding structural basis will provide key information for drug research and new drug development. In this study, we defined the binding domain of TMPs according to the binding region investigation of multiple conjugate types. A 3D deep learning model was architected to discover the structural universality inside those domains. The experimental results proved such binding domains existing on the surface of TMPs, and they are structural specific distinguishing to the surface regions without any binding activities. This work provides a new theoretical basis for TMPs binding research and can greatly boost the development of the drug industry.

关键词： Drugs Proteins Deep learning Industries Solid modeling Protein engineering Three-dimensional displays

来源：评论

学校读者我要写书评

暂无评论

CellMirror: Deciphering Cell Populations from Spatial Transcriptomics Data by Interpretable Contrastive Learning

CellMirror: Deciphering Cell Populations from Spatial Transc...

引用

Medical Artificial Intelligence (MedAI), IEEE International Conference on

作者： Junjie Xia Jiangnan Cui Zhenyu Huang Shuangquan Zhang Fang Yao Yijian Zhang Chunman Zuo Department of Applied Mathematics Institute of Artificial Intelligence Donghua University Shanghai China Institute of Artificial Institute Donghua University Shanghai China College of Computer Science and Technology Jilin University Changchun China School of Cyber Science and Engineering Nanjing University of Science and Technology Nanjing China Affiliated Shenzhen Maternity and Child Healthcare Hospital Institute of Maternal and Child Medicine Southern Medical University Shenzhen China Department of General Surgery Xinhua Hospital Affiliated to Shanghai Jiao Tong University of Medicine Shanghai China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Spatial transcriptomics (ST) has enabled us elucidating tumor microenvironments, however, the technological limitations without single-cell resolution severely hinder its application. Here, we propose CellMirror, an interpretable contrastive learning model to decipher heterogeneous cell populations in ST data by single-cell RNA-sequencing (scRNA-seq) data. Specifically, CellMirror learns the disentangled shared (representing biological variations in both data) and salient features (specific to ST data) by two contrastive variational encoders, while constructing the relations between genes and features by a shared linear decoder. In various cancer samples, CellMirror outperforms other tools in learning common features for label transfer, and interpretation of features. Particularly, in breast cancer studies, CellMirror detects finer domains in ST data missed by other methods, and is robust to dissect cell populations in ST data using independent scRNA-seq data. These results demonstrate applications of CellMirror in interpreting the complex tumor structure in ST data by integrating scRNA-seq data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A surrogate model based genetic algorithm for complex problem solving 6

A surrogate model based genetic algorithm for complex proble...

引用

6th Annual International Conference on Network and Information Systems for Computers, ICNISC 2020

作者： Pei, Ying Gao, Hao Han, Xiaosong College of Information Engineering Changchun University of Finance and Economics Changchun130122 China Key Laboratory for Symbol Computation Knowledge Engineering of National Education Ministry College of Computer Science and Technology College of Software Jilin University Changchun130012 China

It is well known that when the fitness function is relatively complex, the optimization time cost of the genetic algorithm will be extremely huge. To address this issue, the surrogate model was employed to predict the fitness value of the optimization problem, to reduce the number of actual calculated fitness values. In this paper, BP neural network, the least square method and support vector machine were fused in the genetic algorithm to evaluate partial individuals' fitness. Sufficient benchmark numerical experiments were conducted, and the results proved that the strategy could reduce the calculating counts of fitness function on similar accuracy basis compared with simple genetic algorithm. © 2020 Journal of Physics: Conference Series.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：