Correcting the Normalization Shift of Redundant Binary Representations

DOI10.1109/TC.2009.38MaRDI QIDQ4974896zbMATH OpenOpenAlexFDO

Authors Peter Kornerup

Publication date 8 August 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2009.38

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• From reduction-based to reduction-free normalization
• From reduction-based to reduction-free normalization
• Binding and normalization of binary sparse distributed representations by context-dependent thinning
• Relative normalization in Deterministic Residual Structures
• Integrating flexible normalization into midlevel representations of deep convolutional neural networks
• A Normalized Redundancy representation for 2D digital images
• Reducing t-norms and augmenting t-conorms
• Dependency reduction with divisive normalization: justification and effectiveness
• scientific article; zbMATH DE number 1361357

Cited in

(1)

• What Is the Limit of Redundancy Reduction with Divisive Normalization?

This page was built for publication: Correcting the Normalization Shift of Redundant Binary Representations

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