77,121 research outputs found
Energy Disaggregation Using Elastic Matching Algorithms
© 2020 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/)In this article an energy disaggregation architecture using elastic matching algorithms is presented. The architecture uses a database of reference energy consumption signatures and compares them with incoming energy consumption frames using template matching. In contrast to machine learning-based approaches which require significant amount of data to train a model, elastic matching-based approaches do not have a model training process but perform recognition using template matching. Five different elastic matching algorithms were evaluated across different datasets and the experimental results showed that the minimum variance matching algorithm outperforms all other evaluated matching algorithms. The best performing minimum variance matching algorithm improved the energy disaggregation accuracy by 2.7% when compared to the baseline dynamic time warping algorithm.Peer reviewedFinal Published versio
Analysis and Forecasting of Trending Topics in Online Media Streams
Among the vast information available on the web, social media streams capture
what people currently pay attention to and how they feel about certain topics.
Awareness of such trending topics plays a crucial role in multimedia systems
such as trend aware recommendation and automatic vocabulary selection for video
concept detection systems.
Correctly utilizing trending topics requires a better understanding of their
various characteristics in different social media streams. To this end, we
present the first comprehensive study across three major online and social
media streams, Twitter, Google, and Wikipedia, covering thousands of trending
topics during an observation period of an entire year. Our results indicate
that depending on one's requirements one does not necessarily have to turn to
Twitter for information about current events and that some media streams
strongly emphasize content of specific categories. As our second key
contribution, we further present a novel approach for the challenging task of
forecasting the life cycle of trending topics in the very moment they emerge.
Our fully automated approach is based on a nearest neighbor forecasting
technique exploiting our assumption that semantically similar topics exhibit
similar behavior.
We demonstrate on a large-scale dataset of Wikipedia page view statistics
that forecasts by the proposed approach are about 9-48k views closer to the
actual viewing statistics compared to baseline methods and achieve a mean
average percentage error of 45-19% for time periods of up to 14 days.Comment: ACM Multimedia 201
Model Reduction for Aperiodically Sampled Data Systems
Two approaches to moment matching based model reduction of aperiodically
sampled data systems are given. The term "aperiodic sampling" is used in the
paper to indicate that the time between two consecutive sampling instants can
take its value from a pre-specified finite set of allowed sampling intervals.
Such systems can be represented by discrete-time linear switched (LS) state
space (SS) models. One of the approaches investigated in the paper is to apply
model reduction by moment matching on the linear time-invariant (LTI) plant
model, then compare the responses of the LS SS models acquired from the
original and reduced order LTI plants. The second approach is to apply a moment
matching based model reduction method on the LS SS model acquired from the
original LTI plant, and then compare the responses of the original and reduced
LS SS models. It is proven that for both methods, as long as the original LTI
plant is stable, the resulting reduced order LS SS model of the sampled data
system is quadratically stable. The results from two approaches are compared
with numerical examples
Moment Matching Based Model Reduction for LPV State-Space Models
We present a novel algorithm for reducing the state dimension, i.e. order, of
linear parameter varying (LPV) discrete-time state-space (SS) models with
affine dependence on the scheduling variable. The input-output behavior of the
reduced order model approximates that of the original model. In fact, for input
and scheduling sequences of a certain length, the input-output behaviors of the
reduced and original model coincide. The proposed method can also be
interpreted as a reachability and observability reduction (minimization)
procedure for LPV-SS representations with affine dependence
Supervised learning on graphs of spatio-temporal similarity in satellite image sequences
High resolution satellite image sequences are multidimensional signals
composed of spatio-temporal patterns associated to numerous and various
phenomena. Bayesian methods have been previously proposed in (Heas and Datcu,
2005) to code the information contained in satellite image sequences in a graph
representation using Bayesian methods. Based on such a representation, this
paper further presents a supervised learning methodology of semantics
associated to spatio-temporal patterns occurring in satellite image sequences.
It enables the recognition and the probabilistic retrieval of similar events.
Indeed, graphs are attached to statistical models for spatio-temporal
processes, which at their turn describe physical changes in the observed scene.
Therefore, we adjust a parametric model evaluating similarity types between
graph patterns in order to represent user-specific semantics attached to
spatio-temporal phenomena. The learning step is performed by the incremental
definition of similarity types via user-provided spatio-temporal pattern
examples attached to positive or/and negative semantics. From these examples,
probabilities are inferred using a Bayesian network and a Dirichlet model. This
enables to links user interest to a specific similarity model between graph
patterns. According to the current state of learning, semantic posterior
probabilities are updated for all possible graph patterns so that similar
spatio-temporal phenomena can be recognized and retrieved from the image
sequence. Few experiments performed on a multi-spectral SPOT image sequence
illustrate the proposed spatio-temporal recognition method
- …