• Journal of Information Technology Applications and Management
• /
• 제12권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권5호
• /
• pp.527-547
• /
• 2009

Moving object management is widely used in traffic, logistic and data mining applications in ubiquitous environments. It is required to analyze spatio-temporal data and trajectories for moving object management. In this paper, we proposed a novel index structure for spatio-temporal aggregation of trajectory in a constrained network, named aCN-RB-tree. It manages aggregation values of trajectories using a constraint network-based index and it also supports direction of trajectory. An aCN-RB-tree consists of an aR-tree in its center and an extended B-tree. In this structure, an aR-tree is similar to a Min/Max R-tree, which stores the child nodes' max aggregation value in the parent node. Also, the proposed index structure is based on a constrained network structure such as a FNR-tree, so that it can decrease the dead space of index nodes. Each leaf node of an aR-tree has an extended B-tree which can store timestamp-based aggregation values. As it considers the direction of trajectory, the extended B-tree has a structure with direction. So this kind of aCN-RB-tree index can support efficient search for trajectory and traffic zone. The aCN-RB-tree can find a moving object trajectory in a given time interval efficiently. It can support traffic management systems and mining systems in ubiquitous environments.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2001년도 추계학술대회 논문집
• /
• pp.270-273
• /
• 2001

Electrical tree is studied widely by manufacture state of insulating material fare and blazing fire diagnosis system of use in phenomenon of part discharge that happen for main cause of dielectric breakdown of equipment for electric power. Use process that draw tree pattern here measuring above zero to study special quality of this electricity tree, real-time processing by image processing is proposed because reproduction of tree blazing fire process drops and pattern of tree is difficult correct quantification of tree growth by existent visual observation by involution. This research presents general process that need in image processing of tree blazing fire, and that remove various noises that happen in above zero by measuring electrical tree dividing background and complete view in measured above zero taking advantage of specially proposed complete view object abstraction techniques effectively and quantification of tree becomes easy naturally, can apply to dielectric breakdown estimate because can chase growth process of tree.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2008년도 추계학술발표대회
• /
• pp.878-881
• /
• 2008

To index the object's trajectory is an important aspect in moving object database management. This paper implements an optimizing index structure named Rend 3D R-tree based on 3D R-Tree. This paper demonstrates the time period update method to reconstruct the MBR for the moving objects in order to decrease the dead space that is produced in the closed time dimension of the 3D R-tree, then a rend method is introduced for indexing both current data and history data. The result of experiments illustrates that given methods outperforms 3D R-Tree and LUR tree in query processes.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2001년도 추계학술대회 논문집 Vol.14 No.1
• /
• pp.270-273
• /
• 2001

Electrical tree is studied widely by manufacture state of insulating material fare and blazing fire diagnosis system of use in phenomenon of part discharge that happen for main cause of dielectric breakdown of equipment for electric power. Use process that draw tree pattern here measuring above zero to study special quality of this electricity tree, real-time processing by image processing is proposed because reproduction of tree blazing fire process drops and pattern of tree is difficult correct quantification of tree growth by existent visual observation by involution. This research presents general process that need in image processing of tree blazing fire, and that remove various noises that happen in above zero by measuring electrical tree dividing background and complete view in measured above zero taking advantage of specially proposed complete view object abstraction techniques effectively and quantification of tree becomes easy naturally, can apply to dielectric breakdown estimate because can chase growth process of tree.

• 한국가스학회지
• /
• 제5권2호
• /
• pp.1-8
• /
• 2001

공정의 위험성 평가를 위한 이상트리 작성은 많은 시간과 인력을 요하는 작업으로 대규모 화학공장에 적용하기가 매우 힘들다. 본 연구에서는 화학공정의 이상트리 합성을 위해 장치에서 발생할 수 있는 공정변수의 이탈 및 장치이상에 대한 원인-결과 관계를 나타내는데 필요한 객체지향 지식기반의 프레임워크를 제안하였다. 이상에 대한 원인을 탐색하기 위하여 장치의 객체지향 모델링과 장치간의 연결관계를 이용하여 이탈을 전파하고 이를 통해 이상트리를 합성하였다. 제안된 방법론을 질산 냉각 공정에 적용하여 그 유효성을 검증하였다.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• pp.309-312
• /
• 2005

The need for LBS (Loc,ation Based Services) is increasing due to the wnespread of mobile computing devices and positioning technologies~ In LBS, there are many applications that need to manage moving objects (e.g. taxies, persons). The moving object join operation is to make pairs with spatio-temporal attribute for two sets in the moving object database system. It is import and complicated operation. And processing time increases by geometric progression with numbers of moving objects. Therefore efficient methods of spatio-temporal join is essential to moving object database system. In this paper, we apply spatial join methods to moving objects join. We propose two kind of join methods with TB- Tree that preserves trajectories of moving objects. One is depth first traversal spatio-temporaljoin and another is breadth-first traversal spatio-temporal join. We show results of performance test with sample data sets which are created by moving object ,generator tool.

• Journal of Forest and Environmental Science
• /
• 제35권3호
• /
• pp.181-188
• /
• 2019

This study was performed to construct tree species classification map according to three information types (spectral information, texture information, and spectral and texture information) by altitude (30 m, 60 m, 90 m) using the unmanned aerial vehicle images and the object-based classification method, and to evaluate the concordance rate through field survey data. The object-based, optimal weighted values by altitude were 176 for 30 m images, 111 for 60 m images, and 108 for 90 m images in the case of Scale while 0.4/0.6, 0.5/0.5, in the case of the shape/color and compactness/smoothness respectively regardless of the altitude. The overall accuracy according to the type of information by altitude, the information on spectral and texture information was about 88% in the case of 30 m and the spectral information was about 98% and about 86% in the case of 60 m and 90 m respectively showing the highest rates. The concordance rate with the field survey data per tree species was the highest with about 92% in the case of Pinus densiflora at 30 m, about 100% in the case of Prunus sargentii Rehder tree at 60 m, and about 89% in the case of Robinia pseudoacacia L. at 90 m.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제16권2호
• /
• pp.251-254
• /
• 2016

An energy-efficient object matching accelerator is proposed for mobile object recognition based on matching prediction scheme. Conventionally, vocabulary tree has been used to save the external memory bandwidth in object matching process but involved massive internal memory transactions to examine each object in a database. In this paper, a novel object matching accelerator is proposed based on matching predictions to reduce unnecessary internal memory transactions by mitigating non-target object examinations, thereby improving the energy-efficiency. Experimental results show a 26% reduction in power-delay product compared to the prior art.

• 전자공학회논문지C
• /
• 제35C권1호
• /
• pp.25-33
• /
• 1998

This paepr presents an algorithm for searching an object in a fast way which contains a continuous moving object in multi-dimensional spatical databases. This algorithm improves the search method of R-tree for the case that a target object is continuously moving in a spatial database. It starts the searching from the current node instead of the root of R-tree. Thus, the algorithm will find the target object from the entries of current node or sibling nodes in the most cases. The performance analysis shows that it is more efficient than the existing algorithm for R-tree when search windows or target objects are continuously moving.