Energy disaggregation is the task of segregating the aggregate energy of the entire building (as logged by the smart-meter) into the energy consumed by individual appliances. This is a single channel (the only channel being the smart-meter) blind source (different electrical appliances) separation problem. The traditional way to address this is via stochastic finite state machines (e.g., factorial hidden Markov model). In recent times, dictionary learning-based approaches have shown promise in addressing the disaggregation problem. The usual technique is to learn a dictionary for every device and use the learned dictionaries as basis for blind source separation during disaggregation. Prior studies in this area are shallow learning techniques, i.e., they learn a single layer of dictionary for every device. In this paper, we propose a deep learning approach-instead of learning one level of dictionary, we learn multiple layers of dictionaries for each device. These multi-level dictionaries are used as a basis for source separation during disaggregation. Results on two benchmark datasets and one actual implementation show that our method outperforms state-of-the-art techniques.
12 June 2018 in IEEE Transactions on Neural Networks and Learning Systems
The term “blind denoising” refers to the fact that the basis used for denoising is learned from the noisy sample itself during denoising. Dictionary learning- and transform learning-based formulations for blind denoising are well known. But there has been no autoencoder-based solution for the said blind denoising approach. So far, autoencoder-based denoising formulations have learned the model on a separate training data and have used the learned model to denoise test samples. Such a methodology fails when the test image (to denoise) is not of the same kind as the models learned with. This will be the first work, where we learn the autoencoder from the noisy sample while denoising. Experimental results show that our proposed method performs better than dictionary learning (K-singular value decomposition), transform learning, sparse stacked denoising autoencoder, and the gold standard BM3D algorithm.
21 August 2020 in IEEE Transactions on Power Systems
In this work we address the problem of short-term load forecasting. We propose a generalization of the linear state-space model where the evolution of the state and the observation matrices is unknown. The proposed blind Kalman filter algorithm proceeds via alternating the estimation of these unknown matrices and the inference of the state, within the framework of expectation-maximization. A mini-batch processing strategy is introduced to allow on-the-fly forecasting. The experimental results show that the proposed method outperforms the state-of-the-art techniques by a considerable margin, both on load profile estimation and peak load forecast problems.
Currently there are several well-known approaches to non-intrusive appliance load monitoring-rule based, stochastic finite state machines, neural networks, and sparse coding. Recently several studies have proposed a new approach based on multi-label classification. Different appliances are treated as separate classes, and the task is to identify the classes given the aggregate smart-meter reading. Prior studies in this area have used off-the-shelf algorithms like multi label K nearest neighbor and random K-label sets to address this problem. In this paper, we propose a deep learning-based technique. There are hardly any studies in deep learning based multi-label classification; two new deep learning techniques to solve the said problem are fundamental contributions of this paper. These are deep dictionary learning and deep transform learning. Thorough experimental results on benchmark datasets show marked improvement over existing studies.
This work addresses the problem of real-time online reconstruction of dynamic magnetic resonance imaging sequences. The proposed method reconstructs the difference between the previous and the current image frames. This difference image is sparse. We recover the sparse difference image from its partial k-space scans by using a nonconvex compressed sensing algorithm. As there was no previous fast enough algorithm for real-time reconstruction, we derive a novel algorithm for this purpose. Our proposed method has been compared against state-of-the-art offline and online reconstruction methods. The accuracy of the proposed method is less than offline methods but noticeably higher than the online techniques. For real-time reconstruction we are also concerned about the reconstruction speed. Our method is capable of reconstructing 128 × 128 images at the rate of 6 frames/s, 180 × 180 images at the rate of 5 frames/s and 256 × 256 images at the rate of 2.5 frames/s.