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

An Efficient Parameter Optimization of Maximum Correntropy Criterion

IEEE signal processing LETTERS 2023年 30卷 538-542页

作者： Shi, Long Shen, Lu Chen, Badong Sch Comp & Artificial Intelligence Chengdu 611130 Peoples R China Southwestern Univ Finance & Econ Financial Intelligence & Financial Engn Key Lab Si Chengdu 611130 Peoples R China Univ York Dept Elect Engn York YO10 5DD England Xi An Jiao Tong Univ Inst Artificial Intelligence & Robot Xian 710049 Peoples R China

The maximum correntropy criterion (MCC) algorithm depends upon two fundamental parameters, i.e., step-size and kernel width. Previous studies of parameter optimization in the MCC mainly focus on a single parameter (mainly the kernel width), lacking optimization research concerning both parameters. To this end, this letter investigates a novel optimization scheme simultaneously involving step-size and kernel width. The optimization framework is based on making the power of weight error vector undergo the steepest attenuation. Under the premise of maintaining the same evolutionary trend for time-varying step-size and kernel width, we formulate a constrained parameter optimization problem, where the step-size is subject to a kernel width induced constraint. By taking this approach, the original bivariate optimization can be transformed into a univariate optimization problem, which facilitates optimization solving. We further develop an existing reset scheme to make it suitable for kernel width to ensure a good tracking capability. In addition, we investigate the convergence behavior of the optimized algorithm. Simulation results demonstrate that the developed optimization scheme is beneficial for performance improvement, and the resulting algorithm outperforms some state-of-art MCC-based algorithms.

关键词： Kernel Optimization signal processing algorithms Market research Convergence Attenuation Heuristic algorithms Convergence behavior constrained parameter optimization kernel width maximum correntropy criterion tracking capability

来源：评论

学校读者我要写书评

暂无评论

Distributed Banach-Picard Iteration: Application to Distributed Parameter Estimation and PCA

引用

IEEE TRANSACTIONS ON signal processing 2023年 71卷 17-30页

作者： Andrade, Francisco Figueiredo, Mario A. T. Xavier, Joao Univ Lisbon Inst Super Tecn P-1049001 Lisbon Portugal Inst Telecomunicacoes P-1049001 Lisbon Portugal Inst Syst & Robot Lab Robot & Engn Syst P-1600011 Lisbon Portugal

We recently proposed an algorithmic framework, distributed Banach-Picard iteration (DBPI), allowing a set of agents linked by a communication network to find a fixed point of a map that: (a) is the average of individual maps held by said agents;(b) is locally contractive (LC). Given such a map, DBPI yields a distributed algorithm provably inheriting the local linear convergence (LLC) of the standard Banach-Picard iteration for the centralized (average) map. Here, we instantiate DBPI in two classical problems, which amounts to proving that the conditions guaranteeing the LLC of DBPI hold. First, taking Sanger's algorithm for principal component analysis (PCA), we show that it corresponds to iterating an LC map that can be written as the average of local maps held by agents with private data subsets. Applying DBPI then recovers a previous distributed PCA algorithm, which lacked a convergence proof, thus closing that gap. In the second instantiation, we show that a variant of the expectation-maximization (EM) algorithm for parameter estimation from noisy, faulty measurements in sensor networks can be written as iterating an LC map that is the average of local maps. Consequently, the DBPI framework yields a distributed algorithm automatically inheriting the LLC guarantee of its centralized counterpart. Verifying the LC condition for EM is nontrivial (as the underlying operator depends on random samples) and a contribution in itself, possibly of independent interest. Finally, we illustrate experimentally the linear convergence of the proposed distributed EM algorithm, contrasting with the sub-linear rate of the previous version.

关键词： Task analysis Convergence Principal component analysis signal processing algorithms Distributed algorithms Dimensionality reduction Computational modeling Distributed computation banach-picard iteration fixed points distributed EM distributed PCA consensus

来源：评论

学校读者我要写书评

暂无评论

Masked Spectral Bands Modeling With Shifted Windows: An Excellent Self-Supervised Learner for Classification of Medical Hyperspectral Images

引用

IEEE signal processing LETTERS 2023年 30卷 543-547页

作者： Li, Yuan Wu, Ruoyu Tan, Qijuan Yang, Zhengchun Huang, Hong Chongqing Univ Key Lab Optoelect Technol & Syst Educ Minist China Chongqing 400044 Peoples R China Chongqing Univ Dept Radiol Canc Hosp Chongqing 400030 Peoples R China Chongqing Canc Inst Chongqing 400030 Peoples R China Chongqing Canc Hosp Chongqing 400030 Peoples R China Chongqing Med Univ Women & Childrens Hosp Chongqing 401147 Peoples R China

