01143nas a2200181 4500008004100000020002200041022001400063245008900077210006900166260004400235300001000279520046200289100002000751700002000771700002500791700001600816856012900832 2014 eng d a978-3-319-12567-1 a0302-974300aFast Heuristics for Eliminating Switching Components in Binary Matrices by 0-1 Flips0 aFast Heuristics for Eliminating Switching Components in Binary M aPuerto Vallarta, MexicobSpringerc2014 a62-693 a
Switching components are special patterns in binary matrices that play an essential role in many image processing and pattern analysis tasks. Finding the minimal number of 0s that must be switched to 1s in order to eliminate all switching components is an NP-complete problem. We present two novel-type heuristics for the above problems and show via experiments that they outperform the formerly proposed ones, both in optimality and in running time.
1 aHantos, Norbert1 aBalázs, Péter1 aBayro-Corrochano, E.1 aHancock, E. uhttps://www.inf.u-szeged.hu/publication/fast-heuristics-for-eliminating-switching-components-in-binary-matrices-by-0-1-flips