TY - GEN

T1 - On the relevance of discrepancy norm for similarity-based clustering of delta-event sequences

AU - Moser, B.

AU - Eibensteiner, F.

AU - Kogler, J.

AU - Stübl, Gernot

N1 - Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.

PY - 2013

Y1 - 2013

N2 - In contrast to sampling a signal at equidistant points in time the on-delta-send sampling principle relies on discretizing the signal due to equidistant points in the range. On-delta-send sampling is encountered in asynchronous event-based data acquisition of wireless sensor networks in order to reduce the amount of data transfer, in event-based imaging in order to realize high-dynamic range image acquisition or, via the integrate-And-fire principle, in biology in terms of neuronal spike trains. It turns out that the set of event sequences that result from a bounded set of signals by applying on-delta-send sampling can be characterized by means of the ball with respect to the so-called discrepancy norm as metric. This metric relies on a maximal principle that evaluates intervals of maximal partial sums. It is discussed how this property can be used to construct novel matching algorithms for such sequences. Simulations based on test signals show its pontential above all regarding robustness.

AB - In contrast to sampling a signal at equidistant points in time the on-delta-send sampling principle relies on discretizing the signal due to equidistant points in the range. On-delta-send sampling is encountered in asynchronous event-based data acquisition of wireless sensor networks in order to reduce the amount of data transfer, in event-based imaging in order to realize high-dynamic range image acquisition or, via the integrate-And-fire principle, in biology in terms of neuronal spike trains. It turns out that the set of event sequences that result from a bounded set of signals by applying on-delta-send sampling can be characterized by means of the ball with respect to the so-called discrepancy norm as metric. This metric relies on a maximal principle that evaluates intervals of maximal partial sums. It is discussed how this property can be used to construct novel matching algorithms for such sequences. Simulations based on test signals show its pontential above all regarding robustness.

UR - http://www.scopus.com/inward/record.url?scp=84892572189&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-53856-8-11

DO - 10.1007/978-3-642-53856-8-11

M3 - Conference contribution

AN - SCOPUS:84892572189

SN - 9783642538551

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 84

EP - 91

BT - Computer Aided Systems Theory, EUROCAST 2013 - 14th International Conference, Revised Selected Papers

T2 - 14th International Conference on Computer Aided Systems Theory, Eurocast 2013

Y2 - 10 February 2013 through 15 February 2013

ER -