Two parallel thinning algorithms are presented and evaluated in this article. The two algorithms use two-subiteration approaches: (1) alternatively deleting north and east and then south and west bounda y pixels and (2) alternately applying a thinning operator to one of two subfields. image connectivities are proven to be preserved and the algorithms’ speed and medial curve thinness are compare...

Publications: Parallel Thinning Algorithms Based on Ronse's Sufficient Conditions for Topology Preservation [7], Németh, Gábor [8], and Palágyi Kálmán [9] , Progress in Combinatorial Image Analysis, May 2010, Singapore, p.183 194, (2010) An order-independent sequential thinning algorithm [10], Kardos, Péter [11], Németh Gábor [12], and Palágyi Kálmán [9] , Proceedings of the International Works...

Optimal thinning regimes for achieving several management objectives were derived from two stand-growth simulators by dynamic programming. Residual mean tree volumes were then plotted against stand density on density management diagrams. The results supported the use of density management diagrams for comparing, checking, and implementing the results of optimization analyses. FOREST ScI. 30:82-...

IMPORTANCE Optical coherence tomography (OCT) findings of temporal macular thinning are important in the diagnosis and prognosis of X-linked Alport syndrome (XLAS). OBJECTIVES To report OCT findings and severity of temporal macular thinning in a cohort with XLAS and to correlate these and other ocular findings with mutation genotype. DESIGN Patients with XLAS underwent genotyping for COL4A5...

His research interest includes medical image registration, fusion and 3D parallel thinning algorithms. Attila Kuba is the head of the Department of Applied Informatics, JJ ozsef Attila University , Szeged. His research interests are image processing, its applications in medicine, image reconstruction and discrete tomography. Thinning is a frequently used method for extracting skeletons in discr...

We studied the relief of water stress associated with fruit thinning in pear (Pyrus communis L.) trees during drought to determine what mechanisms, other than stomatal adjustment, were involved. Combinations of control irrigation (equal to crop water use less effective rainfall) and deficit irrigation (equal to 20% of control irrigation), fruit load (unthinned and thinned to 40 fruits per tree)...

A 3-layer recurrent neural network is proposed for parallel thinning. This network iteratively removes the contour points of an object shape by template matching. After the neural network converges, a perfectly 8-connected skeleton is derived. The set of templates which the neural network tries to match is specially designed for a one-pass parllel thinning algorithm. The proposed neural network...

This paper proposes a 2-subfield thinning algorithm for extracting medial curves on 3D binary images where the set of all voxels of an image is partitioned into two isometric subsets and the algorithm works alternatively on each subset at a time. The thinning algorithm is proved to preserve topology. An algorithm for verifying the topology soundness of thinning algorithms should be established ...

Thinning is a widely used approach for skeletonization. Sequential thinning algorithms use contour tracking: they scan border points and remove the actual one if it is not designated a skeletal point. They may produce various skeletons for different visiting orders. In this paper, we present a new 2-dimensional sequential thinning algorithm, which produces the same result for arbitrary visiting...

A widely used technique to obtain skeletons of binary objects is thinning, which is an iterative layer-by-layer erosion in a topology preserving way. Thinning in 3D is capable of extracting various skeleton-like shape descriptors (i.e., centerlines, medial surfaces, and topological kernels). This chapter describes a family of new parallel 3D thinning algorithms for (26,6) binary pictures. The r...