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

IEEE International Symposium on information (IT) in Medicine and Education, ITME

作者： Zhiqian Jia Wei Li Zuoyong Li Zhipeng Mu Lihui Lin Shenghua Teng College of Electronic and Information Engineering Shandong University of Science and Technology Qingdao China Xiamen Air Traffic Management Station of CAAC Xiamen China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Data Science MinjiangUniversity Fuzhou China Fujian Key Laboratory of Big Data Application and Intellectualization for Tea Industry School of Mathematics and Computer Science Wuyi University Fujian China

ISBN: (数字)9798350356670

ISBN: (纸本)9798350356687

In recent years, significant advancements have been made in the field of anomaly detection. Expanding anomaly detection tasks to new scenarios has become a development avenue. Anomaly detection for the outer packaging of supermarket goods is a challenging task due to the diversity of goods’ appearances, which results in some detection methods suffering from limited sensitivity to anomalies and inadequate target mining. To address these issues, we propose a novel unsupervised anomaly detection method based on multi-branch feature extraction and foreground cosine structure mining strategy. Firstly, we use anomaly synthesis technique to enhance the model’s perception of anomalies and construct more precise decision boundaries in the feature space. Secondly, a multi-branch feature extractor extracts and integrates multi-level and multi-scale features, providing rich texture and semantic information to improve the model’s adaptability in real-world scenarios. Finally, the foreground cosine loss focuses on target mining while supplementing local structural information, further enhancing the model’s ability to detect subtle anomalies. To validate the effectiveness of the proposed method, extensive experiments were conducted on the GoodsAD dataset, sampled from supermarket scenarios. Experimental results show that this method achieves significant performance in image-level detection and pixel-level localization.

关键词： Location awareness Adaptation models Sensitivity Semantics Education Packaging Feature extraction information technology Anomaly detection Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

Gaf-Net: Graph Attention Fusion Network for Multi-View Semi-Supervised Classification

SSRN

引用

SSRN 2023年

作者： Song, Na Du, Shide Wu, Zhihao Zhong, Luying Wang, Shiping School of Computer Science and Technology Hainan University Hainan570228 China School of Mechanical Electrical and Information Engineering Putian University Putian351100 China College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China

Multi-view semi-supervised classification is a typical task to classify data using a small amount of supervised information, which has attracted a lot of attention from researchers in past years. In practice, existing methods focus more on extracting spatial or spectral features using graph convolutional neural networks without considering the diversity and variability of graph structures and the contributions of different views. To address this challenge, a network framework termed graph attention fusion network is proposed, which is comprised of two phases: view-specific feature embedding and graph embedding fusion. In the former feature extraction stage, view-specific feature embedding module can flexibly focus on the neighborhood calculation operation to learn a weight for each neighboring node. In the latter feature fusion stage, the graph embedding fusion module is performed by complementarity and consistency to fuse these embeddings for semi-supervised classification tasks. We conduct extensive experiments in terms of semi-supervised classification on real-world datasets to validate the superiority of the proposed method over various existing state-ofthe-art methods. © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

CrossDiff: Exploring Self-Supervised Representation of Pansharpening via Cross-Predictive Diffusion Model

arXiv

引用

arXiv 2024年

作者： Xing, Yinghui Qu, Litao Zhang, Shizhou Zhang, Kai Zhang, Yanning Ran, Lingyan Zhang, Xiuwei Yin, Hanlin The Shaanxi Provincial Key Laboratory of Speech and Image Information Processing The National Engineering Laboratory for Integrated Aerospace-GroundOcean Big Data Application Technology School of Computer Science Northwestern Polytechnical University Xi’an710072 China The Research Development Institute Northwestern Polytechnical University in Shenzhen Shenzhen518057 China

