Bin Yang

Bio: Bin Yang is an academic researcher from University of Stuttgart. The author has contributed to research in topics: Computer science & Radar. The author has an hindex of 33, co-authored 253 publications receiving 5078 citations. Previous affiliations of Bin Yang include Princeton University & Information Technology University.

Projection approximation subspace tracking

Abstract: Subspace estimation plays an important role in a variety of modern signal processing applications. We present a new approach for tracking the signal subspace recursively. It is based on a novel interpretation of the signal subspace as the solution of a projection like unconstrained minimization problem. We show that recursive least squares techniques can be applied to solve this problem by making an appropriate projection approximation. The resulting algorithms have a computational complexity of O(nr) where n is the input vector dimension and r is the number of desired eigencomponents. Simulation results demonstrate that the tracking capability of these algorithms is similar to and in some cases more robust than the computationally expensive batch eigenvalue decomposition. Relations of the new algorithms to other subspace tracking methods and numerical issues are also discussed. >

A new approach for supervised power disaggregation by using a deep recurrent LSTM network

Abstract: This paper presents a new approach for supervised power disaggregation by using a deep recurrent long short term memory network. It is useful to extract the power signal of one dominant appliance or any subcircuit from the aggregate power signal. To train the network, a measurement of the power signal of the target appliance in addition to the total power signal during the same time period is required. The method is supervised, but less restrictive in practice since submetering of an important appliance or a subcircuit for a short time is feasible. The main advantages of this approach are: a) It is also applicable to variable load and not restricted to on-off and multi-state appliances. b) It does not require hand-engineered event detection and feature extraction. c) By using multiple networks, it is possible to disaggregate multiple appliances or subcircuits at the same time. d) It also works with a low cost power meter as shown in the experiments with the Reference Energy Disaggregation (REDD) dataset (1/3Hz sampling frequency, only real power).

High-Performance Automotive Radar: A review of signal processing algorithms and modulation schemes

Abstract: The ongoing automation of driving functions in cars results in the evolution of advanced driver assistance systems (ADAS) into ones capable of highly automated driving, which will in turn progress into fully autonomous, self-driving cars. To work properly, these functions first must be able to perceive the car's surroundings by such means as radar, lidar, camera, and ultrasound sensors. As the complexity of such systems increases along with the level of automation, the demands on environment sensors, including radar, grow as well. For radar performance to meet the requirements of self-driving cars, straightforward scaling of the radar parameters is not sufficient. To refine radar capabilities to meet more stringent requirements, fundamentally different approaches may be required, including the use of more sophisticated signal processing algorithms as well as alternative radar waveforms and modulation schemes. In addition, since radar is an active sensor (i.e., it operates by transmitting signals and evaluating their reflections) interference becomes a crucial issue as the number of automotive radar sensors increases. This article gives an overview of the challenges that arise for automotive radar from its development as a sensor for ADAS to a core component of self-driving cars. It summarizes the relevant research and discusses the following topics related to highperformance automotive radar systems: 1) shortcomings of the classical signal processing algorithms due to underlying fundamental assumptions and a signal processing framework that overcomes these limitations, 2) use of digital modulations for automotive radar, and 3) interference-mitigation methods that enable multiple radar sensors to coexist in conditions of increasing market penetration. The overview presented in this article shows that new paradigms arise as automotive radar transitions into a more powerful vehicular sensor, which provides a fertile research ground for further investigation.

Cramer-Rao bound and optimum sensor array for source localization from time differences of arrival

Abstract: This paper presents a theoretical analysis of the Cramer-Rao lower bound for source localization from time differences of arrival. We derive properties of the Cramer-Rao bound and design optimum sensor arrays which minimize the bound.

Optimization Algorithms on Matrix Manifolds

Abstract: Many problems in the sciences and engineering can be rephrased as optimization problems on matrix search spaces endowed with a so-called manifold structure. This book shows how to exploit the special structure of such problems to develop efficient numerical algorithms. It places careful emphasis on both the numerical formulation of the algorithm and its differential geometric abstraction--illustrating how good algorithms draw equally from the insights of differential geometry, optimization, and numerical analysis. Two more theoretical chapters provide readers with the background in differential geometry necessary to algorithmic development. In the other chapters, several well-known optimization methods such as steepest descent and conjugate gradients are generalized to abstract manifolds. The book provides a generic development of each of these methods, building upon the material of the geometric chapters. It then guides readers through the calculations that turn these geometrically formulated methods into concrete numerical algorithms. The state-of-the-art algorithms given as examples are competitive with the best existing algorithms for a selection of eigenspace problems in numerical linear algebra. Optimization Algorithms on Matrix Manifolds offers techniques with broad applications in linear algebra, signal processing, data mining, computer vision, and statistical analysis. It can serve as a graduate-level textbook and will be of interest to applied mathematicians, engineers, and computer scientists.

Principal component analysis

Abstract: Principal component analysis is one of the most important and powerful methods in chemometrics as well as in a wealth of other areas. This paper provides a description of how to understand, use, and interpret principal component analysis. The paper focuses on the use of principal component analysis in typical chemometric areas but the results are generally applicable.