Generative binary codes

DOI10.1007/S10044-003-0194-XMaRDI QIDQ558090zbMATH OpenOpenAlexFDO

Authors Jianyong Qiao, Sumit K. Garg

Publication date 30 June 2005

Published in PAA. Pattern Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10044-003-0194-x

zbMATH Keywords

denoisingBayesian networksgenerative modelsimage codingdistributed binary codingEM-learningmean field inference

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Computing methodologies for image processing (68U10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Deterministic generative models for fast feature discovery
• Discrete sparse coding
• Learning and Inference in Sparse Coding Models With Langevin Dynamics
• Fields of experts
• Cascaded redundancy reduction

Cited in

(6)

• Expectation truncation and the benefits of preselection in training generative models
• Generating binary spaces.
• Discrete sparse coding
• The coolest way to generate binary strings
• scientific article; zbMATH DE number 7625174 (Why is no real title available?)
• Deterministic generative models for fast feature discovery

This page was built for publication: Generative binary codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q558090)