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

arXiv 2025年

作者： He, Yuwen Wang, Wei Wang, Wanyu Jiang, Kui Wu, Wanyu Computer Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology China School of Computer Science and Technology Harbin Institute of Technology China

Lens flares arise from light reflection and refraction within sensor arrays, whose diverse types include glow, veiling glare, reflective flare and so on. Existing methods are specialized for one specific type only, and overlook the simultaneous occurrence of multiple typed lens flares, which is common in the real-world, e.g. coexistence of glow and displacement reflections from the same light source. These co-occurring lens flares cannot be effectively resolved by the simple combination of individual flare removal methods, since these coexisting flares originates from the same light source and are generated simultaneously within the same sensor array, exhibit a complex interdependence rather than simple additive relation. To model this interdependent flares’ relationship, our Nighttime Lens Flare Formation model is the first attempt to learn the intrinsic physical relationship between flares on the imaging plane. Building on this physical model, we introduce a solution to this joint flare removal task named Self-supervised Generation-based Lens Flare Removal Network (SGLFR-Net), which is self-supervised without pre-training. Specifically, the nighttime glow is detangled in PSF Rendering Network(PSFR-Net) based on PSF Rendering Prior, while the reflective flare is modelled in Texture Prior Based Reflection Flare Removal Network (TPRR-Net). Empirical evaluations demonstrate the effectiveness of the proposed method in both joint and individual glare removal tasks. Copyright © 2025, The Authors. All rights reserved.

关键词： Glare

来源：评论

学校读者我要写书评

暂无评论

Task Priority Aware Incentive Mechanism with Reward Privacy-Preservation in Mobile Crowdsensing 25

Task Priority Aware Incentive Mechanism with Reward Privacy-...

引用

25th IEEE International Conference on computer Supported Cooperative Work in Design, CSCWD 2022

作者： Wang, Jiahu Li, Peng Huang, Weiyi Chen, Zeqiang Nie, Lei Wuhan University of Science and Technology School of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing Real-Time Industrial System China

ISBN: (纸本)9781665405270

In mobile crowdsensing, there are generally two types of tasks, popular tasks, and unpopular tasks. For popular tasks, many people can perform that task, and the budget is overallocated. For unpopular tasks, fewer or no one is willing to complete them. How to motivate users to complete different popularity tasks during their work time is a challenging problem. In this paper, we design a task priority-aware incentive mechanism to solve this problem. First, we use hierarchical clustering to classify tasks into different priorities by considering their budgets, deadlines, and density distribution. The higher the task priority, the higher the extra rewards and credits the participating users get. To motivate more users to perform unpopular tasks, we give high priority to unpopular tasks. Then, we propose a greedy algorithm that allows more users to do high-priority tasks. However, too many budget adjustments can cause most users to do unpopular tasks as users are obsessed with their income. To prevent users from all selecting high-priority tasks, we further propose a differential privacy-based algorithm to protect task priority and reduce users' attention to their income. This algorithm protects users' income and allows users to focus more on task characteristics, such as task distribution and task deadline. Through many experiments in the reality Roma dataset, we evaluate two proposed algorithms compared with other solutions. © 2022 IEEE.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Design and development of intelligent well logging interpretation system 41

Design and development of intelligent well logging interpret...

引用

第41届中国控制会议

作者： Saifei Ma Jin Tang Zerui Li Kun Li Wenjun Lv School of Computer Science and Technology Anhui University Institute of Artificial Intelligence Hefei Comprehensive National Science Center Anhui Key Laboratory of Multimodal Cognitive Computing Anhui University Institute of Advanced Technology University of Science and Technology of China Department of Automation University of Science and Technology of China

ISBN: (数字)9789887581536

ISBN: (纸本)9781665482561

In recent years,the traditional well logging interpretation method manually operated by experts has shown some problems,such as low efficiency and poor results,facing the challenges of high dimension,diversity and complexity of current logging *** the progress of artificial intelligence,its effectiveness and efficiency in logging interpretation have gradually attracted researchers' ***,the uncertainty of logging process necessitates the preprocess of collected logging data before employing the artificial intelligence ***,an intelligent well logging interpretation system is designed and developed in this *** the logging data anomalies may include data repetition,null value,etc.,a specific preprocessing module is designed in the system to tackle the data anomalies,so as to ensure that the data input into the algorithms is correct and *** governance can effectively enhance the effectiveness of data,so it is used to guide the design and implementation of logging interpretation ***,user mode and debug mode are designed to solve the problem of cross functional conflict in data governance.

关键词： system Development Logging Interpretation Data Governance Artificial Intelligence

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Face Recognition with Adaptive Generative Perturbations 27th

