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

Optimizing Monitoring Utility of Unmanned Aerial Vehicles Considering Adverse Effects

IEEE Transactions on Mobile Computing 2025年

作者： Zhang, Haihan Dai, Haipeng Qiu, Yu Yu, Enze Zhou, Ruiben Wang, Weijun Wang, Jingwu Chen, Guihai Nanjing University State Key Laboratory for Novel Software Technology Nanjing210023 China South China University of Technology School of Computer Science and Engineering Guangzhou China Beijing China

For Unmanned Aerial Vehicles (UAVs) monitoring tasks, capturing high quality images of target objects is important for subsequent recognition. Concerning the problem, many prior works study placement/trajectory planning for UAVs to maximize the quality of captured images. However, all of them overlook a fact that UAV monitoring may cause a huge risk/annoyance on living objects. In this paper, we investigate the novel problem of oPtimizing unmanned aErial vehicles plAcement by Considering both monitoring utility and adverse Effects (PEACE). We propose an approach to solve PEACE, which is proved to be NP-hard. Overall, our approach achieves a 1-1/e- approximation ratio. First, we approximate the original problem of PEACE as a classical problem of Monotone Submodular function Maximization under a Uniform Matroid constraint (MSMUM) with a controlled gap. Then, for MSMUM, we propose a combination of algorithms achieving a 1-1/e approximation and O(n\log n) time complexity considering the correlation among the UAV monitoring strategies. The proposed algorithms outperform existing algorithms for MSMUM through theoretical analysis and experimental results. Extensive simulations and field experiments demonstrate the effectiveness of our approach, achieving performance gains of 9.0% to 1434.5% compared to existing methods. © 2002-2012 IEEE.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

UNI-IQA: A Unified Approach for Mutual Promotion of Natural and Screen Content Image Quality Assessment

引用

IEEE Transactions on Circuits and Systems for Video technology 2025年

作者： Song, Mengke Chen, Chenglizhao Song, Wenfeng Fang, Yuming Qingdao Institute of Software School of Computer Science and Technology China University of Petroleum China Shandong Key Laboratory of Intelligent Oil & Gas Industrial Software China Computer School Beijing Information Science and Technology University China School of Information Management and Mathematics Jiangxi University of Finance and Economics China

To date, the image quality assessment (IQA) research field has mainly focused on natural images (NIs)-based IQA and screen content images (SCIs)-based IQA. Usually, these two research branches are quite independent due to the large differences between NIs and SCIs, where NIs, captured by cameras directly, contain pictorial information solely, yet, SCIs, synthesized or GPU-rendered, have pictures and textures. Moreover, the distortion types are also different, and subjective scores of different datasets assigned by participants are usually not well aligned. So, due to the above-mentioned "domain shifts" and "dataset misalignments", our research community has widely believed that it could be very difficult to achieve joint mutual promotions between NIs- and SCIs-based IQA. In this paper, we argue that despite the "differences", there still are some "common characteristics" — our human visual system perceives the "pictures" in both SCIs and NIs almost the same way. Thus, we can still achieve mutual performance promotion if we can appropriately use the "common characteristics" between SCIs and NIs. Our key idea is to devise a "content-aware" data switch, which, from the perspective of input’s contents (i.e., pictures or textures), aims at letting the model automatically enhance the commonness and compress the discrepancies between the two tasks. Notice that none of the existing fusion schemes can reach this goal since they are actually content-unaware, degenerating the "mutual interactions" into "mutual interferences". This paper is the first attempt to achieve full end-to-end "mutual interactions" between NIs- and SCIs-based IQA. Using the proposed switch, we are also the first to achieve solid mutual promotions for the two tasks, reaching new SOTA results. © 1991-2012 IEEE All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Complementary Learning System Theory-based Active Learning for Audio Classification

