• Journal of Environmental Impact Assessment
• /
• v.17 no.5
• /
• pp.279-288
• /
• 2008

Vertical forest distribution is one of the important factors to understand various ecological mechanism such as succession, disturbance and environmental effects. LiDAR data provide information, both the horizontal and vertical distribution of forest structure. The laser scanner survey provided a point cloud, in which the x, y, and z coordinates of the points are known. The objectives of this study were 1) to analyze factors of forest structure such as individual tree isolation, tree height, canopy closure and tree density using LiDAR data and 2) to compare the forest structure between outer and interior forest. The paper conducted to extract the individual tree using watershed algorithm and to interpolate using the first return of LiDAR data for yielding digital surface model (DSM). The results of the study show characters of edge such as more isolated individual trees, higher density, lower canopy closure, and lower tree height than those of interior forest. LiDAR data is to be useful for analyzing of forest structure. Further study should be undertaken with species for more accurate results.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.5 no.2
• /
• pp.54-68
• /
• 2002

In this paper, We propose a multi-dimensional index structure, called a VA (vector approximate) -tree that constructs a tree with vector approximates of multi-dimensional feature vectors. To save storage space for index structures, the VA-tree employs vector approximation concepts of VA-file that presents feature vectors with much smaller number of bits than original value. Since the VA-tree is a tree structure, it does not suffer from performance degradation owing to the increase of data. Also, even though the VA-tree is MBR Minimum Bounding Region) based tree structure like a R-tree, its split algorithm never allows overlap between MBRs. We show through various experiments that our proposed VA-tree is the efficient index structure for large amount of multi-dimensional data.

• Journal of KIISE:Databases
• /
• v.35 no.2
• /
• pp.169-181
• /
• 2008

Because moving objects usually move on spatial networks, efficient trajectory index structures are required to achieve good retrieval performance on their trajectories. However, there has been little research on trajectory index structures for spatial networks such as FNR-tree and MON-tree. But, because FNR-tree and MON-tree are stored by the unit of the moving object's segment, they can't support the whole moving objects' trajectory. In this paper, we propose an efficient trajectory index structure, named Trajectory of Moving objects on Network Tree(TMN Tree), for moving objects. For this, we divide moving object data into spatial and temporal attribute, and preserve moving objects' trajectory. Then, we design index structure which supports not only range query but trajectory query. In addition, we divide user queries into spatio-temporal area based trajectory query, similar-trajectory query, and k-nearest neighbor query. We propose query processing algorithms to support them. Finally, we show that our trajectory index structure outperforms existing tree structures like FNR-Tree and MON-Tree.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.598-607
• /
• 2005

We propose a new external-memory index data structure, the Suffix B-tree. The Suffix B-tree is a B-tree in which the key is a string like the String B-tree. While the node in the String B-tree is implemented with a Patricia trio, the node in the Suffix B-tree is implemented with an array. So the Suffix B-tree is simpler and easier to be Implemented than the String B-tree. Nevertheless, the branching algorithm of the Suffix B-tree is as efficient as that of the String B-tree. Consequently, the Suffix B-tree takes the same worst-case disk accesses as the String B-tree to solve the string matching problem, which is fundamental and important in the area of string algorithms.

• Journal of Information Technology Applications and Management
• /
• v.12 no.1
• /
• pp.111-123
• /
• 2005

Many indexing methods were proposed so that process moving object efficiently. Among them, indexing methods like the 3D R-tree treat temporal and spatial domain as the same. Actually, however. both domain had better process separately because of difference in character and unit. Especially in this paper we deal with limited region such as indoor environment since spatial domain is limited but temporal domain is grown. In this paper we present a novel indexing structure, namely STS-tree(Separation of Time and Space tree). based on limited region. STS-tree is a hybrid tree structure which consists of R-tree and one-dimensional TB-tree. The R-tree component indexes static object and spatial information such as topography of the space. The TB-tree component indexes moving object and temporal information.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.365-370
• /
• 1997

