Kalman Palagyi - Academia.edu (original) (raw)

Kalman Palagyi

Uploads

Papers by Kalman Palagyi

Research paper thumbnail of A 3-subiteration 3D thinning algorithm for extracting medial surfaces

Pattern Recognition Letters, Apr 1, 2002

Research paper thumbnail of Cellular algorithm for matrix multiplication

Proc of the Third International Workshop on Parallel Processing By Cellular Automata and Arrays, 1987

Research paper thumbnail of A 3D Parallel Shrinking Algorithm

Research paper thumbnail of 2D Parallel Thinning and Shrinking Based on Sufficient Conditions for Topology Preservation

Research paper thumbnail of Topology-preserving hexagonal thinning

Http Dx Doi Org 10 1080 00207160 2012 724198, Aug 8, 2013

Research paper thumbnail of Affine matching of two sets of points in arbitrary dimensions

Research paper thumbnail of On order-independent sequential thinning

2012 Ieee 3rd International Conference on Cognitive Infocommunications, Dec 1, 2012

Research paper thumbnail of A diszkrét tomográfia új irányzatai és alkalmazása a neutron radiográfiában = New directions in discrete tomography and its application in neutron radiography

Research paper thumbnail of Topology Preserving 2-Subfield 3D Thinning Algorithms

Signal Processing, Pattern Recognition and Applications, 2010

