检索结果-内蒙古大学图书馆

Online Distributed Optimization With Nonconvex Objective Functions Under Unbalanced Digraphs: Dynamic Regret Analysis

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2024年第5期11卷 4241-4251页

作者： Qin, Yanfu Lu, Kaihong Wang, Hongxia Shandong Univ Sci & Technol Coll Elect Engn & Automat Qingdao 266590 Peoples R China

In this paper, the problem of online distributed optimization subject to a convex set is studied by employing a network of agents. Each agent's objective function is time-varying and nonconvex and the agents exchange information with their neighbors through a time-varying directed graph. Particularly, here the graph is not assumed to be balanced. To handle this problem, an online distributed algorithm is proposed based on the projection-free strategy and the push-sum protocol. The algorithm's performance is measured using dynamic regrets whose offline benchmark is to find a stationary point of the objective function at each time. Under mild assumptions on the graph and objective functions, we prove that if the deviation of the objective function sequence is sublinear with the square root of the time horizon, and the deviation of the objective function gradient sequence is sublinear with the time horizon, then the dynamic regret increases sublinearly. Finally, simulation experiments are presented to verify the effectiveness of the theoretical results.

关键词： Optimization Linear programming Heuristic algorithms signal processing algorithms Vectors Benchmark testing Multi-agent systems Dynamic regrets nonconvex optimization online distributed optimization unbalanced graphs

来源：评论

学校读者我要写书评

暂无评论

Spectral Graph Learning With Core Eigenvectors Prior via Iterative GLASSO and Projection

引用

IEEE TRANSACTIONS ON signal processing 2024年 72卷 3958-3972页

作者： Bagheri, Saghar Do, Tam Thuc Cheung, Gene Ortega, Antonio York Univ Dept Elect Engn & Comp Sci Toronto ON M3J 1P3 Canada Univ Southern Calif Dept Elect Comp Engn Los Angeles CA 90089 USA

Before the execution of many standard graph signal processing (GSP) modules, such as compression and restoration, learning of a graph that encodes pairwise (dis)similarities in data is an important precursor. In data-starved scenarios, to reduce parameterization, previous graph learning algorithms make assumptions in the nodal domain on i) graph connectivity (e.g., edge sparsity), and/or ii) edge weights (e.g., positive edges only). In this paper, given an empirical covariance matrix (C) over bar estimated from sparse data, we consider instead a spectral-domain assumption on the graph Laplacian matrix L: the first K eigenvectors (called"core" eigenvectors){u(k)}of L are pre-selected-e.g., based on domain-specific knowledge-and only the remaining eigen vectors are learned and parameterized. We first prove that, inside a Hilbert space of real symmetric matrices, the subspace H+u of positive semi-definite (PSD) matrices sharing a common set of core K eigenvectors {u(k)} is a convex cone. Inspired by the Gram-Schmidt procedure, we then construct an efficient operator to project a given positive definite (PD) matrix on to H-u(+). Finally, we design a hybrid graphical lasso/projection algorithm to compute a locally optimal inverse Laplacian L-1 is an element of H-u(+) given (C) over bar. We apply our graph learning algorithm in two practical settings: parliamentary voting interpolation and predictive transform coding in image compression. Experiments show that our algorithm outperformed existing graph learning schemes in data-starved scenarios for both synthetic data and these two settings

关键词： Laplace equations Symmetric matrices signal processing algorithms Covariance matrices Eigenvalues and eigenfunctions Optimization Reviews Graph signal processing graph learning convex optimization

来源：评论

学校读者我要写书评

暂无评论

Multi-Target Association for UAVs Based on Fused Topology and Visual Features

引用

IEEE signal processing LETTERS 2025年 32卷 1755-1759页

作者： Li, Xudong Wu, Lizhen Niu, Yifeng Yuan, Man Natl Univ Def Technol Coll Intelligence Sci & Technol Changsha 410073 Peoples R China

In this letter, we propose a novel multi-target association algorithm that fuses topological and visual features, and this algorithm improves target discrimination. The fused features are first constructed, and then a similarity calculation method is proposed to aggregate neighbor similarities to the central node based on topological similarity, which can be iterated several times to enhance the differentiation between targets. The experimental results demonstrate the advantages of the proposed algorithm.

关键词： Feature extraction Visualization Topology Autonomous aerial vehicles Vectors signal processing algorithms Fuses Convolutional neural networks Training Target recognition Feature fusion topology features multi-target association UAV

来源：评论

学校读者我要写书评

暂无评论

Robust Multitask Diffusion Bias Compensation M-Estimate algorithms for Distributed Adaptive Learning With Noisy Input

引用

IEEE signal processing LETTERS 2025年 32卷 1146-1150页