Privacy-Preserving Face Recognition with Adaptive Generative...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Zhang, Delong Peng, Yixing Wu, Ancong Zheng, Wei-Shi School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Guangzhou China Guangdong Province Key Laboratory of Information Security Technology Sun Yat-sen University Guangzhou China

ISBN: (纸本)9783031783401

For online face recognition services, the potential leakage of facial features and reconstruction techniques gives malicious attackers the opportunity to reconstruct face images, raising public concern about privacy. Previous privacy-preserving face recognition methods either require retraining the face recognition model or iterative perturbation that increases inference time. To overcome these limitations, we propose an efficient plug-and-play method that crafts Adaptive Generative perturbations for frozen Face recognition model (AGFace) to defend the reconstruction attacks. To generate perturbation with a single forward for shallow features extracted by frozen recognition model, we learn a Perturbation Generator to efficiently mine the adversarial perturbations by simultaneously minimizing the perturbation and maximizing the reconstruction error of a proxy reconstructor. To achieve privacy-utility trade-off, we propose the Adaptive Channel Selector to identify top-k reconstruction-sensitive channels for the features. By selecting these channels for perturbation, the dominant visual privacy information is protected with reconstruction-insensitive discriminative information preserved. Extensive experiments demonstrate that AGFace achieves state-of-the-art performance in terms of both privacy and utility among retraining-free methods and is comparable to retraining-dependent methods. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Makespan and Security-Aware Workflow Scheduling for Cloud Service Cost Minimization Using Firefly Optimizer 22nd

Makespan and Security-Aware Workflow Scheduling for Cloud ...

引用

22nd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2022

作者： Zhou, Chengliang Wang, Tian Li, Liying Sun, Jin Zhou, Junlong School of Computer Science and Engineering Nanjing University of Science and Technology Nanjing210094 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China National Trusted Embedded Software Engineering Technology Research Center East China Normal University Shanghai200062 China

ISBN: (纸本)9783031226762

As efficient commercial information technology, cloud computing has attracted more and more users to submit their requests to the cloud platform and pay for them based on the amount and quality of services. One of the most important concerns of cloud service providers is to minimize the monetary cost for completing users’ requests while meeting constraints on the quality of services such as makespan and security. To solve this concern, this paper proposes a makespan and security-aware workflow scheduling method based on an improved firefly optimizer that consists of a new solution initialization scheme, a firefly position updating scheme, a firefly-to-solution mapping operator, and two task-to-virtual machine assignment schemes. We carry out extensive simulation experiments on real-world workflows to validate our proposed workflow scheduling method. The results reveal that the monetary cost reduction achieved by our method can be up to 54.0% compared to a baseline and two state-of-the-art approaches. © 2023, Springer Nature Switzerland AG.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Scribble-Supervised Video Object Segmentation

引用

IEEE/CAA Journal of Automatica Sinica 2022年第2期9卷 339-353页

作者： Peiliang Huang Junwei Han Nian Liu Jun Ren Dingwen Zhang Brain and Artificial Intelligence Laboratory School of AutomationNorthwestern Polytechnical UniversityXi’an 710072China IEEE Department of Engagement Services Mohamed Bin Zayed University of Artificial IntelligenceAbuDhabiUnited Arab Emirate Science and Technology on Complex System Control and Intelligent Agent Cooperation Laboratory BeijingChina

Recently,video object segmentation has received great attention in the computer vision *** of the existing methods heavily rely on the pixel-wise human annotations,which are expensive and time-consuming to *** tackle this problem,we make an early attempt to achieve video object segmentation with scribble-level supervision,which can alleviate large amounts of human labor for collecting the manual ***,using conventional network architectures and learning objective functions under this scenario cannot work well as the supervision information is highly sparse and *** address this issue,this paper introduces two novel elements to learn the video object segmentation *** first one is the scribble attention module,which captures more accurate context information and learns an effective attention map to enhance the contrast between foreground and *** other one is the scribble-supervised loss,which can optimize the unlabeled pixels and dynamically correct inaccurate segmented areas during the training *** evaluate the proposed method,we implement experiments on two video object segmentation benchmark datasets,You Tube-video object segmentation(VOS),and densely annotated video segmentation(DAVIS)-*** first generate the scribble annotations from the original per-pixel ***,we train our model and compare its test performance with the baseline models and other existing *** experiments demonstrate that the proposed method can work effectively and approach to the methods requiring the dense per-pixel annotations.

关键词： Convolutional neural networks(CNNs) scribble self-attention video object segmentation weakly supervised

来源：评论

学校读者我要写书评

暂无评论

QoS-Aware and Cost-Efficient Dynamic Resource Allocation for Serverless ML Workflows

