Péter Balázs

Péter Balázs

orcid

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 April 2013 in Computer Vision and Image Understanding
Verified
Journal Article
Closed access
KBK. Joost Batenburg
K. Joost Batenburg
WPWillem Jan Palenstijn
Willem Jan Palenstijn
PBPéter Balázs
Péter Balázs
Jan SijbersJan Sijbers
Jan Sijbers

30 October 2014 in Clinical Oral Investigations
Verified
Journal Article
Closed access
PDF file
ÁJÁgnes Janovszky
Ágnes Janovszky
ASAndrea Szabó
Andrea Szabó
RVRenáta Varga
Renáta Varga
DGDénes Garab
Dénes Garab
MBMihály Boros
Mihály Boros
JPJózsef Piffkó
József Piffkó

15 April 2005 in Discrete Applied Mathematics
Verified
Journal Article
Open access
PDF file
PBPéter Balázs
Péter Balázs
EBEmese Balogh
Emese Balogh
AKAttila Kuba
Attila Kuba
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.

1 November 2011 in Graphical Models
Verified
Journal Article
Closed access
LVLászló Varga
László Varga
PBPéter Balázs
Péter Balázs
ANAntal Nagy
Antal Nagy

1 August 2016 in Pattern Recognition Letters
Verified
Journal Article
Closed access
TLTibor Lukić
Tibor Lukić
PBPéter Balázs
Péter Balázs

1 January 2011 in Acta Cybernetica
Verified
Journal Article
Closed access
PDF file
LVLaszló Varga
Laszló Varga
PBPéter Balázs
Péter Balázs
ANAntal Nagy
Antal Nagy
It has already been shown that the choice of projection angles can significantly influence the quality of reconstructions in discrete tomography. In this contribution we summarize and extend the previous results by explaining and demonstrating the effects of projection selection dependency, in a set of experimental software tests. We perform reconstructions of software phantoms, by using different binary tomography reconstruction algorithms, from different equiangular and non-equiangular projections sets, under various conditions (i.e., when the objects to be reconstructed undergo slight topological changes, or the projection data is affected by noise) and compare the results with suitable approaches. Based on our observations, we reveal regularities in the resulting data and discuss possible consequences of such projection selection dependency in binary tomography.