Complementary Learning System Theory-based Active Learning f...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Hui Geng Zijian Gao Tianjiao Wan Dawei Feng Changjian Wang Kele Xu College of Computer Science and Technology National University of Defense Technology Changsha China State Key Laboratory of Complex & Critical Software Environment Changsha China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Deep learning has significantly advanced the audio classification, achieving remarkable results. However, these successes often rely on extensive manual annotation of audio, a labor-intensive and costly process. Active Learning (AL) presents a promising solution by minimizing the required amount of annotation through the iterative selection of the most informative audio samples. Current AL methods for audio classification typically depend solely on the latest model checkpoint, overlooking the dynamics of the entire training process. The Complementary Learning Systems (CLS) theory posits that the interplay between short-term and long-term memory systems can effectively measure sample uncertainty, offering a means to capture training dynamics. In this work, we introduce a novel AL framework for audio classification, termed CLS-AL, which addresses the limitations of existing methods by simultaneously maintaining both short-term and long-term memory models. This dual-memory approach allows for a more comprehensive consideration of training dynamics. The divergence in predictions between these memory models provides a new metric for evaluating the uncertainty of unlabeled samples, enhancing the effectiveness of the AL sample selection process. We demonstrate the effectiveness and generalizability of CLS-AL through extensive experiments on a diverse set of audio datasets, showing that CLS-AL obviously outperforms existing state-of-the-art methods.

关键词： Training Uncertainty Annotations Active learning Measurement uncertainty Manuals Signal processing Predictive models Iterative methods Speech processing

来源：评论

学校读者我要写书评

暂无评论

Probabilistic-Search and Neighbor-Density Based Doppler-Shift Acquisition in Space Communications

引用

IEEE Transactions on Communications 2025年

作者： Zhang, Zhaowei Du, Shuai Liu, Lin Liu, Hui Zuo, Jiakuo Miao, Wang Zhao, Haitao Nanjing University of Posts and Telecommunications School of Internet of Things China Nanjing University State Key Laboratory for Novel Software Technology China Jinling Institute of Technology School of Software Engineering China University of Exeter Department of Computer Science United Kingdom

In space communications, the signal's long-distance transmission between a flying transmitter-receiver pair encounters two obstacles: a huge path-loss and a high-speed movement. The huge path-loss results in a low signal-to-noise ratio (SNR) and the high-speed movement brings a dynamic Doppler-shift, thus posing a great challenge for Doppler-shift acquisition. Under the low SNR, the Doppler-shift acquisition has to accumulate many symbols in a long-time period. However, during this period, the dynamic Doppler-shift disperses all these symbols' total energy over a wide range, thus causing the energy dispersion problem. To address this problem, we propose a probabilistic-search and neighbor-density (PSND) scheme, where the probabilistic-search considers the element's amplitude and sacrifices some redundant signal elements for a narrower search-range, while the neighbordensity sums the signal element's all neighbors for a larger signal energy. The PSND scheme includes two algorithms: the Generic PSND and Iterative PSND. The Generic PSND algorithm first selects some search-elements with their probabilities to construct a probabilistic-search-range, then selects some density-elements with their neighbor-elements to derive the neighbor-densities, and finally searches the largest neighbor-density to obtain the acquisition result. Built upon the Generic PSND algorithm above, the Iterative PSND algorithm iteratively updates the searchelements to further strengthen the neighbor-density in a narrower probabilistic-search-range. Moreover, the simulations results have demonstrated our PSND scheme's higher acquisition probability, as compared with the existing schemes. © 1972-2012 IEEE.

关键词： Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Image Tampering Detection With Frequency-Aware Attention and Multiview Fusion

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第3期6卷 614-625页

作者： Xu, Xu Chen, Junxin Lv, Wenrui Wang, Wei Zhang, Yushu Dalian University of Technology School of Software Dalian116621 China Northeastern University School of Computer Science and Engineering Shenyang110004 China Shenzhen MSU-BIT University Guangdong-Hong Kong-Macao Joint Laboratory for Emotion Intelligence and Pervasive Computing Artificial Intelligence Research Institute Shenzhen518172 China Jiangxi University of Finance and Economics School of Computing and Artificial Intelligence Nanchang330013 China

Manipulated images are flooding our daily lives, which poses a threat to social security. Recently, many studies have focused on image tampering detection. However, they have poor performance on independent validation due to differences in image scenes and tampering methods. The key question is how to design a network that is able to adaptively enhance the tampering information and suppress the generalization features during training. To this end, we propose a dual-branch network with a frequency adaptation paradigm and a feature fusion module for robust tampering image detection. First, this paradigm is designed to adaptively highlight tampering features through frequency conversion and learnable weight. Second, a feature fusion module is developed to filter redundant features and dynamically fuse two-branch features. Experiments on eight typical datasets demonstrate that our model has advantages over state-of-the-art algorithms, and our paradigm can well empower semantic segmentation networks for tampering detection. © 2024 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

