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

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

作者： Guohua Lv Mao Yuan Zengbin Zhang Zhengyang Zhang Zhenhui Ding Guangxiao Ma Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science Jinan China Shandong Key Laboratory of Ubiquitous Intelligent Computing Jinan China College of Computer Science and Engineering Shandong University of Science and Technology Qingdao China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Co-salient object detection (CoSOD) aims to detect common salient objects across multiple related images. However, existing methods often struggle with limited attention coverage, missing some co-salient objects. To address this, we propose a two-stage feature processing module (FPM) comprising comprehensive feature extraction module (CFE) and feature enhancement module (FEM). CFE extracts comprehensive cosalient features while reducing background noise, and FEM enhances feature representation and adjusts attention weights for full object coverage. Additionally, we introduce an adversarial learning module (ALM) to improve prediction quality by reducing noise in the co-salient regions. Extensive experiments on three benchmark datasets—CoCA, CoSOD3k, and CoSal2015—demonstrate that our model significantly outperforms state-of-the-art methods. The source code is available at https://***/yaobaimiao/CFPAM.

关键词： Attention mechanisms Source coding Noise Object detection Benchmark testing Feature extraction Adversarial machine learning Finite element analysis Background noise Speech processing

来源：评论

学校读者我要写书评

暂无评论

Medical Image Segmentation Based on 3d Pdc with Swin Transformer

SSRN

引用

SSRN 2025年

作者： Fan, Lin Ding, Xiaojia Wang, Zhongmin Wang, Hai Zhang, Rong School of Computer Science and Technology Xi’an University of Posts and Telecommunications Shaanxi Xi’an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi’an710121 China Xi’an Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi’an710121 China The School of Information Science and Technology Northwest University Shaanxi Xi’an710121 China

3D medical image segmentation is vital for disease diagnosis and effective treatment strategies. Despite the advancements in Convolutional Neural Networks (CNN), their fixed receptive fields constrain global context modeling, leading to suboptimal performance, particularly with complex shapes and multi-scale variations. Transformer enhances the global modeling capability through self-attention mechanism. However, challenges persist in capturing fine-grained local features and extracting edge features. To overcome these issues, In this study, a dual-path encoder is proposed, which consists of a 3D PDC and a Swin Transformer and is combined with a CNN for the decoder. The 3D PDC module extracts local features by calculating the differences between neighboring pixels. To improve the ability of capturing edge structures, three 3D PDC variants (3D CPDC, 3D APDC, and 3D RPDC) are proposed to optimize the processing ability of complex edges, multi-directional edges, and multi-scale structures, respectively. After performance evaluation, the selected CARV combinations (3D CPDC, 3D APDC, 3D RPDC, and 3D ordinary convolution) achieve a compromise between high segmentation accuracy and low computational cost. The Swin Transformer encoder captures global context using a hierarchical shift-window mechanism, while the CNN decoder fuses features progressively to produce precise pixel-level segmentation. The proposed method exceeds the performance of existing state-of-the-art techniques, as shown by experiments conducted on the BTCV, FLARE21, and AMOS22 datasets. © 2025, The Authors. All rights reserved.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

SFDA-rPPG: Source-Free Domain Adaptive Remote Physiological Measurement with Spatio-Temporal Consistency

arXiv

引用

arXiv 2024年

作者： Xie, Yiping Yu, Zitong Wu, Bingjie Xie, Weicheng Shen, Linlin Computer Vision Institute School of Computer Science & Software Engineering Shenzhen Institute of Artificial Intelligence and Robotics for Society Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China School of Computing and Information Technology Great Bay University Dongguan523000 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China Singapore

