IEEE Signal Processing Letters最新文献

筛选
英文 中文
Enhancing Noise Robustness in Focus Measure Using Tight Framelet Features 利用紧框架特征增强焦点测量中的噪声鲁棒性
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-20 DOI: 10.1109/LSP.2025.3553425
Yan-Ran Li;Junwei Liu;Zhangtao Ye;Lixin Shen;Xiaosheng Zhuang
{"title":"Enhancing Noise Robustness in Focus Measure Using Tight Framelet Features","authors":"Yan-Ran Li;Junwei Liu;Zhangtao Ye;Lixin Shen;Xiaosheng Zhuang","doi":"10.1109/LSP.2025.3553425","DOIUrl":"https://doi.org/10.1109/LSP.2025.3553425","url":null,"abstract":"Focus measures are widely used to assess image clarity in various fields, such as photography and computer vision. However, many existing focus measures face challenges in balancing noise robustness and measurement capability. In this letter, a novel focus measure called Variance of Tight Framelet Feature (VTFF) is proposed to address this challenge. VTFF leverages the advantages of tight framelet features and variance information in feature maps to provide a robust and accurate assessment of image focus. Experimental results on both synthetic and real-world data demonstrate its superior performance compared to recent focus measures in measurement capability, noise robustness, and real-time performance.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1435-1439"},"PeriodicalIF":3.2,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143783290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Collaborative Adapter Experts for Class-Incremental Learning 类增量学习的协作适配器专家
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-20 DOI: 10.1109/LSP.2025.3553431
Sunyuan Qiang;Xinxing Yu;Yanyan Liang;Jun Wan;Du Zhang
{"title":"Collaborative Adapter Experts for Class-Incremental Learning","authors":"Sunyuan Qiang;Xinxing Yu;Yanyan Liang;Jun Wan;Du Zhang","doi":"10.1109/LSP.2025.3553431","DOIUrl":"https://doi.org/10.1109/LSP.2025.3553431","url":null,"abstract":"Pre-trained models (PTMs) with parameter-efficient fine-tuning (PEFT) techniques have been extensively utilized in class-incremental learning (CIL) scenarios. However, they still remain susceptible to performance degradation as the individual PEFT module operates as an independent learning entity during the incremental process. To this end, this work proposes a novel class-incremental collaborative adapter experts (CICAE) model, which incorporates multiple adapters operating collaboratively to facilitate CIL. Specifically, our model primarily consists of two phases. Initially, multiple adapters are employed to establish a multi-expert system aimed at acquiring diverse incremental knowledge. Through the collaborative knowledge sharing (CKS) mechanism, the expertise of each adapter expert is transferable, promoting collaborative development and mutual advancement. Subsequently, with the category prototype distributions, collaborative classifier alignment (CCA) is proposed to further align the classifiers with the representation space in a cooperative manner. Extensive experiments on CIL benchmarks validate the superior performance of our model.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1530-1534"},"PeriodicalIF":3.2,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143845330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Variation Autoencoder of Spatial-Spectral Joint Mask for Hyperspectral Anomaly Detection 用于高光谱异常检测的空间-光谱联合掩模变化自编码器
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-20 DOI: 10.1109/LSP.2025.3553433
Dandan Ma;Zhuozhao Liu;Zhiyu Jiang
{"title":"Variation Autoencoder of Spatial-Spectral Joint Mask for Hyperspectral Anomaly Detection","authors":"Dandan Ma;Zhuozhao Liu;Zhiyu Jiang","doi":"10.1109/LSP.2025.3553433","DOIUrl":"https://doi.org/10.1109/LSP.2025.3553433","url":null,"abstract":"In recent years, autoencoders and their variants have emerged as effective tools for hyperspectral anomaly detection. Nevertheless, owing to the complex distribution of anomalous regions and the similarity in spatial-spectral features, these models often reconstruct anomalies and backgrounds simultaneously, hindering their ability to distinguish between them and reducing detection accuracy. To address this issue, we propose a novel hyperspectral anomaly detection method based on a spatial-spectral joint mask variational autoencoder (VAE). By combining the probabilistic modeling capabilities of VAEs with a masking-based attention mechanism, our method enables more precise extraction of essential background information in localized regions. Specifically, the spatial-spectral joint masking technique is proposed to guide the network to concentrate on background features across multiple dimensions, tackling issues of spatial structure approximation and spectral redundancy. To further enhance robustness in noisy and complex environments, we iteratively refine the reconstructed residual image through recursive filtering. Extensive comparative experiments and ablation studies on multiple public datasets demonstrate that our approach consistently outperforms existing methods in detection accuracy.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1535-1539"},"PeriodicalIF":3.2,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143845481","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Flow-PLC: Towards Efficient Packet Loss Concealment With Flow Matching 流plc:基于流匹配的高效丢包隐藏
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-20 DOI: 10.1109/LSP.2025.3553421
Da-Hee Yang;Joon-Hyuk Chang
{"title":"Flow-PLC: Towards Efficient Packet Loss Concealment With Flow Matching","authors":"Da-Hee Yang;Joon-Hyuk Chang","doi":"10.1109/LSP.2025.3553421","DOIUrl":"https://doi.org/10.1109/LSP.2025.3553421","url":null,"abstract":"Recent advancements in packet loss concealment (PLC) have introduced diffusion-based generative models that offer high-quality audio reconstruction. However, their high computational costs make them impractical for real-time applications. In this letter, we present Flow-PLC, an efficient PLC model based on the flow-matching framework, designed to address these computational challenges. Flow-PLC achieves a remarkable 23× reduction in inference time compared to diffusion-based PLC models, requiring only five sampling steps to achieve near-optimal reconstruction. By significantly reducing computational complexity while maintaining high-quality results, Flow-PLC represents a substantial advancement in the development of efficient and practical generative PLC systems.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1430-1434"},"PeriodicalIF":3.2,"publicationDate":"2025-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143783360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Blind Deconvolution of Graph Signals: Robustness to Graph Perturbations 图信号的盲反卷积:对图扰动的鲁棒性
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-19 DOI: 10.1109/LSP.2025.3553064
Chang Ye;Gonzalo Mateos
{"title":"Blind Deconvolution of Graph Signals: Robustness to Graph Perturbations","authors":"Chang Ye;Gonzalo Mateos","doi":"10.1109/LSP.2025.3553064","DOIUrl":"https://doi.org/10.1109/LSP.2025.3553064","url":null,"abstract":"We study blind deconvolution of signals defined on the nodes of an undirected graph. Although observations are bilinear functions of both unknowns, namely the forward convolutional filter coefficients and the graph signal input, a filter invertibility requirement along with input sparsity allow for an efficient linear programming reformulation. Unlike prior art that relied on perfect knowledge of the graph eigenbasis, here we derive stable recovery conditions in the presence of small graph perturbations. We also contribute a provably convergent robust algorithm, which alternates between blind deconvolution of graph signals and eigenbasis denoising in the Stiefel manifold. Reproducible numerical tests showcase the algorithm's robustness under several graph eigenbasis perturbation models.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1381-1385"},"PeriodicalIF":3.2,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143748912","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Factorization-Based Information Reconstruction for Enhancing Missing Modality Robustness 基于因子分解的信息重构增强缺失模态鲁棒性
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-18 DOI: 10.1109/LSP.2025.3552435
Chao Wang;Miaolei Zhou;Xiaofei Yu;Junchao Weng;Yong Zhang
{"title":"Factorization-Based Information Reconstruction for Enhancing Missing Modality Robustness","authors":"Chao Wang;Miaolei Zhou;Xiaofei Yu;Junchao Weng;Yong Zhang","doi":"10.1109/LSP.2025.3552435","DOIUrl":"https://doi.org/10.1109/LSP.2025.3552435","url":null,"abstract":"In recent years, Multimodal Sentiment Analysis (MSA) has emerged as a prominent research area, utilizing multiple signals to better understand human sentiment. Previous studies in MSA have primarily concentrated on performing interaction and fusion with complete signals. However, they have overlooked the issue of missing signals, which commonly arise in real-world scenarios due to factors such as occlusion, privacy concerns, and device malfunctions, leading to reduced generalizability. To this end, we propose a Factorization-based Information Reconstruction Framework (FIRF) to mitigate the modality missing problem in the MSA task. Specifically, we propose a fine-grained complementary factorization module that factorizes modality into synergistic, modality-heterogeneous, and noisy representations and design elaborate constraint paradigms for representation learning. Furthermore, we design a distribution calibration self-distillation module that fully recovers the missing semantics by utilizing bidirectional knowledge transfer. Comprehensive experiments on two datasets indicate that FIRF has a significant performance advantage over previous methods with uncertain missing modalities.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1376-1380"},"PeriodicalIF":3.2,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143748819","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Joint Target Localization and Channel Estimation for ODDM-ISAC Systems ODDM-ISAC系统联合目标定位与信道估计
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-18 DOI: 10.1109/LSP.2025.3552518
Luning Lin;Jun Tong;Hai Lin;Hang Zheng;Zhiguo Shi
{"title":"Joint Target Localization and Channel Estimation for ODDM-ISAC Systems","authors":"Luning Lin;Jun Tong;Hai Lin;Hang Zheng;Zhiguo Shi","doi":"10.1109/LSP.2025.3552518","DOIUrl":"https://doi.org/10.1109/LSP.2025.3552518","url":null,"abstract":"In pursuit of reliable performance for high-mobility integrated sensing and communication (ISAC) scenarios, the orthogonal delay-Doppler division multiplexing (ODDM) modulation can be leveraged to exploit the inherent channel sparsity in the delay-Doppler (DD) domain. In this letter, we propose a joint target localization and channel estimation method for ODDM-ISAC systems that employs a multi-pilot training frame to enhance parameter estimation with accumulated signal energy. By exploiting the block-circulant-like structure of the equivalent sampled DD domain (ESDD) channel matrix, multiple pilots are strategically arranged within a training frame. To facilitate effective energy accumulation from different pilots, a phase compensation strategy is devised, which improves the accuracy of parameter estimation for target localization and channel reconstruction. Moreover, the feasibility of the proposed method is theoretically analyzed when the actual delay and Doppler shift are on or off the quantized DD grid, respectively. Simulation results validate the effectiveness of the proposed method for both target localization and channel estimation.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1525-1529"},"PeriodicalIF":3.2,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143845331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
DNGG: Medical Image Lossless Encryption via Deep Network Guided Generative 基于深度网络引导生成的医学图像无损加密
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-18 DOI: 10.1109/LSP.2025.3552528
Lin Fan;Meng Li;Zhenting Hu;Yuan Hong;Dexing Kong
{"title":"DNGG: Medical Image Lossless Encryption via Deep Network Guided Generative","authors":"Lin Fan;Meng Li;Zhenting Hu;Yuan Hong;Dexing Kong","doi":"10.1109/LSP.2025.3552528","DOIUrl":"https://doi.org/10.1109/LSP.2025.3552528","url":null,"abstract":"Ensuring the security and integrity of medical images is crucial for telemedicine. Recently, deep learning-based image encryption techniques have significantly improved data transmission security. However, the unpredictability of complex models may lead to damage during image reconstruction, thereby negatively impacting medical diagnostics. To address this issue, we propose a lossless encryption algorithm for medical images, which is based on a guided image generative neural network. Initially, we designed a guided image generation network. Subsequently, we train a generator using random keys to produce a key map. This key map then guides the encryption of the secret image through a bitwise XOR (bit-XOR) algorithm, effectively merging the secret image with the key map. During the decryption process, the original image can be restored losslessly by using a key map generated from a random key. The experimental results show that the encryption algorithm greatly ensures the security of data and shows strong anti-attack ability.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1331-1335"},"PeriodicalIF":3.2,"publicationDate":"2025-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143716487","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimizing the Order of Modes in Tensor Train Decomposition 张量列分解中模态阶数的优化
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-17 DOI: 10.1109/LSP.2025.3552005
Petr Tichavský;Ondřej Straka
{"title":"Optimizing the Order of Modes in Tensor Train Decomposition","authors":"Petr Tichavský;Ondřej Straka","doi":"10.1109/LSP.2025.3552005","DOIUrl":"https://doi.org/10.1109/LSP.2025.3552005","url":null,"abstract":"The tensor train (TT) is a popular way of representing high-dimensional hyper-rectangular data structures called tensors. It is widely used, for example, in quantum chemistry under the name “matrix product state”. The complexity of the TT model mainly depends on the bond dimensions that connect TT cores, constituting the model. Unlike canonical polyadic decomposition, the TT model complexity may depend on the order of the modes/indices in the data structures or the order of the core tensors in the TT, in general. This letter aims to provide methods for optimizing the order of the modes to reduce the bond dimensions. Since the number of possible orderings of the cores is exponentially high, we propose a greedy algorithm that provides a suboptimal solution. We consider three problem setups, i.e., specifications of the tensor: tensor given by a list of all its elements, tensor described by a TT model with some default order of the modes, and tensor obtained by sampling a multivariate function.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1361-1365"},"PeriodicalIF":3.2,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143725106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Sensing Within Ultra-Short Duration: Extended Subspace Algorithms With Insufficient Snapshots 超短持续时间内的感知:快照不足的扩展子空间算法
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-17 DOI: 10.1109/LSP.2025.3551943
Teng Ma;Yuxuan Feng;Yue Xiao;Xia Lei;Vladimir Poulkov
{"title":"Sensing Within Ultra-Short Duration: Extended Subspace Algorithms With Insufficient Snapshots","authors":"Teng Ma;Yuxuan Feng;Yue Xiao;Xia Lei;Vladimir Poulkov","doi":"10.1109/LSP.2025.3551943","DOIUrl":"https://doi.org/10.1109/LSP.2025.3551943","url":null,"abstract":"In pursuit of real-time sensing within ultra-short duration, conventional sensing algorithms are gradually failing to fulfill the stringent latency demands. Specifically, traditional subspace-based methods such as multiple signal classification (MUSIC) are hindered by their need for an extensive number of snapshots to accumulate the rank of the spatial covariance matrix (SCM), resulting in poor real-time performance. Moreover, advanced techniques like compressed sensing and machine learning are constrained by requirements for high signal sparsity or suffer from limited generality. To handle these challenges, this paper proposes an innovative extension of subspace theory tailored to insufficient-snapshot scenarios, leveraging the concept of spatio-temporal exchangeability. Based on the defined spatio-temporal correlation predicated on the space translation invariance characteristic of uniform linear arrays, we engineer a pseudo SCM that inherently possesses sufficient rank. This methodology not only resolves the rank-deficiency issue but also fully exploits the array aperture and significantly reduces the noise level. Simulation results are presented, substantiating the feasibility and enhanced performance of the proposed algorithms, marking a significant advancement over existing methodologies.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1490-1494"},"PeriodicalIF":3.2,"publicationDate":"2025-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143830431","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信