[PDF][PDF] Convexity and fast speech extraction by split bregman method.
A fast speech extraction (FSE) method is presented using convex optimization made
possible by pause detection of the speech sources. Sparse unmixing filters are sought by l1 …
possible by pause detection of the speech sources. Sparse unmixing filters are sought by l1 …
[图书][B] Variational models in image and signal enhancement
W Ma - 2011 - search.proquest.com
In this work, we focus on applications of variational models to image and signal
enhancement. These models are based on sparsity and turn out to be the L 1 norm or the …
enhancement. These models are based on sparsity and turn out to be the L 1 norm or the …
A randomly perturbed INFOMAX algorithm for blind source separation
We present a novel modification to the well-known infomax algorithm of blind source
separation. Under natural gradient descent, the infomax algorithm converges to a stationary …
separation. Under natural gradient descent, the infomax algorithm converges to a stationary …
[PDF][PDF] A convex speech extraction model and fast computation by the split bregman method
A fast speech extraction (FSE) method is presented using convex optimization made
possible by pause detection of the speech sources. Sparse unmixing filters are sought by l1 …
possible by pause detection of the speech sources. Sparse unmixing filters are sought by l1 …
[PDF][PDF] Separating Mixed Signals in a Noisy Environment Using Global Optimization
G Hou - 2015 - evoq-eval.siam.org
In this paper, we propose and analyze a class of blind source separation (BSS) methods to
recover mixed signals in a noisy environment. Blind source separation aims at recovering …
recover mixed signals in a noisy environment. Blind source separation aims at recovering …
Convergence analysis of a randomly perturbed infomax algorithm for blind source separation
We present a novel variation of the well-known infomax algorithm of blind source separation.
Under natural gradient descent, the infomax algorithm converges to a stationary point of a …
Under natural gradient descent, the infomax algorithm converges to a stationary point of a …