PIP: Perturbation-based Iterative Pruning for Large Language Models

arXiv

引用

arXiv 2025年

作者： Cao, Yi Xu, Wei-Jie Shen, Yucheng Shi, Weijie Chan, Chi-Min Xu, Jiajie School of Computer Science and Technology Soochow University China State Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science and Engineering The Hong Kong University of Science and Technology Hong Kong

The rapid increase in the parameter counts of Large Language Models (LLMs), reaching billions or even trillions, presents significant challenges for their practical deployment, particularly in resource-constrained environments. To ease this issue, we propose PIP (Perturbation-based Iterative Pruning), a novel double-view structured pruning method to optimize LLMs, which combines information from two different views: the unperturbed view and the perturbed view. With the calculation of gradient differences, PIP iteratively prunes those that struggle to distinguish between these two views. Our experiments show that PIP reduces the parameter count by approximately 20% while retaining over 85% of the original model’s accuracy across varied benchmarks. In some cases, the performance of the pruned model is within 5% of the unpruned version, demonstrating PIP’s ability to preserve key aspects of model effectiveness. Moreover, PIP consistently outperforms existing state-of-the-art (SOTA) structured pruning methods, establishing it as a leading technique for optimizing LLMs in environments with constrained resources. Our code is available at: https://***/caoyiiiiii/PIP. Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SPUFChain: Permissioned Blockchain Lightweight Authentication Scheme for Supply Chain Management Using PUF of IoT

引用

IEEE Access 2025年 13卷 88662-88682页

作者： Assaqty, Mohammad Iqbal Saryuddin Gao, Ying Alqarni, Abeer D. Khan, Siraj Chakraborty, Mohuya Siddiqi, Hafied Nur Ahmad, Sadique South China University of Technology School of Computer Science and Engineering Guangzhou510006 China Universitas Nahdlatul Ulama Indonesia Faculty of Engineering and Computer Science Jakarta10320 Indonesia College of Computer and Information Sciences Princess Nourah bint Abdulrahman University Department of Information Technology PO Box 84428 Riyadh11671 Saudi Arabia Shenzhen University College of Computer Science & Software Engineering Shenzhen518060 China University of Engineering and Management Cybersecurity Centre of Excellence Kolkata700160 India Prince Sultan University EIAS Data Science and Blockchain Laboratory CCIS Riyadh12435 Saudi Arabia

The complexity of the entire process of supply chain management (SCM) is quite cumbersome and traditional way of handling it is devoid of proper authentication and security and very often suffers from human errors in dealing with flaws in quality control process of SCM. While it may have started with shipment tracking, the outcome of using IoT on supply chains has spread to every link in the chain. For instance, manufacturers are employing Internet-enabled sensors in production to find product faults, resulting in higher-quality production runs. Physical Unclonable Function (PUF) is a security mechanism that exploits the unique, unrepeatable physical characteristics of hardware components to generate distinct cryptographic keys or identifiers, typically for a semiconductor device like an Internet of Things (IoT) device. The unique identification of IoT devices along the supply chain is implemented by using PUFs as tamper-resistant IDs. Blockchain, the distributed, immutable ledger, on the other hand is the disruptive technology that provides higher security as compared to traditional centralized systems. The integration of PUF and blockchain proves to be quite interesting while handling the above issues of authentication. A smart contract on the blockchain is a software code that executes spontaneously as and when the conditions of the contract or agreement are satisfied. Hence after authentication process the results are fed to blockchain smart contract for the final validation. This paper presents a novel permissioned blockchain smart contract-based lightweight authentication scheme for SCM using PUF of IoT known as SPUFChain. Informal and formal security analysis (using AVISPA and BAN logic) of the proposed framework show its potential to combat several attack scenarios like man-in-the middle, non-repudiation, impersonation, replay attacks and many other security features as compared to other related schemes. The processing time (~13.8ms) is better than existing

关键词： Supply chain management

来源：评论

学校读者我要写书评

暂无评论

FDC: Feature Dropout Consistency for unsupervised domain adaptation semantic segmentation

引用

Neural Networks 2025年 189卷 107527页

作者： Rao, Chaoyu Fan, Wanshu Wang, Cong Yang, Xin Wei, Xiaopeng Zhou, Dongsheng National and Local Joint Engineering Laboratory of Computer Aided Design School of Software Engineering Dalian University China Department of Computing The Hong Kong Polytechnic University Hong Kong School of Computer Science and Technology Dalian University of Technology China

