We consider the problem of designing spectral graph filters for the construction of dictionaries of atoms that can be used to efficiently represent signals residing on weighted graphs. While the filters used in previous spectral graph wavelet constructions are only adapted to the length of the spectrum, the filters proposed in this paper are adapted to the distribution of graph Laplacian eigenvalues, and therefore lead to atoms with better discriminatory power. Our approach is to first characterize a family of systems of uniformly translated kernels in the graph spectral domain that give rise to tight frames of atoms generated via generalized translation on the graph. We then warp the uniform translates with a function that approximates the cumulative spectral density function of the graph Laplacian eigenvalues.We use this approach to construct computationally efficient, spectrum-adapted, tight vertex-frequency and graph wavelet frames. We give numerous examples of the resulting spectrum-adapted graph filters, and also present an illustrative example of vertex-frequency analysis using the proposed construction.

No abstract

No abstract

In the context of railway safety, it is crucial to know the positions of all trains moving along the infrastructure. In this contribution, we present an algorithm that extracts the positions of moving trains for a given point in time from Distributed Acoustic Sensing (DAS) signals. These signals are obtained by injecting light pulses into an optical fiber close to the railway tracks and measuring the Rayleigh backscatter. We show that the vibrations of moving objects can be identified and tracked in real-time yielding train positions every second. To speed up the algorithm, we describe how the calculations can partly be based on graphical processing units. The tracking quality is assessed by counting the inaccurate and lost train tracks for two different types of cable installations.

We deduce a simple representation and the invariant factor decompositions of the subgroups of the group Z m × Z n , where m and n are arbitrary positive integers. We obtain formulas for the total number of subgroups and the number of subgroups of a given order.