The thinning is an iterative layer by layer erosion until only the "skeletons" of the objects are left. This paper presents a thinning algorithm for extracting medial surfaces from 3D binary pictures. The st...
详细信息
The thinning is an iterative layer by layer erosion until only the "skeletons" of the objects are left. This paper presents a thinning algorithm for extracting medial surfaces from 3D binary pictures. The strategy which is used is called fully parallel, which means that the same parallel operator is applied at each iteration. An efficient implementation of the proposed algorithm on conventional sequential computers is given and the topological correctness for (26, 6) binary pictures is proved. (c) 2008 Elsevier B.V. All rights reserved.
作者：
BERTRAND, GLABO IAAI
ESIEE Cité Descartes BP 99 93162 Noisy-le-Grand Cedex France
A new 3D parallel thinning algorithm for medial surfaces is proposed. It works in cubic grids with the 6-connectivity. This algorithm is based on a precise definition of end points which are points belonging to surfac...
详细信息
A new 3D parallel thinning algorithm for medial surfaces is proposed. It works in cubic grids with the 6-connectivity. This algorithm is based on a precise definition of end points which are points belonging to surfaces or curves. We give a necessary and sufficient Boolean condition for characterizing points which are simple, non-ends and which are border points of a certain type (N, S, E, W, U, D). The algorithm consists precisely in removing all points satisfying the condition: it has a little computational cost and it is based on a clear thinning criterion.
A fully parallel thinning algorithm may be considered to be constructed in two stages: (i) the definition of edge pixels which can be sequentially removed;and (ii) the definition of protection guards which ensures tha...
详细信息
A fully parallel thinning algorithm may be considered to be constructed in two stages: (i) the definition of edge pixels which can be sequentially removed;and (ii) the definition of protection guards which ensures that the parallel thinning of pixels does not involve destructive interference - for example, the complete removal of a pattern. The goal of this article is to modify the protection conditions of Wu and Tsai's algorithm (1992) and to prove that the resulting method is free from undesirable parallel interactions.
A comparison between two fully parallel thinning algorithms designed for images sampled on the square and hexagonal grids is reported. Using techniques from mathematical morphology, a hexagonal algorithm has been desi...
详细信息
A comparison between two fully parallel thinning algorithms designed for images sampled on the square and hexagonal grids is reported. Using techniques from mathematical morphology, a hexagonal algorithm has been designed to closely match the operation of a well known square grid algorithm. Proofs of the connectivity and single pixel limb width of the resulting converged hexagonal skeleton have been presented. Implementations of both algorithms were found to produce accurate skeletons, but the hexagonal could be implemented with only 50% of the logical operations required by the square.
With the onset of ultra-compact packages, systems in package may include stacked dies and mechanical sensors. Thus the thinning of silicon becomes necessary. The risk of failure, especially die crack, is often a major...
详细信息
With the onset of ultra-compact packages, systems in package may include stacked dies and mechanical sensors. Thus the thinning of silicon becomes necessary. The risk of failure, especially die crack, is often a major concern in the reliability of electronic packages. Therefore chip strength assessment becomes necessary for reliability prediction. In this paper, three-point-bend test and ball-on-ring test are compared to evaluate the risk of fracture of a silicon die as a function of its thickness, and of surface quality induced by the thinning process. Five thinning processes and six thicknesses (from 300 mu M down to 80 mu m) are statistically evaluated. (C) 2012 Elsevier Ltd. All rights reserved.
An efficient image compression technique as a preprocessing step for skeletonisation is presented. For this purpose a 5*5 pattern window is used, in which an internal 3*3 nonoverlapping window does the compression whi...
详细信息
An efficient image compression technique as a preprocessing step for skeletonisation is presented. For this purpose a 5*5 pattern window is used, in which an internal 3*3 nonoverlapping window does the compression whilst the outer ring of pixels helps to preserve the image connectivity during compression. Comparative evaluation based on experimental results, execution timings and quality of the skeleton obtained, show that this algorithm is faster and more efficient than many other existing thinning algorithms. This algorithm is also more efficient for noisy images than other thinning algorithms because it simultaneously performs median filtering operations.
This paper presents a new application of a neural network model in the area of dedicated (handwritten numerals) binary pattern thinning. The thinning method has been tested on 6000 randomly selected images of unconstr...
详细信息
This paper presents a new application of a neural network model in the area of dedicated (handwritten numerals) binary pattern thinning. The thinning method has been tested on 6000 randomly selected images of unconstrained handwritten numerals. The test results show that the method introduces minimal structural deformity and the skeletal shape of the underlying pattern is retained.
Fiducial markers are used to determine object location, but in certain applications, such as biaxial strain analysis, markers may migrate. In such cases it is necessary to first establish existence and locate the appr...
详细信息
Fiducial markers are used to determine object location, but in certain applications, such as biaxial strain analysis, markers may migrate. In such cases it is necessary to first establish existence and locate the approximate center of the fiducial. We have developed an algorithm (the MPT algorithm) which is an improvement of a well-known morphological thinning algorithm, and which can thin entities to a central pixel. This allows efficient location of markers. The improvement corrects a shortcoming of the previous algorithm which annihilated certain classes of small entities. The new algorithm safely thins small entities to their central points. Concave entities are acceptable since the algorithm preserves connectedness. This new algorithm will have applications in general scene analysis tasks.
Anovel design technique is presented whereby a reflectarray comprising sub-wavelength coupled-resonant elements can be array thinned without significant reduction in gain at the centre frequency. A thinned reflectarra...
详细信息
Anovel design technique is presented whereby a reflectarray comprising sub-wavelength coupled-resonant elements can be array thinned without significant reduction in gain at the centre frequency. A thinned reflectarray can more readily accommodate the integration of active components.
Given a finite point set Z subset of R-d, the covering radius of a nonempty subset X subset of Z is the minimum distance r(X,Z) such that every point in Z is at a distance of at most r(X,Z) from some point in X. This ...
详细信息
Given a finite point set Z subset of R-d, the covering radius of a nonempty subset X subset of Z is the minimum distance r(X,Z) such that every point in Z is at a distance of at most r(X,Z) from some point in X. This paper concerns the construction of a sequence of subsets of decreasing sizes, such that their covering radii are small. To this end, a method for progressive data reduction, referred to as scattered data filtering, is proposed. The resulting scheme is a composition of greedy thinning, a recursive point removal strategy, and exchange, a postprocessing local optimization procedure. The paper proves adaptive a priori lower bounds on the minimal covering radii, which allows us to control for any current subset the deviation of its covering radius from the optimal value at run time. Important computational aspects of greedy thinning and exchange are discussed. The good performance of the proposed filtering scheme is finally shown by numerical examples. (C) 2003 Elsevier B.V. All rights reserved.
暂无评论