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

Optimal Linear Crossover for Mitigating Negative Transfer in Evolutionary Multitasking

学校读者我要写书评

暂无评论

IEEE Transactions on Evolutionary Computation 2024年

作者： Liu, Zhaobo Yuan, Jianhua Zhang, Haili Zeng, Tao Zhu, Zexuan Shenzhen University Institute for Advanced Study Shenzhen518060 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China Shenzhen Polytechnic University School of Undergraduate Education Shenzhen518055 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China Shenzhen University Shenzhen City Key Laboratory of Embedded System Design Shenzhen518060 China Chongqing University Key Laboratory of Dependable Service Computing in Cyber Physical Society Ministry of Education of China Chongqing400044 China

Evolutionary multitasking algorithms use information exchange among individuals in a population to solve multiple optimization problems simultaneously. Negative transfer is a critical factor that affects the performance of evolutionary multitasking algorithms. In this study, we propose an innovative approach to mitigate negative transfer in evolutionary multitasking algorithms. The proposed approach is grounded in rigorous theoretical analysis, which provides valuable theoretical insights into the design of an optimal linear crossover operator for mitigating negative transfer. By identifying interpretable conditions, we establish a solid theoretical foundation to prevent negative transfer in diverse scenarios. Building upon these findings, we theoretically derive a closed-form expression for the optimal crossover operator and propose practical design methods based on approximations. Furthermore, we integrate the proposed optimal crossover operator into a fundamental evolutionary multitasking algorithm framework. The resultant algorithm is comparable or superior to other state-of-the-art methods. Empirical validation through comprehensive experiments confirms the effectiveness of our theoretical findings. © 1997-2012 IEEE.

关键词： Optimization algorithms

StyleGene: Crossover and Mutation of Region-level Facial Genes for Kinship Face Synthesis

学校读者我要写书评

暂无评论

StyleGene: Crossover and Mutation of Region-level Facial Gen...

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Hao Li Xianxu Hou Zepeng Huang Linlin Shen Computer Vision Institute College of Computer Science and Software Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University School of AI and Advanced Computing Xi'an Jiaotong-Liverpool University Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University

High-fidelity kinship face synthesis has many potential applications, such as kinship verification, missing child identification, and social media analysis. However, it is challenging to synthesize high-quality descendant faces with genetic relations due to the lack of large-scale, high-quality annotated kinship data. This paper proposes RFG (Region-level Facial Gene) extraction framework to address this issue. We propose to use IGE (Image-based Gene Encoder), LGE (Latent-based Gene Encoder) and Gene Decoder to learn the RFGs of a given face image, and the relationships between RFGs and the latent space of Style-GAN2. As cycle-like losses are designed to measure the $\mathcal{L}_data$ distances between the output of Gene Decoder and image encoder, and that between the output of LGE and IGE, only face images are required to train our framework, i.e. no paired kinship face data is required. Based upon the proposed RFGs, a crossover and mutation module is further designed to inherit the facial parts of parents. A Gene Pool has also been used to introduce the variations into the mutation of RFGs. The diversity of the faces of descendants can thus be significantly increased. Qualitative, quantitative, and subjective experiments on FIW, TSKinFace, and FF-databases clearly show that the quality and diversity of kinship faces generated by our approach are much better than the existing state-of-the-art methods.

关键词：

SciceVPR: Stable Cross-Image Correlation Enhanced Model for Visual Place Recognition

学校读者我要写书评

暂无评论

arXiv 2025年

作者： Wan, Shanshan Wei, Yingmei Kang, Lai Shen, Tianrui Wang, Haixuan Yang, Yee-Hong College of Systems Engineering the Laboratory for Big Data and Decision National University of Defense Technology Hunan Changsha410073 China Department of Computing Science University of Alberta EdmontonABT6G 2E9 Canada

Visual Place Recognition (VPR) is a major challenge for robotics and autonomous systems, with the goal of predicting the location of an image based solely on its visual features. State-of-the-art (SOTA) models extract global descriptors using the powerful foundation model DINOv2 as backbone. These models either explore the cross-image correlation or propose a time-consuming two-stage re-ranking strategy to achieve better performance. However, existing works only utilize the final output of DINOv2, and the current cross-image correlation causes unstable retrieval results. To produce both discriminative and constant global descriptors, this paper proposes a stable cross-image correlation enhanced model for VPR called SciceVPR. This model explores the full potential of DINOv2 in providing useful feature representations that implicitly encode valuable contextual knowledge. Specifically, SciceVPR first uses a multi-layer feature fusion module to capture increasingly detailed task-relevant channel and spatial information from the multi-layer output of DINOv2. Secondly, SciceVPR considers the invariant correlation between images within a batch as valuable knowledge to be distilled into the proposed self-enhanced encoder. In this way, SciceVPR can acquire fairly robust global features regardless of domain shifts (e.g., changes in illumination, weather and viewpoint between pictures taken in the same place). Experimental results demonstrate that the base variant, SciceVPR-B, outperforms SOTA one-stage methods with single input on multiple datasets with varying domain conditions. The large variant, SciceVPR-L, performs on par with SOTA two-stage models, scoring over 3% higher in Recall@1 compared to existing models on the challenging Tokyo24/7 dataset. Our code will be released at https://***/shuimushan/SciceVPR. Copyright © 2025, The Authors. All rights reserved.

