• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.1
• /
• pp.50-57
• /
• 2002

This paper is the study about the improvement of the WPTA4 algorithm available for the recognition of various characters. The WPTA4 algorithm can extract the skeleton of a character almost similar to the original pattern by using the connection value representing connectivity of each pixel. In this paper we show that the skeleton disappearance phenomena existing in the WPTA4 and propose an modified algorithm which can eliminate this phenomena. The proposed algorithm shows that the skeleton disappearance phenomena is eliminated and the quality of extracted skeleton is excellent.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.10
• /
• pp.2823-2829
• /
• 1999

This paper is a study on the improvement of WPTA algorithm available for the recognition of various characters. WPTA algorithm can extract the skeleton of a character almost similar to the original pattern by using the connection value representing connectivity of each pixel. In this paper we show that the skeleton disappearance phenomena existing in WPTA and propose modified algorithm which can eliminate this phenomena.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.18 no.4
• /
• pp.451-458
• /
• 2015

This paper handles self-collision avoidance for a rescue robot with redundant manipulators. In order to detect all available self-collisions in advance, minimum distances between arbitrary robot parts should be monitored in real-time. For the minimum distance estimation, we suggest a modified method from a previous skeleton algorithm which has less computation burden and realize collision avoidance based on a potential function using the proposed algorithm. The resultant command by collision avoidance should not disturb a given primary task, so null-space of joint solution from a CLIK is utilized for collision avoidance by a gradient projection method.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2790-2792
• /
• 2005

This paper proposes a path-planning algorithm that enables a robot to reach the goal position while avoiding obstacles. The proposed method, which is based on dynamic programming, finds an optimum path to follow using a modified skeleton map method which exploits information on obstacle positions. Simulation results show the feasibility of the proposed method.

• The Journal of the Convergence on Culture Technology
• /
• v.4 no.4
• /
• pp.361-366
• /
• 2018

For each character constituting learning data, different fonts are added in pixel unit to create MASK, and then pixel values belonging to the MASK are divided into three groups. The experimental data are modified into skeletal forms, and then regional boundary operation is used to create a boundary that distinguishes the background region adjacent to the skeleton of the character from the background of the modified experimental data. Discordance values between the modified experimental data and the MASKs are calculated, and then the MASK with the minimum value is found. This MASK is selected as a finally recognized result for the given experiment data. The recognition algorithm using skeleton of the character and the regional boundary operation can easily extend the learning data set by adding new fonts to the given learning data, and also it is simple to implement, and high character recognition rate can be obtained.

• Journal of Biomedical Engineering Research
• /
• v.21 no.3 s.61
• /
• pp.225-231
• /
• 2000

The Delaunay triangulation. which is one of the surface rendering methods. have been evaluated as a good algorithm which can solve the geometrical connection problems and make high quality images. However this method also have the problem that is the 'non-solid' connection between slices. In this paper, we proposed a new method for the Delaunay triangulation for the surface rendering from 2D medical images in the PC environment. The proposed method was designed to eliminate 'non-solid' tetrahedra. which had no correspondence to the geometric closeness, and used elimination algorithm with modified External Voronoi Skeleton path. This method enabled us to eliminate 'non-solid' tetrahedra without affecting other regions. Thus we could effectively reconstruct the complex shaped objects which were compactly connected with tetrahedra.