Hyperspectral imaging has become a popular imaging technique in the medical field, and the development of algorithms for computer-aided diagnosis (CAD) is urgently required. Traditional deep learning techniques require a lot of annotated data, which is a burden on doctors. Self-supervised learning (SSL) is a solution for extracting feature representations from unlabeled data. However, traditional CNN-based SSL algorithms cannot explore relations between neighboring and long-range spectral bands, which limits classification performance. In this letter, the proposed solution is a novel SSL method using a transformer-based technique called masked spectral bands modeling with shifted windows (MSBMSW). This method predicts masked spectral bands as the pretext task and uses a self-attention mechanism with shifted windows to capture the divergence of neighboring spectral bands and enhance information exchange between long-range spectral bands. Experimental results demonstrate that MSBMSW achieves better classification results than many state-of-the-art methods and has potential clinical value for CAD of MHSIs.

关键词： Hyperspectral imaging Feature extraction Transformers Training Solid modeling signal processing algorithms Medical diagnostic imaging Medical hyperspectral images classification self-supervised learning transformer shift windows

来源：评论

学校读者我要写书评

暂无评论

Active-LATHE: An Active Learning Algorithm for Boosting the Error Exponent for Learning Homogeneous Ising Trees

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2023年第4期69卷 2537-2555页

作者： Zhang, Fengzhuo Tandon, Anshoo Tan, Vincent Y. F. Natl Univ Singapore Dept Elect & Comp Engn Singapore 119077 Singapore Indian Inst Sci IUDX Program Unit SID Bengaluru 560012 India Natl Univ Singapore Dept Math Singapore 119077 Singapore

The Chow-Liu algorithm (IEEE Trans. Inform. Theory, 1968) has been a mainstay for the learning of tree structured graphical models from i.i.d. sampled data vectors. Its theoretical properties have been well-studied and are well understood. In this paper, we focus on the class of trees that are arguably even more fundamental, namely homogeneous trees in which each pair of nodes that forms an edge has the same correlation ?. We ask whether we are able to further reduce the error probability of learning the structure of the homogeneous tree model when active learning is allowed. Our figure of merit is the error exponent, which quantifies the exponential rate of decay of the error probability with an increasing number of data samples. We design and analyze an algorithm ActiveLearning Algorithm for Trees with Homogeneous Edges (ACTIVE-LATHE), which surprisingly boosts the error exponent by at least 40% when ? is at least 0.8. For all other values of ?, we also observe commensurate, but more modest, improvements in the error exponent. Our analysis hinges on judiciously exploiting the minute but detectable statistical variation of the samples to allocate more data to parts of the graph in which we are less confident of being correct.

关键词： Graphical models Vegetation signal processing algorithms Correlation Error probability Random variables Task analysis Active learning graphical models ising models error exponents

来源：评论

学校读者我要写书评

暂无评论

Large Deviations for Products of Non-Identically Distributed Network Matrices With Applications to Communication-Efficient Distributed Learning and Inference

引用

IEEE TRANSACTIONS ON signal processing 2023年 71卷 1319-1333页

作者： Petrovic, Nemanja Bajovic, Dragana Kar, Soummya Jakovetic, Dusan Sahu, Anit Kumar Univ Novi Sad Fac Tech Sci Dept Fundamental Sci Novi Sad 21000 Serbia Univ Novi Sad Fac Tech Sci Dept Power Elect & Commun Engn Novi Sad 21000 Serbia Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA Univ Novi Sad Fac Sci Dept Math & Informat Novi Sad 21000 Serbia Amazon Com Inc Alexa AI Pittsburgh PA 15232 USA

This paper studies products of independent but non-identically distributed random network matrices that arise as weight matrices in distributed consensus-type computation and inference procedures in peer-to-peer multi-agent networks. The non-identically distributed matrices studied in this paper model various application scenarios in which the agent communication network is time-varying, either naturally or engineered to achieve communication efficiency in computational procedures. First, under broad conditions on the statistics of the network matrix sequence, the product of the sequence is shown to converge almost surely to the consensus matrix and explicit large deviations rate of convergence are obtained. Specifically, given the admissible graph of interconnections modeling the base network topology, it is shown that the large deviations rate of consensus equals the minimum limiting value of the fluctuating graph cuts, where the edge costs are assigned through the current probabilities of the inter-agent communications. Secondly, an application of the above large deviations principle is studied in the context of distributed detection in time-varying networks with sequential observations. By adopting a consensus+innovations type distributed detection algorithm, as a by-product of this result, error exponents are obtained for the performance of distributed detection. It is shown that slow starts (slow increase) of inter-agent communication probabilities yield the same asymptotic error rate - and hence the same distributed detection performance, as if the communications were at their nominal levels from the beginning. As an important special case it is shown that when all the intermittent graph cuts have a link the probability of which increases to one, the performance of distributed detection is asymptotically optimal - i.e., equivalent to a centralized setup having access to all network data at all times.