关键词： Image correlation

Variational Bayes for Federated Continual Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Yao, Dezhong Li, Sanmu Dai, Yutong Xu, Zhiqiang Hu, Shengshan Zhao, Peilin Sun, Lichao The 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 Wuhan430074 China Lehigh University PA18015 United States Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates Tencent AI Lab. Shenzhen China

Federated continual learning (FCL) has received increasing attention due to its potential in handling real-world streaming data, characterized by evolving data distributions and varying client classes over time. The constraints of storage limitations and privacy concerns confine local models to exclusively access the present data within each learning cycle. Consequently, this restriction induces performance degradation in model training on previous data, termed "catastrophic forgetting". However, existing FCL approaches need to identify or know changes in data distribution, which is difficult in the real world. To release these limitations, this paper directs attention to a broader continuous framework. Within this framework, we introduce Federated Bayesian Neural Network (FedBNN), a versatile and efficacious framework employing a variational Bayesian neural network across all clients. Our method continually integrates knowledge from local and historical data distributions into a single model, adeptly learning from new data distributions while retaining performance on historical distributions. We rigorously evaluate FedBNN’s performance against prevalent methods in federated learning and continual learning using various metrics. Experimental analyses across diverse datasets demonstrate that FedBNN achieves state-of-the-art results in mitigating forgetting. Copyright © 2024, The Authors. All rights reserved.

关键词： Digital storage

WebCode2M: A Real-World dataset for Code Generation from Webpage Designs

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Gui, Yi Li, Zhen Wan, Yao Shi, Yemin Zhang, Hongyu Su, Yi Chen, Bohua Chen, Dongping Wu, Siyuan Zhou, Xing Jiang, Wenbin Jin, Hai Zhang, Xiangliang Huazhong University of Science and Technology Wuhan China Peking University Beijing China Chongqing University Chongqing China Hubei University of Automotive Technology Shiyan China Rabbitpre AI Shenzhen China University of Notre Dame Notre Dame United States 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

Automatically generating webpage code from webpage designs can significantly reduce the workload of front-end developers, and recent Multimodal Large Language Models (MLLMs) have shown promising potential in this area. However, our investigation reveals that most existing MLLMs are constrained by the absence of high-quality, large-scale, real-world datasets, resulting in inadequate performance in automated webpage code generation. To fill this gap, this paper introduces WebCode2M, a new dataset comprising 2.56 million instances, each containing a design image along with the corresponding webpage code and layout details. Sourced from real-world web resources, WebCode2M offers a rich and valuable dataset for webpage code generation across a variety of applications. The dataset quality is ensured by a scoring model that filters out instances with aesthetic deficiencies or other incomplete elements. To validate the effectiveness of WebCode2M, we introduce a baseline model based on the Vision Transformer (ViT), named WebCoder, and establish a benchmark for fair comparison. Additionally, we introduce a new metric, TreeBLEU, to measure the structural hierarchy recall. The benchmarking results demonstrate that our dataset significantly improves the ability of MLLMs to generate code from webpage designs, confirming its effectiveness and usability for future applications in front-end design tools. Finally, we highlight several practical challenges introduced by our dataset, calling for further research. The code and dataset are publicly available at our project homepage: https://***. Copyright © 2024, The Authors. All rights reserved.

关键词： Web Design

PSMiner: A Pattern-Aware Accelerator for High-Performance Streaming Graph Pattern Mining

学校读者我要写书评

暂无评论

PSMiner: A Pattern-Aware Accelerator for High-Performance St...

Design Automation Conference

作者： Hao Qi Yu Zhang Ligang He Kang Luo Jun Huang Haoyu Lu Jin Zhao 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 Zhejiang Lab Zhejiang-HUST Joint Research Center for Graph Processing China Department of Computer Science University of Warwick United Kingdom

Streaming Graph Pattern Mining (GPM) has been widely used in many application fields. However, the existing streaming GPM solution suffers from many unnecessary explorations and isomorphism tests, while the existing static GPM ones require many repetitive operations to compute the full graph. In this paper, we propose a pattern-aware incremental execution approach and design the first streaming GPM accelerator called PSMiner, which integrates multiple optimizations to reduce redundant computation and improve computing efficiency. We have conducted extensive experiments. The results show that compared with the state-of-the-art software and hardware solutions, PSMiner achieves the average speedups of 770.9× and 60.4×, respectively.

关键词：

Automatic Life Event Tree Generation for Older Adults 1

学校读者我要写书评

暂无评论

24th International Conference on Human-Computer Interaction, HCII 2022

