3260 papers • 126 benchmarks • 313 datasets
Blind source separation (BSS) is a signal processing technique that aims to separate multiple source signals from a set of mixed signals, without any prior knowledge about the sources or the mixing process. The goal is to recover the original source signals from the observed mixtures, typically using statistical and computational methods. BSS has applications in various fields such as audio signal processing, image processing, and telecommunications. It is used to extract useful information from mixed signals and to improve the quality of the source signals.
(Image credit: Papersgraph)
These leaderboards are used to track progress in blind-source-separation-4
No benchmarks available.
Use these libraries to find blind-source-separation-4 models and implementations
No datasets available.
No subtasks available.
This paper proposes sequence-to-point learning, where the input is a window of the mains and the output is a single point of the target appliance, and uses convolutional neural networks to train the model.
An algorithm based on the directional sparse filtering (DSF) framework that utilizes the Lehmer mean with learnable weights to adaptively account for source imbalance is proposed.
This work develops a novel sparse pursuit algorithm that can match the discrete frequency spectra from the recorded signal with the continuous spectra delivered by the model, and develops a dictionary that contains the model parameters which characterize the musical instruments, using a modified version of Adam.
Two-layer biologically-plausible neural network algorithms that can separate mixtures into sources coming from a variety of source domains are derived and it is demonstrated that these algorithms outperform other biologically- plausible BSS algorithms on correlated source separation problems.
An improved implementation of GSS is described that leverages the power of modern GPU-based pipelines, including batched processing of frequencies and segments, to provide 300x speed-up over CPU-based inference.
The proposed algorithm, named nGMCA (non-negative Generalized Morphological Component Analysis), makes use of proximal calculus techniques to provide properly constrained solutions and is shown to provide robustness to noise and performs well on synthetic mixtures of real NMR spectra.
This work shows how a sparse NMF algorithm called nonnegative generalized morphological component analysis (nGMCA) can be extended to impose nonnegativity in the direct domain along with sparsity in a transformed domain, with both analysis and synthesis formulations.
This paper introduces a novel sparsity-enforcing BSS method coined Adaptive Morphological Component Analysis (AMCA), which is designed to retrieve sparse and partially correlated sources and makes profit of an adaptive re-weighting scheme to favor/penalize samples based on their level of correlation.
In a case study on electricity disaggregation, which is a type of single-channel blind source separation problem, it is shown that latent Bayesian melding leads to significantly more accurate predictions than an approach based solely on generalized moment matching.
Adding a benchmark result helps the community track progress.