00651nas a2200169 4500008004100000022001400041245009800055210006900153260001900222300001200241490000700253100002000260700002000280700002000300700002300320856013800343 2015 eng d a1012-244300aBinary image reconstruction from a small number of projections and the morphological skeleton0 aBinary image reconstruction from a small number of projections a bSpringerc2015 a195-2160 v751 aHantos, Norbert1 aIván, Szabolcs1 aBalázs, Péter1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/binary-image-reconstruction-from-a-small-number-of-projections-and-the-morphological-skeleton00460nas a2200121 4500008004100000245005600041210005600097260004200153300000700195100002000202700002000222856009600242 2014 eng d00aEliminating switching components in binary matrices0 aEliminating switching components in binary matrices aSzeged, HungarybUniversity of Szeged a211 aHantos, Norbert1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/eliminating-switching-components-in-binary-matrices01143nas a2200181 4500008004100000020002200041022001400063245008900077210006900166260004400235300001000279520046200289100002000751700002000771700002500791700001600816856012900832 2014 eng d a978-3-319-12567-1 a0302-974300aFast Heuristics for Eliminating Switching Components in Binary Matrices by 0-1 Flips0 aFast Heuristics for Eliminating Switching Components in Binary M aPuerto Vallarta, MexicobSpringerc2014 a62-693 a
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.
1 aHantos, Norbert1 aBalázs, Péter1 aBayro-Corrochano, E.1 aHancock, E. uhttps://www.inf.u-szeged.hu/publication/fast-heuristics-for-eliminating-switching-components-in-binary-matrices-by-0-1-flips00593nas a2200145 4500008004100000245008100041210007800122260003800200300001400238100002000252700002000272700002300292700002100315856011100336 2013 eng d00aBináris képek rekonstrukciója két vetületből és morfológiai vázból0 aBináris képek rekonstrukciója két vetületből és morfológiai vázb aVeszprémbNJSZT-KÉPAFcJan 2013 a182 - 1931 aHantos, Norbert1 aBalázs, Péter1 aPalágyi, Kálmán1 aCzúni, László uhttps://www.inf.u-szeged.hu/publication/binaris-kepek-rekonstrukcioja-ket-vetuletbol-es-morfologiai-vazbol00680nas a2200157 4500008004100000020002200041245009300063210006900156260005300225300001400278100002000292700002000312700002600332700003100358856013300389 2013 eng d a978-3-642-41821-100aReconstruction and Enumeration of hv-Convex Polyominoes with Given Horizontal Projection0 aReconstruction and Enumeration of hvConvex Polyominoes with Give aHeidelberg; London; New YorkbSpringercNov 2013 a100 - 1071 aHantos, Norbert1 aBalázs, Péter1 aRuiz-Shulcloper, Jose1 aSanniti di Baja, Gabriella uhttps://www.inf.u-szeged.hu/publication/reconstruction-and-enumeration-of-hv-convex-polyominoes-with-given-horizontal-projection00623nas a2200145 4500008004100000020001400041245012100055210006900176260000900245300001400254490000800268100002000276700002000296856016100316 2013 eng d a0169-296800aThe reconstruction of polyominoes from horizontal and vertical projections and morphological skeleton is NP-complete0 areconstruction of polyominoes from horizontal and vertical proje c2013 a343 - 3590 v1251 aHantos, Norbert1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/the-reconstruction-of-polyominoes-from-horizontal-and-vertical-projections-and-morphological-skeleton-is-np-complete01721nas a2200181 4500008004100000245013300041210006900174260002800243300001400271520095600285100002001241700002001261700002201281700002101303700002001324700002201344856017301366 2013 eng d00aA uniqueness result for reconstructing hv-convex polyominoes from horizontal and vertical projections and morphological skeleton0 auniqueness result for reconstructing hvconvex polyominoes from h aTriestebIEEEcSep 2013 a788 - 7933 aIn 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.
1 aHantos, Norbert1 aBalázs, Péter1 aRamponi, Giovanni1 aLončarić, Sven1 aCarini, Alberto1 aEgiazarian, Karen uhttps://www.inf.u-szeged.hu/publication/a-uniqueness-result-for-reconstructing-hv-convex-polyominoes-from-horizontal-and-vertical-projections-and-morphological-skeleton01221nas a2200181 4500008004100000245007800041210006900119260008200188300001400270520050400284100002000788700002000808700002300828700002300851700002500874700002200899856011800921 2012 eng d00aBinary image reconstruction from two projections and skeletal information0 aBinary image reconstruction from two projections and skeletal in aBerlin; Heidelberg; New York; London; Paris; TokyobSpringer VerlagcNov 2012 a263 - 2733 a
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.
1 aHantos, Norbert1 aBalázs, Péter1 aPalágyi, Kálmán1 aBarneva, Reneta, P1 aBrimkov, Valentin, E1 aAggarwal, Jake, K uhttps://www.inf.u-szeged.hu/publication/binary-image-reconstruction-from-two-projections-and-skeletal-information00601nas a2200145 4500008004100000245007100041210006900112260006000181300000700241490003300248100002000281700002000301700002300321856011100344 2012 eng d00aBinary tomography using two projections and morphological skeleton0 aBinary tomography using two projections and morphological skelet aSzegedbUniv Szeged Institute of InformaticscJune 2012 a200 vVolume of Extended Abstracts1 aHantos, Norbert1 aBalázs, Péter1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/binary-tomography-using-two-projections-and-morphological-skeleton00552nas a2200133 4500008004100000245007500041210006900116260004800185300000700233100002000240700002000260700002300280856011500303 2012 eng d00aSolving binary tomography from morphological skeleton via optimization0 aSolving binary tomography from morphological skeleton via optimi aVeszprémbUniversity of PannoniacDec 2012 a421 aHantos, Norbert1 aBalázs, Péter1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/solving-binary-tomography-from-morphological-skeleton-via-optimization00559nas a2200145 4500008004100000245007200041210007200113260002800185300001400213100002000227700002000247700001700267700002300284856010600307 2011 eng d00aMediánszűrés alkalmazása algebrai rekonstrukciós módszerekben0 aMediánszűrés alkalmazása algebrai rekonstrukciós módszerekben aSzegedbNJSZTcJan 2011 a106 - 1161 aHantos, Norbert1 aBalázs, Péter1 aKato, Zoltan1 aPalágyi, Kálmán uhttps://www.inf.u-szeged.hu/publication/medianszures-alkalmazasa-algebrai-rekonstrukcios-modszerekben01693nas a2200289 4500008004100000020002200041245009900063210006900162260005400231300001400285520070400299100002001003700002001023700001801043700001901061700001901080700001901099700001801118700001901136700002201155700001701177700001901194700002101213700001501234700001601249856013801265 2010 eng d a978-3-642-17276-200aImage enhancement by median filters in algebraic reconstruction methods: an experimental study0 aImage enhancement by median filters in algebraic reconstruction aLas Vegas, NV, USAbSpringer VerlagcNov-Dec 2010 a339 - 3483 aAlgebraic 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.
1 aHantos, Norbert1 aBalázs, Péter1 aBebis, George1 aBoyle, Richard1 aParvin, Bahram1 aKoracin, Darko1 aChung, Ronald1 aHammound, Riad1 aHussain, Muhammad1 aKar-Han, Tan1 aCrawfis, Roger1 aThalmann, Daniel1 aKao, David1 aAvila, Lisa uhttps://www.inf.u-szeged.hu/publication/image-enhancement-by-median-filters-in-algebraic-reconstruction-methods-an-experimental-study00474nas a2200121 4500008004100000245005700041210005700098260005300155300000700208100002000215700002000235856009700255 2010 eng d00aMedian filtering in algebraic reconstruction methods0 aMedian filtering in algebraic reconstruction methods aSzeged, HungarybUniversity of SzegedcJune 2010 a361 aHantos, Norbert1 aBalázs, Péter uhttps://www.inf.u-szeged.hu/publication/median-filtering-in-algebraic-reconstruction-methods