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

Automatic localization of macular area based on structure label transfer

International Journal of Ophthalmology(English edition) 2018年第3期11卷 422-428页

作者： Xiao-Xin Guo Qun Li Chao Sun Yi-Nan LU Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun130012 Jilin Province China College of Computer Science and Technology Jilin University Changchun 130012 Jilin Province China

AIM： To explore feasibility and practicability of macula localization independent of macular morphological features. METHODS： A novel method was proposed to identify macula in fundus images by using structure label transfer. Its main idea was to match a processed image with the candidate images with known structures, and then transfer the structure label representing the macular to the processed image as a result of macula localization. In this way, macula localization couldn＇t be influenced by lesion or other interference any more. RESULTS： The average success rate in four datasets was 98.18%. For accuracy, the average error distance in four datasets was 0.151 optic disc diameter （ODD）. Even for severe lesion images, the proposed method can still maintain high success rate and high accuracy, e.g., 95.65% and 0.124 ODD in the case of STARE dataset, respectively, which indicated that the proposed method was highly robust and stable in the complicated situations. CONCLUSION： The proposed method can avoid the interference of lesion to macular morphological features in macula localization, and can locate macula with high accuracy and robustness, verifying its feasibility.

关键词： fundus image optic disc macula structurelabel transfer

来源：评论

学校读者我要写书评

暂无评论

Joint optimization QoS and security of wireless communication networks 7

Joint optimization QoS and security of wireless communicatio...

引用

7th International Conference on Information Technology: IoT and Smart City, ICIT 2019

作者： Su, Xiaochun Liu, Yanheng Wan, Jian College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation Jilin University Changchun130012 China Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

ISBN: (纸本)9781450376631

Currently, security and quality of service (QoS) are critical for any network. The main purpose of security mechanisms is to provide identity authentication, protect information, and ensure that the received information is not tampered with;the aim of QoS is to provide better network communication services. Security and QoS are not independent of each other. The security mechanism affects QoS and vice versa. Both QoS and security pose resource management problems and are conflicting when resources are limited. QoS requires security mechanisms to ensure proper allocation and service cost, and an inappropriate security mechanism will reduce the performance of the communication quality. Currently, numerous real-time, big data, and diverse applications and services have emerged. Moreover, the number of potential threats is expected to increase dramatically. Therefore, combining QoS and security is important. However, as they are difficult to model owing to their internal conflict, QoS and security are normally separated or optimized at a particular point using game theory. From the perspective of resource allocation, this study uses optimization method and considers security and QoS resource optimization by dividing resources into two categories: space (bandwidth) and time (delay). In order to harmonize the QoS and security, in this paper, the two conflicting terms "communication" and "security" are considered as two individual aspect. Furthermore, we construct a model wherein the joint utility is maximized by controlling the packet length. We formulate the utility functions of these two aspects with respect to the effective throughput. The results show that the presented optimization method enables a mobile node to adaptively select specific packet length based on the optimum curve. With the obtained packet length values, the joint utility reach to the maximum so that satisfactory communication quality can be realized without compromising the security, thereby improvin

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Copy-Move Forgery Detection Based on Interest Point and Local Search Algorithm

Copy-Move Forgery Detection Based on Interest Point and Loca...

引用

IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS)

作者： Fang Mei Jing Lyu Yingda Lyu Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

ISBN: (数字)9781728138633

ISBN: (纸本)9781728138640

Copy-move forgery detection mainly includes block-based and interest point-based methods, but both of them have shortcomings, such as weak resistance to affine transformations, weak ability to locate the forged region. To solve these problems, a novel algorithm is proposed in this paper, which involves two-stage search algorithm. The first stage takes image blocks as the search unit, and in the second stage, the forger region is searched at the pixel level. Experimental results demonstrate that the proposed method performants better compared to recent state-of-the-art methods.

关键词： Rail to rail outputs

来源：评论

学校读者我要写书评

暂无评论

Reinforcement Learning-based Non-Autoregressive Solver for Traveling Salesman Problems

arXiv

引用

arXiv 2023年

