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

Frequency-Guided Spatial Adaptation for Camouflaged Object Detection

学校读者我要写书评

暂无评论

arxiv 2024年

作者： Zhang, Shizhou Kong, Dexuan xing, Yinghui Lu, Yue Ran, Lingyan Liang, Guoqiang Wang, Hexu Zhang, Yanning National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology School of Computer Science Northwestern Polytechnical University Xi’an China The Research & Development Institute Northwestern Polytechnical University Shenzhen China The School of Information and Technology Northwest University Xi’an710127 China Xi’an Key Laboratory of Human-Machine Integration and Control Technology for Intelligent Rehabilitation Xijing University Shaanxi Xi’an710123 China

Camouflaged object detection (COD) aims to segment camouflaged objects which exhibit very similar patterns with the surrounding environment. Recent research works have shown that enhancing the feature representation via the frequency information can greatly alleviate the ambiguity problem between the foreground objects and the background. With the emergence of vision foundation models, like InternImage, Segment Anything Model etc, adapting the pretrained model on COD tasks with a lightweight adapter module shows a novel and promising research direction. Existing adapter modules mainly care about the feature adaptation in the spatial domain. In this paper, we propose a novel frequency-guided spatial adaptation method for COD task. Specifically, we transform the input features of the adapter into frequency domain. By grouping and interacting with frequency components located within non overlapping circles in the spectrogram, different frequency components are dynamically enhanced or weakened, making the intensity of image details and contour features adaptively adjusted. At the same time, the features that are conducive to distinguishing object and background are highlighted, indirectly implying the position and shape of camouflaged object. We conduct extensive experiments on four widely adopted benchmark datasets and the proposed method outperforms 26 state-of-the-art methods with large margins. Code will be released. Copyright © 2024, The Authors. All rights reserved.

关键词： Frequency domain analysis

Fence Theorem: Towards Dual-Objective Semantic-Structure Isolation in Preprocessing Phase for 3D Anomaly Detection

学校读者我要写书评

暂无评论

arxiv 2025年

作者： Liang, Hanzhe Zhou, Jie Chen, Xuanxin Dai, Tao Wang, Jinbao Gao, Can College of Computer Science and Software Engineering Shenzhen University China Shenzhen Audencia Financial Technology Institute Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Faculty of Education Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

3D anomaly detection (AD) is prominent but difficult due to lacking a unified theoretical foundation for preprocessing design. We establish the Fence Theorem, formalizing preprocessing as a dual-objective semantic isolator: (1) mitigating cross-semantic interference to the greatest extent feasible and (2) confining anomaly judgements to aligned semantic spaces wherever viable, thereby establishing intra-semantic comparability. Any preprocessing approach achieves this goal through a two-stage process of Semantic-Division and Spatial-Constraints stage. Through systematic deconstruction, we theoretically and experimentally subsume existing preprocessing methods under this theorem via tripartite evidence: qualitative analyses, quantitative studies, and mathematical proofs. Guided by the Fence Theorem, we implement Patch3D, consisting of Patch-Cutting and Patch-Matching modules, to segment semantic spaces and consolidate similar ones while independently modeling normal features within each space. Experiments on Anomaly-ShapeNet and Real3D-AD with different settings demonstrate that progressively finer-grained semantic alignment in preprocessing directly enhances point-level AD accuracy, providing inverse validation of the theorem’s causal logic. Copyright © 2025, The Authors. All rights reserved.

关键词： Fences

MSONoC: A Metasurface-assisted Hybrid Waveguide/FSO Network-on-Chip Architecture

学校读者我要写书评

暂无评论

IEEE Transactions on Green Communications and Networking

IEEE Transactions on Green Communications and Networking 2024年

作者： Sun, Wei Li, Jingsi Guo, Pengxing He, xiangyu Wang, Zimo Hu, Cong Liu, Weichen Hou, Weigang Guo, Lei School of Communications and Information Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China Institute of Intelligent Communications and Network Security Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China Guangxi Key Laboratory of Automatic Detecting Technology and Instruments Guilin University of Electronic Technology Guilin541004 China School of Computer Science and Engineering Nanyang Technological University Singapore

Optical networks-on-chips (ONoCs) have emerged as the most promising solution for on-chip interconnection networks, offering distinct advantages such as high bandwidth and low latency. However, traditional wired-based ONoCs often suffer from a high average number of hops, leading to challenges such as increased insertion loss, crosstalk noise, and energy consumption. Therefore, this paper presents a novel ONoC structure known as the metasurface ONoC (MSONoC), which integrates wired waveguide and free-space optical (FSO) transmission with the assistance of metasurfaces. Specifically, this work encompasses the design of a passive metasurface structure tailored for ONoCs, a virtual network cluster partitioning method, an optical metasurface access points select strategy, and a shortest-path routing algorithm. Performance verification is conducted using a modified Noxim simulator. The simulation results demonstrate that the proposed MSONoC offers advantages over traditional NoCs, radio frequency (RF)-based hybrid wired/wireless NoCs, and wired-based ONoCs in terms of throughput, delay, energy consumption, and signal-to-noise ratio under both synthetic traffic and real traffic models. These improvements proves the effectiveness of the MSONoC architecture in optimizing network performance, making it a promising solution for high-performance, energy-efficient communication in on-chip networks. © 2017 IEEE.

