• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.355-356
• /
• 2011

LiDAR data is very large, which contains an amount of redundant information. The information not only takes up a lot of storage space but also brings much inconvenience to the LIDAR data transmission and application. Therefore, a simplified method was proposed for LiDAR data based on quad-tree structure in this paper. The boundary contour lines of the buildings are displayed as building extraction. Experimental results show that the method is efficient for point's simplification according to the rule of mapping.

• Journal of KIISE
• /
• v.41 no.10
• /
• pp.792-798
• /
• 2014

In spatial databases, R-tree is one of the most widely used indexing structures and many variants have been proposed for its performance improvement. Among these variants, Hilbert R-tree is a representative method using Hilbert curve to process large amounts of data without high cost split techniques to construct the R-tree. This Hilbert R-tree, however, is hardly applicable to large-scale applications in practice mainly due to high pre-processing costs and slow bulk-load time. To overcome the limitations of Hilbert R-tree, we propose a novel approach for parallelizing Hilbert mapping and thus accelerating bulk-loading of Hilbert R-tree on GPU memory. Hilbert R-tree based on GPU improves bulk-loading performance by applying the inversed-cell method and exploiting parallelism for packing the R-tree structure. Our experimental results show that the proposed scheme is up to 45 times faster compared to the traditional CPU-based bulk-loading schemes.

• Journal of the Korean Wood Science and Technology
• /
• v.47 no.6
• /
• pp.700-708
• /
• 2019

To verify the possibility of using resistograph to estimate the age of big old living trees, we selected three Zelkova serrata and seven Pinus densiflora in Goesan. The mean diameters at breast height of Z. serrata and P. densiflora were 102 (92-116) cm and 80 (65-110) cm, respectively. The heights measured from the ground using a resistograph ranged at 1.2-4.3 m and 0.6-1.1 m for Z. serrata and P. Densiflora, respectively. The most appropriate needle speed to determine tree-ring boundaries for measuring ring width was 1500 r/min for both tree species. Alternatively, the suitable feed speeds for Z. serrata and P. densiflora were 50 cm/min and 150 cm/min, respectively. From the measured data, the mean numbers of tree rings of Z. serrata and P. densiflora were 57 (43-68) and 104 (93-124), respectively, and the mean tree-ring widths were 4.27 mm (3.18-5.09 mm) and 2.93 mm (2.32-3.34 mm), respectively. A comparison between the time series of tree-ring widths by resistograph and that from the local master chronologies tallied for the heartwood part. Finally, this study showed that resistograph can be used to estimate tree ages when a local master chronology is available.

• Journal of Digital Convergence
• /
• v.18 no.11
• /
• pp.427-432
• /
• 2020

In order to establish an effective forest management plan, it is necessary to investigate tree management information such as tree height and DBH(Diameter at breast height). However, research on convergence and application of data acquisition technology to improve the efficiency of existing forest survey methods is insufficient. Therefore, in this study, tree management information was constructed and analyzed using point cloud data acquired through a 3D scanner. Data on the study site was acquired using fixed and mobile 3D scanners, and the efficiency of the mobile 3D scanner was presented through comparison of working hours. In addition, tree management information for object management was constructed by classifying vegetation by object using point cloud data, and by constructing information on chest height diameter and height. As a result of the accuracy evaluation compared with the conventional measurement method, the difference in tree height was 0.02-0.09m and DBH was 0.01-0.04m. If information on the location of vegetation and crowns of each object is constructed through additional research in the future, the efficiency of the work related to forest management information construction can be greatly increased.

• Journal of Korea Water Resources Association
• /
• v.51 no.11
• /
• pp.999-1009
• /
• 2018

A Model Tree technique of data mining was applied to derive optimal equations for sediment discharge assessment based on the measured sediment data and then to evaluate stable channel design for Naesung Stream. The sediment discharge formula as a function of channel width, velocity, depth, slope and median grain diameter which was developed by a Model Tree technique with sediment discharge data measured in Korean River had a high goodness-of-fit between measured and calculated results. In case of the sediment discharge formula as a function of channel width, velocity, depth and median grain diameter which was developed by a Model Tree technique with sediment discharge data only measured in Naesung Stream represented the highest goodness-of-fit. Two types of sediment discharge formulas were applied to evaluate stable channel analysis for Yonghyeol Station of Naesung Stream. As a result, bed erosion was expected in the study section compared to the current section. It was also presented that the be slope might be changed to be a milder slope than the current slope to reach equilibrium condition in the long term.

• Journal of KIISE:Databases
• /
• v.30 no.5
• /
• pp.451-463
• /
• 2003