Research paper thumbnail of Discrete Geometry for Computer Imagery (vol. # 4245)

Research paper thumbnail of A 3-subiteration surface-thinning algorithm

Proceedings of the 12th International Conference on Computer Analysis of Images and Patterns, 2007

Research paper thumbnail of Spiral CT based assessment of laryngotrachealstenoses with 3D image processing using a Skeletonisation algorithm

Research paper thumbnail of Solution of dense systems of linear equations using cellular processors

Parcella, 1988

A cellular processor is a totally reconfigurable universal purpose device for highly parallel pro... more A cellular processor is a totally reconfigurable universal purpose device for highly parallel processing, where computations are performed by a homogeneous array of microprogrammable Boolean processors [6].

Research paper thumbnail of Topology-preserving equivalent parallel and sequential 4-subiteration 2D thinning algorithms

2015 9th International Symposium on Image and Signal Processing and Analysis (ISPA), 2015

Research paper thumbnail of Fully Parallel 3D Thinning Algorithms Based on Sufficient Conditions for Topology Preservation

Lecture Notes in Computer Science, 2009

... 188–190 (1990) 5. Hall, RW: Parallel connectivity-preserving thinning algorithms. In: Kong, T... more ... 188–190 (1990) 5. Hall, RW: Parallel connectivity-preserving thinning algorithms. In: Kong, TY, Rosenfeld, A. (eds.) Topological algorithms for digital image processing, pp. ... Pattern Recognition Letters 23, 677–686 (2002) 7. Kong, TY: On topology preservation in 2-d and 3-d ...

Research paper thumbnail of Equivalent Sequential and Parallel Reductions in Arbitrary Binary Pictures

International Journal of Pattern Recognition and Artificial Intelligence, 2014

A reduction transforms a binary picture only by changing some black points to white ones, which i... more A reduction transforms a binary picture only by changing some black points to white ones, which is referred to as deletion. Sequential reductions traverse the black points of a picture, and consider a single point for possible deletion, while parallel reductions can delete a set of black points simultaneously. Two reductions are called equivalent if they produce the same result for each input picture. A deletion rule is said to be equivalent if it yields a pair of equivalent parallel and sequential reductions. This paper introduces a class of equivalent deletion rules that allows us to establish a new sufficient condition for topology-preserving parallel reductions in arbitrary binary pictures. In addition we present a method of verifying that a deletion rule given by matching templates is equivalent, a necessary and sufficient condition for order-independent deletion rules, and a sufficient criterion for order-independent and translation-invariant parallel subfield-based algorithms.

Research paper thumbnail of Techniques in 3D Assessment of Tracheal-Stenosis by the Mean of Spiral Computed Tomography (S-CT) and Their Applications

Medical Imaging Systems Technology, 2005

Research paper thumbnail of Binary image reconstruction from a small number of projections and the morphological skeleton

Annals of Mathematics and Artificial Intelligence, 2014

Research paper thumbnail of Segmentation, Skeletonization, and Branchpoint Matching — A Fully Automated Quantitative Evaluation of Human Intrathoracic Airway Trees

Lecture Notes in Computer Science, 2002

Research paper thumbnail of Assessment of Intrathoracic Airway Trees: Methods and In Vivo Validation

Lecture Notes in Computer Science, 2004

Research paper thumbnail of A 3-subiteration 3D thinning algorithm for extracting medial surfaces

Pattern Recognition Letters, Apr 1, 2002

Research paper thumbnail of Cellular algorithm for matrix multiplication

Proc of the Third International Workshop on Parallel Processing By Cellular Automata and Arrays, 1987

Research paper thumbnail of A 3D Parallel Shrinking Algorithm

Research paper thumbnail of 2D Parallel Thinning and Shrinking Based on Sufficient Conditions for Topology Preservation

Research paper thumbnail of Topology-preserving hexagonal thinning

Http Dx Doi Org 10 1080 00207160 2012 724198, Aug 8, 2013

Research paper thumbnail of Affine matching of two sets of points in arbitrary dimensions

Research paper thumbnail of On order-independent sequential thinning

2012 Ieee 3rd International Conference on Cognitive Infocommunications, Dec 1, 2012

Research paper thumbnail of A diszkrét tomográfia új irányzatai és alkalmazása a neutron radiográfiában = New directions in discrete tomography and its application in neutron radiography

Research paper thumbnail of Topology Preserving 2-Subfield 3D Thinning Algorithms

Signal Processing, Pattern Recognition and Applications, 2010

Research paper thumbnail of Discrete Geometry for Computer Imagery (vol. # 4245)

Research paper thumbnail of A 3-subiteration surface-thinning algorithm

Proceedings of the 12th International Conference on Computer Analysis of Images and Patterns, 2007

Research paper thumbnail of Spiral CT based assessment of laryngotrachealstenoses with 3D image processing using a Skeletonisation algorithm

Research paper thumbnail of Solution of dense systems of linear equations using cellular processors

Parcella, 1988

A cellular processor is a totally reconfigurable universal purpose device for highly parallel pro... more A cellular processor is a totally reconfigurable universal purpose device for highly parallel processing, where computations are performed by a homogeneous array of microprogrammable Boolean processors [6].

Research paper thumbnail of Topology-preserving equivalent parallel and sequential 4-subiteration 2D thinning algorithms

2015 9th International Symposium on Image and Signal Processing and Analysis (ISPA), 2015

Research paper thumbnail of Fully Parallel 3D Thinning Algorithms Based on Sufficient Conditions for Topology Preservation

Lecture Notes in Computer Science, 2009

... 188–190 (1990) 5. Hall, RW: Parallel connectivity-preserving thinning algorithms. In: Kong, T... more ... 188–190 (1990) 5. Hall, RW: Parallel connectivity-preserving thinning algorithms. In: Kong, TY, Rosenfeld, A. (eds.) Topological algorithms for digital image processing, pp. ... Pattern Recognition Letters 23, 677–686 (2002) 7. Kong, TY: On topology preservation in 2-d and 3-d ...

Research paper thumbnail of Equivalent Sequential and Parallel Reductions in Arbitrary Binary Pictures

International Journal of Pattern Recognition and Artificial Intelligence, 2014

A reduction transforms a binary picture only by changing some black points to white ones, which i... more A reduction transforms a binary picture only by changing some black points to white ones, which is referred to as deletion. Sequential reductions traverse the black points of a picture, and consider a single point for possible deletion, while parallel reductions can delete a set of black points simultaneously. Two reductions are called equivalent if they produce the same result for each input picture. A deletion rule is said to be equivalent if it yields a pair of equivalent parallel and sequential reductions. This paper introduces a class of equivalent deletion rules that allows us to establish a new sufficient condition for topology-preserving parallel reductions in arbitrary binary pictures. In addition we present a method of verifying that a deletion rule given by matching templates is equivalent, a necessary and sufficient condition for order-independent deletion rules, and a sufficient criterion for order-independent and translation-invariant parallel subfield-based algorithms.

Research paper thumbnail of Techniques in 3D Assessment of Tracheal-Stenosis by the Mean of Spiral Computed Tomography (S-CT) and Their Applications

Medical Imaging Systems Technology, 2005

Research paper thumbnail of Binary image reconstruction from a small number of projections and the morphological skeleton

Annals of Mathematics and Artificial Intelligence, 2014

Research paper thumbnail of Segmentation, Skeletonization, and Branchpoint Matching — A Fully Automated Quantitative Evaluation of Human Intrathoracic Airway Trees

Lecture Notes in Computer Science, 2002

Research paper thumbnail of Assessment of Intrathoracic Airway Trees: Methods and In Vivo Validation

Lecture Notes in Computer Science, 2004

Log In