%0 Conference Paper %B A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2013 %D 2013 %T Bináris képek rekonstrukciója két vetületből és morfológiai vázból %A Norbert Hantos %A Péter Balázs %A Kálmán Palágyi %E László Czúni %B A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2013 %I NJSZT-KÉPAF %C Veszprém %P 182 - 193 %8 Jan 2013 %G eng %9 Conference paper %0 Book Section %B Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications (CIARP) %D 2013 %T Reconstruction and Enumeration of hv-Convex Polyominoes with Given Horizontal Projection %A Norbert Hantos %A Péter Balázs %E Jose Ruiz-Shulcloper %E Gabriella Sanniti di Baja %B Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications (CIARP) %S Lecture Notes in Computer Science %I Springer %C Heidelberg; London; New York %P 100 - 107 %8 Nov 2013 %@ 978-3-642-41821-1 %G eng %9 Conference paper %R 10.1007/978-3-642-41822-8_13 %0 Journal Article %J FUNDAMENTA INFORMATICAE %D 2013 %T The reconstruction of polyominoes from horizontal and vertical projections and morphological skeleton is NP-complete %A Norbert Hantos %A Péter Balázs %B FUNDAMENTA INFORMATICAE %V 125 %P 343 - 359 %8 2013 %@ 0169-2968 %G eng %N 3-4 %9 Journal article %! FUND INFOR %0 Conference Paper %B Proceedings of International Symposium on Image and Signal Processing and Analysis (ISPA) %D 2013 %T A uniqueness result for reconstructing hv-convex polyominoes from horizontal and vertical projections and morphological skeleton %A Norbert Hantos %A Péter Balázs %E Giovanni Ramponi %E Sven Lončarić %E Alberto Carini %E Karen Egiazarian %X

In this article we study the uniqueness of the reconstruction in a special class of 4-connected hv-convex images, using two projections and the so-called morphological skeleton. Generally, if just the two projections are given, there can be exponentially many hv-convex 4-connected images satisfying them. Knowing the morphological skeleton in addition, we can reduce the number of solutions. In the studied class, the images are defined by two parameters. We show that the uniqueness of their reconstruction depends only on the values of those parameters.

 

%B Proceedings of International Symposium on Image and Signal Processing and Analysis (ISPA) %I IEEE %C Trieste %P 788 - 793 %8 Sep 2013 %G eng %9 Conference paper %M 14027951 %R 10.1109/ISPA.2013.6703845 %0 Book Section %B Combinatorial Image Analysis %D 2012 %T Binary image reconstruction from two projections and skeletal information %A Norbert Hantos %A Péter Balázs %A Kálmán Palágyi %E Reneta P Barneva %E Valentin E Brimkov %E Jake K Aggarwal %X

In binary tomography, the goal is to reconstruct binary images from a small set of their projections. However, especially when only two projections are used, the task can be extremely underdetermined. In this paper, we show how to reduce ambiguity by using the morphological skeleton of the image as a priori. Three different variants of our method based on Simulated Annealing are tested using artificial binary images, and compared by reconstruction time and error. © 2012 Springer-Verlag.

%B Combinatorial Image Analysis %S Lecture Notes in Computer Science %I Springer Verlag %C Berlin; Heidelberg; New York; London; Paris; Tokyo %P 263 - 273 %8 Nov 2012 %G eng %9 Conference paper %! LNCS %R 10.1007/978-3-642-34732-0_20 %0 Conference Paper %B Conference of PhD Students in Computer Science %D 2012 %T Binary tomography using two projections and morphological skeleton %A Norbert Hantos %A Péter Balázs %A Kálmán Palágyi %B Conference of PhD Students in Computer Science %I Univ Szeged Institute of Informatics %C Szeged %V Volume of Extended Abstracts %P 20 %8 June 2012 %G eng %0 Conference Paper %B Veszprém Optimization Conference: Advanced Algorithms (VOCAL) %D 2012 %T Solving binary tomography from morphological skeleton via optimization %A Norbert Hantos %A Péter Balázs %A Kálmán Palágyi %B Veszprém Optimization Conference: Advanced Algorithms (VOCAL) %I University of Pannonia %C Veszprém %P 42 %8 Dec 2012 %G eng %9 Conference paper %0 Conference Paper %B A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 %D 2011 %T Mediánszűrés alkalmazása algebrai rekonstrukciós módszerekben %A Norbert Hantos %A Péter Balázs %E Zoltan Kato %E Kálmán Palágyi %B A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 %I NJSZT %C Szeged %P 106 - 116 %8 Jan 2011 %G eng %9 Conference paper %0 Book Section %B Advances in Visual Computing %D 2010 %T Image enhancement by median filters in algebraic reconstruction methods: an experimental study %A Norbert Hantos %A Péter Balázs %E George Bebis %E Richard Boyle %E Bahram Parvin %E Darko Koracin %E Ronald Chung %E Riad Hammound %E Muhammad Hussain %E Tan Kar-Han %E Roger Crawfis %E Daniel Thalmann %E David Kao %E Lisa Avila %X

Algebraic methods for image reconstruction provide good solutions even if only few projections are available. However, they can create noisy images if the number of iterations or the computational time is limited. In this paper, we show how to decrease the effect of noise by using median filters during the iterations. We present an extensive study by applying filters of different sizes and in various times of the reconstruction process. Also, our test images are of different structural complexity. Our study concentrates on the ART and its discrete variant DART reconstruction methods.

 

%B Advances in Visual Computing %S Lecture Notes in Computer Science %I Springer Verlag %C Las Vegas, NV, USA %P 339 - 348 %8 Nov-Dec 2010 %@ 978-3-642-17276-2 %G eng %9 Conference paper %! LNCS %R 10.1007/978-3-642-17277-9_35 %0 Conference Paper %B Conference of PhD Students in Computer Science. Volume of Extended Abstracts. %D 2010 %T Median filtering in algebraic reconstruction methods %A Norbert Hantos %A Péter Balázs %B Conference of PhD Students in Computer Science. Volume of Extended Abstracts. %I University of Szeged %C Szeged, Hungary %P 36 %8 June 2010 %G eng %9 Abstract