{"title":"Fast Beam Pattern Synthesis Based on Vector Accelerated Alternating Direction Multiplier Method","authors":"Qiyan Song","doi":"10.1109/LSP.2024.3522858","DOIUrl":"https://doi.org/10.1109/LSP.2024.3522858","url":null,"abstract":"The alternating direction multiplier method (ADMM) has been employed to iteratively solve convex optimization problems with multiple constraints in be amforming scenarios. Faster beamforming can help improve the response speed of acoustic devices in scenarios such as sound field reconstruction and speech enhancement. In this study, an accelerated ADMM for faster beam pattern synthesis is proposed and compared to traditional ADMMs. Based on the principle of vector acceleration, the computation of dual and auxiliary variables is expedited to improve the computational speed of ADMM beamforming algorithm. Simulation results show that the proposed algorithm reduces the overall computational time by approximately 30<inline-formula><tex-math>$%$</tex-math></inline-formula> and achieves more accurate results in less time compared to traditional ADMM beamforming algorithms.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"526-530"},"PeriodicalIF":3.2,"publicationDate":"2024-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142976114","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}
Arnab Kumar Roy;Hemant Kumar Kathania;Adhitiya Sharma;Abhishek Dey;Md. Sarfaraj Alam Ansari
{"title":"ResEmoteNet: Bridging Accuracy and Loss Reduction in Facial Emotion Recognition","authors":"Arnab Kumar Roy;Hemant Kumar Kathania;Adhitiya Sharma;Abhishek Dey;Md. Sarfaraj Alam Ansari","doi":"10.1109/LSP.2024.3521321","DOIUrl":"https://doi.org/10.1109/LSP.2024.3521321","url":null,"abstract":"The human face is a silent communicator, expressing emotions and thoughts through it's facial expressions. With the advancements in computer vision in recent years, facial emotion recognition technology has made significant strides, enabling machines to decode the intricacies of facial cues. In this work, we propose ResEmoteNet, a novel deep learning architecture for facial emotion recognition designed with the combination of Convolutional, Squeeze-Excitation (SE) and Residual Networks. The inclusion of SE block selectively focuses on the important features of the human face, enhances the feature representation and suppresses the less relevant ones. This helps in reducing the loss and enhancing the overall model performance. We also integrate the SE block with three residual blocks that help in learning more complex representation of the data through deeper layers. We evaluated ResEmoteNet on four open-source databases: FER2013, RAF-DB, AffectNet-7 and ExpW, achieving accuracies of 79.79%, 94.76%, 72.39% and 75.67% respectively. The proposed network outperforms state-of-the-art models across all four databases.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"491-495"},"PeriodicalIF":3.2,"publicationDate":"2024-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142937894","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}
{"title":"A Simple and Efficient Method for Hybrid AOA and DTD Localization With Unknown Transmitter Location","authors":"Yanbin Zou;Yangpeng Xiao;Weien Zhang","doi":"10.1109/LSP.2024.3521317","DOIUrl":"https://doi.org/10.1109/LSP.2024.3521317","url":null,"abstract":"Recently, joint target and transmitter localization using differential time-delay (DTD) and angle-of-arrival (AOA) measurements has attracted researchers' interest. Due to the fact that three Euclidean norms exist in the DTD equation, the DTD equation is difficult to tackle directly. In this paper, we divide the joint localization problem into three subproblems, respectively, the AOA-only localization problem, the hybrid AOA and time-difference-of-arrival (TDOA) localization problem, and the hybrid AOA and time-delay (TD) localization problem with known transmitter location. Then, a two-stage algorithm is developed. In the first stage, solving the AOA-only localization problem provides initial estimates. In the second stage, alternatively and iteratively solving the problem of hybrid AOA and TDOA localization and the problem of hybrid AOA and TD localization provide the improved solutions. Simulation results validate that the proposed algorithm is superior to the existing constrained weighted least-squares (CWLS) algorithm when AOA noise variance is not sufficiently small. \u0000<italic>Index Term</i>\u0000-Angle-of-arrival (AOA), differential time-delay (DTD), time-delay (TD), time-difference-of-arrival (TDOA), elliptic localization.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"401-405"},"PeriodicalIF":3.2,"publicationDate":"2024-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142925407","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}
{"title":"Gate-Calibrated Double Disentangled Distribution Matching Network for Cross-Domain Pedestrian Trajectory Prediction","authors":"Zhengfa Liu;Ya Wu;Dequan Zeng;Shihang Du;Boyang Peng","doi":"10.1109/LSP.2024.3521786","DOIUrl":"https://doi.org/10.1109/LSP.2024.3521786","url":null,"abstract":"In cross-domain pedestrian trajectory prediction, most existing methods usually focus on learning entangled spatial-temporal domain-invariant features, while ignoring the different contributions of spatial and temporal shifts to the prediction model. To address this issue, we propose a novel gate-Calibrated Double Disentangled Distribution Matching Network (CD<inline-formula><tex-math>$^{3}$</tex-math></inline-formula>MN) that can effectively eliminate cross-trajectory domain shifts at both the spatial and temporal levels while learning robust prediction using a calibrated gated-fusion. The key idea of CD<inline-formula><tex-math>$^{3}$</tex-math></inline-formula>MN is to model domain-invariant features across trajectories as a calibrated gated-fusion of disentangled domain-invariant features at the temporal and spatial levels. We first introduce a spatial-temporal disentanglement module to disentangle the spatial-temporal properties of pedestrian trajectories from the spatial-level and temporal-level. Secondly, we design a domain-invariant disentanglement module for learning domain-invariant sample-level transferable feature representations at the spatial and temporal levels. Finally, to effectively fuse these disentangled temporal and spatial features, we design a calibrated gated-fusion module where both inter-level and intra-level knowledge are introduced to calibrate the fusion gate. Extensive experiments on real datasets demonstrate the effectiveness of CD<inline-formula><tex-math>$^{3}$</tex-math></inline-formula>MN.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"656-660"},"PeriodicalIF":3.2,"publicationDate":"2024-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143184278","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}
{"title":"Energy-Efficient Sensor Scheduling for State Estimation Over Homogeneous Multi-Hop Networks","authors":"Yao Li;Rui Song;Jianyong Zheng;Xinping Guan","doi":"10.1109/LSP.2024.3521378","DOIUrl":"https://doi.org/10.1109/LSP.2024.3521378","url":null,"abstract":"In this letter, anestimation-oriented power-constrained sensor scheduling problem over multi-hop sensor networks is studied. Two different online scheduling schemes for multi-hop transmission, i.e., global-delay-based scheduling (GS) and covariance-based scheduling (CS) are proposed, respectively. We propose a stochastic triggering scheme to satisfy power constraints. A Markovian model is adopted to formulate the state transition relationship in the scheduling process. In order to calculate the switching threshold and selection probabilities, an algorithm for parameters determination is further properly designed to overcome the coupling property between hops. We have explicitly analyzed the performance of GS by figuring out the upper and lower bounds of cost. Moreover, the superiority and optimality of CS have been theoretically proved by using the optimal state distribution method. Numerical simulations and comparisons with existing methods have been conducted illustratively to verify the correctness and effectiveness of our proposed schemes, algorithms and results.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"411-415"},"PeriodicalIF":3.2,"publicationDate":"2024-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142925366","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}
Jian-Li Zhao;Jian-Feng Gao;Sheng Fang;Tian-Heng Zhang;Jin-Yu Wang
{"title":"Robust Tensor Completion via Spatial-Spectral Constrained Deep Low-Rank Tensor Factorization for Hyperspectral Image Recovery","authors":"Jian-Li Zhao;Jian-Feng Gao;Sheng Fang;Tian-Heng Zhang;Jin-Yu Wang","doi":"10.1109/LSP.2024.3521382","DOIUrl":"https://doi.org/10.1109/LSP.2024.3521382","url":null,"abstract":"Robust tensor completion of hyperspectral image (HSI) is a challenging task in the field of remote sensing. Recently, nuclear norm minimization-based methods have made certain progress in robust tensor completion. However, the tensor nuclear norm applies the same constraint to all singular values, resulting in insufficient capturing power for the global structure of the HSI. In addition, as a convex surrogate of global low-rankness, tensor nuclear norm minimization leads to an overall low-rank approximation that cannot capture the details of the HSI. In this letter, we propose the spatial-spectral constrained deep low-rank tensor factorization (SDLTF). More precisely, the low-rank tensor factorization is used to dynamically assign penalty weights, aiming to preserve the main information and maintain the global structure of the HSI. The spatial-spectral constrained unsupervised deep prior is applied within a deep convolutional neural network to capture spatial-spectral correlations and local details of the HSI. We develop an efficient algorithm to tackle the corresponding model based on the ADMM. Extensive experiments demonstrate that our model has superior performance compared with several state-of-the-art methods.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"551-555"},"PeriodicalIF":3.2,"publicationDate":"2024-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142993347","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}
{"title":"Exploring Local Sparse Structure Prior for Image Deraining and Desnowing","authors":"Xin Guo;Xueyang Fu;Zheng-Jun Zha","doi":"10.1109/LSP.2024.3521374","DOIUrl":"https://doi.org/10.1109/LSP.2024.3521374","url":null,"abstract":"Existing image deraining and desnowing methods are typically trained under specific weather conditions, which limits their effectiveness in locating rain streaks and snowflakes in diverse, open scenes. This restriction often leads to suboptimal restoration performance. To address these limitations, we propose a novel local sparse structure prior for rain and snow, characterized by high pixel intensity and the locally sparse spatial distribution of rain streaks and snowflakes. Leveraging this prior, we developed an algorithm that extracts rain and snow structure masks, enabling precise localization of rain streaks and snowflake regions across open scenes. In addition, we introduce a refinement and compensation process to remove irrelevant information from the masks and correct mask estimation errors. We further construct a Mask-Guided Restoration Network (MGNet) that utilizes the rain and snow structure masks effectively and includes a mask-conditioned attention module to focus restoration efforts on degraded areas affected by rain streaks and snowflakes. Extensive experimental results demonstrate that our method significantly outperforms current state-of-the-art techniques in open scenes, effectively restoring various types of rain streaks and snowflakes with a single model parameter configuration.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"406-410"},"PeriodicalIF":3.2,"publicationDate":"2024-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142925367","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}
{"title":"Fast 3D Gaussian Splatting Rendering via Easily Integrable Improvements","authors":"Laurens Diels;Michiel Vlaminck;Wilfried Philips;Hiep Luong","doi":"10.1109/LSP.2024.3521379","DOIUrl":"https://doi.org/10.1109/LSP.2024.3521379","url":null,"abstract":"The recently introduced 3D Gaussian Splatting and subsequent methods have achieved significantly reduced inference times for novel view synthesis. To reduce this rendering time even further, in this paper we propose four improvements which are fully compatible with the high-level Gaussian Splatting formulation and can thus be incorporated into most methods based on this paradigm. Most notably, we alter the way Gaussians are duplicated across tiles by allowing for non-square axis-aligned Gaussian bounding boxes whose sizes take into account the Gaussian's opacity information. Our experiments demonstrate that we can decrease the 3D Gaussian Splatting rendering times by up to a factor of almost 4.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"381-385"},"PeriodicalIF":3.2,"publicationDate":"2024-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142925447","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}
{"title":"A Delta Operator State Estimation Algorithm for Discrete-Time Systems With State Time-Delay","authors":"Ling Xu;Xiao Zhang;Feng Ding;Quanmin Zhu","doi":"10.1109/LSP.2024.3519897","DOIUrl":"https://doi.org/10.1109/LSP.2024.3519897","url":null,"abstract":"This letter presents a state estimation algorithm for linear discrete-time systems with state-delay. In order to overcome the difficulty that the traditional Kalman filter cannot estimate the states of the systems with state-delay, a state estimation strategy is developed by combining the auxiliary model with the delta operator. Then, by constructing and minimizing the covariance matrix of the state reconstruction errors, a delta operator state estimation algorithm is derived and it can fulfill effective state estimation for the linear discrete-time system with state-delay. Moreover, the convergence proof is provided by means of stochastic stability theory. Finally, the experimental results demonstrate that the developed state estimation method is effective.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"391-395"},"PeriodicalIF":3.2,"publicationDate":"2024-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142925448","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}
{"title":"Novel Mathematical Model of Voltage Waveform Prediction for High-Speed PRBS Signal Transmission","authors":"Chaoyi Wang;Jinchun Gao;Kaixuan Song;Wenjia Wang;Zhijiao Chen","doi":"10.1109/LSP.2024.3520006","DOIUrl":"https://doi.org/10.1109/LSP.2024.3520006","url":null,"abstract":"Of specific interest in this current work, high-speed signal waveforms were evaluated and analyzed through novel mathematical modeling in time domain. Using complete math equations with accurate amplitude and phase information, the intrinsic property and transmission characteristic of a specific pseudo random binary sequence (PRBS) were further studied and presented quantitatively, where unipolar and bipolar signals at different bit rates were simultaneously considered in-depth. Transmission investigations of high-speed interconnects under pristine and degraded conditions were both conducted, and predictions of the mathematical model were all verified by circuit simulations and measurements. In addition, the corresponding eye diagram parameters were obtained and compared based on the voltage waveforms, providing a further validation of the proposed mathematical interconnect modeling method.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"376-380"},"PeriodicalIF":3.2,"publicationDate":"2024-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142925408","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}