Abstract
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.
Author supplied keywords
Cite
CITATION STYLE
Hantos, N., & Balázs, P. (2014). Fast heuristics for eliminating switching components in binary matrices by 0-1 flips. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8827, pp. 62–69). Springer Verlag. https://doi.org/10.1007/978-3-319-12568-8_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