Recently, there have been various research efforts to develop strategies for accelerating OLAP operations on huge amounts of spatio-temporal data. Most of the work is based on multi-tree structures which consist of a single R-tree variant for spatial dimension and numerous B-trees for temporal dimension. The multi~tree based frameworks, however, are hardly applicable to spatio-temporal OLAP in practice, due mainly to high management cost and low query efficiency. To overcome the limitations of such multi-tree based frameworks, we propose a new approach called Hilbert Cube(H-Cube), which employs fractals in order to impose a total-order on cells. In addition, the H-Cube takes advantage of the traditional Prefix-sum approach to improve Query efficiency significantly. The H-Cube partitions an embedding space into a set of cells which are clustered on disk by Hilbert ordering, and then composes a cube by arranging the grid cells in a chronological order. The H-Cube refines cells adaptively to handle regional data skew, which may change its locations over time. The H-Cube is an adaptive, total-ordered and prefix-summed cube for spatio-temporal data warehouses. Our approach focuses on indexing dynamic point objects in static spatial dimensions. Through the extensive performance studies, we observed that The H-Cube consumed at most 20% of the space required by multi-tree based frameworks, and achieved higher query performance compared with multi-tree structures.

• Journal of Korean Society of Forest Science
• /
• v.105 no.1
• /
• pp.122-131
• /
• 2016

This study was conducted to analyze the effect of climatic variables on tree-ring growth of Larix leptolepis distributed in Korea by dendroclimatological method. For this, annual tree-ring growth data of Larix leptolepis collected by the $5^{th}$ National Forest Inventory were first organized to analyze yearly growth patterns of the species. To explain the relationship between tree-ring growth of Larix leptolepis and climatic variables, monthly temperature and precipitation data from 1950 to 2010 were compared with tree-ring growth data for each county. When tree-ring growth data were analyzed through cluster analysis based on similarity of climatic conditions, six clusters were identified. In addition, index chronology of Larix leptolepis for each cluster was produced through cross-dating and standardization procedures. The adequacy of index chronologies was tested using basic statistics such as mean sensitivity, auto correlation, signal to noise ratio, and expressed population signal of annual tree-ring growth. Response function analysis was finally conducted to reveal the relationship between tree-ring growth and climatic variables for each cluster. The results of this study are expected to provide valuable information necessary for estimating local growth characteristics of Larix leptolepis and for predicting changes in tree growth patterns caused by climate change.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.17 no.2
• /
• pp.93-101
• /
• 2015

This study was conducted to analyze the relationship between tree-ring growth of Quercus acutissima and climatic variables by dendroclimatological method. Annual tree-ring growth data of Quercus acutissima collected by the $5^{th}$ National Forest Inventory (NFI5) were organized to analyze the spatial distribution of the species growth pattern. To explain the relationship between tree-ring growth of Quercus acutissima and climatic variables, monthly temperature and precipitation data from 1950 to 2010 were compared with tree-ring growth data for each county. When tree-ring growth data were analyzed through cluster analysis based on similarity of climatic conditions, four clusters were identified. In addition, index chronology of Quercus acutissima for each cluster was produced through cross-dating and standardization procedures. The adequacy of index chronologies was tested using basic statistics such as mean sensitivity, auto correlation, signal to noise ratio, and expressed population signal of annual tree-ring growth. Response function analysis was conducted to reveal the relationship between tree-ring growth and climatic variables for each cluster. The results of this study are expected to provide valuable information necessary for estimating local growth characteristics of Quercus acutissima and for predicting changes in tree growth patterns caused by climate change.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.1
• /
• pp.31-43
• /
• 2007

Sensor data have the characteristics such as numerous and continuous data. Therefore, it is required to develop an index which could retrieve a specific sensor data efficiently from numerous sensed data. The index should have an efficient delete operation for the past data to support the data archiving. In this paper, we have proposed and implemented an index splitting technique to support the sensor data archiving. These splitted indexes compose of a virtual index (that is, index management component), which is shown as single tree from outside. Experimental results show that in the case of 100,000 insert operations the splitted index performs 8% better than the traditional TB-tree maximumly. And the splitted index outperforms TB-tree with retrieving queries when the region of query is small and the size of time domain is large.

• Journal of Internet Computing and Services
• /
• v.21 no.4
• /
• pp.35-41
• /
• 2020

This paper proposes an algorithm to improve the compression performance of the adaptive multi-rate (AMR) speech coding using the context tree weighting (CTW) method. AMR is the voice encoding standard adopted by IMT-2000, and supports 8 transmission rates from 4.75 kbit/s to 12.2 kbit/s to cope with changes in the channel condition. CTW as a kind of the arithmetic coding, uses a variable-order Markov model. Considering that CTW operates bit by bit, we propose an algorithm that re-orders AMR data and compresses them with CTW. To verify the validity of the proposed algorithm, an experiment is conducted to compare the proposed algorithm with existing compression methods including ZIP in terms of compression ratio. Experimental results indicate that the average additional compression rate in AMR data is about 3.21% with ZIP and about 9.10% with the proposed algorithm. Thus our algorithm improves the compression performance of AMR data by about 5.89%.