TY - JOUR T1 - Binary image reconstruction from a small number of projections and the morphological skeleton JF - ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE Y1 - 2015 A1 - Norbert Hantos A1 - Szabolcs Iván A1 - Péter Balázs A1 - Kálmán Palágyi PB - Springer VL - 75 IS - 1 ER - TY - Generic T1 - Eliminating switching components in binary matrices Y1 - 2014 A1 - Norbert Hantos A1 - Péter Balázs JF - Proceedings of the 9th Conference of PhD Students in Computer Science (CSCS'14) PB - University of Szeged CY - Szeged, Hungary ER - TY - CHAP T1 - Fast Heuristics for Eliminating Switching Components in Binary Matrices by 0-1 Flips T2 - Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications: 19th Iberoamerican Congress (CIARP) Y1 - 2014 A1 - Norbert Hantos A1 - Péter Balázs ED - E. Bayro-Corrochano ED - E. Hancock AB -

Switching components are special patterns in binary matrices that play an essential role in many image processing and pattern analysis tasks. Finding the minimal number of 0s that must be switched to 1s in order to eliminate all switching components is an NP-complete problem. We present two novel-type heuristics for the above problems and show via experiments that they outperform the formerly proposed ones, both in optimality and in running time.

JF - Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications: 19th Iberoamerican Congress (CIARP) T3 - LNCS PB - Springer CY - Puerto Vallarta, Mexico SN - 978-3-319-12567-1 JO - LNCS ER - TY - CONF T1 - Bináris képek rekonstrukciója két vetületből és morfológiai vázból T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2013 Y1 - 2013 A1 - Norbert Hantos A1 - Péter Balázs A1 - Kálmán Palágyi ED - László Czúni JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2013 PB - NJSZT-KÉPAF CY - Veszprém ER - TY - CHAP T1 - Reconstruction and Enumeration of hv-Convex Polyominoes with Given Horizontal Projection T2 - Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications (CIARP) Y1 - 2013 A1 - Norbert Hantos A1 - Péter Balázs ED - Jose Ruiz-Shulcloper ED - Gabriella Sanniti di Baja JF - Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications (CIARP) T3 - Lecture Notes in Computer Science PB - Springer CY - Heidelberg; London; New York SN - 978-3-642-41821-1 N1 - ScopusID: 84893181366doi: 10.1007/978-3-642-41822-8_13 ER - TY - JOUR T1 - The reconstruction of polyominoes from horizontal and vertical projections and morphological skeleton is NP-complete JF - FUNDAMENTA INFORMATICAE Y1 - 2013 A1 - Norbert Hantos A1 - Péter Balázs VL - 125 SN - 0169-2968 IS - 3-4 N1 - UT: 000322028300009ScopusID: 84881495517doi: 10.3233/FI-2013-868 JO - FUND INFOR ER - TY - CONF T1 - A uniqueness result for reconstructing hv-convex polyominoes from horizontal and vertical projections and morphological skeleton T2 - Proceedings of International Symposium on Image and Signal Processing and Analysis (ISPA) Y1 - 2013 A1 - Norbert Hantos A1 - Péter Balázs ED - Giovanni Ramponi ED - Sven Lončarić ED - Alberto Carini ED - Karen Egiazarian AB -

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.

 

JF - Proceedings of International Symposium on Image and Signal Processing and Analysis (ISPA) PB - IEEE CY - Trieste ER - TY - CHAP T1 - Binary image reconstruction from two projections and skeletal information T2 - Combinatorial Image Analysis Y1 - 2012 A1 - Norbert Hantos A1 - Péter Balázs A1 - Kálmán Palágyi ED - Reneta P Barneva ED - Valentin E Brimkov ED - Jake K Aggarwal AB -

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.

JF - Combinatorial Image Analysis T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Berlin; Heidelberg; New York; London; Paris; Tokyo N1 - ScopusID: 84869986820doi: 10.1007/978-3-642-34732-0_20 JO - LNCS ER - TY - CONF T1 - Binary tomography using two projections and morphological skeleton T2 - Conference of PhD Students in Computer Science Y1 - 2012 A1 - Norbert Hantos A1 - Péter Balázs A1 - Kálmán Palágyi JF - Conference of PhD Students in Computer Science PB - Univ Szeged Institute of Informatics CY - Szeged VL - Volume of Extended Abstracts ER - TY - CONF T1 - Solving binary tomography from morphological skeleton via optimization T2 - Veszprém Optimization Conference: Advanced Algorithms (VOCAL) Y1 - 2012 A1 - Norbert Hantos A1 - Péter Balázs A1 - Kálmán Palágyi JF - Veszprém Optimization Conference: Advanced Algorithms (VOCAL) PB - University of Pannonia CY - Veszprém ER - TY - CONF T1 - Mediánszűrés alkalmazása algebrai rekonstrukciós módszerekben T2 - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 Y1 - 2011 A1 - Norbert Hantos A1 - Péter Balázs ED - Zoltan Kato ED - Kálmán Palágyi JF - A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2011 PB - NJSZT CY - Szeged ER - TY - CHAP T1 - Image enhancement by median filters in algebraic reconstruction methods: an experimental study T2 - Advances in Visual Computing Y1 - 2010 A1 - Norbert Hantos A1 - Péter Balázs ED - George Bebis ED - Richard Boyle ED - Bahram Parvin ED - Darko Koracin ED - Ronald Chung ED - Riad Hammound ED - Muhammad Hussain ED - Tan Kar-Han ED - Roger Crawfis ED - Daniel Thalmann ED - David Kao ED - Lisa Avila AB -

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.

 

JF - Advances in Visual Computing T3 - Lecture Notes in Computer Science PB - Springer Verlag CY - Las Vegas, NV, USA SN - 978-3-642-17276-2 N1 - UT: 000290358400035ScopusID: 78650793785doi: 10.1007/978-3-642-17277-9_35 JO - LNCS ER - TY - CONF T1 - Median filtering in algebraic reconstruction methods T2 - Conference of PhD Students in Computer Science. Volume of Extended Abstracts. Y1 - 2010 A1 - Norbert Hantos A1 - Péter Balázs JF - Conference of PhD Students in Computer Science. Volume of Extended Abstracts. PB - University of Szeged CY - Szeged, Hungary ER -