关键词： Convergence Peer-to-peer computing Inference algorithms Electronic mail signal processing algorithms Limiting Estimation Distributed inference stochastic matrices error exponents inaccuracy rates large deviations consensus

来源：评论

学校读者我要写书评

暂无评论

Direct-Optimization-Based DC Dictionary Learning With the MCP Regularizer

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2023年第7期34卷 3568-3579页

作者： Li, Zhenni Yang, Zuyuan Zhao, Haoli Xie, Shengli Guangdong Univ Technol Sch Automat Guangzhou 510006 Peoples R China Guangdong HongKong Macao Joint Lab Smart Discrete Guangzhou 510006 Peoples R China Guangdong Key Lab IoT Informat Technol GDUT Guangzhou 510006 Peoples R China Sun Yat Sen Univ Sch Data & Comp Sci Guangzhou 510006 Peoples R China Minist Educ Key Lab Intelligent Informat Proc & Syst Integrat Guangzhou 510006 Peoples R China

Direct-optimization-based dictionary learning has attracted increasing attention for improving computational efficiency. However, the existing direct optimization scheme can only be applied to limited dictionary learning problems, and it remains an open problem to prove that the whole sequence obtained by the algorithm converges to a critical point of the objective function. In this article, we propose a novel direct-optimization-based dictionary learning algorithm using the minimax concave penalty (MCP) as a sparsity regularizer that can enforce strong sparsity and obtain accurate estimation. For solving the corresponding optimization problem, we first decompose the nonconvex MCP into two convex components. Then, we employ the difference of the convex functions algorithm and the nonconvex proximal-splitting algorithm to process the resulting subproblems. Thus, the direct optimization approach can be extended to a broader class of dictionary learning problems, even if the sparsity regularizer is nonconvex. In addition, the convergence guarantee for the proposed algorithm can be theoretically proven. Our numerical simulations demonstrate that the proposed algorithm has good convergence performances in different cases and robust dictionary-recovery capabilities. When applied to sparse approximations, the proposed approach can obtain sparser and less error estimation than the different sparsity regularizers in existing methods. In addition, the proposed algorithm has robustness in image denoising and key-frame extraction.

关键词： Machine learning Optimization Dictionaries Convergence Convex functions signal processing algorithms Approximation algorithms Convergence analysis dictionary learning direct optimization minimax concave penalty (MCP) regularizer

来源：评论

学校读者我要写书评

暂无评论

Accelerating Two-Phase Multiobjective Evolutionary Algorithm for Electric Location-Routing Problems

引用

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2023年第9期24卷 9121-9136页

作者： Wang, Chao Liu, Rongrong Su, Yansen Zhang, Xingyi Anhui Univ Minist Educ Sch Artificial Intelligence Informat Mat & Intelligent Sensing Lab Anhui Prov Hefei Peoples R China Anhui Univ Engn Res Ctr Autonomous Unmanned Syst Technol Sch Artificial Intelligence Minist Educ Hefei 230601 Peoples R China Anhui Univ Minist Educ Key Lab Intelligent Comp & Signal Proc Hefei 230601 Peoples R China Anhui Univ Sch Artificial Intelligence Hefei 230601 Peoples R China

Electric location-routing problem is a challenging problem consisting of the optimization of electric vehicle routing and charging facility location, simultaneously. Existing algorithms generally adopt the two-phase search strategy to alternately optimize the routing and the location. However, they are usually criticized for the inefficiency as the problem scale increases. In order to improve the search efficiency in each phase, we propose an accelerating two-phase multiobjective evolutionary algorithm, where the learning method is used to mine the useful information from the historical search process to generate the high-quality routing and location offspring. To be specific, in the routing optimization phase, an interpolation method is developed to extract the frequent visiting orders existing in the historical best solutions. These frequent visiting orders are used to create potential routing offspring that can accelerate the convergence toward the optimal solutions. In the location optimization phase, a surrogate model is used to approximatively represent the relationship from routing to location, which can directly output a promising location scheme for a given routing offspring and thus reduce the optimization time. Experimental results on different scales of test instances demonstrate the competitiveness of the proposed algorithm in comparison with several state of-the-art algorithms, including four widely used heuristic algorithms and two multiobjective evolutionary algorithms.

关键词： Routing Search problems Optimization Heuristic algorithms Evolutionary computation Batteries signal processing algorithms Electric location-routing problem multiobjective optimization evolutionary algorithm interpolation surrogate

来源：评论

学校读者我要写书评

暂无评论

DOA Estimation Based on Coherent Integration-Sparse Bayesian Learning With Time-Variant Gain-Phase Errors

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2023年第6期59卷 7951-7962页