In this paper we suggest a development of surface defect inspection algorithms for cold mill strip using tree structure. The defects which exist in a surface of cold mill strip have a scattering or singular distribution. This paper consists of preprocessing, feature extraction and defect classification. By preprocessing, the binarized defect image is achieved. In this procedure, Top-hit transform, adaptive thresholding, thinning and noise rejection are used. Especially, Top-hit transform using local min/max operation diminishes the effect of bad lighting. In feature extraction, geometric, moment, co-occurrence matrix, histogram-ratio features are calculated. The histogram-ratio feature is taken from the gray-level image. For the defect classification, we suggest a tree structure of which nodes are multilayer neural network clasifiers. The proposed algorithm reduced error rate comparing to one stage structure.

• Journal of IKEEE
• /
• v.24 no.2
• /
• pp.372-377
• /
• 2020

This paper is based on the triangular inset patch antenna as the basic structure, and the array structure is the twin tree form to improve the antenna's main lobe gain and reduce the side lobe gain. A twin tree structure was implemented by placing two identical trees of 2-4-6 arrays of triangular inset patches side by side. The parametric analysis confirmed that the gap between tree structures arranged side by side is most effective for impedance matching. The fabricated antenna has a gain of 16.74 dBi at 24.15 GHz, and the beam width of the main lobe is 22° in the E-plane and 6° in the H-plane. The antenna size was 125 mm × 50 mm, and a Taconic TLC substrate with a dielectric constant of 3.2 was used. Although the main lobe gain is improved over the twin tree structure, The directivity in the beam pattern due to the mutual interference of the two tree array structure can be improved.

• Industrial Engineering and Management Systems
• /
• v.10 no.2
• /
• pp.161-169
• /
• 2011

In seeking further efficiency in production preparation, it is common to examine assembly sequences using digital manufacturing. The assembly sequences affect the product evaluation, so it is necessary to test several assembly sequences before actual production. However, because selection and testing of assembly sequences depends on the operator's personal experience and intuition, only a small number of assembly sequences are actually tested. Nevertheless, there is a systematic method for generating assembly sequences using a contact-related figure. However, the larger the number of parts, the larger the number of assembly sequences geometric becomes. The purpose of this study is to establish a systematic method of generating efficient assembly sequences regardless of the number of parts. To generate such assembly sequences selectively, a "Tournament Tree," which shows the structure of an assembly sequence, is formulated. Applying the method to assembly sequences of a water valve, good assembly sequences with the same structure as the Tournament Tree are identified. The structure of such a Tournament Tree tends to have fewer steps than the others. As a test, the structure is then applied for a drum cartridge with 38 parts. In all the assembly sequences generated from the contact-related figures, the best assembly sequence is generated by using the Tournament Tree.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.8
• /
• pp.73-83
• /
• 2017

In this paper, we discuss the differences between an ordinary B-tree and B-tree implemented by NTFS. There are lots of distinctions between the two B-tree, if not understand the distinctions fully, it is difficult to utilize and analyze artifacts of NTFS. Not much, actually, is known about the implementation of NTFS, especially B-tree index for directory management. Several items of B-tree features are performed that includes a node size, minimum number of children, root node without children, type of key, key sorting, type of pointer to child node, expansion and reduction of node, return of node. Furthermore, it is emphasized the fact that NTFS use B-tree structure not B+structure clearly.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.3
• /
• pp.87-92
• /
• 2008

In this paper, certain scaling functions are generated using the dyadic subband tree structure and applied to a time-hopping, pulse position modulation, ultra-wideband (TH-PPM UWB) system. Scaling functions can be obtained by iterating a lowpass filter at each level using a critically sampled dyadic tree. The performance of the TH-PPM UWB system employing scaling functions as the mono-cycle waveform is evaluated through computer simulations in a Rayleigh fading environment.