Radio Location of Partial Discharge Sources: A Support Vector Regression Approach

Partial discharge (PD) can provide a useful forewarning of asset failure in electricity substations. A significant proportion of assets are susceptible to PD due to incipient weakness in their dielectrics. This paper examines a low cost approach for uninterrupted monitoring of PD using a network of inexpensive radio sensors to sample the spatial patterns of PD received signal strength. Machine learning techniques are proposed for localisation of PD sources. Specifically, two models based on Support Vector Machines (SVMs) are developed: Support Vector Regression (SVR) and Least-Squares Support Vector Regression (LSSVR). These models construct an explicit regression surface in a high dimensional feature space for function estimation. Their performance is compared to that of artificial neural network (ANN) models. The results show that both SVR and LSSVR methods are superior to ANNs in accuracy. LSSVR approach is particularly recommended as practical alternative for PD source localisation due to it low complexity

Robust Rotation Synchronization via Low-rank and Sparse Matrix Decomposition

This paper deals with the rotation synchronization problem, which arises in global registration of 3D point-sets and in structure from motion. The problem is formulated in an unprecedented way as a "low-rank and sparse" matrix decomposition that handles both outliers and missing data. A minimization strategy, dubbed R-GoDec, is also proposed and evaluated experimentally against state-of-the-art algorithms on simulated and real data. The results show that R-GoDec is the fastest among the robust algorithms.Comment: The material contained in this paper is part of a manuscript submitted to CVI

Adaptive 3D facial action intensity estimation and emotion recognition

Automatic recognition of facial emotion has been widely studied for various computer vision tasks (e.g. health monitoring, driver state surveillance and personalized learning). Most existing facial emotion recognition systems, however, either have not fully considered subject-independent dynamic features or were limited to 2D models, thus are not robust enough for real-life recognition tasks with subject variation, head movement and illumination change. Moreover, there is also lack of systematic research on effective newly arrived novel emotion class detection. To address these challenges, we present a real-time 3D facial Action Unit (AU) intensity estimation and emotion recognition system. It automatically selects 16 motion-based facial feature sets using minimal-redundancy–maximal-relevance criterion based optimization and estimates the intensities of 16 diagnostic AUs using feedforward Neural Networks and Support Vector Regressors. We also propose a set of six novel adaptive ensemble classifiers for robust classification of the six basic emotions and the detection of newly arrived unseen novel emotion classes (emotions that are not included in the training set). A distance-based clustering and uncertainty measures of the base classifiers within each ensemble model are used to inform the novel class detection. Evaluated with the Bosphorus 3D database, the system has achieved the best performance of 0.071 overall Mean Squared Error (MSE) for AU intensity estimation using Support Vector Regressors, and 92.2% average accuracy for the recognition of the six basic emotions using the proposed ensemble classifiers. In comparison with other related work, our research outperforms other state-of-the-art research on 3D facial emotion recognition for the Bosphorus database. Moreover, in on-line real-time evaluation with real human subjects, the proposed system also shows superior real-time performance with 84% recognition accuracy and great flexibility and adaptation for newly arrived novel (e.g. ‘contempt’ which is not included in the six basic emotions) emotion detection

Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig

Advanced Optimization and Data-Driven Control in Smart Grid

The power grids are continuously evolving over the past decades, where new challenges and opportunities are embraced at the same time. On one hand, the penetration of renewable generations and other distributed energy resources (DER) is growing rapidly, whose different generation and control patterns could significantly impact the daily operation. On the other hand, the new communication, monitoring and regulating devices are gradually installed, which enable more control abilities of the generations, demands, and grids, and the feasibility to deploy more sophisticated control schemes.To leverage the new technique and overcome the new challenges in the smart girds, different optimization and control problems need to be solved for different roles including the system operator, demand, and financial traders. For the system operators, it is critical to maximizing the total social welfare while satisfying the operational constraints. To better coordinate the DER and improve the efficiency of distribution systems, the three-phase optimal power flow (OPF) problem algorithms are developed including the DCOPF algorithm for robustness and the ACOPF algorithm for optimality. Moreover, the deep reinforcement learning-based Volt-VAR control schemes are proposed to better maintain the voltage stability and electricity service quality.For demands resources, minimizing their energy bills will satisfy the energy needs is always their goal. Providing ancillary services by proactively adjusting their total demand is one of the potential choices. Through the provision of the services, the demands can not only receiving incentives from the system operators but also help to improve the reliability and stability of power grids. We develop control schemes specifically for the data centers to provide the phase balancing service in the distribution system and the frequency regulation service in the transmission system. The financial traders, it is desired to maximize their total profits. A better trading strategy with a more accurate forecast model can help increase the traders' gain and further improve the price convergence of the electricity market. Our machine learning based trading framework outperforms the existing approach and lays the foundation for market efficiency evaluation across the markets

Eigenvector Synchronization, Graph Rigidity and the Molecule Problem

The graph realization problem has received a great deal of attention in recent years, due to its importance in applications such as wireless sensor networks and structural biology. In this paper, we extend on previous work and propose the 3D-ASAP algorithm, for the graph realization problem in $\mathbb{R}^3$, given a sparse and noisy set of distance measurements. 3D-ASAP is a divide and conquer, non-incremental and non-iterative algorithm, which integrates local distance information into a global structure determination. Our approach starts with identifying, for every node, a subgraph of its 1-hop neighborhood graph, which can be accurately embedded in its own coordinate system. In the noise-free case, the computed coordinates of the sensors in each patch must agree with their global positioning up to some unknown rigid motion, that is, up to translation, rotation and possibly reflection. In other words, to every patch there corresponds an element of the Euclidean group Euc(3) of rigid transformations in $\mathbb{R}^3$, and the goal is to estimate the group elements that will properly align all the patches in a globally consistent way. Furthermore, 3D-ASAP successfully incorporates information specific to the molecule problem in structural biology, in particular information on known substructures and their orientation. In addition, we also propose 3D-SP-ASAP, a faster version of 3D-ASAP, which uses a spectral partitioning algorithm as a preprocessing step for dividing the initial graph into smaller subgraphs. Our extensive numerical simulations show that 3D-ASAP and 3D-SP-ASAP are very robust to high levels of noise in the measured distances and to sparse connectivity in the measurement graph, and compare favorably to similar state-of-the art localization algorithms.Comment: 49 pages, 8 figure