作者： Xiao, Yubin Wang, Di Li, Boyang Chen, Huanhuan Pang, Wei Wu, Xuan Li, Hao Xu, Dong Liang, Yanchun 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 Computer Science and Engineering Nanyang Technological University 639798 Singapore The School of Computer Science University of Science & Technology of China Hefei230026 China The School of Mathematical and Computer Sciences Heriot-Watt University EdinburghEH14 4AS United Kingdom College of Computer National University of Defense Technology Hunan Changsha410073 China The Department of Electrical Engineering and Computer Science Bond Life Sciences Center University of Missouri Columbia United States The School of Computer Science Zhuhai College of Science and Technology Zhuhai519000 China

The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem with broad real-world applications. Recently, neural networks have gained popularity in this research area because as shown in the literature, they provide strong heuristic solutions to TSPs. Compared to autoregressive neural approaches, non-autoregressive (NAR) networks exploit the inference parallelism to elevate inference speed but suffer from comparatively low solution quality. In this paper, we propose a novel NAR model named NAR4TSP, which incorporates a specially designed architecture and an enhanced reinforcement learning strategy. To the best of our knowledge, NAR4TSP is the first TSP solver that successfully combines RL and NAR networks. The key lies in the incorporation of NAR network output decoding into the training process. NAR4TSP efficiently represents TSP encoded information as rewards and seamlessly integrates it into reinforcement learning strategies, while maintaining consistent TSP sequence constraints during both training and testing phases. Experimental results on both synthetic and real-world TSPs demonstrate that NAR4TSP outperforms five state-of-the-art models in terms of solution quality, inference speed, and generalization to unseen scenarios. Copyright © 2023, The Authors. All rights reserved.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

RiWalk: Fast Structural Node Embedding via Role Identification

RiWalk: Fast Structural Node Embedding via Role Identificati...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Xuewei Ma Geng Qin Zhiyang Qiu Mingxin Zheng Zhe Wang College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China

Nodes performing different functions in a network have different roles, and these roles can be gleaned from the structure of the network. Learning latent representations for the roles of nodes helps to understand the network and to transfer knowledge across networks. However, most existing structural embedding approaches suffer from high computation and space cost or rely on heuristic feature engineering. Here we propose RiWalk, a flexible paradigm for learning structural node representations as it decouples the structural embedding problem into a role identification procedure and a network embedding procedure. Through role identification, rooted kernels with structural dependencies kept are built to better integrate network embedding methods. To demonstrate the effectiveness of RiWalk, we develop two different role identification methods named RiWalk-SP and RiWalk-WL respectively and employ random walk based network embedding methods. Experiments on within-network classification tasks show that our proposed algorithms achieve comparable performance with other baselines while being an order of magnitude more efficient. Besides, we also conduct across-network role classification tasks. The results show potential of structural embeddings in transfer learning. RiWalk is also scalable, making it capable of capturing structural roles in massive networks.

关键词： Kernel Task analysis knowledge engineering Machine learning Bridges Proteins Network topology

来源：评论

学校读者我要写书评

暂无评论

High-Resolution Natural Image Matting by Refining Low-resolution Alpha Mattes

引用

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society 2025年 PP卷 PP页

作者： Xianmin Ye Yihui Liang Mian Tan Fujian Feng Lin Wang Han Huang College of Data Science and Information Engineering Guizhou Minzu University Guiyang China Guizhou Key Laboratory of Pattern Recognition and Intelligent System Guizhou Minzu University Guiyang China School of Computer Science Zhongshan Institute University of Electronic Science and Technology of China Zhongshan China Guizhou Key Laboratory of Pattern Recognition and Intelligent System and the College of Data Science and Information Engineering Guizhou Minzu University Guiyang China School of Software Engineering South China University of Technology Guangzhou China Key Laboratory of Big Data and Intelligent Robot (SCUT) MOE of China Guangzhou China Guangdong Engineering Center for Large Model and GenAI Technology Guangzhou China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

