Eliminating switching components in binary matrices by 0-1 flips and column permutations

DOI10.3233/FI-2015-1268MaRDI QIDQ3187022zbMATH OpenFDO

Authors Norbert Hantos, Péter Balázs

Publication date 15 August 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/FI-2015-1268

zbMATH Keywords

0-1 flipbinary matrixdata compressionimage reconstructionnestednessswitching componentuniqueness

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10)

Recommendations

• Minimising the number of gap-zeros in binary matrices
• Boolean optimization algorithm on (0,1)-matrices
• scientific article; zbMATH DE number 4075286
• Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results
• Block seriation problems: A unified approach. Reply to the problem of H. Garcia and J. M. Proth (Applied Stochastic Models and Data Analysis, 1, (1), 25–34 (1985))

This page was built for publication: Eliminating switching components in binary matrices by 0-1 flips and column permutations

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