ترغب بنشر مسار تعليمي؟ اضغط هنا

Successive Nonnegative Projection Algorithm for Linear Quadratic Mixtures

105   0   0.0 ( 0 )
 نشر من قبل Christophe Kervazo
 تاريخ النشر 2020
  مجال البحث هندسة إلكترونية
والبحث باللغة English




اسأل ChatGPT حول البحث

In this work, we tackle the problem of hyperspectral (HS) unmixing by departing from the usual linear model and focusing on a Linear-Quadratic (LQ) one. The proposed algorithm, referred to as Successive Nonnegative Projection Algorithm for Linear Quadratic mixtures (SNPALQ), extends the Successive Nonnegative Projection Algorithm (SNPA), designed to address the unmixing problem under a linear model. By explicitly modeling the product terms inherent to the LQ model along the iterations of the SNPA scheme, the nonlinear contributions in the mixing are mitigated, thus improving the separation quality. The approach is shown to be relevant in a realistic numerical experiment.



قيم البحث

اقرأ أيضاً

In this work, we consider the problem of blind source separation (BSS) by departing from the usual linear model and focusing on the linear-quadratic (LQ) model. We propose two provably robust and computationally tractable algorithms to tackle this pr oblem under separability assumptions which require the sources to appear as samples in the data set. The first algorithm generalizes the successive nonnegative projection algorithm (SNPA), designed for linear BSS, and is referred to as SNPALQ. By explicitly modeling the product terms inherent to the LQ model along the iterations of the SNPA scheme, the nonlinear contributions of the mixing are mitigated, thus improving the separation quality. SNPALQ is shown to be able to recover the ground truth factors that generated the data, even in the presence of noise. The second algorithm is a brute-force (BF) algorithm, which is used as a post-processing step for SNPALQ. It enables to discard the spurious (mixed) samples extracted by SNPALQ, thus broadening its applicability. The BF is in turn shown to be robust to noise under easier-to-check and milder conditions than SNPALQ. We show that SNPALQ with and without the BF postprocessing is relevant in realistic numerical experiments.
This paper presents a novel array response control algorithm and its application to array pattern synthesis. The proposed algorithm considers how to flexibly and precisely adjust the array responses at multiple points, on the basis of one given weigh t vector. With the principle of adaptive beamforming, it is shown that the optimal weight vector for array response control can be equivalently obtained with a different manner, in which a linear transformation is conducted on the quiescent weight. This new strategy is utilized to realize multi-point precise array response control from one given weight vector, and it obtains a closed-form solution. A careful analysis shows that the response levels at given points can be independently, flexibly and accurately adjusted by simply varying the parameter vector, and that the uncontrolled region remains almost unchanged. By applying the proposed algorithm, an effective pattern synthesis approach is devised. Simulation results are provided to demonstrate the performance of the proposed algorithm.
Linear Programming (LP) is an important decoding technique for binary linear codes. However, the advantages of LP decoding, such as low error floor and strong theoretical guarantee, etc., come at the cost of high computational complexity and poor per formance at the low signal-to-noise ratio (SNR) region. In this letter, we adopt the penalty dual decomposition (PDD) framework and propose a PDD algorithm to address the fundamental polytope based maximum likelihood (ML) decoding problem. Furthermore, we propose to integrate machine learning techniques into the most time-consuming part of the PDD decoding algorithm, i.e., check polytope projection (CPP). Inspired by the fact that a multi-layer perception (MLP) can theoretically approximate any nonlinear mapping function, we present a specially designed neural CPP (NCPP) algorithm to decrease the decoding latency. Simulation results demonstrate the effectiveness of the proposed algorithms.
This paper investigates a new class of non-convex optimization, which provides a unified framework for linear precoding in single/multi-user multiple-input multiple-output (MIMO) channels with arbitrary input distributions. The new optimization is ca lled generalized quadratic matrix programming (GQMP). Due to the nondeterministic polynomial time (NP)-hardness of GQMP problems, instead of seeking globally optimal solutions, we propose an efficient algorithm which is guaranteed to converge to a Karush-Kuhn-Tucker (KKT) point. The idea behind this algorithm is to construct explicit concave lower bounds for non-convex objective and constraint functions, and then solve a sequence of concave maximization problems until convergence. In terms of application, we consider a downlink underlay secure cognitive radio (CR) network, where each node has multiple antennas. We design linear precoders to maximize the average secrecy (sum) rate with finite-alphabet inputs and statistical channel state information (CSI) at the transmitter. The precoding problems under secure multicast/broadcast scenarios are GQMP problems, and thus they can be solved efficiently by our proposed algorithm. Several numerical examples are provided to show the efficacy of our algorithm.
This paper presents a state and state-input constrained variant of the discrete-time iterative Linear Quadratic Regulator (iLQR) algorithm, with linear time-complexity in the number of time steps. The approach is based on a projection of the control input onto the nullspace of the linearized constraints. We derive a fully constraint-compliant feedforward-feedback control update rule, for which we can solve efficiently with Riccati-style difference equations. We assume that the relative degree of all constraints in the discrete-time system model is equal to one, which often holds for robotics problems employing rigid-body dynamic models. Simulation examples, including a 6 DoF robotic arm, are given to validate and illustrate the performance of the method.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا