Vladimir Stankovic

Prof. Vladimir Stankovic

University of Strathclyde, U.K
orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
5 January 2017 in Scientific Data
Verified
Journal Article
Open access
DMDavid Murray
David Murray
LSLina Stankovic
Lina Stankovic
VSVladimir Stankovic
Vladimir Stankovic
Smart meter roll-outs provide easy access to granular meter measurements, enabling advanced energy services, ranging from demand response measures, tailored energy feedback and smart home/building automation. To design such services, train and validate models, access to data that resembles what is expected of smart meters, collected in a real-world setting, is necessary. The REFIT electrical load measurements dataset described in this paper includes whole house aggregate loads and nine individual appliance measurements at 8-second intervals per house, collected continuously over a period of two years from 20 houses. During monitoring, the occupants were conducting their usual routines. At the time of publishing, the dataset has the largest number of houses monitored in the United Kingdom at less than 1-minute intervals over a period greater than one year. The dataset comprises 1,194,958,790 readings, that represent over 250,000 monitored appliance uses. The data is accessible in an easy-to-use comma-separated format, is time-stamped and cleaned to remove invalid measurements, correctly label appliance data and fill in small gaps of missing data.

5 April 2023 in Sensors
Verified
Journal Article
Open access
PDF file
DHDong Han
Dong Han
BMBeni Mulyana
Beni Mulyana
VSVladimir Stankovic
Vladimir Stankovic
SCSamuel Cheng
Samuel Cheng
Robotic manipulation challenges, such as grasping and object manipulation, have been tackled successfully with the help of deep reinforcement learning systems. We give an overview of the recent advances in deep reinforcement learning algorithms for robotic manipulation tasks in this review. We begin by outlining the fundamental ideas of reinforcement learning and the parts of a reinforcement learning system. The many deep reinforcement learning algorithms, such as value-based methods, policy-based methods, and actor–critic approaches, that have been suggested for robotic manipulation tasks are then covered. We also examine the numerous issues that have arisen when applying these algorithms to robotics tasks, as well as the various solutions that have been put forth to deal with these issues. Finally, we highlight several unsolved research issues and talk about possible future directions for the subject.

9 August 2016 in IEEE Transactions on Smart Grid
Verified
Journal Article
Closed access
KHKanghang He
Kanghang He
LSLina Stankovic
Lina Stankovic
JLJing Liao
Jing Liao
VSVladimir Stankovic
Vladimir Stankovic
With the large-scale roll-out of smart metering worldwide, there is a growing need to account for the individual contribution of appliances to the load demand. In this paper, we design a graph signal processing (GSP)-based approach for non-intrusive appliance load monitoring (NILM), i.e., disaggregation of total energy consumption down to individual appliances used. Leveraging piecewise smoothness of the power load signal, two GSP-based NILM approaches are proposed. The first approach, based on total graph variation minimization, searches for a smooth graph signal under known label constraints. The second approach uses the total graph variation minimizer as a starting point for further refinement via simulated annealing. The proposed GSP-based NILM approach aims to address the large training overhead and associated complexity of conventional graph-based methods through a novel event-based graph approach. Simulation results using two datasets of real house measurements demonstrate the competitive performance of the GSP-based approaches with respect to traditionally used hidden Markov model-based and decision tree-based approaches.

21 April 2016 in IEEE Access
Verified
Journal Article
Open access
BZBochao Zhao
Bochao Zhao
LSLina Stankovic
Lina Stankovic
VSVladimir Stankovic
Vladimir Stankovic
With ongoing large-scale smart energy metering deployments worldwide, disaggregation of a household's total energy consumption down to individual appliances using analytical tools, also known as non-intrusive appliance load monitoring (NALM), has generated increased research interest lately. NALM can deepen energy feedback, support appliance retrofit advice, and support home automation. However, despite the fact that NALM was proposed over 30 years ago, there are still many open challenges with respect to its practicality and effectiveness at low sampling rates. Indeed, the majority of NALM approaches, supervised or unsupervised, require training to build appliance models, and are sensitive to appliance changes in the house, thus requiring regular re-training. In this paper, we tackle this challenge by proposing an NALM approach that does not require any training. The main idea is to build upon the emerging field of graph signal processing to perform adaptive thresholding, signal clustering, and pattern matching. We determine the performance limits of our approach and demonstrate its usefulness in practice. Using two open access datasets-the US REDD data set with active power measurements downsampled to 1 min resolution and the UK REFIT data set with 8-s resolution, we demonstrate the effectiveness of the proposed method for typical smart meter sampling rate, with the state-of-the-art supervised and unsupervised NALM approaches as benchmarks.

11 September 2009 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
Dejan VukobratovicDejan Vukobratovic
Dejan Vukobratovic
VSVladimir Stankovic
Vladimir Stankovic
DSDino Sejdinovic
Dino Sejdinovic
LSLina Stankovic
Lina Stankovic
ZXZixiang Xiong
Zixiang Xiong
Fountain codes were introduced as an efficient and universal forward error correction (FEC) solution for data multicast over lossy packet networks. They have recently been proposed for large scale multimedia content delivery in practical multimedia distribution systems. However, standard fountain codes, such as LT or Raptor codes, are not designed to meet unequal error protection (UEP) requirements typical in real-time scalable video multicast applications. In this paper, we propose recently introduced UEP expanding window fountain (EWF) codes as a flexible and efficient solution for real-time scalable video multicast. We demonstrate that the design flexibility and UEP performance make EWF codes ideally suited for this scenario, i.e., EWF codes offer a number of design parameters to be ldquotunedrdquo at the server side to meet the different reception criteria of heterogeneous receivers. The performance analysis using both analytical results and simulation experiments of H.264 scalable video coding (SVC) multicast to heterogeneous receiver classes confirms the flexibility and efficiency of the proposed EWF-based FEC solution.

3 April 2006 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
VSVladimir Stankovic
Vladimir Stankovic
ALA.D. Liveris
A.D. Liveris
ZXZixiang Xiong
Zixiang Xiong
CGC.N. Georghiades
C.N. Georghiades
A Slepian-Wolf coding scheme for compressing two uniform memoryless binary sources using a single channel code that can achieve arbitrary rate allocation among encoders was outlined in the work of Pradhan and Ramchandran. Inspired by this work, we address the problem of practical code design for general multiterminal lossless networks where multiple memoryless correlated binary sources are separately compressed and sent; each decoder receives a set of compressed sources and attempts to jointly reconstruct them. First, we propose a near-lossless practical code design for the Slepian-Wolf system with multiple sources. For two uniform sources, if the code approaches the capacity of the channel that models the correlation between the sources, then the system will approach the theoretical limit. Thus, the great advantage of this design method is its possibility to approach the theoretical limits with a single channel code for any rate allocation among the encoders. Based on Slepian-Wolf code constructions, we continue with providing practical designs for the general lossless multiterminal network which consists of an arbitrary number of encoders and decoders. Using irregular repeat-accumulate and turbo codes in our designs, we obtain the best results reported so far and almost reach the theoretical bounds.