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

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Liu, Hanlin Zhou, Jiantao Li, Hua Inner Mongolia University College of Computer Science Hohhot China Natl. Loc. Jt. Eng. Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

ISBN: (纸本)9798350331684

Anomaly detection refers to the identification of data objects that deviate from the general data distribution. One of the important challenges in anomaly detection is handling high-dimensional data, especially when it contains a large number of redundant attributes. Although traditional Isolation Forest (iForest) and Extended Isolation Forest (EIF) have performed well in anomaly detection, the detection accuracy is still extremely influenced by redundant attributes. In this paper, we propose a two-tier architecture named RS-EIF, to alleviate the negative impact of redundant attributes. Specifically, the RS-EIF combines the rough set theory and EIF algorithm and provides an effective basis for the EIF-based anomaly detection method by removing redundant attributes with rough set theory. Experimental results show that the RS-EIF algorithm performs better than the iForest and EIF algorithms in terms of anomaly detection rate, and the results of the combination of rough set theory and EIF are more prominent compared to the other combination methods. © 2023 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

CESFusion: Cross-Frequency Enhanced Spatial—Spectral Fusion Network for Hyperspectral and Multispectral Image Fusion

引用

IEEE Transactions on Geoscience and Remote Sensing 2025年 63卷

作者： Zhang, Haozheng Yang, Yanhong Li, Chaoyang Lu, Yanjie Zhang, Guodao Chen, Shengyong Tianjin University of Technology School of Computer Science and Engineering Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin300384 China School of Computer Science and Engineering Tianjin300384 China Hangzhou Dianzi University Institute of Intelligent Media Computing Hangzhou310018 China

The fusion of hyperspectral and multispectral images (MSIs) involves integrating a high spectral resolution hyperspectral image (HSI) and a high spatial resolution MSI to generate an HSI with high-resolution HSI (HR-HSI). Existing HSI-MSI fusion methods primarily focus on information fusion within the spatial domain;however, few solutions have explored the employment of frequency analysis to enhance spatial resolution, limiting their capability for global perception. In this article, we propose an efficient and novel paradigm for HSI-MSI fusion through the cross-frequency enhanced spatial-spectral fusion network, named CESFusion, exploring the complementary fusion of information between the spatial and frequency domains. Specifically, we first present the cross-frequency fusion module (CFFM) to perform global analysis through the Fourier transform (FT) and effectively integrate and enhance the frequency domain information from both HSI and MSI. Subsequently, we propose the spectral modeling module (SpeMM) based on a state space model (SMM) to capture long-range spectral dependencies with linear complexity, and integrate it with the spatial residual block-based module (SRM) for joint spatial-spectral feature extraction. Finally, to enable sufficient interaction between the spatial and frequency domains, we adopt the cross-domain interaction module (CDIM), capturing and integrating complementary information from both domains. Moreover, a frequency-based loss function is purposely designed to further improve the restoration of global information. Extensive experiments conducted on both synthetic and real datasets demonstrate the superiority of our CESFusion, as evidenced by both quantitative and qualitative evaluation results. © 1980-2012 IEEE.

关键词： Image fusion

来源：评论

学校读者我要写书评

暂无评论

multiPI-TransBTS: A multi-path learning framework for brain tumor image segmentation based on multi-physical information

引用

Computers in Biology and Medicine 2025年 191卷 110148-110148页

作者： 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. © 2025

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

A Graph Sequence Generator and Multi-head Self-attention Mechanism based Knowledge Graph Reasoning Architecture 26

A Graph Sequence Generator and Multi-head Self-attention Mec...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Wu, Yuejia Zhou, Jian-Tao College of Computer Science Inner Mongolia University Hohhot China National & Local Joint Engineering Research Center Intelligent Info. Proc. Technology for Mongolian Engineering Research Center of Ecological Big Data Ministry of Education Hohhot China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Hohhot China Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

ISBN: (纸本)9798350331684

