• Journal of the Korea Society of Computer and Information
• /
• v.28 no.2
• /
• pp.99-110
• /
• 2023

In this paper, we propose a system termed ForestLi that can accurately estimate the diameter at breast height (DBH) and tree height using LiDAR point cloud data. The ForestLi system processes LiDAR point cloud data through the following steps: downsampling, outlier removal, ground segmentation, ground height normalization, stem extraction, individual tree segmentation, and DBH and tree height measurement. A commercial system, such as LiDAR360, for processing LiDAR point cloud data requires the user to directly correct errors in lower vegetation and individual tree segmentation. In contrast, the ForestLi system can automatically remove LiDAR point cloud data that correspond to lower vegetation in order to improve the accuracy of estimating DBH and tree height. This enables the ForestLi system to reduce the total processing time as well as enhance the accuracy of accuracy of measuring DBH and tree height compared to the LiDAR360 system. We performed an empirical study to confirm that the ForestLi system outperforms the LiDAR360 system in terms of the total processing time and accuracy of measuring DBH and tree height.

• Journal of Advanced Marine Engineering and Technology
• /
• v.37 no.1
• /
• pp.59-65
• /
• 2013

The objective of this paper is to analyze the structure of the wind power tree using a helical type wind turbine. The blades of a helical rotor is designed with a composite material. The structural analyses of a helical rotor have been implemented by finite element method. The structural analyses of the wind power tree which support four helical rotor, have been performed under a wind load, a rotational velocity of a rotor, and dead weight.

• Communications of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.631-638
• /
• 2018

Chellai et al. [3] gave an upper bound on the [1, 2]-domination number of tree and posed an open question "how to classify trees satisfying the sharp bound?". Yang and Wu [5] gave a partial solution for tree of order n with ${\ell}$-leaves such that every non-leaf vertex has degree at least 4. In this paper, we give a new upper bound on the [1, 2]-domination number of tree which extends the result of Yang and Wu. In addition, we design a polynomial time algorithm for solving the open question. By using this algorithm, we give a characterization on the [1, 2]-domination number for trees of order n with ${\ell}$ leaves satisfying $n-{\ell}$. Thereby, the open question posed by Chellai et al. is solved.

• Journal of Forest and Environmental Science
• /
• v.34 no.2
• /
• pp.162-164
• /
• 2018

This study quantified the carbon storage and uptake by street trees in Seoul and explored suitable planting and management strategies. A systematic sampling model was used to select 50 plots to survey the structures of street trees. The average density and cover of street trees were approximately 5.8 trees/$100m^2$ and 12.1%, respectively. Trees with a dbh of less than 30 cm accounted for about 66.3% of the total number of trees surveyed. The total carbon storage and uptake by the street trees were approximately 103,641 t and 10,992 t/yr, respectively. The total carbon uptake equaled the amount of annual carbon emissions from driving of about 11,000 cars. Street tree planting and management strategies were proposed to enhance carbon uptake. They included multi-layered and multi-aged planting, securing ground and space for plant growth, and avoiding excessive tree pruning.

• Journal of Korea Multimedia Society
• /
• v.20 no.4
• /
• pp.696-703
• /
• 2017

In this paper, we show how to design based on solving Sudoku problem that is one of the NP-complete problems like Go. We show how to use greedy method which can minimize depth based on tree expansion and how to apply heuristic algorithm for pruning unnecessary branches. As a result of measuring the performance of the proposed method for solving of Sudoku problems, this method can reduce the number of function call required for solving compared with the method of heuristic algorithm or recursive method, also this method is able to reduce the 46~64 depth rather than simply expanding the tree and is able to pruning unnecessary branches. Therefore, we could see that it can reduce the number of leaf nodes required for the calculation to 6 to 34.

• Journal of applied mathematics & informatics
• /
• v.12 no.1_2
• /
• pp.21-29
• /
• 2003

Let G be a graph with n vertices and n edges. The problem of constructing a spanning tree is to find a connected subgraph of G with n vertices and n -1 edges. In this paper, we propose an O(log n) time parallel algorithm with O(n/ log n) processors on an EREW PRAM for constructing a spanning tree on trapezoid graphs.

• Journal of Korean Society for Quality Management
• /
• v.19 no.2
• /
• pp.96-107
• /
• 1991

At the design stage of a plant, the plausible causes and pathways of release of hazardous materials are not clearly known. Thus there exist large amount of uncertainties on the consequences resulting from the operation of a fusion plant. In order to better handle such uncertain circumstances, we utilize the Probabilistic Risk Assessment(PRA) for the safety analyses on fusion power plant. In this paper, we concentrate on the tritium release accident. We develop a simple model that describes the process and flow of tritium, by which we figure out the locations of tritium inventory and their vulnerability. We construct event tree models that lead to various levels of tritium release from abnormal initiating events. Branch parameters on the event tree are assessed from the fault tree analysis. Based on the event tree models we construct influence diagram models which are more useful for the parameter updating and analysis. We briefly discuss the parameter updating scheme, and finally develop the methodology to obtain the predictive distribution of consequences resulting from the operating a fusion power plant. We also discuss the way to utilize the results of testing on sub-systems to reduce the uncertain ties on over all system.

• Proceedings of the KIEE Conference
• /
• 1999.07e
• /
• pp.2051-2053
• /
• 1999

In this work, PD patterns and electrical trees are observed by use of the XLPE cable insulation. and the tree initiation voltage related to the contamination are also measured in order to calculate the electric stress necessary for the design of cable insulation. Throughout these works, correlation between the PD pattern and the shape of electrical tree has been observed that there may exist three distinct pattern of PD dependence on the stage of tree propagation, Such correlation could bring a basic information in connection with the partial discharge of cable system. It was also found that the electrical stress necessary for the initiation of electrical tree was measured to the 290kV/mm for the 154kV XLPE cables manufactured in KOREA.

• Proceedings of the KSME Conference
• /
• 2008.11b
• /
• pp.2652-2657
• /
• 2008

An analytical study was carried out on the flow resistance of tree-shaped channel flow architectures, based on the principle of the constructal law of evolutionary increase of flow access through the generation of better flowing configurations with two diameters in the square domain. Two types of tree-shaped configurations are optimized. The minimized global flow resistance decreases definitely as the system size, N, increases. And the best channel configurations among the first construct and second construct as a result of regarding pressure drop was selected. We also show that the freedom to morph the design and to increase its performance can be enhanced by using tree-tree configurations with $2^{nd}$ construct when N is greater than 18.

• Journal of the Korea Furniture Society
• /
• v.17 no.4
• /
• pp.109-114
• /
• 2006

An investigation was carried out for the annual ring width, longitudinal tracheid diameter and wall thickness in different tree heights for Pinus koraiensis Sieb. et. Zucc. The annual ring width increased along with the tree height, however the tracheid diameter and wall thickness decreased with the tree height. Tracheid wall thickness was found the thickest at 2.0m from the above ground samples and it increased gradually from pith to bark. Radial tracheid diameter was found to be larger than that of tangential tracheid diameter in earlywood. But, it was found to be the opposite in latewood. In earlywood, the average values of tracheid wall thickness was found the range of $2.1-3.0{\mu}m$, whereas, in latewood, it was $2.4-4.2{\mu}m$.