You are here

Biblio

Export 73 results:
Filters: Author is Péter Balázs  [Clear All Filters]
2009
Balázs P. Reconstruction of canonical hv-convex discrete sets from horizontal and vertical projections. In: Wiederhold P, Barneva RP, editors. Combinatorial Image Analysis. Berlin; Heidelberg; New York; London; Paris; Tokyo: Springer Verlag; 2009. 2. p. 280-288p.
2008
Balázs P. On the ambiguity of reconstructing hv-convex binary matrices with decomposable configurations. ACTA CYBERNETICA-SZEGED. 2008;18(3):367-377.
Balázs P, Gara M. Decision trees in binary tomography for supporting the reconstruction of hv-convex connected images. In: Proceedings of the Advanced Concepts for Intelligent Vision Systems. Vol 5259. Juan-les-Pins, France: Springer; 2008. 4. p. 433-443p. (Lecture Notes in Computer Science; vol 5259).
Gara M, Balázs P. Determination of geometric features of binary images from their projections by using decision trees. In: Palágyi K, Bánhelyi B, Gergely T, Matievics I, editors. Conference of PhD Students in Computer Science. Volume of Extended Abstracts. Szeged, Hungary: University of Szeged; 2008. 2. 26.
Balázs P. Discrete tomographic reconstruction of binary images with disjoint components using shape information. INTERNATIONAL JOURNAL OF SHAPE MODELLING. 2008;14(2):189-207.
Balázs P. A framework for generating some discrete sets with disjoint components by using uniform distributions. THEORETICAL COMPUTER SCIENCE. 2008;406(1-2):15-23.
A képfeldolgozás kutatása a Szegedi Tudományegyetemen. In: Informatika a felsőoktatásban 2008. Debrecen: Debreceni Egyetem Informatikai Kar; 2008.
Balázs P. On the number of hv-convex discrete sets. In: Brimkov VE, Barneva RP, Hauptman HA, editors. Combinatorial Image Analysis. Buffalo, NY, USA: Springer Verlag; 2008. 1. p. 112-123p. (Lecture Notes in Computer Science).
Balázs P. Reconstruction of binary images with few disjoint components from two projections. In: Bebis G, Boyle R, Parvin B, Koracin D, Remagnino P, Porikli F et al., editors. Advances in Visual Computing. Las Vegas, NV, USA: Springer Verlag; 2008. 1. p. 1147-1156p. (Lecture Notes in Computer Science).
2007
Balázs P. Binary Tomography Using Geometrical Priors: Uniqueness and Reconstruction Results. Szeged, Hungary: University of Szeged; 2007.
Balázs P. Decomposition Algorithms for Reconstructing Discrete Sets with Disjoint Components. In: Herman G T, Kuba A, editors. ADVANCES IN DISCRETE TOMOGRAPHY AND ITS APPLICATIONS. Cambridge: Birkhauser Boston; 2007. 1. p. 153-173p. (Applied and Numerical Harmonic Analysis).
Balázs P. A decomposition technique for reconstructing discrete sets from four projections. IMAGE AND VISION COMPUTING. 2007;25(10):1609-1619.
Balázs P. Generation and empirical investigation of hv-Convex discrete sets. In: Ersbøll BKjær, Pedersen KSteenstrup, editors. Image Analysis. Aalborg, Denmark: Springer Verlag; 2007. 3. p. 344-353p. (Lecture Notes in Computer Science).
Balázs P. Reconstructing some hv-convex binary images from three or four projections. In: Petrou M, Saramaki T, Ercil A, Lončarić S, editors. Proccedings of the 5th International Symposium on Image and Signal Processing and Analysis. Istanbul, Turkey: IEEE; 2007. 1. p. 136-140p.
Uniform generation of hv-convex discrete sets. In: A Képfeldolgozók és Alakfelismerők Társaságának konferenciája - KÉPAF 2007. Debrecen: Képfeldolgozók és Alakfelismerők Társasága; 2007. 6. p. 63-70p.
2006
On the ambiguity of reconstructing decomposable hv-convex binary matrices. In: Conference of PhD Students in Computer Science. Vol Volume of Extenden Abstracts.; 2006. 1. 17.
The number of line-convex directed polyominoes having the same orthogonal projections. In: Discrete Geometry for Computer Imagery. Berlin, Heidelberg: Springer-Verlag; 2006. 7. p. 77-85p.
2005
Reconstruction of 8-connected but not 4-connected hv-convex discrete sets. DISCRETE APPLIED MATHEMATICS. 2005;147:149-168.
Reconstruction of decomposable discrete sets from four projections. In: Discrete Geometry for Computer Imagery. Berlin; Heidelberg; New York; London; Paris; Tokyo: Springer Verlag; 2005. 1. p. 104-114p.
Reconstruction of discrete sets from four projections: strong decomposability. ELECTRONIC NOTES IN DISCRETE MATHEMATICS. 2005;20:329-345.
2004
Reconstruction of discrete sets from four projections: Decomposable cases. In: Conference of PhD Students in Computer Science. Vol Volume of Extended Abstracts.; 2004. 2. 22.
2003
A fast algorithm for reconstructing hv-convex 8-connected but not 4-connected discrete sets. In: Discrete Geometry for Computer Imagery. Berlin; Heidelberg; New York; London; Paris; Tokyo: Springer Verlag; 2003. 3. p. 388-397p.
2002
A fast algorithm for reconstructing hv-convex 8-connected but not 4-connected discrete sets. In: Conference of PhD Students in Computer Science. Vol Volume of Extended Abstracts.; 2002. 1. 19.

Pages