Title :
Reconstruction algorithms for hv-convex 4- and 8-connected discrete sets
Author :
Balogh, Emese ; Kuba, Attila
Author_Institution :
Dept. of Inf., Szeged Univ., Hungary
Abstract :
A new algorithm is presented for reconstructing hv-convex polyominoes and hv-convex 8-connected discrete sets. A systematic comparison is done to compare this method with two other methods; one of them has the best known worst case complexity and the other one has the best known average time complexity. From the experimental comparisons, it turned out that the new algorithm summarizes the good properties of the two other algorithms
Keywords :
computational complexity; image reconstruction; set theory; tomography; average time complexity; discrete tomography; hv-convex 4-connected discrete sets; hv-convex 8-connected discrete sets; hv-convex polyominoes; reconstruction algorithms; worst case complexity; Computational complexity; Informatics; Lattices; Polynomials; Reconstruction algorithms; Tomography;
Conference_Titel :
Image and Signal Processing and Analysis, 2001. ISPA 2001. Proceedings of the 2nd International Symposium on
Conference_Location :
Pula
Print_ISBN :
953-96769-4-0
DOI :
10.1109/ISPA.2001.938602