作者： Peng, Senran Jia, Lijuan Yang, Zi-Jiang Tao, Ran Wang, Yue Beijing Inst Technol Sch Informat & Elect Beijing 100081 Peoples R China Ibaraki Univ Coll Engn Dept Mech Syst Engn Ibaraki 3168511 Japan

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.

关键词： Noise Estimation signal processing algorithms Clustering algorithms Noise measurement Vectors Real-time systems Cost function Adaptation models Modeling Multitask networks robust M-estimate bias compensation spatial average combination

来源：评论

学校读者我要写书评

暂无评论

Exact Equality of the MSEs for Two Types of Nonlinear Adaptive Systems: Saturation and Dead-Zone Types

引用

IEEE ACCESS 2024年 12卷 181704-181717页

作者： Miyoshi, Seiji Yamaguchi, Yua Kansai Univ Fac Engn Sci Dept Elect Elect & Informat Engn Suita Osaka 5648680 Japan Nidec Adv Technol Corp Muko Kyoto 6170003 Japan

Adaptive signal processing systems, commonly utilized in applications such as active noise control and acoustic echo cancellation, often encompass nonlinearities due to hardware components such as loudspeakers, microphones, and amplifiers. Examining the impact of these nonlinearities on the overall performance of adaptive systems is critically important. In this study, we employ a statistical-mechanical method to investigate the behaviors of adaptive systems, each containing an unknown system with a nonlinearity in its output. We specifically address two types of nonlinearity: saturation and dead-zone types. We analyze both the dynamic and steady-state behaviors of these systems under the effect of such nonlinearities. Our findings indicate that when the saturation value is equal to the dead-zone width, the mean square errors (MSEs) in steady states are identical for both nonlinearity types. Furthermore, we derive a self-consistent equation to obtain the saturation value and dead-zone width that maximize the steady-state MSE. We theoretically clarify that these values depend on neither the step size nor the variance of background noise.

关键词： Adaptive systems Adaptation models Adaptive signal processing Adaptive equalizers Noise Vectors Steady-state signal processing algorithms Mathematical models Finite impulse response filters Adaptive filter adaptive signal processing system identification LMS algorithm saturation-type nonlinearity dead-zone-type nonlinearity statistical-mechanical analysis

来源：评论

学校读者我要写书评

暂无评论

Optimizing a-DCF for Spoofing-Robust Speaker Verification

引用

IEEE signal processing LETTERS 2025年 32卷 1081-1085页

作者： Kurnaz, Oguzhan Mishra, Jagabandhu Kinnunen, Tomi H. Hanilci, Cemal Univ Eastern Finland Joensuu 80130 Finland Bursa Tech Univ TR-16310 Bursa Turkiye

Automatic speaker verification (ASV) systems are vulnerable to spoofing attacks. We propose a spoofing-robust ASV system optimized directly for the recently introduced architecture-agnostic detection cost function (a-DCF), which allows targeting a desired trade-off between the contradicting aims of user convenience and robustness to spoofing. We combine a-DCF and binary cross-entropy (BCE) with a novel straightforward threshold optimization technique. Our results with an embedding fusion system on ASVspoof2019 data demonstrate relative improvement of 13% over a system trained using BCE only (from minimum a-DCF of 0.1445 to 0.1254). Using an alternative non-linear score fusion approach provides relative improvement of 43% (from minimum a-DCF of 0.0508 to 0.0289).

关键词： Measurement Costs Training Cost function signal processing algorithms Error analysis Security Robustness Computer architecture Training data a-DCF spoofing-robust speaker verification

来源：评论

学校读者我要写书评

暂无评论

Continuous-Time Distributed Algorithm for Seeking Fixed Points of Multiagent Quasi-Nonexpansive Operators

引用

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS 2024年第3期11卷 1238-1250页

作者： Nian, Xiaohong Liu, Dongxin Li, Fan Cent South Univ Key Lab Inst Cluster Unmanned Syst Sch Automat Changsha 410083 Peoples R China

This article investigates the distributed fixed point seeking problem for the operator in real Hilbert spaces over the multiagent networks, where each local operator can only be approximately and privately accessed by the corresponding agent. Specifically, two cases, including the global operator is sum separable and block separable, are considered. Under the assumption that the local operator is Lipschitz and the global operator is quasi-nonexpansive, continuous-time distributed algorithms over balanced time-varying digraphs and strongly connected fixed digraphs are designed for two cases, respectively, and it is proved in both cases that the algorithms weakly converge to a fixed point of the considered operator. To the best of our knowledge, these two algorithms are the first continuous-time dynamical system results for the distributed fixed point seeking problem. Meanwhile, the designed algorithms can also be applied to solve resource allocation, noncooperative games, and multicluster games, providing a unified framework for their solution. Finally, several numerical simulations are presented to verify the theoretical results.

