• Title/Summary/Keyword: Object Tree

Search Result 325, Processing Time 0.022 seconds

Analysis Methology of Detailed Stand Age Classes in Forest Type Map (임상도 작성시 정밀 영급분석기법 연구)

  • Kim, Jeong-Ho
    • Journal of Environmental Science International
    • /
    • v.17 no.6
    • /
    • pp.647-655
    • /
    • 2008
  • The purpose of the study is to find the problems related to the current state of the stand age classes and the method of calculating it defined in the existing forest type map and propose the more accurate method of calculating the stand age classes. The object for the study was selected as the forest scattered around the Geesan village Paju city in Kyunggi province. For the accurate method of calculating the stand age classes, such items as, the type of actual vegetation, establishment of grid-type standard area scaled down at the level of the 5% of the actual area, the types, number, DBH and age of tree found by the plots, were investigated. It was found out actual vegetation was divided into the total 24 types and the 20 types of them belonged to the growing tree areas. As the plots, the 125 places(unit area: $400m^2$) were established the types of the trees found were distributed in the range where the minimum was 1 type, the maximum was 9, the mean was $4.4{\pm}1.5$, and the mode was 4 types. The number of the trees found was distributed in the range where the minimum was 17, the maximum was 125, the mean was $4.4{\pm}1.5$, and the mode was 70. In the DBH, the minimum was 6 cm, the maximum was 30 cm, the mean was 13 cm and the mode was 10 cm. As the result of measuring the age of the 5 trees corresponding to the value of the mode in DBH, selected among the dominant species by the plots, less than 20 years was 17 places, the 115 places were included in the range from 21 to 30 years, and more than 31 years was the 6 places.

Estimation of Above-Ground Biomass of a Tropical Forest in Northern Borneo Using High-resolution Satellite Image

  • Phua, Mui-How;Ling, Zia-Yiing;Wong, Wilson;Korom, Alexius;Ahmad, Berhaman;Besar, Normah A.;Tsuyuki, Satoshi;Ioki, Keiko;Hoshimoto, Keigo;Hirata, Yasumasa;Saito, Hideki;Takao, Gen
    • Journal of Forest and Environmental Science
    • /
    • v.30 no.2
    • /
    • pp.233-242
    • /
    • 2014
  • Estimating above-ground biomass is important in establishing an applicable methodology of Measurement, Reporting and Verification (MRV) System for Reducing Emissions from Deforestation and Forest Degradation-Plus (REDD+). We developed an estimation model of diameter at breast height (DBH) from IKONOS-2 image that led to above-ground biomass estimation (AGB). The IKONOS image was preprocessed with dark object subtraction and topographic effect correction prior to watershed segmentation for tree crown delineation. Compared to the field observation, the overall segmentation accuracy was 64%. Crown detection percent had a strong negative correlation to tree density. In addition, satellite-based crown area had the highest correlation with the field measured DBH. We then developed the DBH allometric model that explained 74% of the data variance. In average, the estimated DBH was very similar to the measured DBH as well as for AGB. Overall, this method can potentially be applied to estimate AGB over a relatively large and remote tropical forest in Northern Borneo.

A Design of Power Management and Control System using Digital Protective Relay for Motor Protection, Fault Diagnosis and Control (모터 보호, 고장진단 및 제어를 위한 디지털 보호계전기 활용 전력감시제어 시스템 설계)

  • Lee, Sung-Hwan;Ahn, Ihn-Seok
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.49 no.10
    • /
    • pp.516-523
    • /
    • 2000
  • In this paper, intelligent methods using digital protective relay in power supervisory control system is developed in order to protect power systems by means of timely fault detection and diagnosis during operation for induction motor which has various load environments and capacities in power systems. The spectrum pattern of input currents was used to monitor to state of induction motors, and by clustering the spectrum pattern of input currents, the newly occurrence of spectrums pattern caused by faults were detected. For diagnosis of the fault detected, the fuzzy fault tree was derived, and the fuzzy relation equation representing the relation between an induction motor fault and each fault type, was solved. The solution of the fuzzy relation equation shows the possibility of each fault's occurring. The results obtained are summarized as follows: 1) The test result on the basis of KEMC1120 and IEC60255, show that the operation time error of the digital motor protective relay is improved within ${\pm}5%$. 2) Using clustering algorithm by unsupervisory learning, an on-line fault detection method, not affected by the characteristics of loads and rates, was implemented, and the degree of dependency by experts during fault detection was reduced. 3) With the fuzzy fault tree, fault diagnosis process became systematic and expandable to the whole system, and the diagnosis for sub-systems can be made as an object-oriented module.

  • PDF