关键词： Network-on-chip

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorithm 19th

学校读者我要写书评

暂无评论

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorit...

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Chen, Jiebin Hu, Ziqiang Ye, Renjie Zhang, Qishan Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Xianda College of Economics and Humanities Shanghai International Studies University Shanghai China

ISBN: (纸本)9789819623723

Large-scale graphs have become prevalent with the advent of the big data era. Distributed graph computing systems are commonly used for processing and analyzing large-scale graphs, with graph partitioning being a key prerequisite for their efficient computation. Graph partitioning aims to balance the load across partitions while minimizing the number of cut-edges. Moreover, it should achieve high efficiency and scalability. However, the existing popular graph partitioning algorithms do not fully take into account the internal topology of real-world graphs, which affects the final partition quality and convergence. Meanwhile, they easily fall into the local optimum due to partition load constraints. This paper introduces a Novel Optimized Balanced Graph Partitioning algorithm (NOBGP). First, we propose an initialization strategy based on label propagation of core vertices to achieve initial partitions with good locality and accelerate convergence. Second, we optimize the label propagation process to ensure balanced partitions and propose a probability-based disruption strategy to avoid the local optimum. We implement NOBGP on the distributed graph computing framework GraphX. Extensive experimental results on real-world graphs show that the proposed algorithm is scalable and performs better than the existing algorithms. We also run PageRank and Louvain applications using the graph partitioning results to demonstrate the efficiency of our algorithm. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Graph algorithms

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)

Suppress content shift: better diffusion features via off-the-shelf generation techniques 24

学校读者我要写书评

暂无评论

Suppress content shift: better diffusion features via off-th...

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

作者： Benyuan Meng Qianqian Xu Zitai Wang Zhiyong Yang xiaochun Cao Qingming Huang Institute of Information Engineering CAS and School of Cyber Security University of Chinese Academy of Sciences Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and Peng Cheng Laboratory Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS School of Computer Science and Tech. University of Chinese Academy of Sciences School of Cyber Science and Tech. Shenzhen Campus of Sun Yat-sen University School of Computer Science and Tech. University of Chinese Academy of Sciences and Key Lab. of Intelligent Information Processing Institute of Computing Technology CAS and Key Laboratory of Big Data Mining and Knowledge Management CAS

ISBN: (纸本)9798331314385

Diffusion models are powerful generative models, and this capability can also be applied to discrimination. The inner activations of a pre-trained diffusion model can serve as features for discriminative tasks, namely, diffusion feature. We discover that diffusion feature has been hindered by a hidden yet universal phenomenon that we call content shift. To be specific, there are content differences between features and the input image, such as the exact shape of a certain object. We locate the cause of content shift as one inherent characteristic of diffusion models, which suggests the broad existence of this phenomenon in diffusion feature. Further empirical study also indicates that its negative impact is not negligible even when content shift is not visually perceivable. Hence, we propose to suppress content shift to enhance the overall quality of diffusion features. Specifically, content shift is related to the information drift during the process of recovering an image from the noisy input, pointing out the possibility of turning off-the-shelf generation techniques into tools for content shift suppression. We further propose a practical guideline named GATE to efficiently evaluate the potential benefit of a technique and provide an implementation of our methodology. Despite the simplicity, the proposed approach has achieved superior results on various tasks and datasets, validating its potential as a generic booster for diffusion features. Our code is available at https://***/Darkbblue/diffusion-content-shift.

关键词：

Fully Synthetic Videos and Random Background-Pasting Method for Flame Segmentation

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Jia, Yang Zhang, xinmeng Kuang, Yaxi Chen, Yanping Wang, Gang Zhang, Qixing School of Computer Science Xi'an University of Posts and Telecommunications 710121 China Shaanxi Key Laboratory of Network Data Intelligent Processing Xi'an University of Posts and Telecommunications 710121 China Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'an University of Posts and Telecommunications 710121 China School of Information Science and Technology University of Science and Technology of China 230026 China XNIF262 710061 China State Key Laboratory of Fire Science University of Science and Technology of China 230026 China

Video-based flame detection (VFD) aims to recognize fire events by the image features. Flame segmentation is an essential task in VFD, which provides suspected regions for feature analysis and object recognition. The development of deep learning has promoted VFD performances to a higher level. However, due to the rarity of recorded fire events, it is challenging to get tremendous positive flame samples for model training. Existing deep learning-based VFD methods are limited to the lack of flame samples under different scenarios. In this paper, we propose an assumption that we can train a segmentation model with virtual flame images and design experiments to prove it. We take many virtual flame videos to extend existing flame datasets, which provide adequate flame samples for deep learning-based VFD methods. We also take a random background-pasting method to distribute the flame images among different scenarios. The proposed method trains a flame segmentation model with zero real flame image. Moreover, we perform segmentation testing with real flame images, which the model has never touched, to see if the model trained with ‘fake’ images can segment real objects. We trained four segmentation models based on FCN, U-Net, Deeplabv3, and Mask-RCNN with synthetic flame video frames, and obtained the highest mPA of 0.783 and mIoU of 0.515. The experimental results on FIRE-SMOKE-dataSET and Fire-Detection-Image-dataset demonstrate that the ‘fake’ flame samples generated by the proposed random background-pasting method can improve the performances of existing state-of-the-art flame segmentation methods obviously on cross-dataset evaluation settings. © 2022, The Authors. All rights reserved.

关键词： Deep learning

Multi-view Point Cloud Registration based on Evolutionary Multitasking with Bi-Channel Knowledge Sharing Mechanism

学校读者我要写书评

暂无评论

arxiv 2022年

作者： Wu, Yue Liu, Yibo Gong, Maoguo Gong, Peiran Li, Hao Tang, Zedong Miao, Qiguang Ma, Wenping The School of Computer Science and Technology Key Laboratory of Big Data and Intelligent Vision Xidian University Xi’an710071 China The School of Electronic Engineering Key Laboratory of Intelligent Perception and Image Understanding Ministry of Education Xidian University Xi’an710071 China The School of Artificial Intelligence Key Laboratory of Intelligent Perception and Image Understanding Ministry of Education Xidian University Xi’an710071 China

Multi-view point cloud registration is fundamental in 3D reconstruction. Since there are close connections between point clouds captured from different viewpoints, registration performance can be enhanced if these connections be harnessed properly. Therefore, this paper models the registration problem as multi-task optimization, and proposes a novel bi-channel knowledge sharing mechanism for effective and efficient problem solving. The modeling of multi-view point cloud registration as multi-task optimization are twofold. By simultaneously considering the local accuracy of two point clouds as well as the global consistency posed by all the point clouds involved, a fitness function with an adaptive threshold is derived. Also a framework of the co-evolutionary search process is defined for the concurrent optimization of multiple fitness functions belonging to related tasks. To enhance solution quality and convergence speed, the proposed bi-channel knowledge sharing mechanism plays its role. The intra-task knowledge sharing introduces aiding tasks that are much simpler to solve, and useful information is shared across aiding tasks and the original tasks, accelerating the search process. The inter-task knowledge sharing explores commonalities buried among the original tasks, aiming to prevent tasks from getting stuck to local optima. Comprehensive experiments conducted on model object as well as scene point clouds show the efficacy of the proposed method. Copyright © 2022, The Authors. All rights reserved.

关键词： Multitasking

multiPI-TransBTS: A Multi-Path Learning Framework for Brain Tumor Image Segmentation Based on Multi-Physical Information

学校读者我要写书评

暂无评论

arxiv 2024年

作者： Zhu, Hongjun Huang, Jiaohang Chen, Kuo Ying, Xuehui Qian, Ying School of Software Engineering Chongqing University of Posts and Telecommunications Chongqing400065 China Chongqing Engineering Research Center of Software Quality Assurance Testing and Assessment Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunications Chongqing400065 China

Brain Tumor Segmentation (BraTS) plays a critical role in clinical diagnosis, treatment planning, and monitoring the progression of brain tumors. However, due to the variability in tumor appearance, size, and intensity across different MRI modalities, automated segmentation remains a challenging task. In this study, we propose a novel Transformer-based framework, multiPI-TransBTS, which integrates multi-physical information to enhance segmentation accuracy. The model leverages spatial information, semantic information, and multi-modal imaging data, addressing the inherent heterogeneity in brain tumor characteristics. The multiPI-TransBTS framework consists of an encoder, an Adaptive Feature Fusion (AFF) module, and a multi-source, multi-scale feature decoder. The encoder incorporates a multi-branch architecture to separately extract modality-specific features from different MRI sequences. The AFF module fuses information from multiple sources using channel-wise and element-wise attention, ensuring effective feature recalibration. The decoder combines both common and task-specific features through a Task-Specific Feature Introduction (TSFI) strategy, producing accurate segmentation outputs for Whole Tumor (WT), Tumor Core (TC), and Enhancing Tumor (ET) regions. Comprehensive evaluations on the BraTS2019 and BraTS2020 datasets demonstrate the superiority of multiPI-TransBTS over the state-of-the-art methods. The model consistently achieves better Dice coefficients, Hausdorff distances, and Sensitivity scores, highlighting its effectiveness in addressing the BraTS challenges. Our results also indicate the need for further exploration of the balance between precision and recall in the ET segmentation task. The proposed framework represents a significant advancement in BraTS, with potential implications for improving clinical outcomes for brain tumor patients. Copyright © 2024, The Authors. All rights reserved.

关键词： Decoding