Discrete sparse coding
DOI10.1162/NECO_A_01015zbMATH Open1456.68175DBLPjournals/neco/ExarchakisL17OpenAlexW2757860842WikidataQ47668774 ScholiaQ47668774MaRDI QIDQ5380863FDOQ5380863
Authors: Georgios Exarchakis, Jörg Lücke 
Publication date: 6 June 2019
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco_a_01015
Recommendations
Artificial neural networks and deep learning (68T07) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- The Indian buffet process: an introduction and review
- Deep learning
- Learning the parts of objects by non-negative matrix factorization
- Compressed sensing
- Online learning for matrix factorization and sparse coding
- Title not available (Why is that?)
- Latent variable analysis and signal separation. 10th international conference, LVA/ICA 2012, Tel Aviv, Israel, March 12--15, 2012. Proceedings
- Generative binary codes
- The aspect Bernoulli model: multiple causes of presences and absences
- Receptive Field Self-Organization in a Model of the Fine Structure in V1 Cortical Columns
- Unsupervised Spike Detection and Sorting with Wavelets and Superparamagnetic Clustering
- Expectation truncation and the benefits of preselection in training generative models
- Title not available (Why is that?)
- Efficient occlusive components analysis
- Title not available (Why is that?)
Cited In (4)
Uses Software
This page was built for publication: Discrete sparse coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380863)
