Signal Processing最新文献

筛选
英文 中文
A saddlepoint approximation for the smoothed periodogram
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2024-11-28 DOI: 10.1016/j.sigpro.2024.109758
Dakota Roberson , S. Huzurbazar
{"title":"A saddlepoint approximation for the smoothed periodogram","authors":"Dakota Roberson ,&nbsp;S. Huzurbazar","doi":"10.1016/j.sigpro.2024.109758","DOIUrl":"10.1016/j.sigpro.2024.109758","url":null,"abstract":"<div><div>Poor variance properties of the periodogram often limit its practical applicability to a wide range of modern spectral estimation and detection applications. The smoothed periodogram, a refined periodogram-based method, is one such nonparametric approach to reducing variance. Neighboring spectral samples are averaged across a spectral window, as opposed to the more common temporal or lag window. Tapered spectral windows and other modifications needed to address the time-bandwidth product and resolution-variance trade-offs complicate the statistical analysis, making it difficult to quantify statistical performance. In addition, approximate distributions for the smoothed periodogram require <em>a priori</em> normalization along with simplifying assumptions to yield computationally tractable results. Here, under mild asymptotic conditions, the distribution derived prior to normalization is shown to be computationally intractable in most cases. First-order statistical approximations are computationally stable but result in sizeable inaccuracies, particularly in the tails. We use a saddlepoint approximation, a second-order asymptotic method, that allows for accurate statistical characterization but is also numerically stable. Monte Carlo simulations are used to validate the results and to illustrate the robustness of the approach. Finally, its utility is demonstrated on a real-world dataset relevant to the side-channel and hardware cybersecurity communities.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"230 ","pages":"Article 109758"},"PeriodicalIF":3.4,"publicationDate":"2024-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142756676","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
Multifunctional adversarial examples: A novel mechanism for authenticatable privacy protection of images
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2024-11-28 DOI: 10.1016/j.sigpro.2024.109816
Ming Li , Si Wang
{"title":"Multifunctional adversarial examples: A novel mechanism for authenticatable privacy protection of images","authors":"Ming Li ,&nbsp;Si Wang","doi":"10.1016/j.sigpro.2024.109816","DOIUrl":"10.1016/j.sigpro.2024.109816","url":null,"abstract":"<div><div>With the rapid development of network technology, more and more images containing personal identity characteristics are being released by users on open network platforms. However, these images are easily collected by malicious users, leading to problems such as privacy leakage, infringement, and tampering, thus harming users’ legitimate interests. Recent studies have found that adversarial examples generated by adding tiny perturbations to an image can mislead image classifiers, causing incorrect classifications. Therefore significant privacy protection against deep neural networks is achieved while the visual quality remains indistinguishable to human eyes. However, these methods cannot protect the authenticity and integrity of the image simultaneously, failing to address infringement and tampering issues, which are also neglectable in the open network platforms. To solve this problem, we propose a novel authentication-enabled privacy protection method. The meaningful information used for authentication, instead of the meaningless perturbations, is embedded into the host image to generate adversarial examples, thereby achieving both authentication and privacy protection simultaneously. This scheme combines attention mechanisms with generative adversarial networks to adaptively select and weight features between different channels, achieving significant improvements in both aggressiveness and authentication capability. Experimental results show that our method outperforms recent similar methods in overall performance.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"230 ","pages":"Article 109816"},"PeriodicalIF":3.4,"publicationDate":"2024-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142744534","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
Progressive Gaussian filtering for nonlinear uncertain systems based on Gaussian process models
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2024-11-26 DOI: 10.1016/j.sigpro.2024.109801
Qichao Wang , Xiaolei Zhuge , Xusheng Yang , Wen-An Zhang
{"title":"Progressive Gaussian filtering for nonlinear uncertain systems based on Gaussian process models","authors":"Qichao Wang ,&nbsp;Xiaolei Zhuge ,&nbsp;Xusheng Yang ,&nbsp;Wen-An Zhang","doi":"10.1016/j.sigpro.2024.109801","DOIUrl":"10.1016/j.sigpro.2024.109801","url":null,"abstract":"<div><div>This paper studies the problem of progressive Gaussian filtering (PGF) for nonlinear uncertain systems, and a PGF method is proposed by incorporating Gaussian process (GP) models to improve the compensation ability for measurement uncertainties. Firstly, the measurements are classified by the Chi-square test, and an adaptive strategy for controlling the pseudo-duration of progressive measurement update is designed to compensate for measurement uncertainties. Moreover, a conservative upper bound of the pseudo-duration is given to obtain conservative estimates. Secondly, to mitigate the adverse effects caused by measurement uncertainties on state predictions, the GP model is incorporated into the PGF. Finally, the effectiveness and superiority of the proposed method are validated through simulation results.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"230 ","pages":"Article 109801"},"PeriodicalIF":3.4,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142744536","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
A privacy-preserving license plate encryption scheme based on an improved YOLOv8 image recognition algorithm
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2024-11-26 DOI: 10.1016/j.sigpro.2024.109811
Chengye Zou , Yunong Liu , Yongwei Yang , Changjun Zhou , Yang Yu , Yubao Shang
{"title":"A privacy-preserving license plate encryption scheme based on an improved YOLOv8 image recognition algorithm","authors":"Chengye Zou ,&nbsp;Yunong Liu ,&nbsp;Yongwei Yang ,&nbsp;Changjun Zhou ,&nbsp;Yang Yu ,&nbsp;Yubao Shang","doi":"10.1016/j.sigpro.2024.109811","DOIUrl":"10.1016/j.sigpro.2024.109811","url":null,"abstract":"<div><div>With the rapid development of green smart cities, urban intelligence has also brought new challenges, particularly in protecting the privacy information of vehicles within the city. To address this issue, we propose a novel image encryption scheme to ensure the security of image transmission. This method captures vehicle images through roadside surveillance cameras and uses an improved YOLOv8 algorithm to identify sensitive vehicle information in real time, which is then securely transmitted to the city’s traffic management system. To safeguard the data, we employ a combination of the Rabbit Competition scrambling algorithm and a custom diffusion kernel to perform real-time encryption on the identified image regions, protecting privacy-sensitive areas. Experimental results show that our method improves accuracy by 1.53% and average precision by 1.4% on the test set compared to the baseline model, indicating a substantial enhancement in detection accuracy. Additionally, the encryption scheme demonstrates a larger key space, improved robustness, and significantly enhanced anti-attack capabilities, confirming its effectiveness in protecting vehicle information in smart city environments.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"230 ","pages":"Article 109811"},"PeriodicalIF":3.4,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142744663","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
A broken-track association method for robust multi-target tracking adopting multi-view Doppler measurement information
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2024-11-26 DOI: 10.1016/j.sigpro.2024.109815
Jiaqi Zhang , Cao Zeng , Haihong Tao , Yuhong Zhang , Shihua Zhao , Qirui Wu
{"title":"A broken-track association method for robust multi-target tracking adopting multi-view Doppler measurement information","authors":"Jiaqi Zhang ,&nbsp;Cao Zeng ,&nbsp;Haihong Tao ,&nbsp;Yuhong Zhang ,&nbsp;Shihua Zhao ,&nbsp;Qirui Wu","doi":"10.1016/j.sigpro.2024.109815","DOIUrl":"10.1016/j.sigpro.2024.109815","url":null,"abstract":"<div><div>Due to reasons such as target maneuvering and track crossing, mistaken track association may be caused. When the target is in Doppler blind zone, it often leads to the loss of measurement information, which is reflected in the situation as track breakage. In response to the demand of track repair in the case of track breakage, we propose a robust multi-target broken-track association method that comprehensively utilizes multi-view Doppler measurement information. Firstly, based on the derivation of measurement coordinate transformation bias, the multi-sensor Doppler measurement after error correction is fused to obtain the heading velocity and heading acceleration measurement of the target. Secondly, the multi-scan association cost function based on the heading velocity and heading acceleration measurement is constructed, and the optimal correlation sequence is obtained by minimizing the complexity of the cost function. Then, for the case of missing measurements, the optimal association sequence is used to extrapolate the missing measurements, thereby accomplishing the correlation among the broken track segment, the extrapolated measurement and the optimal correlation sequence. Thirdly, we design a multi-scan GLMB smoother to perform forward prediction and backward smoothing on the above correlation results to improve the smoothness of the track. Simulation and actual experimental results suggest that our proposed method can effectively deal with the track breakage situation of dense targets, particularly in track integrity, track accuracy and robustness compared with the existing approaches.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"230 ","pages":"Article 109815"},"PeriodicalIF":3.4,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142758831","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
Simplified ICF and smart MIR for PAPR reduction in OFDM systems
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2024-11-26 DOI: 10.1016/j.sigpro.2024.109804
Heng Du, Jiang Xue , Weilin Song, Qihong Duan
{"title":"Simplified ICF and smart MIR for PAPR reduction in OFDM systems","authors":"Heng Du,&nbsp;Jiang Xue ,&nbsp;Weilin Song,&nbsp;Qihong Duan","doi":"10.1016/j.sigpro.2024.109804","DOIUrl":"10.1016/j.sigpro.2024.109804","url":null,"abstract":"<div><div>One of the biggest problems for orthogonal frequency division multiplexing (OFDM) systems is the high peak-to-average power ratio (PAPR), which breaks the orthogonality among subcarriers and leads to the nonlinear distortion of transmitted signals after being processed by the power amplifier (PA). The iterative clipping and filtering (ICF) method is one of the well known and applied existing PAPR reduction techniques at the transmitter and the modified iterative receiver (MIR) is an effective existing method for signal recovery with the ICF method in its iterative process at the receiver. However, the ICF method, as well as the MIR, suffers from the high computational complexity due to the oversampling and high-order inverse fast Fourier transform/fast Fourier transform (IFFT/FFT) operators. Besides, the performance of MIR is limited by the number of iterations. In this paper, to reduce the computational complexity of ICF method, the phase rotation iterative clipping and filtering (PRICF) method is proposed, which performs padding, phase rotation and low-order IFFT/FFT operators. Meanwhile, the computational complexity of MIR is also reduced because the ICF method is replaced by the PRICF method in its iterative process. Furthermore, to accelerate the iteration or improve the performance, the modified iterative network receiver (MIR-Net) is proposed by introducing trainable parameters based on the method of model-driven deep learning. Comparing with the combination of ICF and MIR, the simulation results demonstrate the advantages of our proposed methods, which is the combination of PRICF and MIR-Net, in terms of the computational complexity and performance.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"230 ","pages":"Article 109804"},"PeriodicalIF":3.4,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142758830","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
A dual-based first-order algorithm for ToA asynchronous localization and synchronization
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2024-11-26 DOI: 10.1016/j.sigpro.2024.109814
Eyal Gur , Alon Amar , Shoham Sabach
{"title":"A dual-based first-order algorithm for ToA asynchronous localization and synchronization","authors":"Eyal Gur ,&nbsp;Alon Amar ,&nbsp;Shoham Sabach","doi":"10.1016/j.sigpro.2024.109814","DOIUrl":"10.1016/j.sigpro.2024.109814","url":null,"abstract":"<div><div>Joint ToA source localization and synchronization determines the location and time offset of a radiating source using time-of-arrival measurements collected from a time-synchronized array of sensors. Various approaches have been proposed to address this non-convex and non-smooth optimization problem, which usually transform the problem by applying convex relaxations or smooth approximations. In this paper, we focus on the original joint problem and show that it can be expressed as a sum of a quadratic function with multiple non-smooth functions. This type of problems cannot be solved using traditional proximal-based methods, and we develop a tailored dual-based first-order algorithm. We analyze the proposed method, and prove its convergence to critical points of the original problem under mild assumptions. Experimental results showcase advantages of the method in terms of convergence, RMSE, bias, and complexity.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"230 ","pages":"Article 109814"},"PeriodicalIF":3.4,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142758833","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
Extraction of patterns from images using a model of combined frequency localization spaces
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2024-11-26 DOI: 10.1016/j.sigpro.2024.109810
Djordje Stanković , Cornel Ioana , Irena Orović
{"title":"Extraction of patterns from images using a model of combined frequency localization spaces","authors":"Djordje Stanković ,&nbsp;Cornel Ioana ,&nbsp;Irena Orović","doi":"10.1016/j.sigpro.2024.109810","DOIUrl":"10.1016/j.sigpro.2024.109810","url":null,"abstract":"<div><div>An algorithm for image decomposition and separation of superposed stationary contributions is proposed. It is based on the concept of sparse-to-sparse domain representation achieved through a relationship between block-based and full-size discrete cosine transform. The L-statistics is adapted to discard nonstationary components from the frequency domain vectors, leaving just a few coefficients associated with stationary pattern. These fewer stationary components are then used under the compressive sensing framework to reconstruct the stationary pattern. The original image is observed as a nonstationary component, acting as a non-desired part at this stage of the procedure, while the stationary pattern is observed as a “desired part” that should be extracted through the reconstruction process. The problem of interest is formulated as underdetermined system of equations resulting from a relationship between the two considered transformation spaces. Once the stationary pattern is reconstructed, it can be removed entirely from the image. Furthermore, it will be shown that the efficiency of pattern extraction cannot be affected, even when image contains additional nonstationary disturbance (here, the noisy image is observed as nonstationary undesired part). The proposed approach is motivated by challenges in removing Moiré-like patterns from images, enabling some interesting applications, including extraction of hidden sinusoidal signatures.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"230 ","pages":"Article 109810"},"PeriodicalIF":3.4,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142758834","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
Game-theory-based complexity allocation for 360-degree video coding
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2024-11-23 DOI: 10.1016/j.sigpro.2024.109807
Jielian Lin , Kaiying Xing , Yiwen Xu
{"title":"Game-theory-based complexity allocation for 360-degree video coding","authors":"Jielian Lin ,&nbsp;Kaiying Xing ,&nbsp;Yiwen Xu","doi":"10.1016/j.sigpro.2024.109807","DOIUrl":"10.1016/j.sigpro.2024.109807","url":null,"abstract":"<div><div>360-degree video applications with immersive experiences have been well spread in our daily life. However, 360-degree video with high resolution (e.g., 8192<span><math><mrow><mspace></mspace><mo>×</mo><mspace></mspace><mn>4096</mn><mo>,</mo><mn>6144</mn><mspace></mspace><mo>×</mo></mrow></math></span> 3072, and 3840 × 1920) leads to high coding computational complexity. To further optimize the complexity allocation and obtain the optimal coding performance, this paper proposes a game-theory-based complexity allocation algorithm for 360-degree video coding. The proposed method first constructs the latitude-level complexity allocation model by introducing game theory. Second, the optimal Lagrange coefficient <span><math><msup><mrow><mi>λ</mi></mrow><mrow><mo>∗</mo></mrow></msup></math></span> value is obtained by the Newton method, and then, the complexity of the latitude can be further obtained. Finally, the overall complexity allocation algorithm is also designed. Experimental results indicate our method obtains Time Saving (TS) with 18.44%<span><math><mo>∼</mo></math></span>67.08% and BDBR performance with 0.10%<span><math><mo>∼</mo></math></span>3.11%. The proposed method also achieves the optimal Coding Gain (CG) values for the most global target complexity.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"230 ","pages":"Article 109807"},"PeriodicalIF":3.4,"publicationDate":"2024-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142744535","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
FTAN: Feature Transform and Alignment Network for cross-domain specific emitter identification
IF 3.4 2区 工程技术
Signal Processing Pub Date : 2024-11-22 DOI: 10.1016/j.sigpro.2024.109800
Zhiling Xiao, Xiang Zhang, Guomin Sun, Huaizong Shao
{"title":"FTAN: Feature Transform and Alignment Network for cross-domain specific emitter identification","authors":"Zhiling Xiao,&nbsp;Xiang Zhang,&nbsp;Guomin Sun,&nbsp;Huaizong Shao","doi":"10.1016/j.sigpro.2024.109800","DOIUrl":"10.1016/j.sigpro.2024.109800","url":null,"abstract":"<div><div>Conventional deep learning-based specific emitter identification (SEI) methods are consistently constrained to domain-invariant assumption, leading to a decrease in recognition accuracy when the feature domain changes. To tackle this issue, we propose a novel unsupervised domain adaptation (UDA) framework named feature transform and alignment network (FTAN) for cross-domain SEI. In FTAN, we first apply a weight-shared network to extract the initial features of signals from all domains. Then, we introduce domain-specific modules to individually learn domain-invariant features, which can minimize the distribution discrepancies of source and target signals. Finally, the aligned domain-invariant features are utilized for identification. We evaluate the performance of FTAN on the various signal datasets. The experimental results demonstrate that FTAN significantly mitigates identification performance degradation in cross-domain scenarios and outperforms other state-of-the-art methods.</div></div>","PeriodicalId":49523,"journal":{"name":"Signal Processing","volume":"230 ","pages":"Article 109800"},"PeriodicalIF":3.4,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142744531","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学术官方微信