High-resolution natural image matting plays an important role in image editing, film-making and remote sensing due to its ability of accurately extract the foreground from a natural background. However, due to the complexity brought about by the proliferation of resolution, the existing image matting methods cannot obtain high-quality alpha mattes on high-resolution images in reasonable time. To overcome this challenge, we introduce a high-resolution image matting framework based on alpha matte refinement from low-resolution to high-resolution (HRIMF-AMR). The proposed framework transforms the complex high-resolution image matting problem into low-resolution image matting problem and high-resolution alpha matte refinement problem. While the first problem is solved by adopting an existing image matting method, the latter is addressed by applying the Detail Difference Feature Extractor (DDFE) designed as a part of our work. The DDFE extracts detail difference features from high-resolution images by measuring the image feature difference between high-resolution images and low-resolution images. The low-resolution alpha matte is refined according to the extracted detail difference feature, providing the high-resolution alpha matte. In addition, the Matte Detail Resolution Difference (MDRD) loss is introduced to train the DDFE, which imposes an additional constraint on the extraction of detail difference features with mattes. Experimental results show that integrating HRIMF-AMR significantly enhances the performance of existing matting methods on high-resolution images of Transparent-460 and Alphamatting. Project page: https://***/yexianmin/HRAMR-Matting.

关键词： Feature extraction Image resolution Image color analysis Optimization Remote sensing Clustering algorithms Accuracy Visualization Transforms Training

来源：评论

学校读者我要写书评

暂无评论

Efficient reinforcement learning in continuous state and action spaces with Dyna and policy approximation

引用

Frontiers of Computer Science 2019年第1期13卷 106-126页

作者： Shan ZHONG Quan LIU Zongzhang ZHANG Qiming FU School of Computer Science and Technology Soochow UniversitySuzhou 215000China School of Computer Science and Engineering Changshu Institute of TechnologyChangshu 215500China Jiangsu Province Key Laboratory of Intelligent Building Energy Efficiency Suzhou University of Science and TechnologySuzhou 215006China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing 210000China College of Electronic &Information Engineering Suzhou University of Science and TechnologySuzhou 215000China

Dyna is an effective reinforcement learning (RL) approach that combines value function evaluation with model ***,existing works on Dyna mostly discuss only its efficiency in RL problems with discrete action *** paper proposes a novel Dyna variant,called Dyna-LSTD-PA,aiming to handle problems with continuous action ***-LSTD-PA stands for Dyna based on least-squares temporal difference (LSTD)and policy ***-LSTD-PA consists of two simultaneous,interacting *** learning process determines the probability distribution over action spaces using the Gaussian distribution;estimates the underlying value function,policy,and model by linear representation;and updates their parameter vectors online by LSTD(,t).The planning process updates the parameter vector of the value function again by using ofttine LSTD(2).Dyna-LSTD-PA also uses the Sherman-Morrison formula to improve the efficiency of LSTD(,t),and weights the parameter vector of the value function to bring the two processes ***,the global error bound is derived by considering approximation,estimation,and model ***,Dyna-LSTD-PA outperforms two representative methods in terms of convergence rate,success rate,and stability performance on four benchmark RL problems.

关键词： problem solving control methods heuristic search methods dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Attention-based multi-level feature fusion for named entity recognition 29

Attention-based multi-level feature fusion for named entity ...

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Yang, Zhiwei Chen, Hechang Zhang, Jiawei Ma, Jing Chang, Yi College of Computer Science and Technology Jilin University Changchun China School of Artificial Intelligence Jilin University Changchun China IFM Lab Department of Computer Science Florida State University TallahasseeFL United States Department of Computer Science Hong Kong Baptist University Hong Kong Hong Kong Key Laboratory of Symbolic Computation Knowledge Engineering of Ministry of Education China International Center of Future Science Jilin University Changchun China

ISBN: (纸本)9780999241165

Named entity recognition (NER) is a fundamental task in the natural language processing (NLP) area. Recently, representation learning methods (e.g., character embedding and word embedding) have achieved promising recognition results. However, existing models only consider partial features derived from words or characters while failing to integrate semantic and syntactic information (e.g., capitalization, inter-word relations, keywords, lexical phrases, etc.) from multi-level perspectives. Intuitively, multi-level features can be helpful when recognizing named entities from complex sentences. In this study, we propose a novel framework called attention-based multi-level feature fusion (AMFF), which is used to capture the multi-level features from different perspectives to improve NER. Our model consists of four components to respectively capture the local character-level, global character-level, local word-level, and global word-level features, which are then fed into a BiLSTM-CRF network for the final sequence labeling. Extensive experimental results on four benchmark datasets show that our proposed model outperforms a set of state-of-the-art baselines. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Hypergraph-driven soft semantics flexible learning for visible–infrared person re-identification