Fusion of a panchromatic (PAN) image and corresponding multispectral (MS) image is also known as pansharpening, which aims to combine abundant spatial details of PAN and spectral information of MS. Due to the absence of high-resolution MS images, available deep-learning-based methods usually follow the paradigm of training at reduced resolution and testing at both reduced and full resolution. When taking original MS and PAN images as inputs, they always obtain sub-optimal results due to the scale variation. In this paper, we propose to explore the self-supervised representation of pansharpening by designing a cross-predictive diffusion model, named CrossDiff. It has two-stage training. In the first stage, we introduce a cross-predictive pretext task to pre-train the UNet structure based on conditional DDPM, while in the second stage, the encoders of the UNets are frozen to directly extract spatial and spectral features from PAN and MS, and only the fusion head is trained to adapt for pansharpening task. Extensive experiments show the effectiveness and superiority of the proposed model compared with state-of-the-art supervised and unsupervised methods. Besides, the cross-sensor experiments also verify the generalization ability of proposed self-supervised representation learners for other satellite’s datasets. We will release our code for reproducibility. © 2024, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Online Attentive Kernel-Based Temporal Difference Learning

arXiv

引用

arXiv 2022年

作者： Yang, Guang Chen, Xingguo Yang, Shangdong Wang, Huihui Dong, Shaokang Gao, Yang The the Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications National Engineering Laboratory for Agri-Product Quality Traceability Beijing Technology and Business University China The State Key Laboratory for Novel Software Technology Nanjing University China The PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology China

With rising uncertainty in the real world, online Reinforcement Learning (RL) has been receiving increasing attention due to its fast learning capability and improving data efficiency. However, online RL often suffers from complex Value Function Approximation (VFA) and catastrophic interference, creating difficulty for the deep neural network to be applied to an online RL algorithm in a fully online setting. Therefore, a simpler and more adaptive approach is introduced to evaluate value function with the kernel-based model. Sparse representations are superior at handling interference, indicating that competitive sparse representations should be learnable, non-prior, non-truncated and explicit when compared with current sparse representation methods. Moreover, in learning sparse representations, attention mechanisms are utilized to represent the degree of sparsification, and a smooth attentive function is introduced into the kernel-based VFA. In this paper, we propose an Online Attentive Kernel-Based Temporal Difference (OAKTD) algorithm using two-timescale optimization and provide convergence analysis of our proposed algorithm. Experimental evaluations showed that OAKTD outperformed several Online Kernel-based Temporal Difference (OKTD) learning algorithms in addition to the Temporal Difference (TD) learning algorithm with Tile Coding on public Mountain Car, Acrobot, CartPole and Puddle World tasks. Copyright © 2022, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Hybridizing infeasibility driven and constrained-domination principle with MOEA/D for constrained multiobjective evolutionary optimization

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8916卷 249-261页

作者： Lin, Huibiao Fan, Zhun Cai, Xinye Li, Wenji Wang, Sheng Li, Jian Zhang, Chengdian School of Engineering Shantou University Guangdong515063 China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics NanjingJiangsu210016 China College of Science Shantou University Guangdong515063 China Guangdong Provincial Key Laboratory of Digital Signal and Image Processing Techniques Shantou University Guangdong515063 China

This paper presents a novel multiobjective constraint handling approach, named as MOEA/D-CDP-ID, to tackle constrained optimization problems. In the proposed method, two mechanisms, namely infeasibility driven (ID) and constrained-domination principle (CDP) are embedded into a prominent multiobjective evolutionary algorithm called MOEA/D. Constraineddomination principle defined a domination relation of two solutions in constraint handling problem. Infeasibility driven preserves a proportion of marginally infeasible solutions to join the searching process to evolve offspring. Such a strategy allows the algorithm to approach the constraint boundary from both the feasible and infeasible side of the search space, thus resulting in gaining a Pareto solution set with better distribution and convergence. The efficiency and effectiveness of the proposed approach are tested on several well-known benchmark test functions. In addition, the proposed MOEA/D-CDP-ID is applied to a real world application, namely design optimization of the two-stage planetary gear transmission system. Experimental results suggest that MOEA/D-CDP-ID can outperform other state-of-the-art algorithms for constrained multiobjective evolutionary optimization. © Springer International Publishing Switzerland 2014.

关键词： Constraint handling

来源：评论

学校读者我要写书评

暂无评论

A Policy-Controlled Signature Scheme for end-to-end Secure Communication