In Unsupervised Domain Adaptation Semantic Segmentation (UDASS), while self-training techniques have become one of the most effective methods to date, the absence of target labels makes models susceptible to overfitting. To address this problem, consistency techniques regularize the model by perturbing the target domain and enforcing consistent pixel predictions before and after the perturbation. Consistency techniques are based on the idea that a well-performing model should yield consistent predictions for the target data stream before and after perturbations. In this paper, we introduce the Feature Dropout Consistency (FDC) module, a novel approach that instigates perturbations at the feature level. This is achieved by implementing random feature dropout between the encoder and decoder of the student network. Subsequently, a feature dropout consistency loss is applied to minimize discrepancies in predictions between the perturbed student network and its teacher counterpart. Notably, FDC seamlessly integrates with existing self-training methodologies and, when paired with input perturbation, delves into an even broader perturbation spectrum. Through rigorous experimentation in standard UDA settings — training with synthetic labeled and real unlabeled data — FDC consistently outperforms baseline models, establishing new benchmarks on GTAV → Cityscapes and SYNTHIA → Cityscapes. © 2025

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

MODEL CHECKING FOR MULTI-AGENT SYSTEMS MODELED BY EPISTEMIC PROCESS CALCULUS

arXiv

引用

arXiv 2025年

作者： Yu, Qixian Cao, Zining Hui, Zong Zhou, Yuan College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing211106 China Ministry Key Laboratory for Safety-Critical Software Development and Verification Nanjing211106 China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing210023 China Faculty of Computer and Software Engineering Huaiyin Institute Of Technology Huaian223001 China

This paper presents a comprehensive framework for modeling and verifying multi-agent systems. The paper introduce an Epistemic Process Calculus for multi-agent systems, which formalizes the syntax and semantics to capture the essential features of agent behavior interactions and epistemic states. Building upon this calculus, we propose ATLE, an extension of Alternating-time Temporal Logic incorporating epistemic operators to express complex properties related to agent epistemic state. To verify ATLE specifications, this paper presents a model checking algorithm that systematically explores the state space of a multi-agent system and evaluates the satisfaction of the specified properties. Finally, a case study is given to demonstrate the method. © 2025, CC BY.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Deep Learning Algorithm for Person Re-Identification Based on Dual Network Architecture

引用

computers, Materials & Continua 2025年第5期83卷 2889-2905页

作者： Meng Zhu Xingyue Wang Honge Ren Abeer Hakeem Linda Mohaisen College of Information Engineering Harbin UniversityHarbin150086China Heilongjiang Provincial Key Laboratory of the Intelligent Perception and Intelligent Software Harbin UniversityHarbin150086China College of Computer and Control Engineering Northeast Forestry UniversityHarbin150040China Heilongjiang Forestry Intelligent Equipment Engineering Research Center Northeast Forestry UniversityHarbin150040China Faculty of Computing and Information Technology King Abdulaziz UniversityJeddah21589Saudi Arabia

Changing a person’s posture and low resolution are the key challenges for person re-identification(ReID)in various deep learning *** this paper,we introduce an innovative architecture using a dual attention network that includes an attentionmodule and a joint measurement module of spatial-temporal *** proposed approach can be classified into two main ***,the spatial attention feature map is formed by aggregating features in the spatial ***,the same operation is carried out on the channel dimension to formchannel attention ***,the receptive field size is adjusted adaptively tomitigate the changing person posture ***,we use a joint measurement method for the spatial-temporal information to fully harness the data,and it can also naturally integrate the information into the visual features of supervised ReID and hence overcome the low resolution *** experimental results indicate that our proposed algorithm markedly improves the accuracy in addressing changing human postures and low-resolution issues compared with contemporary leading *** proposed method shows superior outcomes on widely recognized benchmarks,which are the Market-1501,MSMT17,and DukeMTMC-reID ***,the proposed algorithmattains a Rank-1 accuracy of 97.4% and 94.9% mAP(mean Average Precision)on the Market-1501 ***,it achieves a 94.2% Rank-1 accuracy and 91.8% mAP on the DukeMTMC-reID dataset.

关键词： Person reidentification ReID computer vision self-attention spatial-temporal information

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：