Remote Photoplethysmography (rPPG) is a non-contact method that uses facial video to predict changes in blood volume, enabling physiological metrics measurement. Traditional rPPG models often struggle with poor generalization capacity in unseen domains. Current solutions to this problem is to improve its generalization in the target domain through Domain Generalization (DG) or Domain Adaptation (DA). However, both traditional methods require access to both source domain data and target domain data, which cannot be implemented in scenarios with limited access to source data, and another issue is the privacy of accessing source domain data. In this paper, we propose the first Source-free Domain Adaptation benchmark for rPPG measurement (SFDA-rPPG), which overcomes these limitations by enabling effective domain adaptation without access to source domain data. Our framework incorporates a Three-Branch Spatio-Temporal Consistency Network (TSTC-Net) to enhance feature consistency across domains. Furthermore, we propose a new rPPG distribution alignment loss based on the Frequency-domain Wasserstein Distance (FWD), which leverages optimal transport to align power spectrum distributions across domains effectively and further enforces the alignment of the three branches. Extensive cross-domain experiments and ablation studies demonstrate the effectiveness of our proposed method in source-free domain adaptation settings. Our findings highlight the significant contribution of the proposed FWD loss for distributional alignment, providing a valuable reference for future research and applications. The source code is available at https://***/XieYiping66/SFDA-rPPG. Copyright © 2024, The Authors. All rights reserved.

关键词： Photoplethysmography

来源：评论

学校读者我要写书评

暂无评论

CGNet: Classification-Guided Multi-Task Interactive Network for Hyperspectral and Multispectral Image Fusion

CGNet: Classification-Guided Multi-Task Interactive Network ...

引用

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

作者： Guohua Lv Yanlong Xu Yongbiao Gao Guixin Zhao Guotao Wang Xiangcheng Sun Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) China Shandong Provincial Key Laboratory of Computing Power Internet and Service Computing Shandong Fundamental Research Center for Computer Science China Shandong Key Laboratory of Ubiquitous Intelligent Computing China Key Laboratory of New Generation Artificial Intelligence Technology and Its Interdisciplinary Application (Southeast University) Ministry of Education China Beihang University Beijing China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

The goal of fusing hyperspectral images (HSI) and multispectral images (MSI) is to generate high-resolution hyperspectral images for downstream tasks. However, most existing methods overlook the specific requirements of these tasks, leading to a gap between the fusion process and its subsequent applications due to insufficient guidance from downstream tasks. To address this issue, we propose a classification-guided multitask interactive network (CGNet) that integrates both fusion and classification tasks into a unified framework, with two branches producing the fused image and classification results, respectively. In the fusion branch, we design a multi-level residual refinement module to efficiently integrate spatial and spectral information. Additionally, an attention-based multi-scale fusion module, incorporating both spatial and channel attention, is carefully crafted to enhance representation learning. In the classification branch, both 2-D and 3-D convolutions are employed to improve classification performance. Moreover, an information interaction module is proposed to guide the fusion task based on classification outcomes. Extensive experiments demonstrate that our method outperforms state-of-the-art approaches on the Pavia Centre and Pavia University datasets.

关键词： Representation learning Three-dimensional displays Attention mechanisms Convolution Streaming media Multitasking Speech processing Image fusion information exchange Hyperspectral imaging

来源：评论

学校读者我要写书评

暂无评论

Facial StO2-based Stress Recognition using Automatic Graph Generation and Dual-Stream GNN

Facial StO2-based Stress Recognition using Automatic Graph G...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yingjuan Jia Hanpu Wang Xinyu Liu Tong Chen College of Electronic and Information Engineering Southwest University China Chongqing Key Laboratory of Generic Technology and System of Service Robots Southwest University China Institute of Legal Psychology and Intelligent Computing Southwest University China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

The recognition of stress responses in health, resilience, and psychopathology holds significant scientific importance. The biological information carried by the facial tissue oxygen saturation (StO2) is a useful indicator for stress recognition. Although graph-based methods have achieved state-of-the-art (SOTA), there is room for improvement. This study proposes an automatic graph generation method for facial StO2, replacing manual methods and enhancing the information of graphs. To further enhance the capability of graphs’ representation, a dimensionality reduction strategy for nodes is proposed. The strategy is implemented based on an novel objective function that can increase the inter-class distance and reduce the intra-class distance. After obtaining highly representative graphs, a dual-stream network integrating GAT and GCN is designed to extract stress-related features from the graphs, ultimately achieving the SOTA recognition accuracy.