A Policy-Controlled Signature Scheme for end-to-end Secure C...

引用

International Conference on Advanced Cloud and Big Data (CBD)

作者： Feng Yu Linghui Meng Jing Xi Xianxian Li Qianhui Lu Weidong Zhu Key Lab of Education Blockchain and Intelligent Technology Guangxi Normal University GuiLin China Jiangsu Provincial Key Laboratory of Netwrok and Information Security University of SouthEast Nanjing China Guangxi Key Lab of Multi-Source Information Mining and Security Guangxi Normal University GuiLin China Guangxi Collaborative Innovation Center of Multi-source Information Integration and Intelligent Processing Guangxi Normal University GuiLin China

ISBN: (数字)9798331511074

ISBN: (纸本)9798331511081

In the digitalized society, end-to-end security communication is receiving increasing attention. Issues such as ma-licious sender impersonation and over-privilege communication continue to prevail in end-to-end communication. This paper pro-poses a policy-controlled signature scheme aimed at addressing these concerns through identity verification and permission man-agement, thus establishing a secure mode of communication. The scheme designs policy-controlled signatures with partial policy hiding functionality, employing expressive access structures and garbled Bloom Filter (GBF) to protect the sender's attributes. In comparison to related approaches, this scheme provides benefits in terms of signature computation cost, thereby enhancing the resilience and efficiency of the communication system against attacks.

关键词： Privacy Costs Communication systems Prevention and mitigation Big Data Computational efficiency Security Protection Resilience

来源：评论

学校读者我要写书评

暂无评论

An Effective Retinal Blood Vessel Segmentation by Using Automatic Random Walks Based on Centerline Extraction

引用

BioMed Research International 2020年第0期2020卷 000-000页

作者： Gao, Jianqing Chen, Guannan Lin, Wenru Smart Home Information Collection and Processing on Internet of Things Laboratory of Digital Fujian Fujian Jiangxia University Fuzhou 350108 China School of Electronic Information Science Fujian Jiangxia University Fuzhou 350108 China Key Laboratory of OptoElectronic Science and Technology for Medicine of Ministry of Education Fujian Provincial Key Laboratory for Photonics Technology Fujian Normal University Fuzhou 350007 China Fujian Provincial Engineering Technology Research Center of Photoelectric Sensing Application Fujian Normal University Fuzhou 350117 China College of Computer and Control Engineering Minjiang University Fuzhou 350121 China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou 350121 China

The retinal blood vessel analysis has been widely used in the diagnoses of diseases by ophthalmologists. According to the complex morphological characteristics of the blood vessels in normal and abnormal images, an automatic method by using the random walk algorithms based on the centerlines is proposed to segment retinal blood vessels. Hessian-based multiscale vascular enhancement filtering is used to display the vessel structures in maximum intensity projection. Random walk algorithm provides a unique and quality solution, which is robust to weak object boundaries. Seed groups in the random walk segmentation are labeled according to the centerlines, which are extracted by using the divergence of the normalized gradient vector field and the morphological method. Experiments of the proposed method are implemented on the publicly available STARE (the Structured Analysis of the Retina) database. The results are compared to other existing retinal blood vessel segmentation methods with respect to the accuracy, sensitivity, and specificity, and the proposed method is proved to be more sensitive in detecting the retinal blood vessels in both normal and pathological areas. © 2020 Jianqing Gao et al.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Systematic Resource Allocation in Cloud RAN with Caching as a Service under Two Timescales

Systematic Resource Allocation in Cloud RAN with Caching as ...

引用

作者： Tang, Jianhua Quek, Tony Q. S. Chang, Tsung-Hui Shim, Byonghyo Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China Institute of New Media and Communications Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore Department of Electronic Engineering Kyung Hee University Yongin17104 Korea Republic of School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China Department of Electrical and Computer Engineering Institute of New Media and Communications Seoul National University Seoul08826 Korea Republic of