作者： Gui, Fang Wu, Xi Hu, Min Yang, Jiaoyun School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data of Ministry of Education Hefei University of Technology Hefei China National Smart Eldercare International S&T Cooperation Base Hefei University of Technology Hefei China Laboratory of Affective Computing and Advanced Intelligent Machine Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China

ISBN: (数字)9783031179020

ISBN: (纸本)9783031179013

Studies have shown that learning personal stories could help provide individualized eldercare services. However, personal stories are often disordered because of the scattered collection, including informal interviews or daily interactions, which brings difficulties in acquiring valuable information quickly. One solution to this problem is to extract events from personal stories and automatically organize them in chronological order. Events extracted by current methods from social media or news corpus are mainly organized in a linear structure. These works usually focus on the event time and ignore the consistency of event contents when organizing events. This paper aims to organize events into a tree structure based on an event network, with stem nodes representing key event topics and branch nodes representing detailed events. Social workers or caregivers can clarify the life experience of the older adults quickly through the event tree and have a preliminary understanding of them. The experiments show that the event tree generated by our method has a better performance in consistency than current event organization methods. A survey study shows that our method achieves the highest logical coherence for the event tree branches compared with other algorithms. © 2022, Springer Nature Switzerland AG.

关键词： Trees (mathematics)

DG-CNN:Introducing Margin Information into Convolutional Neural Networks for Breast Cancer Diagnosis in Ultrasound Images

学校读者我要写书评

暂无评论

Journal of Computer Science & technology 2022年第2期37卷 277-294页

作者： Xiao-Zheng Xie Jian-Wei Niu Senior Member Xue-Feng Liu Qing-Feng Li Yong Wang Jie Han Shaojie Tang State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and Engineering Beihang UniversityBeijing 100191China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang UniversityHangzhou 310051China Department of Diagnostic Ultrasound National Cancer CenterChinese Academy of Medical SciencesPeking Union Medical CollegeBeijing 100021China Naveen Jindal School of Management The University of Texas at DallasRichardsonTX 75080-3021U.S.A.

Although using convolutional neural networks(CNNs)for computer-aided diagnosis(CAD)has made tremendous progress in the last few years,the small medical datasets remain to be the major bottleneck in this *** address this problem,researchers start looking for information out of the medical *** efforts mainly leverage information from natural images via transfer *** recent research work focuses on integrating knowledge from medical practitioners,either letting networks resemble how practitioners are trained,how they view images,or using extra *** this paper,we propose a scheme named Domain Guided-CNN(DG-CNN)to incorporate the margin information,a feature described in the consensus for radiologists to diagnose cancer in breast ultrasound(BUS)*** DG-CNN,attention maps that highlight margin areas of tumors are first generated,and then incorporated via different approaches into the *** have tested the performance of DG-CNN on our own dataset(including 1485 ultrasound images)and on a public *** results show that DG-CNN can be applied to different network structures like VGG and ResNet to improve their *** example,experimental results on our dataset show that with a certain integrating mode,the improvement of using DG-CNN over a baseline network structure ResNet 18 is 2.17%in accuracy,1.69%in sensitivity,2.64%in specificity and 2.57%in AUC(Area Under Curve).To the best of our knowledge,this is the first time that the margin information is utilized to improve the performance of deep neural networks in diagnosing breast cancer in BUS images.

关键词： medical consensus domain knowledge breast cancer diagnosis margin map deep neural network

SpirDet: Towards Efficient, Accurate and Lightweight Infrared Small Target Detector

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Mao, Qianchen Li, Qiang Wang, Bingshu Zhang, Yongjun Dai, Tao Chen, C.L. Philip The School of Software Northwestern Polytechnical University Taicang Campus Suzhou215400 China The School of Software Northwestern Polytechnical University Xi’an710129 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China The State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China The College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China The School of Computer Science and Engineering South China University of Technology and Pazhou Lab Guangzhou510641 China

In recent years, the detection of infrared small targets using deep learning methods has garnered substantial attention due to notable advancements. To improve the detection capability of small targets, these methods commonly maintain a pathway that preserves high-resolution features of sparse and tiny targets. However, it can result in redundant and expensive computations. To tackle this challenge, we propose SpirDet, a novel approach for efficient detection of infrared small targets. Specifically, to cope with the computational redundancy issue, we employ a new dual-branch sparse decoder to restore the feature map. Firstly, the fast branch directly predicts a sparse map indicating potential small target locations (occupying only 0.5% area of the map). Secondly, the slow branch conducts fine-grained adjustments at the positions indicated by the sparse map. Additionally, we design an lightweight DO-RepEncoder based on reparameterization with the Downsampling Orthogonality, which can effectively reduce memory consumption and inference latency. Extensive experiments show that the proposed SpirDet significantly outperforms state-of-the-art models while achieving faster inference speed and fewer parameters. For example, on the IRSTD-1K dataset, SpirDet improves MIoU by 4.7 and has a 7× FPS acceleration compared to the previous state-of-the-art model. The code will be open to the public. © 2024, CC BY.

关键词： Deep learning