DavideNardone / Greedy-Adaptive-Dictionary
Greedy Adaptive Dictionary (GAD) is a learning algorithm that sets out to find sparse atoms for speech signals.
☆11Updated 6 years ago
Alternatives and similar repositories for Greedy-Adaptive-Dictionary:
Users that are interested in Greedy-Adaptive-Dictionary are comparing it to the libraries listed below
- CUDA extension for the SPORCO project☆18Updated 3 years ago
- Data and code for the paper "Deep, complex, invertible networks for inversion of transmission effects in multimode optical fibres" publis…☆18Updated 6 years ago
- Tensorflow implementation of the paper "Fast Compressive Sensing Using Generative Model with Structed Latent Variables"☆10Updated 5 years ago
- Tensor methods have emerged as a powerful paradigm for consistent learning of many latent variable models such as topic models, independe…☆17Updated 8 years ago
- research on convolutional neural networks in fourier space☆15Updated 8 years ago
- Blind source separation based on the probabilistic tensor factorisation framework☆44Updated 6 years ago
- Sequential adaptive elastic net (SAEN) approach, complex-valued LARS solver for weighted Lasso/elastic-net problems, and sparsity (or mod…☆16Updated 5 years ago
- BiSPy : a python framework for signal processing of bivariate signals☆23Updated 5 months ago
- Sparse dictionary learning☆29Updated 11 years ago
- Implementation of the LOSSGRAD optimization algorithm☆15Updated 6 years ago
- Collection of notebooks exploring conv nets in detail.☆10Updated 7 years ago
- Code to reproduce all the results in the paper: "Learning dynamics of linear denoising autoencoders." (ICML 2018)☆12Updated 6 years ago
- noiseless/nonnegative sparse recovery and feature retrieval via compressed sensing☆36Updated 6 years ago
- Some PyTorch code for the Kaggle Speech Recognition Challenge☆12Updated 6 years ago
- ☆15Updated 7 years ago
- Code for "Modeling Sparse Deviations for Compressed Sensing using Generative Models", ICML 2018☆24Updated 6 years ago
- Code for Robust Kronecker-Decomposable Component Analysis (ICCV 2017)☆11Updated 2 years ago
- VAE + Quantile Networks for MNIST☆12Updated 6 years ago
- Earth Movers Distance-Based Simultaneous Comparison of Hyperspectral Endmembers and Proportions☆8Updated 6 years ago
- YALL1: Your ALgorithms for L1☆12Updated 7 years ago
- Adversarial Non-linear Independent Component Analysis☆50Updated 7 years ago
- Adaptive optimization procedure☆16Updated 7 years ago
- Random Mesh Projectors for Inverse Problems☆24Updated 4 years ago
- Implementation of the BASIS algorithm for source separation with deep generative priors☆39Updated 2 years ago
- Code for a recurrent neural network (RNN) created by unfolding the sequential ISTA (SISTA) algorithm for sequential sparse coding☆14Updated 8 years ago
- Uncertainty Autoencoders, AISTATS 2019☆55Updated 6 years ago
- Morgan A. Schmitz., Matthieu Heitz, Nicolas Bonneel, Fred Ngole, David Coeurjolly, Marco Cuturi, Gabriel Peyré, and Jean-Luc Starck. "Was…☆18Updated 5 years ago
- A conda-smithy repository for python-spams.☆23Updated 5 months ago
- A set of tools and experimental scripts used to achieve multimodal learning with nonnegative matrix factorization (NMF).☆18Updated 8 years ago
- Code of Fair PCA algorithm introduced in the paper "The Price of Fair PCA: One Extra Dimension"☆27Updated 2 years ago