Recently, cloud radio access network (C-RAN) with caching as a service (CaaS) was proposed to merge the functionalities of communication, computing, and caching (CCC) together. In this paper, we dissect the interactions of CCC in C-RAN with CaaS from two dimensions: physical resource dimension and time dimension. In the physical resource dimension, we identify how to segment the baseband unit (BBU) pool resources (i.e., computation and storage) into different types of virtual machines (VMs). In the time dimension, we address how the long-term resource segmentation in the BBU pool impacts on the short-term transmit beamforming at the remote radio heads. We formulate the problem as a stochastic mixed-integer nonlinear programming (SMINLP) to minimize the system cost, including the server cost, VM cost and wireless transmission cost. After a series of approximation, including sample average approximation, successive convex approximation, and semidefinite relaxation, the SMINLP is approximated as a global consensus problem. The alternating direction method of multipliers (ADMM) is utilized to obtain the solution in a parallel fashion. Simulation results verify the convergence of our proposed algorithm, and also confirm that the proposed scheme is more cost-saving than that without considering the integration of CCC. © 1972-2012 IEEE.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Effects of Adaptive Random Deceleration on Traffic Flow

引用

Journal of Applied Mathematics and Physics 2023年第3期11卷 618-628页

作者： Qi Wang Shu Zhu Liuhua Zhu School of computer Jiangsu University of Science and Technology Zhenjiang China School of Physics and Telecommunication Engineering Yulin Normal University Yulin China Guangxi Colleges and Universities Key Laboratory of Complex System Optimization and Big Data Processing Yulin China Optoelectronic Information Research Center Yulin Normal University Yulin China

Based on the Nagel-Schreckenberg model, an improved cellular automaton traffic flow model is proposed, in which the random deceleration probability of each vehicle is no longer fixed, but is adaptively adjusted according to the local traffic density in its vision and its current velocity. The numerical simulation results show that the maximum traffic capacity of the improved model under the same parameters is greater than that of the Nagel-Schreckenberg model, and is closer to the measured data. In addition, the traffic flow and vehicle velocity under different meteorological conditions are simulated by using the improved model, and the synchronized flow phenomenon consistent with the actual traffic is reproduced. Meanwhile, the results show that under the same parameters, when the traffic density is equal to 0.3, the traffic flow of the improved model increases by about 11% compared with the original model, and when the traffic density increases to 0.6, the traffic flow increases by about 27%. .

关键词： Traffic Flow Cellular Automaton Adaptive Random Deceleration Synchronized Flow

来源：评论

学校读者我要写书评

暂无评论

A Multi-Stage Goal-Driven Network for Pedestrian Trajectory Prediction

arXiv

引用

arXiv 2024年

作者： Wu, Xiuen Wang, Tao Cai, Yuanzheng Liang, Lingyu Papageorgiou, George Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Minjiang University Fuzhou China College of Computer and Data Science Fuzhou University Fuzhou China School of Electronic and Information Engineering South China University of Technology Guangzhou China SYSTEMA Research Center European University Cyprus Nicosia Cyprus

Pedestrian trajectory prediction plays a pivotal role in ensuring the safety and efficiency of various applications, including autonomous vehicles and traffic management systems. This paper proposes a novel method for pedestrian trajectory prediction, called multi-stage goal-driven network (MGNet). Diverging from prior approaches relying on stepwise recursive prediction and the singular forecasting of a long-term goal, MGNet directs trajectory generation by forecasting intermediate stage goals, thereby reducing prediction errors. The network comprises three main components: a conditional variational autoencoder (CVAE), an attention module, and a multi-stage goal evaluator. Trajectories are encoded using conditional variational autoencoders to acquire knowledge about the approximate distribution of pedestrians' future trajectories, and combined with an attention mechanism to capture the temporal dependency between trajectory sequences. The pivotal module is the multistage goal evaluator, which utilizes the encoded feature vectors to predict intermediate goals, effectively minimizing cumulative errors in the recursive inference process. The effectiveness of MGNet is demonstrated through comprehensive experiments on the JAAD and PIE datasets. Comparative evaluations against state-of-the-art algorithms reveal significant performance improvements achieved by our proposed method. Copyright © 2024, The Authors. All rights reserved.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：