• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2012.05a
• /
• pp.645-646
• /
• 2012

• Proceedings of the PSK Conference
• /
• 2001.04a
• /
• pp.102.1-102.1
• /
• 2001

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.4
• /
• pp.67-74
• /
• 2016

Drone images with high spatial resolution are emerging as an alternative to previous studies with extraction limits in high density forests. Individual tree in the dense forests were extracted from drone images. To detect the individual tree extracted through the image segmentation process, the image segmentation results were compared between the combination of DSM and all R,G,B band and the combination of DSM and R,G,B band separately. The changes in the tree density of a deciduous forest was experimented by time and image. Especially the image of May when the forests are dense, among the images of March, April, May, the individual tree extraction rate based on the trees surveyed on the site was 50%. The analysis results of the width of crown showed that the RMSE was less than 1.5m, which was the best result. For extraction of the experimental area, the two sizes of medium and small trees were extracted, and the extraction accuracy of the small trees was higher. The forest tree volume and forest biomass could be estimated if the tree height is extracted based on the above data and the DBH(diameter at breast height) is estimated using the relational expression between crown width and DBH.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.22 no.3
• /
• pp.55-71
• /
• 2019

The purpose of this study is to propose an evaluation method to assess green environments of streetscapes to improve urban street green spaces in Jeonju City. Through a rapid assessment of urban street green spaces, we suggest an objective basis for expanding street green space as well as for adopting sustainable maintenance and improvement measures. We choose 12 sections of streetscapes (roads and sidewalks) to investigate existing street conditions which have more than four lanes and function as major road axes. Six large roads and six medium roads of Jeonju City center area are investigated as pilot assessment study sites. Site inventory checklists consist of environmental characteristics of streetscape, street tree status, and planting condition evaluation. Environmental characteristics of streetscapes are composed of physical and neighborhood factors. For instance, items for physical factors are types and width of road/sidewalks, paving materials, tree protection materials, and green strip. And surrounding landuse is a neighborhood factor. Assessment items for street tree status are street plant names (tree/shrubs/ground cover), size, and planting intervals. Planting condition evaluation items are tree shape, damage, canopy density, and planting types with existence of adjacent green space. Evaluation results are classified into three levels such as A(maintain or repair), B(greening enhancement), and C(structural improvement). In case of grade A, streetscapes have enough sidewalk width for maintaining green strip and a multi-layered planting(in large road only) with fairly good growing conditions of street trees. For grade B and C, streetscapes have a moderate level of sidewalk width with a single street tree planting. In addition, street tree growing conditions are appeared poor so that green enhancement or maintenance measures are needed. For median, only grade B and C are found as its planting growing foundations are very limited in space. As a result, acquiring enough sidewalk space is essential to enhance ecological quality of urban street green. Especially, it is necessary to have green strip with reasonable widths for plant growing conditions in sidewalks. In addition, we need to consider native species with multi-layer plant compositions while designing street green.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.11
• /
• pp.102-110
• /
• 1992

In this paper, a new method of character recognition is proposed. It uses density information, in addition to positional and directional information generally used, to recognize a character. Four directional feature primitives are extracted from the thinning templates on the observation that the output of the templates have directional property in general. A simple and fast feature extraction scheme is possible. Features are organized from recursive nonary tree(N-tree) that corresponds to normalized character area. Each node of the N-tree has four directional features that are sum of the features of it's nine sub-nodes. Every feature primitive from the templates are added to the corresponding leaf and then summed to the upper nodes successively. Recognition can be accomplished by using appropriate feature level of N-tree. Also, effectiveness of each node's feature vector was tested by experiment. A method to implement the proposed feature vector organization algorithm into hardware is proposed as well. The third generation node, which is 4$\times$4, is used as a unit processing element to extract features, and it was implemented in hardware. As a result, we could observe that it is possible to extract feature vector for real-time processing.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.3
• /
• pp.250-259
• /
• 2001

Given a tree structured network in which each node has its own demand and also stands for a candidate location of a potential facility, such as plant or warehouse, a capacitated facility location problem on the network (CFLPOT) is to decide capacitated facility locations so that the total demand occurred on the network can be satisfied from those facilities with the minimum cost. In this paper, we first introduce a mixed integer programming formulation for CFLPOT with two additional assumptions, the indivisible demand assumption and the contiguity assumption and then show that it can be reformulated as a tree partitioning problem with an exponential number of variables. We then show that it can be solved in O($n^2b$) time by utilizing the limited column generation method developed by Shaw (1993), where n is the total number of nodes in the network and b is the maximum facility capacity. We also develop a depth-first dynamic programming algorithm with a running time of O(nb) for finding the locally maximal reduced cost which plays an important role in the limited column generation method. Finally, we implement our algorithms on a set of randomly generated problems and report the computational results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.9B
• /
• pp.1092-1097
• /
• 2011