A study on the architectural character of JE-DANG in Ulsan (울산지역(蔚山地域) 제당(祭堂)의 건축적(建築的) 특성(特性)에 관한 연구(硏究) - 웅재면(熊材面)과 강동면(江東面)의 제당(祭堂)을 사례(事例)로 -)

  • Kang, Hye-Kyung;Nishimura, Ichiro;Han, Sam-Geon
    • Journal of architectural history
    • /
    • v.8 no.3 s.20
    • /
    • pp.9-22
    • /
    • 1999
  • The purpose of this study is to analyse the architectural character of JE-DAMG at farm village in Ulsan. JE-DANG means the building for DONG-JE (the sacrificial rite of a village). The regions of this study are KANG-DONG MYEN, and UNG-CHON MYEN in Ulsan. The method of this study is the analysis of them after the actual field surveys of 47 JE-DANGs in these regions The survey contains the area, the height, the period of the erection, the architectural structure, the roof shape, the material, the landowner, SHIN-CHE (means a god's name and shape), DANG-SU tree and so on. Methods of the survey are the field survey, the interview of villager, the analysis of reference data and so on. Results of the study are below. JE-DANGs(buildings) of these regions had been built first in the period of Japanese occupancy and erections of them had continued until 1970's. Since then, they have been rebuilt. The primary JE-DANG is characterized by a tiled roof, a wooden post lintel, a mud-plastered wall, and a wooden door. After rebuilding, characters are a flat slab, a tiled roof, a structure of using red bricks, and the area is getting larger than the primary JE-DANG, but 1 KAN persists without variety. Most of houses in the inland area like UNG-CHON MYEN face the south, and ones in the coastal area like KANG-BONG MYEN face the east. Generally there is DANG-SU tree behind JE-DANG. That proves DANG-SU tree to be the object of the rite. The species of DANG-SU is a pine in general ,but various in UNG-CHON MYEN. In general names of the god are DONG-SHIN , DANG-SAN SHIN and SUNG-HWANG SHIN. I think that the landownership of JE-DANG should change the private ownership into the village ownership to preserve JE-DANG though most of lands of JE-DANG are private ones.

  • PDF

2D-THI: Two-Dimensional Type Hierarchy Index for XML Databases (2D-THI: XML 데이테베이스를 위한 이차원 타입상속 계층색인)

  • Lee Jong-Hak
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.3
    • /
    • pp.265-278
    • /
    • 2006
  • This paper presents a two-dimensional type inheritance hierarchy index(2D-THI) for XML databases. XML Schema is one of schema models for the XML documents supporting. The type inheritance. The conventional indexing techniques for XML databases can not support XML queries on type inheritance hierarchies. We construct a two-dimensional index structure using multidimensional file organizations for supporting type inheritance hierarchy in XML queries. This indexing technique deals with the problem of clustering index entries in the two-dimensional domain space that consists of a key element domain and a type identifier domain based on the user query pattern. This index enhances query performance by adjusting the degree of clustering between the two domains. For performance evaluation, we have compared our proposed 2D-THI with the conventional class hierarchy indexing techniques in object-oriented databases such as CH-index and CG-tree through the cost model. As the result of the performance evaluations, we have verified that our proposed two-dimensional type inheritance indexing technique can efficiently support the query Processing in XML databases according to the query types.

  • PDF

A Network-based Indexing Method for Trajectories of Moving Objects on Roads (도로 위에 존재하는 이동객체의 궤적에 대한 네트워크 기반의 색인 방법)

  • Kim, Kyoung-Sook;Li, Ki-Joune
    • The KIPS Transactions:PartD
    • /
    • v.13D no.7 s.110
    • /
    • pp.879-888
    • /
    • 2006
  • Recently many researchers have focused on management of Historical trajectories of moving objects in Euclidean spaces due to numerous sizes of accumulated data over time. However, the movement of moving objects in real applications generally has some constraints, for example vehicles on roads can only travel along connected road networks. In this paper, we propose an indexing method for trajectories of moving objects on road networks in order to process the network-based spatiotemporal range query. Our method contains the connect information of road networks to use the network distance for query processing, deals with trajectories which are represented by road segments in road networks, and manages them using multiple R-trees assigned per each road segment. Furthermore, it has a structure to be able to share R-tree among several road segments in large road networks. Consequently, we show that our method takes about 30% less in node accesses for the network-based spatiotemporal range query processing than other methods based on the Euclidean distance by experiments.

Development of Artificial Intelligence Janggi Game based on Machine Learning Algorithm (기계학습 알고리즘 기반의 인공지능 장기 게임 개발)

  • Jang, Myeonggyu;Kim, Youngho;Min, Dongyeop;Park, Kihyeon;Lee, Seungsoo;Woo, Chongwoo
    • Journal of Information Technology Services
    • /
    • v.16 no.4
    • /
    • pp.137-148
    • /
    • 2017
  • Researches on the Artificial Intelligence has been explosively activated in various fields since the advent of AlphaGo. Particularly, researchers on the application of multi-layer neural network such as deep learning, and various machine learning algorithms are being focused actively. In this paper, we described a development of an artificial intelligence Janggi game based on reinforcement learning algorithm and MCTS (Monte Carlo Tree Search) algorithm with accumulated game data. The previous artificial intelligence games are mostly developed based on mini-max algorithm, which depends only on the results of the tree search algorithms. They cannot use of the real data from the games experts, nor cannot enhance the performance by learning. In this paper, we suggest our approach to overcome those limitations as follows. First, we collects Janggi expert's game data, which can reflect abundant real game results. Second, we create a graph structure by using the game data, which can remove redundant movement. And third, we apply the reinforcement learning algorithm and MCTS algorithm to select the best next move. In addition, the learned graph is stored by object serialization method to provide continuity of the game. The experiment of this study is done with two different types as follows. First, our system is confronted with other AI based system that is currently being served on the internet. Second, our system confronted with some Janggi experts who have winning records of more than 50%. Experimental results show that the rate of our system is significantly higher.

TPKDB-tree : An Index Structure for Efficient Retrieval of Future Positions of Moving Objects (TPKDB 트리 : 이동 객체의 효과적인 미래 위치 검색을 위한 색인구조)

  • Seo Dong Min;Bok Kyoung Soo;Yoo Jae Soo;Lee Byoung Yup
    • Journal of KIISE:Databases
    • /
    • v.31 no.6
    • /
    • pp.624-640
    • /
    • 2004
  • Recently, with the rapid development of location-based techniques, index structures to efficiently manage moving objects have been required. In this paper, we propose a new spatio-temporal index structure that supports a future position retrieval and minimizes a update cost. The proposed index structure combines an assistant index structure that directly accesses current positions of moving objects with KDB-tree that is a space partitioning access method. The internal node in our proposed index structure keeps time parameters in order to support the future position retrieval and to minimize a update cost. Moreover, we propose new update and split methods to maximize the space utilization and the search performance. We perform various experiments to show that our proposed index structure outperforms the existing index structure.

The Experimental Analysis of Integrated (Name/Property) Dynamic Binding Service Model for Wide-Area Objects Computing (광역 객체 컴퓨팅에서 통합(이름/속성) 기반의 동적 바인딩 서비스 모델의 실험분석)

  • Jeong, Chang-Won;Joo, Su-Chong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.10
    • /
    • pp.746-758
    • /
    • 2006
  • Many objects existing on wide area environments have the replication characteristics according to how to categorize using their own names or properties. From the clients' requests, the existing naming and trading services have not supported with the binding service for replicated solver object with the same service type. For this reason, we present an integrated model that can support the selection of replicated object and dynamic binding services on wide-area computing environments. This model suggests provides not only location management of replicated objects but also active binding service which enables to select a least-loaded object on the system to keep the balance of load between systems. In this purpose, constructing both the service plan and model for support solver object's binding with replication property on wide area computing environments has been researched. In this paper, we showed the test environment and analyzed the performance evaluation of client/server binding procedures via integrated binding service in federation model and verified our model under the condition to see whether load balance can be applied to our model. For the performance evaluation of suggested wide area integrated binding service federation model, evaluated the integrated binding service of each domain and analyzed the performance evaluation of process for non-replication object's under federation model environment. Also, we analyzed the performance evaluation of the federation model between domains for wide area environment. From the execution results, we showed the federation model provides lowers search-cost on the physical tree structure of network.

Development of Mean Stand Height Module Using Image-Based Point Cloud and FUSION S/W (영상 기반 3차원 점군과 FUSION S/W 기반의 임분고 분석 모듈 개발)

  • KIM, Kyoung-Min
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.19 no.4
    • /
    • pp.169-185
    • /
    • 2016
  • Recently mean stand height has been added as new attribute to forest type maps, but it is often too costly and time consuming to manually measure 9,100,000 points from countrywide stereo aerial photos. In addition, tree heights are frequently measured around tombs and forest edges, which are poor representations of the interior tree stand. This work proposes an estimation of mean stand height using an image-based point cloud, which was extracted from stereo aerial photo with FUSION S/W. Then, a digital terrain model was created by filtering the DSM point cloud and subtracting the DTM from DSM, resulting in nDSM, which represents object heights (buildings, trees, etc.). The RMSE was calculated to compare differences in tree heights between those observed and extracted from the nDSM. The resulting RMSE of average total plot height was 0.96 m. Individual tree heights of the whole study site area were extracted using the USDA Forest Service's FUSION S/W. Finally, mean stand height was produced by averaging individual tree heights in a stand polygon of the forest type map. In order to automate the mean stand height extraction using photogrammetric methods, a module was developed as an ArcGIS add-in toolbox.