• Journal of the Korean Institute of Navigation
• /
• v.19 no.3
• /
• pp.21-28
• /
• 1995

Mathematical morphology skeleton image processing makes many partial skeleton image planes from an original binary image. And the original binary image can be reconstructed without any distortion by summing the first partial skeleton image plane and each dilated partial skeleton image planes using the same structuring element. Especially compression effects of Elias coding to the morphological globally minimal skeleton(GMS) image, is better than that of PCX and Huffman coding. And then this paper proposes mathematical morphological GMS image processing which can be applied to a binary image transmitting for facimile and big size(bigger than $64{\times}64$ size) bitmap fonts storing in a memory.

• Journal of Korea Multimedia Society
• /
• v.7 no.4
• /
• pp.459-466
• /
• 2004

In this paper, an effective skeleton method is proposed in order to obtain an enhanced digital image of skeleton line. The binary image using the threshold values is applied in the preprocessing stage and then the modified parallel processing method is applied to obtain the improved image of skeleton line. The existing skeleton methods are Rutovitz, Steiabelli and other five skeleton methods. In the digital process of skeleton line, the major problem caused by these methods is elongated lines and noise branches of the processed image. In this study, however, such noises are deleted first by the modified parallel processing step of the proposed method. Then a pixel is compared to its eight neighbor pixels. if its neighbor pixels are in one of the eight conditions, the central pixel is deleted. As a result, the quality of the skeleton is better then those produced by the existing skeleton methods.

• Journal of Korea Multimedia Society
• /
• v.8 no.1
• /
• pp.27-33
• /
• 2005

In this paper, an effective skeleton method is proposed in order to obtain an enhanced digital image of skeleton line. The binary image using the threshold values is applied in the preprocessing stage and then The proposed method is applied to obtain the improved image of skeleton line. We used the existing skeleton methods and SPTA(Shin's Parallel Thinning Algorithm) method for the comparison. The demerits of the existing skeleton methods have a result of noise branch, expansion and contraction. and then we are proposed a SPTA method.

• Journal of Korea Multimedia Society
• /
• v.6 no.2
• /
• pp.224-229
• /
• 2003

In this paper, an effective skeleton method is proposed in order to obtain an enhanced digital image of skeleton line. The edge-detection method is applied in the preprocessing stage and after that, the modified Parallel method is applied to obtain the improved image of skeleton line. The existing parallel methods are Zhang, Lu and Wang, and Paul methods. Firstly, a parallel process method Is applied, and the proposed method is applied that the original is compared with the four neighbor pixels and four corner pixels of mask. In conclusion, the proposed method shows an improved connectivity and quality of skeleton line.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.3
• /
• pp.576-586
• /
• 1996

Original binary image can be reconstructed by morphological bymorphological skeleton(MS) image. And then, the information of MS image points can be applied to a pattern recognition andimage communication. But if we apply MS to a pattern recognition and image communication, there are two problems. That is to say, binary MS processing times is long and skeleton points of MS are high redundancy. And then, to solve these problems, this paper proposes DGMS. After simulating by the proposed method to $256{\times}256$ binary image which is GIRL, we reduce processing time and skeleton points about 1.5~6.5% comparing with the result of GMS method.

• The KIPS Transactions:PartB
• /
• v.14B no.4
• /
• pp.263-272
• /
• 2007

This paper proposes a skeleton-based hierarchical shape description scheme, called a skeleton tree, for accurate shape-based image retrieval. A skeleton tree represents an object shape as a hierarchical tree where high-level nodes describe parts of coarse trunk regions and low-level nodes describe fine details of boundary regions. Each node refines the shape of its parent node. Most of the noise disturbances are limited to bottom level nodes and the boundary noise is reduced by decreasing weights on the bottom levels. The similarity of two skeleton trees is computed by considering the best match of a skeleton tree to a sub-tree of another skeleton tree. The proposed method uses a hybrid similarity measure by employing both Fourier descriptors and moment invariants in computing the similarity of two skeleton trees. Several experimental results are presented demonstrating the validity of the skeleton tree scheme for the shape description and indexing.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.974-977
• /
• 1999

In this paper, we have proposed the hardware architecture which implements the algorithm for retaining the connectivity which prevents disconnecting in the gray-scale image thinning To perform the image thinning in a real time which find a skeleton in image, it is necessary to examine the connectivity of the skeleton in a real time. The proposed architecture finds the connectivity number in the 4-clock period. The architecture is consists of three blocks, PS(Parallel to Serial) Converter and State Generator and Ridge Checker. The PS Converter changes the 3$\times$3 gray level image to four sets of image pixels. The State Generator examine the connectivity of the central pixel by searching the data from the PS Converter. the 3$\times$3 gray level image determines. The Ridge Checker determines whether the central pixel is on the skeleton or not The proposed architecture finds the connectivity of the central pixel in a 3$\times$3 gray level image in the 4-clocks. The total circuits are verified by the design tools and operate correctly.

• Journal of Advanced Navigation Technology
• /
• v.24 no.2
• /
• pp.155-162
• /
• 2020

Recently, with the development of computer vision and deep learning technology, research on human action recognition has been actively conducted for video analysis, video surveillance, interactive multimedia, and human machine interaction applications. Diverse techniques have been introduced for human action understanding and classification by many researchers using RGB image, depth image, skeleton and inertial data. However, skeleton-based action discrimination is still a challenging research topic for human machine-interaction. In this paper, we propose an end-to-end skeleton joints mapping of action for generating spatio-temporal image so-called dynamic image. Then, an efficient deep convolution neural network is devised to perform the classification among the action classes. We use publicly accessible UTD-MHAD skeleton dataset for evaluating the performance of the proposed method. As a result of the experiment, the proposed system shows better performance than the existing methods with high accuracy of 97.45%.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.915-918
• /
• 1998

Region based coding consistsof image segmentation contour and texture coding. Contour coding techniques can be classified into contour or shape-oriented approaches. In this paper, geodesic skeleton based on shape-oriented approach is used for contour coding. Efficient application of geodesic skeleton for contour coding based on the characteristics of regions in segmented image will be discussed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.9
• /
• pp.2317-2327
• /
• 1996

Original binary image can be reconstructed without any distortion by MS(morphological skeleton) image. Though we reduce some points in a MS image, there is no problem to reconstruct original image by it. And then, there are two methods of LMS and GMS which reduce the redundant points of a MS image. The redundancy degree of a GMS image is zero and it is less than that of LMS. And then, GMS image is the best thing of the three kinds of morphological skeleton image to enhance the compression efficienty by the Elias code. But there are continous SKF=1 points in a GMS image whenever using 2 dimensional structureing element. Those points in a GMS image gives rise to a bad compression efficiency. And then, solving this problem, this paper proposes hybrid structuring elements algorithms for binary image compression.