( en | de | ru )

 

Disambiguation of "Palágyi, Kálmán"

Author of the publication

copydeleteadd this publication to your clipboard
Topology preserving parallel thinning algorithms.

, and . Int. J. Imaging Systems and Technology, 21 (1): 37-44 (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kálmán Graffi

Kálmán Graffi

Kálmán Németh

Kálmán Graffi

Elke Kálmán

 

Other publications of authors with the same name

Scalable Biologically-Aware Skeleton Generation for Connectomic Volumes., , , , , , , and . IEEE Trans. Medical Imaging, 41 (9): 2360-2370 (2022)Thinning combined with iteration-by-iteration smoothing for 3D binary images., , and . Graph. Model., 73 (6): 335-345 (2011)A 3-subiteration 3D thinning algorithm for extracting medial surfaces.. Pattern Recognit. Lett., 23 (6): 663-675 (2002)Topology preserving parallel thinning algorithms., and . Int. J. Imaging Systems and Technology, 21 (1): 37-44 (2011)Binary image reconstruction from a small number of projections and the morphological skeleton., , , and . Ann. Math. Artif. Intell., 75 (1-2): 195-216 (2015)A Single-Step 2D Thinning Scheme with Deletion of P-Simple Points., and . CIARP, volume 10657 of Lecture Notes in Computer Science, page 475-482. Springer, (2017)Topology Preserving 3D Thinning Algorithms Using Four and Eight Subfields., , and . ICIAR (1), volume 6111 of Lecture Notes in Computer Science, page 316-325. Springer, (2010)Simplifier Points in 2D Binary Images.. IWCIA, volume 10256 of Lecture Notes in Computer Science, page 3-15. Springer, (2017)A Parallel 12-Subiteration 3D Thinning Algorithm to Extract Medial Lines., and . CAIP, volume 1296 of Lecture Notes in Computer Science, page 400-407. Springer, (1997)Maximal P-simple Sets on (8, 4) Pictures., and . CompIMAGE, volume 10986 of Lecture Notes in Computer Science, page 23-32. Springer, (2018)