There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

This paper gives an overview of the majorization-minimization (MM) algorithmic framework, which can provide guidance in deriving problem-driven algorithms with low computational cost. A general introduction of MM is presented, including a description of the basic principle and its convergence results. The extensions, acceleration schemes, and connection to other algorithmic frameworks are also covered. To bridge the gap between theory and practice, upperbounds for a large number of basic functions, derived based on the Taylor expansion, convexity, and special inequalities, are provided as ingredients for constructing surrogate functions. With the pre-requisites established, the way of applying MM to solving specific problems is elaborated by a wide range of applications in signal processing, communications, and machine learning.

Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning

Thank you very much for downloading spotlight synthetic aperture radar signal processing algorithms. Maybe you have knowledge that, people have search numerous times for their favorite books like this spotlight synthetic aperture radar signal processing algorithms, but end up in malicious downloads. Rather than reading a good book with a cup of coffee in the afternoon, instead they juggled with some harmful virus inside their laptop.

Spotlight Synthetic Aperture Radar Signal Processing Algorithms

Optimization methods are at the core of many problems in signal/image processing, computer vision, and machine learning. For a long time, it has been recognized that looking at the dual of an optimization problem may drastically simplify its solution. However, deriving efficient strategies that jointly bring into play the primal and dual problems is a more recent idea that has generated many important new contributions in recent years. These novel developments are grounded in the recent advances in convex analysis, discrete optimization, parallel processing, and nonsmooth optimization with an emphasis on sparsity issues. In this article, we aim to present the principles of primal?dual approaches while providing an overview of the numerical methods that have been proposed in different contexts. Last but not least, primal?dual methods lead to algorithms that are easily parallelizable. Today, such parallel algorithms are becoming increasingly important for efficiently handling high-dimensional problems.

https://hal.archives-ouvertes.fr/hal-01010437/document

Playing with Duality: An overview of recent primal?dual approaches for solving large-scale optimization problems

This paper reviews recent progress of portable short-range noncontact microwave radar systems for motion detection, positioning, and imaging applications. With the continuous advancements of modern semiconductor technologies and embedded computing, many functionalities that could only be achieved by bulky radar systems in the past are now integrated into portable devices with integrated circuit chips and printed circuits boards. These portable solutions are able to provide high motion detection sensitivity, excellent signal-to-noise ratio, and satisfactory range detection capability. Assisted by on-board signal processing algorithms, they can play important roles in various areas, such as health and elderly care, veterinary monitoring, human-computer interaction, structural monitoring, indoor tracking, and wind engineering. This paper reviews some system architectures and practical implementations for typical wireless sensing applications. It also discusses potential future developments for the next-generation portable smart radar systems.

A Review on Recent Progress of Portable Short-Range Noncontact Microwave Radar Systems

In this letter, we show that the normalized least-mean-square (NLMS) algorithm and the affine projection algorithm (APA) can be decomposed as the sum of two orthogonal vectors. One of these vectors is derived from an l2-norm optimization problem while the other one is simply a good initialization vector. By replacing this optimization with the basis pursuit, which is based on the l1-norm optimization, we derive the proportionate NLMS (PNLMS) algorithm and the proportionate APA (PAPA). Many other adaptive filters can be derived following this approach, including new ones.

Proportionate Adaptive Filters From a Basis Pursuit Perspective

Acoustic echo cancellation represents one of the most challenging system identification problems. The most used adaptive filter in this application is the popular normalized least mean square (NLMS) algorithm, which has to address the classical compromise between fast convergence/tracking and low misadjustment. In order to meet these conflicting requirements, the step-size of this algorithm needs to be controlled. Inspired by the pioneering work of Prof. E. Hansler and his collaborators on this fundamental topic, we present in this paper several solutions to control the adaptation of the NLMS adaptive filter. The developed algorithms are “non-parametric” in nature, i.e., they do not require any additional features to control their behavior. Simulation results indicate the good performance of the proposed solutions and support the practical applicability of these algorithms.

/pdf/an-overview-on-optimized-nlms-algorithms-for-acoustic-echo-4729nni6ef.pdf

An overview on optimized NLMS algorithms for acoustic echo cancellation

The recursive least-squares (RLS) adaptive filter is an appealing choice in many system identification problems. The main reason behind its popularity is its fast convergence rate. However, this algorithm is computationally very complex, which may make it useless for the identification of long length impulse responses, like in echo cancellation. Computationally efficient versions of the RLS algorithm, like those based on the dichotomous coordinate descent (DCD) iterations or QR decomposition techniques, reduce the complexity, but still have to face the challenges related to long length adaptive filters (e.g., convergence/tracking capabilities). In this paper, we focus on a different approach to improve the efficiency of the RLS algorithm. The basic idea is to exploit the impulse response decomposition based on the nearest Kronecker product and low-rank approximation. In other words, a high-dimension system identification problem is reformulated in terms of low-dimension problems, which are combined together. This approach was recently addressed in terms of the Wiener filter, showing appealing features for the identification of low-rank systems, like real-world echo paths. In this paper, besides the development of the RLS algorithm based on this approach, we also propose a variable regularized version of this algorithm (using the DCD method to reduce the complexity), with improved robustness to double-talk. Simulations are performed in the context of echo cancellation and the results indicate the good performance of these algorithms.

Recursive Least-Squares Algorithms for the Identification of Low-Rank Systems

The stereophonic acoustic echo is due to the coupling between two loudspeakers and two microphones. In the classical approach, this configuration is modelled by a two-input/two-output system with real random variables. In this paper, we propose to redesign this scheme as a single-input/single-output system with complex random variables. In this framework, we illustrate the behavior of some basic adaptive algorithms and present a distortion method which is more suitable for this model.

Silviu Ciochina

Papers

Proportionate Adaptive Filters From a Basis Pursuit Perspective

An overview on optimized NLMS algorithms for acoustic echo cancellation

Recursive Least-Squares Algorithms for the Identification of Low-Rank Systems

A Perspective on Stereophonic Acoustic Echo Cancellation

Adaptive filtering for the identification of bilinear forms