Knowledge Graph (KG) is an essential research direction that involves storing and managing knowledge data, but its incompleteness and sparsity hinder its development in various applications. Knowledge Graph Reasoning (KGR) is an effective method to solve this limitation via reasoning missing knowledge based on existing knowledge. The graph Convolution Network (GCN) based method is one of the state-of-the-art approaches to this work. However, there are still some problems, such as the insufficient ability to perceive graph structure and the poor effect of learning data features which may limit the reasoning accuracy. This paper proposes a KGR architecture based on a graph sequence generator and multi-head self-attention mechanism, named GaM-KGR, to improve the above problems and enhance prediction accuracy. Specifically, the GaM-KGR first introduces the graph generation model into the field of KGR for graph representation learning to obtain the hidden features in the data so that enhancing the reasoning effect and then embeds the generated graph sequence into the multi-head self-attention mechanism for subsequent processing to improve the graph structure perception ability of the proposed architecture, so that it can process the graph structure data more appropriately. Extensive experimental results show that the GaM-KGR architecture can achieve the state-of-the-art prediction results of current GCN-based models. © 2023 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Simple and Efficient Knowledge Graph Attention Network for Recommendation

Simple and Efficient Knowledge Graph Attention Network for R...

引用

2023 International Conference on Cyber-Physical Social Intelligence, ICCSI 2023

作者： Li, Yangding Fu, Shaobin Feng, Hao Zeng, Yangyang Wang, Jinghao Jiang, Zhihao Zhang, Lvyun Hunan Provincial Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University School of Information Science and Engineering Changsha China Shenzhen Lazada Software Technology Company Limited Shenzhen China Hechi University School of Big Data and Computer Science Guangxi China

ISBN: (纸本)9798350312492

Existing methods for modeling recommendation systems based on knowledge graphs include embedding-based, pathbased, and propagation-based methods. The embedding-based approach is flexible but more suitable for intra-graph applications, the path-based approach can model complex relationships but has a high computational cost, and the propagation-based approach considers global information but may introduce noise. This study proposed a simple and efficient model, called SEKGAT, which comprehensive the ideology of path-based and propagation approach to personalized recommendation by aggregating the user preferences through graph attention mechanism and fusing multiple feature representations on the knowledge graph into item features through pooling aggregators. Experimental results for the CTR prediction and Top-K recommendation tasks on three datasets of real-world scenarios show that our model approach is competitive. © 2023 IEEE.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

An Encoder-Decoder Model Based On Spiking Neural Networks For Address Event Representation Object Recognition

引用

IEEE Transactions on Cognitive and Developmental Systems 2025年

作者： Du, Sichun Zhu, Haodi Zhang, Yang Hong, Qinghui Hunan University College of Computer Science and Electronic Engineering Changsha418002 China Shenzhen University Computer Vision Institute School of Computer Science and Software Engineering National Engineering Laboratory for Big Data System Computing Technology Guangdong Key Laboratory of Intelligent Information Processing Shenzhen518060 China

Address event representation (AER) object recognition task has attracted extensive attention in neuromorphic vision processing. The spike-based and event-driven computation inherent in the spiking neural network (SNN) provides an energy-saving solution for AER object recognition. However, SNN with spike timing dependent plasticity (STDP) learning rule has not achieved satisfying AER object recognition performance. This work proposes an SNN-based encoder-decoder model to improve the recognition performance of AER objects. An STDP-based locally connected spiking neural network (LC-SNN) is proposed as an encoder to extract rich spatiotemporal features from AER event flows more flexibly. After the encoder extracts and learns primary features, we propose a fully connected spiking neural network (FC-SNN) based on the reward-modulated spike-timing-dependent plasticity (R-STDP) learning rule as a decoder to learn higher-level features for classification. In addition, we improved the winner-take-all (WTA) mechanisms and R-STDP learning rule in the decoder based on the reward and punish decision, enabling the network to perform better. The experiments are performed on the N-MNIST, MNIST-DVS, and the DVS Gesture datasets, improving the accuracy of the best existing plasticity-based SNN by 0.19%, 0.27% and 1.35%, respectively. © 2016 IEEE.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

Adaptively feature matching via joint transformational-spatial clustering

Adaptively feature matching via joint transformational-spati...

引用

