Pub Date : 2024-10-07DOI: 10.1109/LSP.2024.3475356
Jiaojiao Liu;Erdi Chen;Nan Sun;Biyun Ma
This letter proposes a high-resolution multipath time delay estimation (TDE) method for orthogonal frequency division multiplexing linear frequency modulation (OFDM-LFM) signals. Leveraging the expression of OFDM-LFM signals in the fractional domain, where the compressed subcarriers conform to a linear uniform arrangement, the algorithm combines with the multiple signal classification (MUSIC) algorithm for TDE. Simulation results show that regardless of the presence of Doppler effect, OFDM-LFM results in less relative root mean square error (RRMSE) compared to orthogonal frequency division multiplexing (OFDM). Furthermore, the superiority of OFDM-LFM signals is particularly evident at lower signal-to-noise ratios (SNRs). So the proposed algorithm offers promising implications for TDE in mobile scenarios.
{"title":"MUSIC Based Multipath Delay Estimation Method in the Fractional Domain for OFDM-LFM","authors":"Jiaojiao Liu;Erdi Chen;Nan Sun;Biyun Ma","doi":"10.1109/LSP.2024.3475356","DOIUrl":"https://doi.org/10.1109/LSP.2024.3475356","url":null,"abstract":"This letter proposes a high-resolution multipath time delay estimation (TDE) method for orthogonal frequency division multiplexing linear frequency modulation (OFDM-LFM) signals. Leveraging the expression of OFDM-LFM signals in the fractional domain, where the compressed subcarriers conform to a linear uniform arrangement, the algorithm combines with the multiple signal classification (MUSIC) algorithm for TDE. Simulation results show that regardless of the presence of Doppler effect, OFDM-LFM results in less relative root mean square error (RRMSE) compared to orthogonal frequency division multiplexing (OFDM). Furthermore, the superiority of OFDM-LFM signals is particularly evident at lower signal-to-noise ratios (SNRs). So the proposed algorithm offers promising implications for TDE in mobile scenarios.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"31 ","pages":"2830-2834"},"PeriodicalIF":3.2,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142443138","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}
Pub Date : 2024-10-07DOI: 10.1109/LSP.2024.3475916
Yongjian Huang;Huadong Lai;Jisheng Dai;Weichao Xu
In the presence of non-Gaussian noise, traditional spectrum sensing techniques optimized for Gaussian noise may experience significant performance degradation. To address this challenge, this paper employs Kendall's tau (KT) as a detector to detect the primary signal in additive Laplace noise. Unlike techniques relying on fundamental information from raw observation data, this detector utilizes ranks to reduce the impact of impulsive component, thus being robust against large valued outliers. The analytic expressions concerning the expectation and variance of KT under Laplace noise are firstly established. Performance analyses are further conducted in terms of false alarm probability and detection probability. Monte Carlo simulations not only verified the correctness of the established theoretical results, but also demonstrated the superiority of KT over other commonly used methods in terms of detection probability under Laplace noise.
在存在非高斯噪声的情况下，针对高斯噪声进行优化的传统频谱传感技术可能会出现明显的性能下降。为应对这一挑战，本文采用 Kendall's tau (KT) 作为检测器，在加性拉普拉斯噪声中检测主信号。与依赖原始观测数据基本信息的技术不同，该检测器利用等级来减少脉冲成分的影响，从而对大值异常值具有鲁棒性。首先建立了拉普拉斯噪声下 KT 的期望和方差的解析表达式。并进一步从误报概率和检测概率两个方面进行了性能分析。蒙特卡罗模拟不仅验证了所建立的理论结果的正确性，还证明了 KT 在拉普拉斯噪声下的检测概率优于其他常用方法。
{"title":"Kendall's Tau Based Spectrum Sensing for Cognitive Radio in the Presence of Laplace Noise","authors":"Yongjian Huang;Huadong Lai;Jisheng Dai;Weichao Xu","doi":"10.1109/LSP.2024.3475916","DOIUrl":"https://doi.org/10.1109/LSP.2024.3475916","url":null,"abstract":"In the presence of non-Gaussian noise, traditional spectrum sensing techniques optimized for Gaussian noise may experience significant performance degradation. To address this challenge, this paper employs Kendall's tau (KT) as a detector to detect the primary signal in additive Laplace noise. Unlike techniques relying on fundamental information from raw observation data, this detector utilizes ranks to reduce the impact of impulsive component, thus being robust against large valued outliers. The analytic expressions concerning the expectation and variance of KT under Laplace noise are firstly established. Performance analyses are further conducted in terms of false alarm probability and detection probability. Monte Carlo simulations not only verified the correctness of the established theoretical results, but also demonstrated the superiority of KT over other commonly used methods in terms of detection probability under Laplace noise.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"31 ","pages":"2840-2844"},"PeriodicalIF":3.2,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142447071","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}
Effectively fusing depth and RGB information to fully leverage their complementary strengths is essential for advancing RGB-D semantic segmentation. However, when fusing with RGB information, traditional methods often overlook noises in depth data, presuming that they are of high accuracy. To resolve this issue, we propose a self-enhanced feature fusion network (SEFnet) for RGB-D semantic segmentation in this work. It mainly comprises three steps. Firstly, RGB and depth embeddings from the initial layers of the network are fused together. Secondly, the fused features are enhanced by pure RGB embeddings and are progressively guided by semantic edge labels to suppress irrelevant features. Finally, the enhanced features are combined with high-level RGB features and are fed into a normalizing flow decoder to obtain segmentation results. Experimental results demonstrate that the proposed approach can provide accurate predictions, outperforming state-of-the-art methods on benchmark datasets.
{"title":"Self-Enhanced Feature Fusion for RGB-D Semantic Segmentation","authors":"Pengcheng Xiang;Baochen Yao;Zefeng Jiang;Chengbin Peng","doi":"10.1109/LSP.2024.3475352","DOIUrl":"https://doi.org/10.1109/LSP.2024.3475352","url":null,"abstract":"Effectively fusing depth and RGB information to fully leverage their complementary strengths is essential for advancing RGB-D semantic segmentation. However, when fusing with RGB information, traditional methods often overlook noises in depth data, presuming that they are of high accuracy. To resolve this issue, we propose a self-enhanced feature fusion network (SEFnet) for RGB-D semantic segmentation in this work. It mainly comprises three steps. Firstly, RGB and depth embeddings from the initial layers of the network are fused together. Secondly, the fused features are enhanced by pure RGB embeddings and are progressively guided by semantic edge labels to suppress irrelevant features. Finally, the enhanced features are combined with high-level RGB features and are fed into a normalizing flow decoder to obtain segmentation results. Experimental results demonstrate that the proposed approach can provide accurate predictions, outperforming state-of-the-art methods on benchmark datasets.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"31 ","pages":"3015-3019"},"PeriodicalIF":3.2,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142595114","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}
In sound event localization and detection (SELD), traditional methods often treat localization and detection algorithms separately from data augmentation. During the model training process, the strategy for data augmentation is typically implemented in a non-learnable manner. Existing audio data augmentation strategies struggle to find optimal parameter solutions for data augmentation that can be effectively applied to SELD systems. To address this challenge, we introduce an innovative network-based strategy, termed the Automated Audio Data Augmentation (AADA) network. This strategy employs bi-level optimization to synergistically integrate audio data augmentation techniques with SELD tasks. In the AADA network, the lower-level SELD task serves as a constraint for the higher-level data augmentation process. The audio data augmentation parameters are adaptively optimized by utilizing the transfer of intermediate feature information from the SELD tasks, thus obtaining optimal parameters for these tasks. Evaluation of our approach on the Sony-TAU Realistic Spatial Soundscapes 2023 dataset achieves a SELD score of 0.4801, significantly surpassing the performance metrics of all traditional data augmentation strategies for SELD.
{"title":"Automated Audio Data Augmentation Network Using Bi-Level Optimization for Sound Event Localization and Detection","authors":"Wenjie Zhang;Peng Yu;Jun Yin;Xiaoheng Jiang;Mingliang Xu","doi":"10.1109/LSP.2024.3475350","DOIUrl":"https://doi.org/10.1109/LSP.2024.3475350","url":null,"abstract":"In sound event localization and detection (SELD), traditional methods often treat localization and detection algorithms separately from data augmentation. During the model training process, the strategy for data augmentation is typically implemented in a non-learnable manner. Existing audio data augmentation strategies struggle to find optimal parameter solutions for data augmentation that can be effectively applied to SELD systems. To address this challenge, we introduce an innovative network-based strategy, termed the Automated Audio Data Augmentation (AADA) network. This strategy employs bi-level optimization to synergistically integrate audio data augmentation techniques with SELD tasks. In the AADA network, the lower-level SELD task serves as a constraint for the higher-level data augmentation process. The audio data augmentation parameters are adaptively optimized by utilizing the transfer of intermediate feature information from the SELD tasks, thus obtaining optimal parameters for these tasks. Evaluation of our approach on the Sony-TAU Realistic Spatial Soundscapes 2023 dataset achieves a SELD score of 0.4801, significantly surpassing the performance metrics of all traditional data augmentation strategies for SELD.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"31 ","pages":"2770-2774"},"PeriodicalIF":3.2,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142434568","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}
Pub Date : 2024-10-07DOI: 10.1109/LSP.2024.3475349
Yuhong Wang;Xu Zhou;Zongsheng Zheng
This letter addresses a common issue in engineering applications: unanticipated signal truncation events caused by the mismatch between the operational range of measurement devices and the signals to be measured. Under such circumstances, the conventional normalized subband adaptive filtering (NSAF) algorithm significantly underperforms and may even fail to converge. To tackle this issue, we propose an improved NSAF algorithm. We introduce an expectation maximization framework to address the maximum likelihood estimation before the subband adaptive filter, specifically to handle double-sided signal truncation. This new approach leads to an NSAF for unanticipated truncation (UT-NSAF), which has been theoretically and numerically proven to be unbiased. Importantly, our research demonstrates that UT-NSAF significantly outperforms other algorithms in terms of estimation accuracy and convergence speed. Notably, the steady-state solution of UT-NSAF remains almost unaffected by varying truncation thresholds, showing robustness crucial for dealing with various unexpected signal truncation scenarios in engineering applications.
{"title":"Optimizing Subband Adaptive Filters for Resilience Against Unanticipated Signal Truncation","authors":"Yuhong Wang;Xu Zhou;Zongsheng Zheng","doi":"10.1109/LSP.2024.3475349","DOIUrl":"https://doi.org/10.1109/LSP.2024.3475349","url":null,"abstract":"This letter addresses a common issue in engineering applications: unanticipated signal truncation events caused by the mismatch between the operational range of measurement devices and the signals to be measured. Under such circumstances, the conventional normalized subband adaptive filtering (NSAF) algorithm significantly underperforms and may even fail to converge. To tackle this issue, we propose an improved NSAF algorithm. We introduce an expectation maximization framework to address the maximum likelihood estimation before the subband adaptive filter, specifically to handle double-sided signal truncation. This new approach leads to an NSAF for unanticipated truncation (UT-NSAF), which has been theoretically and numerically proven to be unbiased. Importantly, our research demonstrates that UT-NSAF significantly outperforms other algorithms in terms of estimation accuracy and convergence speed. Notably, the steady-state solution of UT-NSAF remains almost unaffected by varying truncation thresholds, showing robustness crucial for dealing with various unexpected signal truncation scenarios in engineering applications.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"31 ","pages":"2765-2769"},"PeriodicalIF":3.2,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142434536","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}
Pub Date : 2024-10-07DOI: 10.1109/LSP.2024.3475910
Qingsong Wang;Chunfeng Cui;Deren Han
Recently, there has been a growing interest in the exploration of Nonlinear Matrix Decomposition (NMD) due to its close ties with neural networks. NMD aims to find a low-rank matrix from a sparse nonnegative matrix with a per-element nonlinear function. A typical choice is the Rectified Linear Unit (ReLU) activation function. To address over-fitting in the existing ReLU-based NMD model (ReLU-NMD), we propose a Tikhonov regularized ReLU-NMD model, referred to as ReLU-NMD-T. Subsequently, we introduce a momentum accelerated algorithm for handling the ReLU-NMD-T model. A distinctive feature, setting our work apart from most existing studies, is the incorporation of both positive and negative momentum parameters in our algorithm. Our numerical experiments on real-world datasets show the effectiveness of the proposed model and algorithm.
{"title":"A Momentum Accelerated Algorithm for ReLU-Based Nonlinear Matrix Decomposition","authors":"Qingsong Wang;Chunfeng Cui;Deren Han","doi":"10.1109/LSP.2024.3475910","DOIUrl":"https://doi.org/10.1109/LSP.2024.3475910","url":null,"abstract":"Recently, there has been a growing interest in the exploration of Nonlinear Matrix Decomposition (NMD) due to its close ties with neural networks. NMD aims to find a low-rank matrix from a sparse nonnegative matrix with a per-element nonlinear function. A typical choice is the Rectified Linear Unit (ReLU) activation function. To address over-fitting in the existing ReLU-based NMD model (ReLU-NMD), we propose a Tikhonov regularized ReLU-NMD model, referred to as ReLU-NMD-T. Subsequently, we introduce a momentum accelerated algorithm for handling the ReLU-NMD-T model. A distinctive feature, setting our work apart from most existing studies, is the incorporation of both positive and negative momentum parameters in our algorithm. Our numerical experiments on real-world datasets show the effectiveness of the proposed model and algorithm.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"31 ","pages":"2865-2869"},"PeriodicalIF":3.2,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142452700","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}
Pub Date : 2024-10-07DOI: 10.1109/LSP.2024.3475353
Hong Hu;Zhuoqun Li;H. Vicky Zhao
In online social networks, millions of connected intelligent individuals actively interact with each other, which not only facilitates opinion sharing but also offers the platform to spread detrimental gossips and rumors. Therefore, it is of crucial importance to better understand how the avalanche of information propagates over social networks and affects our social life and economy. However, most model-based works on information diffusion either consider the spreading of one single message or assume that different information spreads independently. In this letter, we investigate how correlated information spreads together and jointly influences users' decisions from a graphical evolutionary game perspective. We model the multi-source information diffusion process, analyze the impact of information's correlation and time delay on the evolutionary dynamics and the evolutionary stable states (ESS). Simulation results on synthetic networks and Facebook real-world networks are consistent with our analytical results. This investigation offers important insights to the understanding and management of multi-source information diffusion.
{"title":"Understanding Correlated Information Diffusion: From a Graphical Evolutionary Game Perspective","authors":"Hong Hu;Zhuoqun Li;H. Vicky Zhao","doi":"10.1109/LSP.2024.3475353","DOIUrl":"https://doi.org/10.1109/LSP.2024.3475353","url":null,"abstract":"In online social networks, millions of connected intelligent individuals actively interact with each other, which not only facilitates opinion sharing but also offers the platform to spread detrimental gossips and rumors. Therefore, it is of crucial importance to better understand how the avalanche of information propagates over social networks and affects our social life and economy. However, most model-based works on information diffusion either consider the spreading of one single message or assume that different information spreads independently. In this letter, we investigate how correlated information spreads together and jointly influences users' decisions from a graphical evolutionary game perspective. We model the multi-source information diffusion process, analyze the impact of information's correlation and time delay on the evolutionary dynamics and the evolutionary stable states (ESS). Simulation results on synthetic networks and Facebook real-world networks are consistent with our analytical results. This investigation offers important insights to the understanding and management of multi-source information diffusion.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"31 ","pages":"2820-2824"},"PeriodicalIF":3.2,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142443067","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}
Pub Date : 2024-10-07DOI: 10.1109/LSP.2024.3475351
Esa Ollila
We propose greedy Capon beamformer (GCB) for direction finding of narrow-band sources present in the array's viewing field. After defining the grid covering the location search space, the algorithm greedily builds the interference-plus-noise covariance matrix by identifying a high-power source on the grid using Capon's principle of maximizing the signal to interference plus noise ratio while enforcing unit gain towards the signal of interest. An estimate of the power of the detected source is derived by exploiting the unit power constraint, which subsequently allows to update the noise covariance matrix by simple rank-1 matrix addition composed of outerproduct of the selected steering matrix with itself scaled by the signal power estimate. Our numerical examples demonstrate effectiveness of the proposed GCB in direction finding where it performs favourably compared to the state-of-the-art algorithms under a broad variety of settings. Furthermore, GCB estimates of direction-of-arrivals (DOAs) are very fast to compute.
{"title":"Greedy Capon Beamformer","authors":"Esa Ollila","doi":"10.1109/LSP.2024.3475351","DOIUrl":"https://doi.org/10.1109/LSP.2024.3475351","url":null,"abstract":"We propose greedy Capon beamformer (GCB) for direction finding of narrow-band sources present in the array's viewing field. After defining the grid covering the location search space, the algorithm greedily builds the interference-plus-noise covariance matrix by identifying a high-power source on the grid using Capon's principle of maximizing the signal to interference plus noise ratio while enforcing unit gain towards the signal of interest. An estimate of the power of the detected source is derived by exploiting the unit power constraint, which subsequently allows to update the noise covariance matrix by simple rank-1 matrix addition composed of outerproduct of the selected steering matrix with itself scaled by the signal power estimate. Our numerical examples demonstrate effectiveness of the proposed GCB in direction finding where it performs favourably compared to the state-of-the-art algorithms under a broad variety of settings. Furthermore, GCB estimates of direction-of-arrivals (DOAs) are very fast to compute.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"31 ","pages":"2775-2779"},"PeriodicalIF":3.2,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10706632","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142431890","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-07DOI: 10.1109/LSP.2024.3475909
Shih Yu Chang;Hsiao-Chun Wu
High-dimensional signal processing and data analysis have been appealing to researchers in recent decades. Outlier detection and sample-size determination are two essential pre-processing tasks for many signal processing applications. However, fast outlier detection for tensor data with arbitrary orders is still in high demand. Furthermore, sample-size determination for random tensor data has not been addressed in the literature. To fill this knowledge gap, we first derive new tensor Chernoff tail-bounds for random Hermitian tensors. According to our derived tail-bounds, we propose a novel approach for joint outlier detection and sample-size determination. The mathematical relationship among outlier-threshold (sample-size-threshold) probability, outlier-threshold spectrum, and critical sample-size along with the computational-complexity reduction brought by our proposed new analytic approach over the existing methods is also investigated through numerical evaluation over a variety of real tensor data.
{"title":"Random Tensor Analysis: Outlier Detection and Sample-Size Determination","authors":"Shih Yu Chang;Hsiao-Chun Wu","doi":"10.1109/LSP.2024.3475909","DOIUrl":"https://doi.org/10.1109/LSP.2024.3475909","url":null,"abstract":"High-dimensional signal processing and data analysis have been appealing to researchers in recent decades. Outlier detection and sample-size determination are two essential pre-processing tasks for many signal processing applications. However, fast outlier detection for tensor data with arbitrary orders is still in high demand. Furthermore, sample-size determination for random tensor data has not been addressed in the literature. To fill this knowledge gap, we first derive new tensor Chernoff tail-bounds for random Hermitian tensors. According to our derived tail-bounds, we propose a novel approach for joint outlier detection and sample-size determination. The mathematical relationship among outlier-threshold (sample-size-threshold) probability, outlier-threshold spectrum, and critical sample-size along with the computational-complexity reduction brought by our proposed new analytic approach over the existing methods is also investigated through numerical evaluation over a variety of real tensor data.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"31 ","pages":"2835-2839"},"PeriodicalIF":3.2,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142447022","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}
Pub Date : 2024-10-07DOI: 10.1109/LSP.2024.3475913
Arghya Sinha;Kunal N. Chaudhury
In the Plug-and-Play (PnP) method, a denoiser is used as a regularizer within classical proximal algorithms for image reconstruction. It is known that a broad class of linear denoisers can be expressed as the proximal operator of a convex regularizer. Consequently, the associated PnP algorithm can be linked to a convex optimization problem $mathcal {P}$ . For such a linear denoiser, we prove that $mathcal {P}$ exhibits strong convexity for linear inverse problems. Specifically, we show that the strong convexity of $mathcal {P}$ can be used to certify objective and iterative convergence of any PnP algorithm derived from classical proximal methods.
{"title":"On the Strong Convexity of PnP Regularization Using Linear Denoisers","authors":"Arghya Sinha;Kunal N. Chaudhury","doi":"10.1109/LSP.2024.3475913","DOIUrl":"https://doi.org/10.1109/LSP.2024.3475913","url":null,"abstract":"In the Plug-and-Play (PnP) method, a denoiser is used as a regularizer within classical proximal algorithms for image reconstruction. It is known that a broad class of linear denoisers can be expressed as the proximal operator of a convex regularizer. Consequently, the associated PnP algorithm can be linked to a convex optimization problem \u0000<inline-formula><tex-math>$mathcal {P}$</tex-math></inline-formula>\u0000. For such a linear denoiser, we prove that \u0000<inline-formula><tex-math>$mathcal {P}$</tex-math></inline-formula>\u0000 exhibits strong convexity for linear inverse problems. Specifically, we show that the strong convexity of \u0000<inline-formula><tex-math>$mathcal {P}$</tex-math></inline-formula>\u0000 can be used to certify objective and iterative convergence of \u0000<italic>any</i>\u0000 PnP algorithm derived from classical proximal methods.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"31 ","pages":"2790-2794"},"PeriodicalIF":3.2,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142438595","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：