Thinning as a layer-by-layer reduction is a frequently used technique for skeletonization. Sequential thinning algorithms usually suffer from the drawback of being orderdependent, i.e., their results depend on the visiting order of object points. Earlier order-independent sequential methods are based on the conventional thinning schemes that preserve endpoints to provide relevant geometric info...

THINNING overdense stands to improve growth rate of trees is one way in which the nation's supply of merchantable timber can be increased significantly.' In the Pacific Northwest alone, several million acres of such dense precommercial stands would benefit from thinning. Two basic methods are used to thin dense forest stands—felling unwanted trees with saws or killing them with chemicals. Econo...

The nearest neighbor (NN) classifier is well suited for generic object recognition. However, it requires storing the complete training data, and classification time is linear in the amount of data. There are several approaches to improve runtime and/or memory requirements of nearest neighbor methods: Thinning methods select and store only part of the training data for the classifier. Efficient ...

Corrosion is one of the important factors in equipment failures. Wall thinning can be used to evaluate corrosion conditions. However, most of equipments are coated with insulations in order to elevate the energy efficiency. Pulsed eddy current (PEC) testing technique can be used to measure wall thinning through insulation. But when the insulation outside is wrapped with galvanized steel, PEC si...

This paper describes methods for randomly thinning certain classes of spatial point processes. In the case of a Markov point process, the proposed method involves a dependent thinning of a spatial birth-and-death process, where clans of ancestors associated with the original points are identified, and where one simulates backwards and forwards in order to obtain the thinned process. In the case...

This paper investigates the skeletonization problem using parallel thinning techniques and proposes a new one-pass parallel asymmetric thinning algorithm (OPATA 8). Wu and Tsai presented a one-pass parallel asymmetric thinning algorithm (OPATA 4) that implemented 4-distance, or city block distance, skeletonization. However, city block distance is not a good approximation of Euclidean distance. ...

Poisson thinning is an elementary result in probability, which of great importance the theory point processes. In this article, we record a couple characterization results on thinning. We also consider several free probability analogues thinning, collectively dub as \emph{free thinning}, and prove for them, similar to classical case. One these procedures arises naturally high-dimensional asympt...

In this work a new method of skeletonization is presented. The results of applying the developed algorithm showed its universality. A detailed comparison with other very good and almost ideal algorithms of thinning [1,2,3,4,5] is given. Both texts and pictures are tested to prove the essential difference between the presented in this paper algorithm and the other known ones, including the autho...