作者： Wang, Linbo Tan, Li Fang, Xianyong Guo, Yanwen Wan, Shaohua MOE Key Laboratory of Intelligent Computing and Signal Processing School of Computer Science and Technology Anhui University Hefei China National Key Lab for Novel Software Technology Nanjing University Nanjing China School of Information and Safety Engineering Zhongnan University of Economics and Law Wuhan China

The transformational and spatial proximities are important cues for identifying inliers from an appearance based match set because correct matches generally stay close in input images and share similar local transformations. However, most existing approaches only check one type of them or both types consecutively with manually set thresholds, and thus their matching accuracy and flexibility in handling large-scale images are limited. In this paper, we present an efficient clustering based approach to identify match inliers with both proximities simultaneously. It first projects the putative matches into a joint transformational-spatial space, where mismatches tend to scatter all around while correct matches gather together. A mode-seeking process based on joint kernel density estimation is then proposed to obtain significant clusters in the joint space, where each cluster contains matches mapping the same object across images with high accuracy. Moreover, kernel bandwidths for measuring match proximities are adaptively set during density estimation, which enhances its applicability for matching different images. Experiments on three standard datasets show that the proposed approach delivers superior performance on a variety of feature matching tasks, including multi-object matching, duplicate object matching and object retrieval. © 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Clustering Density estimation Feature matching Mode-seeking

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Circular Decomposition and Cross-Modal Recombination for Multimodal Sentiment Analysis

Circular Decomposition and Cross-Modal Recombination for Mul...

引用

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

作者： Haijian Liang Weicheng Xie Xilin He Siyang Song Linlin Shen School of Computer Science & Software Engineering Computer Vision Institue Shenzhen University Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University School of Computing and Mathematical Sciences University of Leicester National Engineering Laboratory for Big Data System Computing Technology Shenzhen University

Multimodal Sentiment Analysis is a burgeoning research area, leveraging various modalities to predict the sentiment score. Nevertheless, previous studies have disregarded the impact of noise interference on specific modal sentiments during video recording, thereby compromising the accuracy of sentiment prediction. In this paper, we propose the Guided Circular Decomposition and Cross-Modal Recombination (GCD-CMR) model, which aims to eliminate contaminated sentiment features in a fine-grained way. To achieve this, we utilize tailored global information specific to each modality to guide the circular decomposing process in the GCD module, to produce a set of sentiment prototypes. Subsequently, in the CMR module, we align cross-modal sentiment prototypes and remove the contaminated prototypes for recombination. Experimental results on two publicly available datasets demonstrate that our model surpasses state-of-the-art models, confirming the effectiveness of our proposed method. We release the code at: https://***/nianhua20/GCD-CMR.

关键词：

来源：评论

学校读者我要写书评

暂无评论

FLIP-80M: 80 Million Visual-Linguistic Pairs for Facial Language-Image Pre-Training 24

FLIP-80M: 80 Million Visual-Linguistic Pairs for Facial Lang...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Li, Yudong Hou, Xianxu Dezhi, Zheng Shen, Linlin Zhao, Zhe School of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China School of AI and Advanced Computing Xi'an Jiaotong-Liverpool University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China Tencent AI Lab Beijing China

ISBN: (纸本)9798400706868

While significant progress has been made in multi-modal learning driven by large-scale image-text datasets, there is still a noticeable gap in the availability of such datasets within the facial domain. To facilitate and advance the field of facial representation learning, we present FLIP-80M, a large-scale visual-linguistic dataset comprising over 80 million face images paired with text descriptions. FLIP-80M is constructed by leveraging the large openly available image-text-pair dataset LAION-5B and a mixed-method approach to filter face-related pairs from both visual and linguistic perspectives. Our curation process involves face detection, face caption classification, text de-noising, and synthesis-based image augmentation. As a result, FLIP-80M stands as the largest face-text dataset to date. To evaluate the potential of our dataset, we fine-tune the CLIP model using the proposed FLIP-80M, to create FLIP (Facial Language-Image Pretraining) and assess its representation capabilities across various downstream tasks. Our experiments demonstrate that our FLIP model achieves state-of-the-art results in a range of face analysis tasks, including face parsing, face alignment, and face attribute classification. The dataset and models are available at https://***/ydli-ai/FLIP. © 2024 ACM.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：