引用

engineering Applications of Artificial Intelligence 2025年 158卷

作者： Zhu, Jiacheng Ge, Hongwei Liu, Yuxuan Wu, Chunguo Fan, Jiulin School of Computer Science and Technology Dalian University of Technology No. 2 Linggong Road Dalian Liaoning 116024 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Jilin University No. 2699 Qianjin Street Changchun Jilin 130012 China Huadian Coal Industry Group Co Ltd. No. 2 Xuanwumennei Street Beijing 100031 China

Visible–infrared person re-identification (VI-ReID) aims to match the images of the person across different modalities. The main challenge in the engineering application of VI-ReID lies in the considerable modality gap between visible and infrared images. Existing methods primarily focus on learning low-order hard semantics to reduce the modality gap, such as specific body parts (e.g., arms, legs, and hands), which are modality-specific and sensitive to cross-modality variations, leading to difficult modality alignment. However, high-order soft semantics contain more modality-invariant features that can be flexibly learned by the model to better align the cross-modality features and reduce the modality gap. To better learn soft semantics, we propose a novel, hypergraph-driven soft semantics flexible learning network (HSFLNet), which extracts hierarchical semantics and flexibly explores the relationships among the extracted soft semantics by using hypergraph neural networks (HGNNs). Specifically, first, we propose a soft semantics mining (SSM) module to capture and flexibly fuse hierarchical features, which integrates low- and high-level semantics across channel and spatial dimensions to align modalities. Second, a hypergraph-driven soft semantics flexible learning (HSFL) module is designed, which employs HGNNs to explore the relationships among soft semantics. These semantics are adaptively learned through gating mechanisms to capture modality-invariant features, thereby reducing the modality gap. We evaluate the performance of HSFLNet on SYSU-MM01, RegDB, and low-light cross-modality (LLCM) datasets, achieving a Rank-1/mean average precision of 75.09%/72.11%, 95.82%/92.42%, and 65.42%/68.55%, respectively. Experimental results demonstrate that HSFLNet outperforms state-of-the-art VI-ReID methods. Our code is available at https://***/Jiacheng813/HSFLNet. © 2025 Elsevier Ltd

关键词： Cross-modality retrieval Hypergraph neural networks Soft semantics Visible–infrared person re-identification

来源：评论

学校读者我要写书评

暂无评论

Joint Resource Management for Energy-efficient UAV-Assisted SWIPT-MEC: A Deep Reinforcement Learning Approach

引用

IEEE Internet of Things Journal 2025年

作者： Chen, Yue Kang, Hui Li, Jiahui Sun, Geng Wang, Boxiong Wang, Jiacheng Liang, Cong Liang, Shuang Niyato, Dusit Jilin University College of Computer Science and Technology Changchun130012 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Nanyang Technological University College of Computing and Data Science 639798 Singapore China Mobile Communications Group Jilin Co. Ltd China Northeast Normal University School of Information Science and Technology Changchun130117 China

The integration of simultaneous wireless information and power transfer (SWIPT) technology in 6G Internet of Things (IoT) networks faces significant challenges in remote areas and disaster scenarios where ground infrastructure is unavailable. This paper proposes a novel unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) system enhanced by directional antennas to provide both computational resources and energy support for ground IoT terminals. However, such systems require multiple trade-off policies to balance UAV energy consumption, terminal battery levels, and computational resource allocation under various constraints, including limited UAV battery capacity, non-linear energy harvesting characteristics, and dynamic task arrivals. To address these challenges comprehensively, we formulate a bi-objective optimization problem that simultaneously considers system energy efficiency and terminal battery sustainability. We then reformulate this non-convex problem with a hybrid solution space as a Markov decision process (MDP) and propose an improved soft actor-critic (SAC) algorithm with an action simplification mechanism to enhance its convergence and generalization capabilities. Simulation results have demonstrated that our proposed approach outperforms various baselines in different scenarios, achieving efficient energy management while maintaining high computational performance. Furthermore, our method shows strong generalization ability across different scenarios, particularly in complex environments, validating the effectiveness of our designed boundary penalty and charging reward mechanisms. © 2014 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：