IEEE Signal Processing Letters最新文献

筛选
英文 中文
Robust Multitask Diffusion Bias Compensation M-Estimate Algorithms for Distributed Adaptive Learning With Noisy Input 带有噪声输入的分布式自适应学习鲁棒扩散偏差补偿m -估计算法
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-04 DOI: 10.1109/LSP.2025.3547668
Senran Peng;Lijuan Jia;Zi-Jiang Yang;Ran Tao;Yue Wang
{"title":"Robust Multitask Diffusion Bias Compensation M-Estimate Algorithms for Distributed Adaptive Learning With Noisy Input","authors":"Senran Peng;Lijuan Jia;Zi-Jiang Yang;Ran Tao;Yue Wang","doi":"10.1109/LSP.2025.3547668","DOIUrl":"https://doi.org/10.1109/LSP.2025.3547668","url":null,"abstract":"This letter studies the issue of robust multitask distributed estimation under the error-in-variable (EIV) model where input noise and output impulsive noise are considered. In such cases, existing distributed algorithms suffer from severe performance degradation. To tackle this problem, a robust multitask diffusion bias-compensated least mean M-estimate (R-MD-BCLMM) is proposed. We adopt a new real-time input noise variance estimation method which utilizes piecewise linearity of the modified Huber function to resist input noises. To further improve network information exchange capability and estimation performance, a robust spatial average combination based multitask adaptive clustering strategy is proposed. Finally, simulations demonstrate that the proposed R-MD-BCLMM algorithm outperforms some state-of-the-art distributed algorithms.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1146-1150"},"PeriodicalIF":3.2,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143654985","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
Bandpass Filters: A Penalized Least-Squares Optimization With $boldsymbol ell _{1}$-Norm Regularization Design 带通滤波器:基于范数正则化设计的惩罚最小二乘优化
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-04 DOI: 10.1109/LSP.2025.3547884
Arman Kheirati Roonizi;Roberto Sassi
{"title":"Bandpass Filters: A Penalized Least-Squares Optimization With $boldsymbol ell _{1}$-Norm Regularization Design","authors":"Arman Kheirati Roonizi;Roberto Sassi","doi":"10.1109/LSP.2025.3547884","DOIUrl":"https://doi.org/10.1109/LSP.2025.3547884","url":null,"abstract":"This letter presents a robust framework based on penalized least-squares optimization (PLSO) with <inline-formula><tex-math>$boldsymbol ell _{1}$</tex-math></inline-formula>-norm regularization, specifically designed for the development and implementation of bandpass filters (BPFs). By integrating the sparsity-inducing properties of <inline-formula><tex-math>$boldsymbol ell _{1}$</tex-math></inline-formula>-norm regularization with the frequency selectivity inherent in conventional BPFs, this approach yields an adaptive filter capable of dynamically adjusting its parameters according to the characteristics of the input signal. This adaptability enables the filter to accurately capture variations in frequency bands while preserving edges and boundaries between them.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1416-1419"},"PeriodicalIF":3.2,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143783296","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
FastPSA: A Fast Version of the Principal Skewness Analysis FastPSA:主偏度分析的快速版本
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-03 DOI: 10.1109/LSP.2025.3546893
Jingyu Gao;Xiurui Geng;Luyan Ji
{"title":"FastPSA: A Fast Version of the Principal Skewness Analysis","authors":"Jingyu Gao;Xiurui Geng;Luyan Ji","doi":"10.1109/LSP.2025.3546893","DOIUrl":"https://doi.org/10.1109/LSP.2025.3546893","url":null,"abstract":"Recently, principal skewness analysis (PSA) has been introduced into the domain of feature extraction. It is equivalent to the skewness version of Fast independent component analysis (FastICA). Unlike FastICA, PSA does not require all sample points when searching for the projection directions, making it faster. However, for the data of dimension <inline-formula><tex-math>$L$</tex-math></inline-formula>, PSA needs to calculate the eigenvectors of <inline-formula><tex-math>$L$</tex-math></inline-formula> tensors, each of size <inline-formula><tex-math>$Ltimes Ltimes L$</tex-math></inline-formula>. When <inline-formula><tex-math>$L$</tex-math></inline-formula> is large, PSA still requires significant computational time to find all projection directions. In this letter, we find that the <inline-formula><tex-math>$(m+1)$</tex-math></inline-formula>th projection direction in PSA can be obtained by calculating the eigenvector of a tensor of size <inline-formula><tex-math>$(L-m)times (L-m)times (L-m)$</tex-math></inline-formula>. Furthermore, we propose a fast version of PSA (FastPSA) that is mathematically equivalent to PSA. The experimental results demonstrate that FastPSA has lower computational complexity than PSA.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1226-1230"},"PeriodicalIF":3.2,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143688161","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
Copy-Move Detection in Optical Microscopy: A Segmentation Network and a Dataset 光学显微镜中的复制移动检测:分割网络和数据集
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-03 DOI: 10.1109/LSP.2025.3547273
Hao-Chiang Shao;Yuan-Rong Liao;Tse-Yu Tseng;Yen-Liang Chuo;Fong-Yi Lin
{"title":"Copy-Move Detection in Optical Microscopy: A Segmentation Network and a Dataset","authors":"Hao-Chiang Shao;Yuan-Rong Liao;Tse-Yu Tseng;Yen-Liang Chuo;Fong-Yi Lin","doi":"10.1109/LSP.2025.3547273","DOIUrl":"https://doi.org/10.1109/LSP.2025.3547273","url":null,"abstract":"With increasing revelations of academic fraud, detecting forged experimental images in the biomedical field has become a public concern. The challenge lies in the fact that copy-move targets can include background tissue, small foreground objects, or both, which may be out of the training domain and subject to unseen attacks, rendering standard object-detection-based approaches less effective. To address this, we reformulate the problem of detecting biomedical copy-move forgery regions as an intra-image co-saliency detection task and propose CMSeg-Net, a copy-move forgery segmentation network capable of identifying unseen duplicated areas. Built on a multi-resolution encoder-decoder architecture, CMSeg-Net incorporates self-correlation and correlation-assisted spatial-attention modules to detect intra-image regional similarities within feature tensors at each observation scale. This design helps distinguish even small copy-move targets in complex microscopic images from other similar objects. Furthermore, we created a copy-move forgery dataset of optical microscopic images, named FakeParaEgg, using open data from the ICIP 2022 Challenge to support CMSeg-Net's development and verify its performance. Extensive experiments demonstrate that our approach outperforms previous state-of-the-art methods on the FakeParaEgg dataset and other open copy-move detection datasets, including <bold>CASIA-CMFD</b>, <bold>CoMoFoD</b>, and <bold>CMF</b>.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1106-1110"},"PeriodicalIF":3.2,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143676092","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
HashShield: A Robust DeepFake Forensic Framework With Separable Perceptual Hashing HashShield:一个具有可分离感知哈希的鲁棒深度伪造取证框架
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-03 DOI: 10.1109/LSP.2025.3547664
Meihong Yang;Baolin Qi;Ruihe Ma;Yongjin Xian;Bin Ma
{"title":"HashShield: A Robust DeepFake Forensic Framework With Separable Perceptual Hashing","authors":"Meihong Yang;Baolin Qi;Ruihe Ma;Yongjin Xian;Bin Ma","doi":"10.1109/LSP.2025.3547664","DOIUrl":"https://doi.org/10.1109/LSP.2025.3547664","url":null,"abstract":"The proliferation of DeepFakes has heightened the necessity to distinguish between authentic and counterfeit faces. While numerous methods concentrate on detecting DeepFakes, only a few address safeguarding genuine faces from manipulation. This letter proposes a novel active forensics system for DeepFake forensics utilizing separable perceptual hash enhancement algorithm. A separable perceptual hash code specifically designed for face deep forgery is introduced, achieving robustness while maintaining sensitivity and imperceptibility when embedded within the original image. Additionally, a multi-scale perceptual smoothing loss function is employed to optimize perceptual similarity, structural smoothness, and embedding stability. As a result, this system ensures the consistence of confidential information both before and after manipulation, thereby enhancing the capability of face source detection and DeepFake identification. Experimental results demonstrate that the proposed scheme can effectively counter traditional deep forgery techniques while exhibiting significant potential in preserving personal privacy.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1186-1190"},"PeriodicalIF":3.2,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143667476","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
Embedding Blake–Zisserman Regularization in Unfolded Proximal Neural Networks for Enhanced Edge Detection 在未折叠近端神经网络中嵌入Blake-Zisserman正则化以增强边缘检测
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-03 DOI: 10.1109/LSP.2025.3547671
Hoang Trieu Vy Le;Marion Foare;Audrey Repetti;Nelly Pustelnik
{"title":"Embedding Blake–Zisserman Regularization in Unfolded Proximal Neural Networks for Enhanced Edge Detection","authors":"Hoang Trieu Vy Le;Marion Foare;Audrey Repetti;Nelly Pustelnik","doi":"10.1109/LSP.2025.3547671","DOIUrl":"https://doi.org/10.1109/LSP.2025.3547671","url":null,"abstract":"In this paper, we present a new edge detection model based on proximal unfolded neural networks. The architecture relies on unfolding proximal Blake–Zisserman iterations, leading to a composition of two blocks: a smoothing block and an edge detection block. We show through simulations that the proposed approach efficiently eliminates irrelevant details while retaining key edges and significantly improves performance with respect to state-of-the-art strategies. Additionally, our architecture is significantly lighter than recent learning models designed for edge detection in terms of number of learnable parameters and inference time.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1271-1275"},"PeriodicalIF":3.2,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143716510","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
Improving the Second Association for Multi-Object Tracking by Directed Reliable Neighbor Graphs 用有向可靠邻居图改进多目标跟踪的二次关联
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-03 DOI: 10.1109/LSP.2025.3546896
Yubo Zhang;Liying Zheng;Qingming Huang
{"title":"Improving the Second Association for Multi-Object Tracking by Directed Reliable Neighbor Graphs","authors":"Yubo Zhang;Liying Zheng;Qingming Huang","doi":"10.1109/LSP.2025.3546896","DOIUrl":"https://doi.org/10.1109/LSP.2025.3546896","url":null,"abstract":"The second association enhances Multi-Object Tracking (MOT) by reducing missed detections and trajectory fragmentation but is limited by the poor distinguishability of low-confidence detections. To address this, we introduce interactive features leveraging Graph Neural Networks (GNNs) to enhance object distinction. Unlike existing GNN-based trackers that compute interactive features for all objects, we selectively calculate interactive features based on directed reliable neighbor graphs for objects in the second stage. These graphs include two kinds of nodes: reliable nodes (already associated in the first association) and unreliable nodes (remaining objects). Bidirectional edges between reliable nodes indicate matches, while directed edges from reliable to unreliable nodes represent neighbor relationships. These graphs are forwarded to graph attention networks to obtain interactive features combined with motion features for the second association. Experimental results on the MOT17 (65.3 in HOTA, 80.6 in IDF1) and MOT20 (63.8 in HOTA, 78.0 in IDF1) benchmark datasets demonstrate the effectiveness of our proposed tracker, particularly in HOTA and IDF1.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1151-1155"},"PeriodicalIF":3.2,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143667673","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 TR Beam Selection and Power Allocation Strategy for MTT in Netted Radar Systems 网络化雷达系统中MTT联合TR波束选择与功率分配策略
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-03 DOI: 10.1109/LSP.2025.3546886
Jingjing Guo;Haihong Tao
{"title":"Joint TR Beam Selection and Power Allocation Strategy for MTT in Netted Radar Systems","authors":"Jingjing Guo;Haihong Tao","doi":"10.1109/LSP.2025.3546886","DOIUrl":"https://doi.org/10.1109/LSP.2025.3546886","url":null,"abstract":"Considering a new type of netted radar system, the receiver can process the reflected echoes transmitted by all transmitters. Compared with networked radar system, power and beam resources of netted radar system are still limited, and more importantly, the number of transmitting and receiving (TR) beams has increased dramatically. In this letter, a joint transmitter/receiver beam selection and power allocation (JTRBS-PA) strategy is developed for multiple targets tracking in netted radar system. The JTRBS-PA strategy utilizes the target prior information and predicted accuracy to optimize the TR beam selection and the power of each transmitting beam, which aims to maximize target tracking performance under limited radar system resources. A two-step solution technique is proposed to deal with the coupled bivariate constrained optimization problem. Simulation results demonstrate the effectiveness and superiority of the proposed strategy.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1221-1225"},"PeriodicalIF":3.2,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143688088","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
MIMO Radar Joint Heart Rate and Respiratory Rate Estimation and Performance Bound Analysis MIMO雷达联合心率和呼吸频率估计及性能界分析
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-03 DOI: 10.1109/LSP.2025.3546894
Peichao Wang;Qian He;Haozheng Li
{"title":"MIMO Radar Joint Heart Rate and Respiratory Rate Estimation and Performance Bound Analysis","authors":"Peichao Wang;Qian He;Haozheng Li","doi":"10.1109/LSP.2025.3546894","DOIUrl":"https://doi.org/10.1109/LSP.2025.3546894","url":null,"abstract":"This letter investigates the non-contact heart rate (HR) and respiratory rate (RR) joint estimation employing multiple-input multiple-output (MIMO) radar with widely separated antennas. By developing a signal model for the HR and RR estimation using the MIMO radar, where the initial phases for HR and RR, as well as the reflection coefficients, are deterministic but unknown, we propose an HR-RR joint estimator. Unlike the existing methods, the theoretical performance of the HR and RR estimation is analyzed for the first time, where the corresponding Cramer-Rao Bounds (CRBs) are derived. These bounds provide the first theoretical performance benchmark for this type of radar-based estimation and guide the system parameters design to enhance the HR and RR estimation performance, thereby avoiding the complex numerical computations involved in the joint estimator. It is shown that the proposed method outperforms traditional methods and the CRB can provide the guidance for system parameter optimization.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1266-1270"},"PeriodicalIF":3.2,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143716511","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
GLNet: Global-Local Fusion Network for Strip Steel Surface Defects Detection 基于全局-局部融合网络的带钢表面缺陷检测
IF 3.2 2区 工程技术
IEEE Signal Processing Letters Pub Date : 2025-03-03 DOI: 10.1109/LSP.2025.3546888
Xuan Wang;Liuxin Bao;Xiaofei Zhou;Lei Xia;Xiaobin Xu
{"title":"GLNet: Global-Local Fusion Network for Strip Steel Surface Defects Detection","authors":"Xuan Wang;Liuxin Bao;Xiaofei Zhou;Lei Xia;Xiaobin Xu","doi":"10.1109/LSP.2025.3546888","DOIUrl":"https://doi.org/10.1109/LSP.2025.3546888","url":null,"abstract":"Surface defect detection in strip steel is a critical task in industrial quality control. However, existing methods struggle with capturing both local details and global context effectively. In this paper, we propose the Global-Local Fusion Network (GLNet) for strip steel surface defect detection, which combines the advantages of VMamba's global feature extraction and CNN's local feature modeling. GLNet employs an encoder-decoder structure, where the encoder consists of two parallel branches: one based on VMamba for capturing global features and the other using ResNet50 for extracting local features. In the decoder, a Global-Local Fusion (GLF) module integrates these features using the Cross Prototype Objective Enhancement (CPOE) and Selective Spatial and Channel Attention (SSCA) modules. The CPOE module facilitates the interaction and fusion between global and local features, while the SSCA module digs the multi-scale information from the global feature through dynamic attention to guide the feature aggregation. Extensive experiments on the ESDIs dataset, demonstrate that GLNet achieves state-of-the-art performance in defect detection, surpassing 13 existing methods in both quantitative and qualitative metrics.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"1256-1260"},"PeriodicalIF":3.2,"publicationDate":"2025-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143716529","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学术官方微信