@inbook {1139,
	title = {Generation and empirical investigation of hv-Convex discrete sets},
	booktitle = {Image Analysis},
	series = {Lecture Notes in Computer Science},
	number = {4522},
	year = {2007},
	note = {UT: 000247364000035ScopusID: 38049002073},
	month = {June 2007},
	pages = {344 - 353},
	publisher = {Springer Verlag},
	organization = {Springer Verlag},
	type = {Conference paper},
	address = {Aalborg, Denmark},
	abstract = {<p>One of the basic problems in discrete tomography is thereconstruction of discrete sets from few projections. Assuming that the set to be reconstructed fulfils some geometrical properties is a commonly used technique to reduce the number of possibly many different solutions of the same reconstruction problem. Since the reconstruction from two projections in the class of so-called hv-convex sets is NP-hard this class is suitable to test the efficiency of newly developed reconstruction algorithms. However, until now no method was known to generate sets of this class from uniform random distribution and thus only ad hoc comparison of several reconstruction techniques was possible. In this paper we first describe a method to generate some special hv-convex discrete sets from uniform random distribution. Moreover, we show that the developed generation technique can easily be adapted to other classes of discrete sets, even for the whole class of hv- convexes. Several statistics are also presented which are of great importance in the analysis of algorithms for reconstructing hv-convex sets. {\textcopyright} Springer-Verlag Berlin Heidelberg 2007.</p>},
	isbn = {978-3-540-73039-2},
	issn = {0302-9743},
	doi = {10.1007/978-3-540-73040-8_35},
	author = {P{\'e}ter Bal{\'a}zs},
	editor = {Bjarne Kj{\ae}r Ersb{\o}ll and Kim Steenstrup Pedersen}
}
