An empirical study of reconstructing hv-convex binary matrices from horizontal and vertical projections

The reconstruction of hv-convex binary matrices (or equivalently, binary images) from their horizontal and vertical projections is proved to be NP-hard. In this paper we take a closer look at the difficulty of the problem. We investigate different heuristic reconstruction algorithms of the class, an...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerzők: Ozsvár Zoltán
Balázs Péter
Dokumentumtípus: Cikk
Megjelent: 2013
Sorozat:Acta cybernetica 21 No. 1
Kulcsszavak:Számítástechnika, Kibernetika, Matematika
Tárgyszavak:
doi:10.14232/actacyb.21.1.2013.11

Online Access:http://acta.bibl.u-szeged.hu/30855
Leíró adatok
Tartalmi kivonat:The reconstruction of hv-convex binary matrices (or equivalently, binary images) from their horizontal and vertical projections is proved to be NP-hard. In this paper we take a closer look at the difficulty of the problem. We investigate different heuristic reconstruction algorithms of the class, and compare them from the viewpoint of running-time and reconstruction quality. Using a large set of test images of different sizes and with varying number of components, we show that the reconstruction quality can depend not only on the size of the image, but on the number and location of its components, too. We also reveal that the reconstruction time can also be affected by the number of the so-called switching components present in the image.
Terjedelem/Fizikai jellemzők:149-163
ISSN:0324-721X