An anti-collision protocol which tries to minimize the collision probability and identification time is the most important factor in all identification technologies. This paper focuses on methods to improve the efficiency of tag's process in identification systems. Our scheme, Binary Slotted Query Tree (BSQT) algorithm, is a memoryless protocol that identifies an object's ID more efficiently by removing the unnecessary prefixes of the traditional Query Tree (QT) algorithm. With enhanced QT algorithm, the reader will broadcast 1 bit and wait the response from the tags but the difference in this scheme is the reader will listen in 2 slots (slot 1 is for 0 bit Tags and slot 2 is for 1 bit Tags). Base on the responses the reader will decide next broadcasted bit. This will help for the reader to remove some unnecessary broadcasted bits which no tags will response. Numerical and simulation results show that the proposed scheme decreases the tag identification time by reducing the overall number of request.

• Journal of applied mathematics & informatics
• /
• v.37 no.3_4
• /
• pp.163-176
• /
• 2019

Given a distribution of pebbles on the vertices of a connected graph G, a pebbling move is defined as the removal of two pebbles from some vertex and the placement of one of those pebbles at an adjacent vertex. The t-pebbling number, $f_t(G)$, of a connected graph G, is the smallest positive integer such that from every placement of $f_t(G)$ pebbles, t pebbles can be moved to any specified vertex by a sequence of pebbling moves. A graph G has the 2t-pebbling property if for any distribution with more than $2f_t(G)$ - q pebbles, where q is the number of vertices with at least one pebble, it is possible, using the sequence of pebbling moves, to put 2t pebbles on any vertex. In this paper, we determine the t-pebbling number for the middle graph of a complete binary tree $M(B_h)$ and we show that the middle graph of a complete binary tree $M(B_h)$ satisfies the 2t-pebbling property.

• The Journal of the Society of Korean Medicine Diagnostics
• /
• v.16 no.2
• /
• pp.59-70
• /
• 2012

Objectives : Pulse diagnosis by Expert is the only way to classify 8 Constitutions so the study to supplement classifying method by the questionnaire has developed and modified and ECM-32 System has designed in 2010. But analyzing with Decision tree had many nodes and 32 important questions omitted while processing the data. So this study was to classify the 8 constitution patients into 2 groups first and analyze its characters in consecutive order. Methods : The participants of this study were 1027 patients who classified into one of the 8 constitutions according to pulse diagnosis and answered 251 questionnaires in 2010. They were divided into sympathetic nerve acceleration constitution and parasympathetic nerve acceleration constitution and analyzed with decision tree. Results : The reponses of the questionnaire were analyzed with 4 methods of 5 scales interval method from 0 to 5, Na, Low(1,2), Medium(3), High(4,5), average value, Y/N dichotomy. Average Value had no significance. 1. From the 5 scale interval method 6 questionnaires with 7 nodes (F5e, B1d, F7f, F2a, F1b, C4L) were significant. The accuracy was 92.5%. 2. From L, M, H method 7 questionnaires with 7 nodes(F5e, B1d, F7f, F1a, B1c, C4L, P3d) were significant. The accuracy was 92.5%. 3. From Y/N dichotomy 9 questionnaires with 9 nodes( F5e, B1d, F7f, F1a, B1c, C4L, B1b, P1i, B2a) were significant. The accuracy was 93.18%. Conclusions : Based on this study, Yes or No dichotomy method was most significant and categorized among the 4 methods. Unlike previous studies which used interval scale method only, Y/N dichotomy method was more statistically significant with the questionnaire to supplement the method of pulse diagnosis. For further study by analyzing decision tree method in consecutive order, the patients can be divided into 8 Constitutions with higher significance with less questionnaires.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.172-175
• /
• 1992

This paper proposes the methods to construct the tree-structured database and analyze the distribution system network. In order to cope with an extensive amount of data and the frequent breaker switching operations in distribution systems, the database for system configuration is constructed using binary trees. Once the tree-structured database has been built, the system tracing of distribution network can be rapidly performed. This remarkably enhances the efficiency of data search and easily adapts to system changes due to switching operations. The computation method of fast power flow using tree search strategies is presented. The methods in the paper may be available in the field of distribution system operation.