Bastian Seifert

Bastian Seifert

Auto-generated profile, based on publicly available information

Bastian Seifert

Faculty of Engineering Sciences, Ansbach University of Applied Sciences, Ansbach, Germany

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
25 October 2023 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
BSBastian Seifert
Bastian Seifert
CWChris Wendler
Chris Wendler
MPMarkus Püschel
Markus Püschel
We present a novel form of Fourier analysis, and associated signal processing concepts, for signals (or data) indexed by edge-weighted directed acyclic graphs (DAGs). This means that our Fourier basis yields an eigendecomposition of a suitable notion of shift and convolution operators that we define. DAGs are the common model to capture causal relationships between data values and in this case our proposed Fourier analysis relates data with its causes under a linearity assumption that we define. The definition of the Fourier transform requires the transitive closure of the weighted DAG for which several forms are possible depending on the interpretation of the edge weights. Examples include level of influence, distance, or pollution distribution. Our framework is specific to DAGs and leverages, and extends, the classical theory of Moebius inversion from combinatorics. For a prototypical application we consider the reconstruction of signals from samples assuming Fourier-sparsity, i.e., few causes. In particular, we consider DAGs modeling dynamic networks in which edges change over time. We model the spread of an infection on such a DAG obtained from real-world contact tracing data and learn the infection signal from samples.

15 January 2021 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
BSBastian Seifert
Bastian Seifert
MPMarkus Puschel
Markus Puschel

18 May 2021 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
MPMarkus Puschel
Markus Puschel
BSBastian Seifert
Bastian Seifert
CWChris Wendler
Chris Wendler
A lattice is a partially ordered set supporting a meet (join) operation that returns the largest lower bound (smallest upper bound) of two elements. Just like graphs, lattices are a fundamental structure that occurs across domains including social data analysis, natural language processing, computational chemistry and biology, and database theory. In this paper we introduce discrete-lattice signal processing (DLSP), an SP framework for data, or signals, indexed by such lattices. We use the meet (or join) to define a shift operation and derive associated notions of filtering, Fourier basis and transform, and frequency response. We show that the spectrum of a lattice signal inherits the lattice structure of the signal domain and derive a sampling theorem. Finally, we show two prototypical applications: spectral analysis of formal concept lattices in social science and sampling and Wiener filtering on multiset lattices in combinatorial auctions. Formal concept lattices are a representation of relations between objects and attributes. Since relations are equivalent to bipartite graphs and hypergraphs, DLSP offers a form of Fourier analysis for these structures.

1 September 2018
Verified
Conference Paper
Closed access
BSBastian Seifert
Bastian Seifert
KKKatharina Korn
Katharina Korn
SHSteffen Hartmann
Steffen Hartmann
CUChristian Uhl
Christian Uhl
Multivariate signal processing is often based on dimensionality reduction techniques. We propose a new method, Dynamical Component Analysis (DyCA), leading to a classification of the underlying dynamics and - for a certain type of dynamics - to a signal subspace representing the dynamics of the data. In this paper the algorithm is derived leading to a generalized eigenvalue problem of correlation matrices. The application of the DyCA on high-dimensional chaotic signals is presented both for simulated data as well as real EEG data of epileptic seizures.

16 November 2020 in IEEE Open Journal of Signal Processing
Verified
Journal Article
Open access
CUChristian Uhl
Christian Uhl
MKMoritz Kern
Moritz Kern
MWMonika Warmuth
Monika Warmuth
BSBastian Seifert
Bastian Seifert
The decomposition of a multivariate signal is an important tool for the analysis of measured or simulated data leading to possible detection of the relevant subspace or the sources of the signal. A new method - dynamical component analysis (DyCA) - is based on modeling the signal by a set of coupled ordinary differential equations. Its derivation and its features are presented in-depth. The corresponding algorithm is nearly as simple as principal component analysis (PCA). The results obtained by DyCA however yield a deeper insight into the underlying dynamics of the data. To illustrate the broad area of possible applications a set of examples of analyzing data by DyCA is presented - involving both measured EEG, motion and ECG data as well as data obtained from stochastic differential equations. Thereby our alternative tool for dimensionality reduction is compared to results obtained PCA and ICA and demonstrate the gain of this approach.

29 November 2018 in Frontiers in Applied Mathematics and Statistics
Verified
Journal Article
Open access
PDF file
BSBastian Seifert
Bastian Seifert
DADennis Adamski
Dennis Adamski
CUChristian Uhl
Christian Uhl
Dynamical Systems Based Modeling (DSBM) is a method to decompose a multivariate signal leading to both a dimensionality reduction and parameter estimation describing the dynamics of the signal. We present this method and its application to EEG data sets of Petit-Mal epilepsies considering Shilnikov chaos as the underlying dynamic interaction. We demonstrate the power of this method compared to conventional decomposition methods like PCA and ICA. Since the fitting quality showed a strong correlation to the ictal phases of the signal, we performed a cross validation on seizure detection with a resulting specifity of 84% and sensitivity of 75%. By applying DSBM in a moving window setup we investigated the comparability of the obtained dynamic models and tested the hypothesis of Shilnikov chaos in terms of linear stability analysis for each of the investigated windows. Thereby we could corroborate the Shilnikov hypothesis for approx. 50% of the relevant windows.