• IE interfaces
• /
• v.15 no.1
• /
• pp.20-25
• /
• 2002

In this research, a nameplate engraving system for images and texts downloaded through Internet on nameplate is developed. The system consists of two subsystems: thinning algorithm and NC code generation module. In the thinning algorithm, the concept of connectivity is used and center lines of images and texts, which will be used as NC tool paths, can be obtained successfully. Because the center lines are composed of a lot of pixels, NC code would be too long. In the NC code generation module, many useless pixel data are removed and linear interpolation algorithm is applied to only the remaining pixels. By performing actual experiments, the thinning algorithm and the NC code generation module are verified.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.2
• /
• pp.153-158
• /
• 1992

We propose, in this paper, a new thinning algorithm and demonstrate Its effectiveness with some concrete experimental results. This new thinning process can solve the problems of disconnectivity and end point reduction explored in one-Pass algorithm Furthermore, this algorithm is proven effective particularly In high speed operation. A processor for this algorithm that is capable of hand-ling Input Image width(between 25 and 4t) bits ) and also operates on pipelining, is implemented and tested. Flexibility and high speed operation of this thinning processor should find excellent applicability in various areas.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.73-81
• /
• 2004

To extract the creditable features in fingerprint image, many people use the thinning algorithm that has a very important position in the preprocessing. In this paper, we propose the robust parallel thinning algorithm that can preserve the connectivity of the binarized fingerprint image, make the thinnest skeleton with 1-pixel width and get near to the medial axis extremely. The proposed thinning method repeats three sub-iterations. The first sub-iteration takes off only the outer boundary pixel by using the interior points. To extract the one side skeletons, the second sub-iteration finds the skeletons with 2-pixel width. The third sub-iteration prunes the needless pixels with 2-pixel width existing in the obtained skeletons and then the proposed thinning algorithm has the robustness against the rotation and noise and can make the balanced medial axis. To evaluate the performance of the proposed thinning algorithm we compare with and analyze the previous algorithms.

• Transactions of the Korean Society of Pressure Vessels and Piping
• /
• v.11 no.2
• /
• pp.31-39
• /
• 2015

Pipe wall-thinning by flow-accelerated corrosion (FAC) and various types of erosion is a significant and costly damage phenomenon in secondary piping systems of nuclear power plants (NPPs). Most NPPs have management programs to ensure pipe integrity due to wall-thinning that includes periodic measurements for pipe wall thicknesses using ultrasonic tests (UTs). Nevertheless, thinning evaluations are not easy because the amount of thickness reduction being measured is often quite small compared to the accuracy of the inspection technique. U.S. Electric Power Research Institute (EPRI) had proposed Total Point Method (TPM) as a thinning occurrence evaluation method, which is a very useful method for detecting locally thinned pipes or fittings. However, evaluation engineers have to discern manually the measurement data because there are no numerical algorithm for TPM. In this study, numerical algorithms were developed based on non-parametric and parametric statistical method.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.2 no.1
• /
• pp.54-62
• /
• 1999

Vectorizing for input processing of map is the most time and cost consuming task, and the quality of vector data depends on that processing result. Therefore, it is an important task to develop a good vectorizing system in the GIS. Thinning algorithm is the most important technology for deciding the quality of vector data in the vectorizing system. In this paper, as a suitable algorithm for map vectorizing we considered several algorithms that preserve topological and geometric characteristics, and have no distortion of the contour line. As a results, we implemented WPTA4 and well known thinning algorithm, and compared WPTA4 execution results with the others.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.2 no.1
• /
• pp.45-53
• /
• 1999

Geographic Information System(GIS) which facilitates efficient storage and retrieval of geographic information is very useful tools. It is of extreme importance to develop automated vectorizing system as input method for GIS, because it takes a large amount of time and effort in constructing a GIS. In all kinds of map processed by GIS, contour line map specially takes a large amount of effort. In this paper we have considered an optimal thinning algorithm for the contour line vectorizing in the GIS. Based on the experimental results, it has been proved that thinning algorithm using the connection value is most excellent algorithm in the similarity and connectivity.

• Korean Journal of Cognitive Science
• /
• v.7 no.1
• /
• pp.5-35
• /
• 1996

This paper addresses an one-pass parallel thinning algorithm which shows effectiveness in both accuracy and speed. The proposed method is based on parallel iterative boundary removal.Image connectivity are preseved and the algorithms performance is compared to other algorithms especially to parallel thinning algorithm which is the best parallel algorithm have been proposed.Evaluation result shows that the proposed algorithm compare favorably to others.The result shows exact thinning free from one pixel boundary noise and free from distortion of shape.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.719-721
• /
• 2013

A thinning stage of fingerprint algorithm occupies 39% cycle of microprocessor system for identification processing of image from fingerprint sensor. Hardware block processing is more effective than software one in speed and power consumption, because a thinning algorithm is iteration of simple instructions without a transcendental function. This paper describes an effective hardware scheme for thinning stage processing using Verilog-HDL in $64{\times}64$ Pixel Array. The hardware scheme is designed and simulated in RTL. The logic is also synthesized by XST in FPGA environment and tested. Experimental results show the performance of the proposed scheme and possibility of application for a soft microprocessor and thinning processor embedded fingerprint SoC.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.8
• /
• pp.35-43
• /
• 1992

We have presented the tracing algorithm for center pixel of character image. Character image was read by scanner device. Performing the tracing process, it can be possible to detect feature points, such as branch point, stroke of 4 directions. So, the tracing process covers the thinning and feature point detection process for improving the processing time. Usage of suggested tracing algorithm instead of thinning that is the preprocessing of character recognition increases speed up to 5 times. The preprocessing chip has been designed by using single layer perceptron algorithm.

• Korean Journal of Cognitive Science
• /
• v.2 no.2
• /
• pp.341-358
• /
• 1990

In this paper, A thinning algorithm which can solve a noise problem os proposed. The proposed method is based on the pavlidis thinning algorithm. During a contour tracing period of the given image, the masks of $3{\times}3$ pixels are proposed. They check all possible caseds of the noise conditions. As soon as the contour tracing is finished, the candidates of the noise are automatically deleted. As a result of the implementation of the proposed algorithm, the similar results which is obtained by noise-free image are obtained and they show the simplified structures comparing with the thinning results of the noisy images. Thus, They illustrate that a simple recognition part is needed to identify the objects.