Study shows DL models trained on healthy subjects perform worse on patients' ECG data.
problem Inefficiency of DL models on heterogeneous datasets for heart beat detection.
method Investigated and evaluated the use of Transfer Learning to adapt DL models to different datasets.
result Transfer Learning improves classification performance on small sample size datasets.
Boosts models to detect synchronisation between EEG and EMG data.
problem Understanding the functional relationship between EEG and EMG during emotion episodes.
method Applied historical function-on-function regression models with gradient boosting algorithm.
result Improved models for detecting synchronisation in bioelectrical signals.
Paper establishes a comprehensive benchmark for ECG time-series analysis.
problem Incomplete understanding of ECG signal properties and limitations in evaluation metrics.
method Categorization of downstream applications, identification of limitations, introduction of a novel metric, benchmarking of time-series models.
result Validation of the effectiveness of the proposed metric and model architecture.
Proposes a new model for DBS electric field dynamics.
problem Inaccurate static models for DBS therapeutic results.
method Hybrid approach using Gaussian processes and wave equation, avoiding quasi-static approximation.
result Model accurately describes dynamic behavior of DBS and solves inverse problems.
A new geometry for comparing signals, overcoming traditional limitations.
problem Comparing and interpolating discontinuous and signed signals.
method Investigation of Riemannian geometry on signal space, introducing a metric that measures both horizontal and vertical deformations.
result Characterization of metric properties and establishment of geodesic regularity and stability.
This work uses encoder-decoder networks to denoise one-dimensional signals by aligning clean and noisy signal latent representations.
problem Noise removal in one-dimensional signals, especially in medical and motion signals.
method Encoder-decoder architecture with adversarial learning to align clean and noisy signal latent representations.
result Better performance on electrocardiogram and motion signal denoising compared to learning-based and non-learning approaches.
Paper proposes efficient methods for clustering and signal recovery in high-dimensional data with block structures.
problem High-dimensional clustering and signal recovery under block signal structures.
method CFA-PCA and MA-PCA methods for sparse and dense block signals.
result Proposed methods achieve computational minimax optimality for clustering and signal recovery.
Paper presents a unique method to recover signals from their bispectrum.
problem Retrieving signals accurately from their bispectrum.
method Two-step trust region algorithm that minimizes a non-convex objective function.
result Signals with finite spectral or temporal support can be recovered from at least 3B measurements of their bispectrum.
Deep invertible networks decode EEG signals better than chance.
problem Decoding brain signals from EEG data.
method Deep invertible networks for generating and classifying brain signals.
result Deep invertible networks generate realistic EEG signals and classify novel signals above chance.
Proposes a novel graph signal model using narrowband kernels.
problem Graph signals with multiple concentrated frequency regions.
method Jointly learns graph signal model parameters and coefficients.
result Joint learning improves signal interpolation accuracy.
Generative adversarial network improves signal reconstruction from magnitude spectrograms.
problem Reconstructing a time-domain signal from a magnitude spectrogram.
method Deep neural network and generative adversarial network approach.
result Our method reconstructs signals faster with higher quality than the Griffin-Lim method.
New framework models graph signals as distribution-valued signals in Wasserstein space.
problem Limitations of classical vector-based GSP, including synchronous observations and uncertainty.
method Introduces graph distribution-valued signals (GDSs) in the Wasserstein space.
result GDSs naturally encode uncertainty and stochasticity, generalizing traditional graph signals.
Paper automates substation signal matching using machine learning.
problem Manual matching of customer data with substation signal names.
method Bagged token classifier that votes on signal names based on customer data.
result The method outperforms standard classifiers in accuracy and efficiency.
New algorithms improve signal processing in federated learning.
problem Efficiently process distributed signal samples with privacy and communication constraints.
method Proposes overpredictive signal approximations using convex optimization.
result Quantifies tradeoffs between communication cost, sampling rate, and approximation error.
We consider the problem of signal recovery on graphs as graphs model data with complex structure as signals on a graph. Graph signal recovery implies recovery of one or multiple smooth graph signals from noisy, corrupted, or incomplete measurements. We propose a graph signal model and formulate signal recovery as a cor…
Improved language identification accuracy through signal combination methods.
problem Enhancing speech recognition accuracy across multiple languages.
method Combining low-level acoustic signals with language-specific recognizer signals using lattice-based ensemble models and deep neural networks.
result Deep neural network model outperforms lattice-based ensemble model, reducing error rate from 5.5% to 4.3%.
Proposes a new signal model for high-dimensional, small-sample-size data.
problem Signal detection in high-dimensional, small-sample-size datasets.
method Intrinsic signal model based on dynamical system assumption.
result Taguchi method effectively detects signals in the proposed model.
This paper reconstructs complex graph signals using kernel methods on manifolds.
problem Reconstructing complex graph signals from samples on graph vertices.
method Kernel methods on complex manifolds, embedding vertices into higher-dimensional spaces.
result Effective reconstruction of complex graph signals, outperforming conventional methods.
Study on signal-plus-noise decomposition in nonlinear spiked random matrices.
problem Nonlinear spiked random matrix models with rank-one signal and noise.
method Signal-plus-noise decomposition and phase transition analysis.
result Identified precise phase transitions in signal components at critical thresholds.
We find ways to make physical signals misclassified by computer vision models.
problem Vulnerability of signal classifiers to adversarial perturbations in physical signals.
method Solving PDE-constrained optimization problems to construct imperceptible perturbations.
result Effective and physically realizable adversarial perturbations can be computed for machine learning models.
New model resolves signal ambiguities in ill-posed systems.
problem Signal retrieval from indirect measurements with known models.
method Variational generative model that captures signal distribution.
result Retrieves consistent signals with high fidelity.
Unified deep learning for graph signals, simplifying existing models.
problem Efficiency of Convolutional Neural Networks on graph signals.
method Unified formalism for existing deep learning models on graph signals.
result Unified formalism simplifies and compares existing models.
GPMM recovers latent signals from noisy mixtures using Bayesian inference.
problem Recovering latent signals from noisy mixed measurements.
method Gaussian process mixture of measurements (GPMM) with Bayesian inference.
result GPMM outperforms standard GP in signal recovery.
Improved extreme learning machines for graph signal regression.
problem Regression tasks with graph signals and limited/noisy data.
method Graph signal processing regularization for smoothness.
result Regularization improves prediction accuracy with limited data.
Optimizes signal detection in particle physics by decorrelating classifiers.
problem Systematic errors in background models can mislead signal detection.
method Use optimal transport to decorrelate classifiers from protected variables, then apply semiparametric mixture model.
result Decorrelation and signal enrichment improve the stability, robustness, and power of signal detection tests.
Paper improves signal proportion estimation by accounting for variable dependence.
problem Traditional estimators assume independence, limiting applicability in real-world scenarios.
method Integrates arbitrary covariance dependence information using principal factor approximation.
result Method outperforms state-of-the-art estimators in accuracy and detection of weaker signals.
Signal recovery is one of the key techniques of Compressive sensing (CS). It reconstructs the original signal from the linear sub-Nyquist measurements. Classical methods exploit the sparsity in one domain to formulate the L0 norm optimization. Recent investigation shows that some signals are sparse in multiple domains.…
Detects missing tensor signals in a KS subspace with high probability.
problem Detecting tensor signals with many missing entities in a KS subspace.
method Projecting the signal onto the KS subspace and bounding residual energy.
result Reliable detection is possible if the missing signal cardinality exceeds KS subspace dimensions.
GAN-based spoofing attacks improve wireless signal authentication.
problem Improving wireless signal authentication against sophisticated spoofing attacks.
method Generative Adversarial Network (GAN) for generating synthetic signals.
result GAN-based spoofing attacks significantly increase the success probability of wireless signal spoofing.
SMSSVD simplifies biomedical signal decomposition without parameters.
problem Identifying and separating overlaid signals from technical artefacts.
method Unsupervised, parameter-free Singular Value Decomposition (SMSSVD) for denoising and signal representation.
result SMSSVD outperforms existing methods like PCA and SPC in real and synthetic datasets.
Goal: This paper deals with the problems that some EEG signals have no good sparse representation and single channel processing is not computationally efficient in compressed sensing of multi-channel EEG signals. Methods: An optimization model with L0 norm and Schatten-0 norm is proposed to enforce cosparsity and low r…
A new model classifies lightning signals more accurately across different scales.
problem Classifying VLF lightning transients to reduce interference and improve navigation system reliability.
method Introduces a multi-scale residual transformer (MRTransformer) to classify lightning signals.
result Achieved 90% accuracy in lightning signal classification.
Generalizes PCA and ICA for continuous-time signals using neural networks.
problem Low-rank decomposition of continuous-time vector-valued signals.
method Implicit neural network framework to learn numerical approximations of PCA and ICA.
result Unified approach to PCA and ICA in continuous domain, enforcing decorrelation and independence.
Research compares ML and Time Series methods for generating trading signals.
problem Efficiency of on-line learning Algorithms in generating trading signals.
method Used technical indicators and ensemble of Random Forests, also Kalman Filter.
result Kalman Filter outperformed Random Forests in on-line learning predictions of stock prices.
Develops graph uncertainty principles for signals, improving signal reconstruction and analysis.
problem Limits on the concentration of graph signals under dictionary transforms.
method Generalizes Lieb's methods to graph signals, incorporating local structure.
result Local uncertainty principles improve random sampling of graph signals.
Model improves emotion recognition using multiple physiological signals.
problem Single physiological signal is insufficient for accurate emotion recognition.
method Fused multiple modal physiological signals (EEG, EMG, EOG) for emotion classification.
result Best classification accuracy of 94.42% on arousal and 94.02% on valence in two-class tasks.
We study the problem of corrupted sensing, a generalization of compressed sensing in which one aims to recover a signal from a collection of corrupted or unreliable measurements. While an arbitrary signal cannot be recovered in the face of arbitrary corruption, tractable recovery is possible when both signal and corrup…
New method recovers block-sparse signals with common sparsity patterns.
problem Recovering block-sparse signals with common sparsity patterns in MMV.
method Pattern-coupled hierarchical Gaussian prior model with EM framework.
result Proposed method automatically captures block sparse structure.
This paper introduces joint stationarity for time-varying graph signals, improving signal processing accuracy.
problem Lack of consideration for both time and vertex dimensions in graph-based signal processing.
method Introduces joint (time-vertex) stationarity, a scalable Wiener optimization framework for joint denoising and learning.
result Joint stationarity optimally improves signal processing accuracy, as shown by real data experiments.
There are three equivalent ways of representing two jointly observed real-valued signals: as a bivariate vector signal, as a single complex-valued signal, or as two analytic signals known as the rotary components. Each representation has unique advantages depending on the system of interest and the application goals. I…
Machine learning detects foreign stock market signals for U.S. companies.
problem Detecting value-relevant foreign information for U.S. companies.
method Training over 100,000 models to capture stock-specific relationships.
result Foreign signals predict U.S. stock returns, especially in emerging markets.
Novel SCUSUM detects weak spatial signals more efficiently.
problem Detecting weak clustered signals in spatial data.
method Spatial CUSUM (SCUSUM) using CUSUM procedure and false discovery rate control.
result SCUSUM achieves high classification accuracy for weak spatial signals.
Signals are submanifolds; bounds on energy calculated.
problem Abstract theory of signal propagation.
method Energy inequalities and bounds calculated for specific signal spaces.
result Upper and lower bounds on energy derived for various signal configurations.
The paper infers graph structure from sparse signal observations.
problem Inferring graph structure from sparse signal observations.
method Formulates a non-convex graph learning problem and solves it via alternating signal sparse coding and graph update steps.
result The method generally outperforms other network inference algorithms in graph recovery.
ZM-Net efficiently manipulates images with unseen signals in real-time.
problem Efficiently alter images with diverse guiding signals (e.g. paintings, attributes).
method Proposes ZM-Net, a fully-differentiable architecture that jointly optimizes TNet and PNet.
result ZM-Net performs high-quality image manipulation in real-time (tens of milliseconds per image) for unseen signals.
CNN model for efficient wireless spectrum sensing and signal identification.
problem Efficient utilization of scarce wireless spectrum.
method Convolutional Neural Network (CNN) based on spectral correlation function.
result Significant performance gains over existing methods.
Random walk sampling recovers smooth graph signals from few samples.
problem Efficiently sampling graph signals from large networks.
method Random walk sampling strategy based on network nullspace property.
result Graph signals can be accurately recovered from few samples.
A new method for time series analysis that highlights important signals.
problem Finding signals that matter most in time series data.
method Contrastive Multivariate Singular Spectrum Analysis (CMSA) using a background dataset.
result CMSA identifies signals that are more relevant to the analyst than those with the highest variance.