关键词： Dimensionality reduction Accuracy Face recognition Manuals Feature extraction Linear programming Biology Convolutional neural networks Stress Resilience

来源：评论

学校读者我要写书评

暂无评论

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-Preserving Talking Face Synthesis

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-...

引用

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

作者： Kaijun Deng Dezhi Zheng Jindong Xie Jinbao Wang Weicheng Xie Linlin Shen Siyang Song Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Provincial Key Laboratory of Intelligent Information Processing Department of Computer Science University of Exeter

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Accurately synthesizing talking face videos and capturing fine facial features for individuals with long hair presents a significant challenge. To tackle these challenges in existing methods, we propose a decomposed per-embedding Gaussian fields (DEGSTalk), a 3D Gaussian Splatting (3DGS)-based talking face synthesis method for generating realistic talking faces with long hairs. Our DEGSTalk employs Deformable Pre-Embedding Gaussian Fields, which dynamically adjust pre-embedding Gaussian primitives using implicit expression coefficients. This enables precise capture of dynamic facial regions and subtle expressions. Additionally, we propose a Dynamic Hair-Preserving Portrait Rendering technique to enhance the realism of long hair motions in the synthesized videos. Results show that DEGSTalk achieves improved realism and synthesis quality compared to existing approaches, particularly in handling complex facial dynamics and hair preservation. Our code is available at https://***/CVI-SZU/DEGSTalk.

关键词： Hair Training Three-dimensional displays Dynamics Signal processing Rendering (computer graphics) Noise measurement Speech processing Faces Videos

来源：评论

学校读者我要写书评

暂无评论

Modeling and Clustering of Parabolic Granular Data

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第7期5卷 3728-3742页

作者： Tang, Yiming Gao, Jianwei Pedrycz, Witold Hu, Xianghui Xi, Lei Ren, Fuji Hu, Min Hefei University of Technology Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine School of Computer and Information Hefei230601 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6R 2V4 Canada Hefei University of Technology School of Computer and Information Hefei230601 China University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada Polish Academy of Sciences Systems Research Institute Warsaw00-901 Poland Istinye University Research Center of Performance and Productivity Analysis Istanbul34010 Turkey Southeast University School of Computer Science and Engineering Nanjing211189 China University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China

At present, there exist some problems in granular clustering methods, such as lack of nonlinear membership description and global optimization of granular data boundaries. To address these issues, in this study, revolving around the parabolic granular data, we propose an overall architecture for parabolic granular modeling and clustering. To begin with, novel coverage and specificity functions are established, and then a parabolic granular data structure is proposed. The fuzzy c-means (FCM) algorithm is used to obtain the numeric prototypes, and then particle swarm optimization (PSO) is introduced to construct the parabolic granular data from the global perspective under the guidance of principle of justifiable granularity (PJG). Combining the advantages of FCM and PSO, we propose the parabolic granular modeling and optimization (PGMO) method. Moreover, we put forward attribute weights and sample weights as well as a distance measure induced by the Gaussian kernel similarity, and then come up with the algorithm of weighted kernel fuzzy clustering for parabolic granularity (WKFC-PG). In addition, the assessment mechanism of parabolic granular clustering is discussed. In summary, we set up an overall architecture including parabolic granular modeling, clustering, and assessment. Finally, comparative experiments on artificial, UCI, and high-dimensional datasets validate that our overall architecture delivers a good improvement over previous strategies. The parameter analysis and time complexity are also given for WKFC-PG. In contrast with related granular clustering algorithms, it is observed that WKFC-PG performs better than other granular clustering algorithms and has superior stability in handling outliers, especially on high-dimensional datasets. © 2020 IEEE.

关键词： Fuzzy clustering

来源：评论

学校读者我要写书评

暂无评论

INNSE: Invertible neural network-based DNA image storage with self-correction encoding

引用

Computational and Structural Biotechnology Journal 2025年 27卷 2492-2502页