QoS-Aware and Cost-Efficient Dynamic Resource Allocation for...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Hao Wu Junxiao Deng Hao Fan Shadi Ibrahim Song Wu Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Inria Univ. Rennes CNRS IRISA France

Machine Learning (ML) workflows are increasingly deployed on serverless computing platforms to benefit from their elasticity and fine-grain pricing. Proper resource allocation is crucial to achieve fast and cost-efficient execution of serverless ML workflows (specially for hyperparameter tuning and model training). Unfortunately, existing resource allocation methods are static, treat functions equally, and rely on offline prediction, which limit their efficiency. In this paper, we introduce CE-scaling – a Cost-Efficient autoscaling framework for serverless ML work-flows. During the hyperparameter tuning, CE-scaling partitions resources across stages according to their exact usage to minimize resource waste. Moreover, it incorporates an online prediction method to dynamically adjust resources during model training. We implement and evaluate CE-scaling on AWS Lambda using various ML models. Evaluation results show that compared to state-of-the-art static resource allocation methods, CE-scaling can reduce the job completion time and the monetary cost by up to 63% and 41% for hyperparameter tuning, respectively; and by up to 58% and 38% for model training.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Service Mining Scheme Based on Semantic for Internet of Things

引用

Chinese Journal of Electronics 2025年第2期23卷 236-242页

作者： Xinming Li Yan Sun The Science and Technology on Complex Electronic System Simulation Laboratory Academy of Equipment Beijing China The School of Computer Science Beijing University of Posts and Telecommunication Beijing China

As the development of Internet of things (IOT), massive sensors have been deployed as the public infrastructure. With the development of in-depth applications in IOT, service discovery and composition are challenges to the end users. To handle this challenge, we develop a service mining scheme based on semantic for IOT to provide users with interesting composite services. In this scheme, services can be combined and recommended to users actively according to the calculation of service similarity and an updatable semantic database. By the results of service similarity, useless compositions can be filtered out so that energy consumption on service flooding will be reduced. The update strategy of semantic database is also given out, by which the composite services can keep up with time and be more applicative. The benefits of the proposed method are that all operations such as calculating, filtering, and updating are simple enough to be performed in sensor networks.

关键词： Smart buildings Databases Filtering Semantics Public infrastructure Ontologies Sensor systems Internet of Things Floods Intelligent sensors

来源：评论

学校读者我要写书评

暂无评论

FedCross: Intertemporal Federated Learning Under Evolutionary Games

arXiv

引用

arXiv 2024年

作者： Lu, Jianfeng Zhang, Ying Jia, Riheng Cao, Shuqin Liu, Jing Fu, Hao School of Computer Science and Technology Wuhan University of Science and Technology China Key Laboratory of Social Computing and Cognitive Intelligence Dalian University of Technology Ministry of Education China School of Computer Science and Technology Zhejiang Normal University China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology China

Federated Learning (FL) mitigates privacy leakage in decentralized machine learning by allowing multiple clients to train collaboratively locally. However, dynamic mobile networks with high mobility, intermittent connectivity, and bandwidth limitation severely hinder model updates to the cloud server. Although previous studies have typically addressed user mobility issue through task reassignment or predictive modeling, frequent migrations may result in high communication overhead. Addressing this challenge involves not only dealing with resource constraints, but also finding ways to mitigate the challenges posed by user migrations. We therefore propose an intertemporal incentive framework, FedCross, which ensures the continuity of FL tasks by migrating interrupted training tasks to feasible mobile devices. Specifically, FedCross comprises two distinct stages. In Stage 1, we address the task allocation problem across regions under resource constraints by employing a multi-objective migration algorithm to quantify the optimal task receivers. Moreover, we adopt evolutionary game theory to capture the dynamic decision-making of users, forecasting the evolution of user proportions across different regions to mitigate frequent migrations. In Stage 2, we utilize a procurement auction mechanism to allocate rewards among base stations, ensuring that those providing high-quality models receive optimal compensation. This approach incentivizes sustained user participation, thereby ensuring the overall feasibility of FedCross. Finally, experimental results validate the theoretical soundness of FedCross and demonstrate its significant reduction in communication overhead. Copyright © 2024, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: vivid multi-colored hair editing via latent diffusion 24

HairDiffusion: vivid multi-colored hair editing via latent d...

引用

Proceedings of the 38th International Conference on Neural Information Processing systems

作者： Yu Zeng Yang Zhang Jiachen Liu Linlin Shen Kaijun Deng Weizhao He Jinbao Wang Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University and Shenzhen Institute of Artificial Intelligence and Robotics for Society and National Engineering Laboratory for Big Data System Computing Technology Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University and Guangdong Provincial Key Laboratory of Intelligent Information Processing

ISBN: (纸本)9798331314385

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：