作者： Lu, Chaojie Zheng, Jibin Yang, Tianyuan Chang, Rui Liu, Hongwei Xidian Univ Natl Lab Radar Signal Proc Xian 710071 Peoples R China Chinese Acad Sci Natl Key Lab Microwave Imaging Technol Aerosp Informat Res Inst Beijing 100045 Peoples R China

Direction of arrival (DOA) estimation is an important topic of array signal processing and channels without gain-phase errors or with time-invariant gain-phase errors are assumed in most of the DOA estimation algorithms. However, with the measured data of a reconnaissance receiver system, we verify that the gain-phase error between channels is time-variation. Based on this fact, a more practical signal model with time-variant gain-phase errors is constructed. To obtain accurate DOA estimation, an algorithm termed as coherent integration-sparse Bayesian learning with time-variant gain-phase errors is (CI-SBLVGPE) devised which has two superiorities, i.e., 1) the CI operation integrates the signal energy into a single snapshot, which decreases the gain-phase errors, makes the compensation possible, and guarantees a low computational complexity;2) the priori information of the gain-phase errors, source DOA, and noise is used to reduce the computational complexity and improve the robustness. With mathematical analyses, numerical simulations, and real data processing, we validate the constructed model and superiorities of the proposed method.

关键词： Direction-of-arrival estimation Estimation signal processing algorithms Bayes methods Phased arrays Data models Measurement uncertainty Coherent integration DOA estimation gain-phase errors sparse Bayesian learning

来源：评论

学校读者我要写书评

暂无评论

Multistage Least Squares algorithms for Clutter Suppression in Airborne Passive Radar Based on Subband Operation

引用

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS 2023年第2期59卷 1893-1909页

作者： Sui, Jinxin Wang, Jun Zuo, Luo Gao, Jie Xidian Univ Sch Elect Engn Natl Key Lab Radar Signal Proc Xian 710000 Peoples R China

This article, first, analyzes the influence of utilizing the space-time adaptive processing approaches in airborne passive radar (APR) systems on the dimension of the clutter subspace, and the signal-plus-noise ratio loss of the target, and illustrates that it is necessary to propose clutter cancellation algorithms suitable for APR systems. Combined with the property of APR systems, the multistage least squares algorithm based on subband operation (MLS-S) and the MLS algorithm based on subband operation in temporal domain (MLS-ST) are proposed for the Doppler-shift clutter cancellation. The first method, in the case of the clutter with integer Doppler-shift bins, proves to be a simple solution. The second approach, at the expense of an additional stage, is suitable for more situations. Due to the use of Doppler-angle-dependence and subband operation to coarsen the range resolution, the proposed methods not only suppress effectively clutter along the clutter ridge, but also cancel the fractional-order-range clutter. In addition, the computational complexity of the proposed algorithms is low, and the clutter cancellation operations can be performed in parallel, which provide the possibility of real-time clutter suppression for APR systems. The feasibility of the proposed approaches is verified by diverse simulated scenarios.

关键词： Clutter signal processing algorithms Doppler effect Heuristic algorithms Time-frequency analysis Passive radar Delays Airborne passive radar fractional-order-range clutter multistage least squares subband operation

来源：评论

学校读者我要写书评

暂无评论

Physics-Inspired Compressive Sensing: Beyond deep unrolling

引用

IEEE signal processing MAGAZINE 2023年第1期40卷 58-72页

作者： Zhang, Jian Chen, Bin Xiong, Ruiqin Zhang, Yongbing Peking Univ Shenzhen Grad Sch Shenzhen 518055 Peoples R China Peking Univ Comp Applicat Technol Shenzhen Grad Sch Shenzhen 518055 Peoples R China Peking Univ Sch Comp Sci Beijing Peoples R China Harbin Inst Technol Shenzhen Comp Sci & Technol Shenzhen 518055 Peoples R China

As an emerging paradigm for signal acquisition and reconstruction, compressive sensing (CS) achieves high-speed sampling and compression jointly and has found its way into many applications. With the fast growth of deep learning in computer vision, various methods of applying neural networks (NNs) in CS imaging tasks have been proposed. One category of them, named the deep unrolling network, is inspired by the physical sampling model and combines the merits of both optimization model- and data-driven methods, becoming the mainstream of this realm. In this review article, we first review the inverse imaging model and optimization algorithms encountered in the CS research and then provide the recent representative developments of CS networks, which are grouped into deep physics-free and physics-inspired approaches with respect to the utilization of sampling matrix and measurement information. Following this, we analyze the conceptual connections and relationships among various existing methods and present our perspectives on recent advances and trends for future research.

关键词： Image coding Computational modeling signal processing algorithms Transforms Market research Image restoration Task analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：