关键词： Distributed algorithms signal processing algorithms Heuristic algorithms Optimization Games Hilbert space Network systems Distributed algorithm distributed optimization fixed point theory game theory multiagent networks

来源：评论

学校读者我要写书评

暂无评论

Distributed Precoder Based on Weighted MMSE With Low Complexity for Massive MIMO Systems

引用

IEEE COMMUNICATIONS LETTERS 2025年第3期29卷 482-486页

作者： Zhou, Ningxin Wang, Zheng Ma, Cong Huang, Yongming Shi, Qingjiang Southeast Univ Sch Informat Sci & Engn Nanjing 210096 Peoples R China ZTE Corp Shenzhen 518057 Peoples R China Tongji Univ Sch Software Engn Shanghai 201804 Peoples R China

The weighted sum mean squared error minimization (WMMSE) algorithm has gained widespread adoption owing to its superior performance. In this letter, we propose a novel low-complexity distributed WMMSE (LCD-WMMSE) algorithm, which is implemented over a decentralized architecture based on ring topology. Although each distributed unit (DU) in LCD-WMMSE works only with the local channel state information (CSI), LCD-WMMSE algorithm is still able to approach the performance of traditional WMMSE. Moreover, we show that LCD-WMMSE is also scalable since its required interconnection bandwidth is independent of the number of transmitter antennas, making it promising to various scenarios of massive MIMO. Simulation results validate that the proposed LCD-WMMSE algorithm not only achieves the low complexity cost in a distributed manner but also exhibits negligible performance loss.

关键词： Precoding signal processing algorithms Massive MIMO Computer architecture Vectors Topology Downlink Interference Distributed databases Antenna arrays Distributed precoding massive MIMO decentralized architecture maximization sum-rate WMMSE

来源：评论

学校读者我要写书评

暂无评论

Augmented Affine Projection Algorithm Based on Error Nonlinearity and Its Simplified Version

引用

IEEE TRANSACTIONS ON signal processing 2024年 72卷 2767-2782页

作者： Gu, Yanglong Ni, Jingen Soochow Univ Sch Elect & Informat Engn Suzhou 215006 Peoples R China

The augmented affine projection algorithm (AAPA) has a faster convergence rate than the augmented complex-valued LMS (ACLMS) algorithm for correlated inputs. However, they are both not robust against impulsive interference. This work proposes an improved AAPA based on error nonlinearity, which is implemented with the derivative of the logistic distance metric. To reduce its computational complexity, this work also proposes a simplified version of the improved AAPA using the first-order Taylor approximation of the exponential function that is included in the derivative of logistic distance metric. To study the stochastic behaviors of the improved AAPA and its simplified version, their stability conditions and transient and steady-state performance are analyzed. Simulations are performed in the context of system identification and stereo acoustic echo cancellation to show the merits of the two proposed algorithms and to verify the accuracy of the theory on stability conditions and transient and steady-state performance.

关键词： Adaptive filters Vectors Logistics Measurement signal processing algorithms Filtering algorithms Noise Affine projection algorithm augmented linear model impulsive interference logistic distance metric

来源：评论

学校读者我要写书评

暂无评论

Blind Recognition Algorithm of RS-SPC Concatenated Codes Based on Single-Error Correction

引用

IEEE signal processing LETTERS 2025年 32卷 101-105页

作者： Wu, Zhuolun Zhang, Wei Wang, Yihan Zhang, Yushan Liu, Yanyan Tianjin Univ Sch Microelect Tianjin 300072 Peoples R China Nankai Univ Coll Elect Informat & Opt Engn Tianjin 300071 Peoples R China Tianjin Univ Sch Architecture Tianjin 300072 Peoples R China

This letter presents an RS-SPC concatenated code blindrecognition algorithm based on the single-error correction. The algorithm corrects the least reliable bit of the single parity check (SPC) codewords based on the parity check characteristics, thereby increasing correct Reed-Solomon (RS) codewords and laying the foundation for improving the recognition probability. In addition, this algorithm combines threshold judgement with the matrix recording method, thereby eliminating unnecessary iterative operations under the condition that accurate recognition is possible. At the same time, it employs probability theory as a theoretical basis to quantify the degree of dispersion of the data through sample variance. The experimental results demonstrate that the recognition probability of this algorithm is superior to that of all other algorithms. When the codeword error rate (CER) is 0.5, RS(15,9)-SPC(4,3) still has a recognition probability of 20%. For RS(255,239)-SPC(8,7), the gain of the proposed algorithm exceeds 1.3dB compared to the upper bound of the recognition probability.

关键词： Codes signal processing algorithms Concatenated codes Polynomials Encoding Parity check codes Symbols Voltage Decoding Probability Reed-Solomon codes blind recognition Galois field Fourier transform concatenated code

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：