作者： Yanfen Zheng Xiaokang Zhang Lijun Sun Ben Cao Bin Wang Qiang Zhang Pan Zheng School of Computer Science and Technology Dalian University of Technology Dalian Liaoning 116024 China The Key Laboratory of Advanced Design and Intelligent Computing Ministry of Education School of Software Engineering Dalian University Dalian Liaoning 116622 China Department of Accounting and Information Systems University of Canterbury Upper Riccarton Christchurch 8140 New Zealand

DNA storage has become an alternative to silicon-based storage of media. However, when used to store multimodal data such as images, it fails to take full advantage of the characteristics of high correlation and variability present in such data, and currently remains inferior in terms of encoding density and time complexity. It also has the shortcoming of weak performance in terms of error correction methods to address insertion and deletion errors caused by error crosstalk. Therefore, we proposed an invertible neural network-based DNA image storage self-correction encoding method (INNSE) that uses the invertibility of network to perform up-down sampling processing on image and video data, thereby greatly reducing the number of DNA sequences required for data storage. A codebook generator was then designed to encode low-dimensional vectors into DNA sequences that meet various constraints. Finally, a self-correction method was constructed to achieve DNA sequence error correction at the base level without adding any redundant information. Our experimental results showed that, compared to the Yin-Yang algorithm, the encoding density of INNSE was increased by 3×, encoding time complexity was reduced by 95.26%. Under a simulated error rate of 2%, PSNR and SSIM were raised by 80.88% and 63.82%, respectively, proving that INNSE has significant advantages in encoding performance and error correction ability.

关键词： Codebook generator DNA storage Invertible neural network Self-correction

来源：评论

学校读者我要写书评

暂无评论

Detection from Phaseless Measurements of Block-Sparse Signals Using Convex Programming

Detection from Phaseless Measurements of Block-Sparse Signal...

引用

2021 CIE International Conference on Radar, Radar 2021

作者： Zhang, Di Wan, Qun School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu China Agile and Intelligent Computing Key Laboratory of Sichuan Province Chengdu China

ISBN: (纸本)9781665498142

In this paper we study the problem of hypothesis testing for detection of a block-sparse signal, which consists of clusters of non-zero elements, from the magnitude-only measurements. As a typical phase retrieval problem, the detection is solved by a method based on convex programming. We derive a detector for the measurement model of this paper and analyze the theoretical performance of the proposed detector. The advantages of our method are indicated in numerical experiments of region of convergence and noise-robustness, etc.. Specifically, the number of requiring measurements of our method for a successful detection is apparently lower than counterparts. © 2021 IEEE.

关键词： block-sparse signal convex programming detection phase retrieval

来源：评论

学校读者我要写书评

暂无评论

Exploring Data Geometry for Continual Learning

arXiv

引用

arXiv 2023年

作者： Gao, Zhi Xu, Chen Li, Feng Jia, Yunde Harandi, Mehrtash Wu, Yuwei Beijing Key Laboratory of Intelligent Information Technology School of Computer Science & Technology Beijing Institute of Technology China Guangdong Laboratory of Machine Perception and Intelligent Computing Shenzhen MSU-BIT University China Department of Electrical and Computer Systems Eng. Monash University Data61 Australia

Continual learning aims to efficiently learn from a non-stationary stream of data while avoiding forgetting the knowledge of old data. In many practical applications, data complies with non-Euclidean geometry. As such, the commonly used Euclidean space cannot gracefully capture non-Euclidean geometric structures of data, leading to inferior results. In this paper, we study continual learning from a novel perspective by exploring data geometry for the non-stationary stream of data. Our method dynamically expands the geometry of the underlying space to match growing geometric structures induced by new data, and prevents forgetting by keeping geometric structures of old data into account. In doing so, making use of the mixed curvature space, we propose an incremental search scheme, through which the growing geometric structures are encoded. Then, we introduce an angular-regularization loss and a neighbor-robustness loss to train the model, capable of penalizing the change of global geometric structures and local geometric structures. Experiments show that our method achieves better performance than baseline methods designed in Euclidean space. Copyright © 2023, The Authors. All rights reserved.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：