Reconstruction of 8-connected but not 4-connected hv-convex discrete sets

Péter Balázs, Emese Balogh, Attila Kuba

Research output: Contribution to journalArticle

27 Citations (Scopus)

Abstract

The reconstruction of 8-connected but not 4-connected hv-convex discrete sets from few projections is considered. An algorithm is given with worst case complexity of O(mnmin{m,n}) to reconstruct all sets with given horizontal and vertical projections. Experimental results are also presented. It is shown, that using also the diagonal projections the algorithm can be speeded up having complexity of O(mn) and in this case the solution is uniquely determined. Finally, we consider the possible generalizations of our results to solve the problem in more general classes.

Original languageEnglish
Pages (from-to)149-168
Number of pages20
JournalDiscrete Applied Mathematics
Volume147
Issue number2-3
DOIs
Publication statusPublished - Apr 15 2005

Keywords

  • Connected discrete set
  • Discrete tomography
  • Reconstruction

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Reconstruction of 8-connected but not 4-connected hv-convex discrete sets'. Together they form a unique fingerprint.

  • Cite this