• Title/Summary/Keyword: Object Tree

Search Result 325, Processing Time 0.022 seconds

Main Memory Index Based on R-tree for Moving Object Databases (이동체 데이터베이스를 위한 R-tree 기반의 메인 메모리 색인)

  • 이창우;안경환;홍봉희
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10b
    • /
    • pp.40-42
    • /
    • 2003
  • 최근에는 물류 및 수송 관리, 교통 정보 서비스 등과 같은 위치 기반 서비스의 요구가 증대되고 있다. 위치 기반 서비스에서 클라이언트들의 빈번한 보고 데이터를 처리하기 위해서는 서버에서 메인 메모리 DBMS를 유지하는 것이 필요하다. 그러나 기존 연구에서는 이러한 이동체 데이터베이스를 위한 메인 메모리 색인이 없으므로 이에 적합한 색인이 필요하다. 다차원 색인으로 영역 질의에 뛰어난 성능을 보이는 색인으로 R-tree가 있는데, 이는 디스크 환경을 고려하여 설계되었기 때문에 메인 메모리에서는 효율을 보장하지 못한다. 이 논문에서는 R-tree를 변형하여 이동체 데이터베이스를 위한 메인 메모리 색인을 제시한다. 이 논문에서 새로 제시한 성장 노드 구조와 동적 재구성 및 큰 영역을 가진 노드 분할 정책은 영역 질의의 성능을 향상시킨다. 실험은 제안한 색인이 이동체 데이터베이스를 위한 적합한 메인 메모리 구조임을 보여준다.

  • PDF

Ranking Query Processing in Multimedia Databases

  • Kim, Byung-Gon;Han, Jong-Woon;Lee, Jaeho;Haechull Lim
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.294-297
    • /
    • 2000
  • Among the multi-dimensional query types, ranking query is needed if we want the object one by one until we satisfy for the result. In multi-dimensional indexing structures like R-tree or its variants, not many methods are introduced in this area. In this paper, we introduce new ranking query processing algorithm which use the filtering mechanism in the R-tree variants.

  • PDF

An Object Recognition Method Based on Depth Information for an Indoor Mobile Robot (실내 이동로봇을 위한 거리 정보 기반 물체 인식 방법)

  • Park, Jungkil;Park, Jaebyung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.10
    • /
    • pp.958-964
    • /
    • 2015
  • In this paper, an object recognition method based on the depth information from the RGB-D camera, Xtion, is proposed for an indoor mobile robot. First, the RANdom SAmple Consensus (RANSAC) algorithm is applied to the point cloud obtained from the RGB-D camera to detect and remove the floor points. Next, the removed point cloud is classified by the k-means clustering method as each object's point cloud, and the normal vector of each point is obtained by using the k-d tree search. The obtained normal vectors are classified by the trained multi-layer perceptron as 18 classes and used as features for object recognition. To distinguish an object from another object, the similarity between them is measured by using Levenshtein distance. To verify the effectiveness and feasibility of the proposed object recognition method, the experiments are carried out with several similar boxes.

An Object-Based Image Retrieval Techniques using the Interplay between Cortex and Hippocampus (해마와 피질의 상호 관계를 이용한 객체 기반 영상 검색 기법)

  • Hong Jong-Sun;Kang Dae-Seong
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.4 s.304
    • /
    • pp.95-102
    • /
    • 2005
  • In this paper, we propose a user friendly object-based image retrieval system using the interaction between cortex and hippocampus. Most existing ways of queries in content-based image retrieval rely on query by example or query by sketch. But these methods of queries are not adequate to needs of people's various queries because they are not easy for people to use and restrict. We propose a method of automatic color object extraction using CSB tree map(Color and Spatial based Binary をn map). Extracted objects were transformed to bit stream representing information such as color, size and location by region labelling algorithm and they are learned by the hippocampal neural network using the interplay between cortex and hippocampus. The cells of exciting at peculiar features in brain generate the special sign when people recognize some patterns. The existing neural networks treat each attribute of features evenly. Proposed hippocampal neural network makes an adaptive fast content-based image retrieval system using excitatory learning method that forwards important features to long-term memories and inhibitory teaming method that forwards unimportant features to short-term memories controlled by impression.

A Study on Colors in the Suhainmyuldo painted on an Old Tomb of the Ancient Kingdom of Goguryeo between the 4th and the late 6th Centuries (4세기-6세기 말 고구려 고분 벽화 수하인물도에 나타난 색채 연구)

  • Kang Eun-Sook
    • Journal of the Korea Fashion and Costume Design Association
    • /
    • v.7 no.1
    • /
    • pp.15-31
    • /
    • 2005
  • Suhainmyuldo(수하인물도) is a kind of picture which express a person under the tree and is known to be transmitted from the Middle Asia. The origin of this kind of expression is assumed to be from Iykshini(=Iygsha), the fairy of tree, in India of from the 'Tree of Life' in W. Asia, and they had in fluenced on the craft art design of Chinese art. However, Chinese art had already developed the motif of this kind in its unique way. For example, Jookrimchilhundo(죽림칠현도: seven wise men in bamboo forest), during Six Dynasty. The tree of life(arbor vitae, lignum viate), the origin of the Painting of figure under a tree(수하인물도), was spreaded in several regions around the center of Mesopotamia early, and them transmitted to Sasan dynasty of Persia, even to Islam, Byzantine, Romanesque, ancient East Asia. The mural painting found in the 4th Tongu Ogoe tomb, which was created after the 5th Tongu Ogoe tomb, used Obangsaek more than the 5th tomb painting did. (The term Obansaek refers to the five Korean traditional colors consisted of yellow, blue, white, red and black) The mural painting on the 4th Ogoe tomb employed distinct technique to depict an object in a certain color by painting the surroundings with different primary colors, making the painting look more exotic and mysterious.

  • PDF

Index method of using Rend 3DR-tree for Location-Based Service (위치 기반 서비스를 위한 Rend 3DR-tree를 이용한 색인 기법)

  • Nam, Ji-Yeun;Rim, Kee-Wook;Lee, Jeong-Bae;Lee, Jong-Woock;Shin, Hyun-Cheol
    • Convergence Security Journal
    • /
    • v.8 no.4
    • /
    • pp.97-104
    • /
    • 2008
  • Recently, the wireless positioning techniques and mobile computing techniques have rapidly developed to use location data of moving objects. The more the number of moving objects is numerous and the more periodical sampling of locations is frequent, the more location data of moving objects become very large. Hence the system should be able to efficiently manage mass location data, support various spatio-temporal queries for LBS, and solve the uncertainty problem of moving objects. Therefore, in this paper, innovating the location data of moving object effectively, we propose Rend 3DR-tree method to decrease the dead space and complement the overlapping of nodes by utilizing 3DR-tree with the indexing structure to support indexing of current data and history data.

  • PDF

Object-Oriented Modelling for Automated HAZOP Analysis (HAZOP 분석 자동화를 위한 객체지향 모델링)

  • 이진명;허보경;황규석
    • Journal of the Korean Society of Safety
    • /
    • v.13 no.1
    • /
    • pp.77-84
    • /
    • 1998
  • Hazard and operability (HAZOP) analysis is one of the safety analysis method that is used in the chemical complex, because it can systematically identify causes and consequences of all the deviation that could occur. Since this method needs to hire specialized experts, it is costly and time-consuming. Therefore HAZOP Expert System has been developed to automate this analysis. This approach introduced object-oriented method and knowledge representation which is hierarchical tree of units to supply flexibility in the system, functional semantic network, propagation equation and rule-chaining method to set up the expert system for automating HAZOP analysis.

  • PDF

Design and Implementation of Trajectory Riving Tree for Combined Queries in Moving Object Databases (이동체 데이타베이스에서 복합 질의를 위한 궤적 분할 트리의 설계 및 구현)

  • 임덕성;전봉기;홍봉희;조대수
    • Journal of KIISE:Databases
    • /
    • v.31 no.2
    • /
    • pp.150-162
    • /
    • 2004
  • Moving objects have characteristics that they change continuously their positions over time. The movement of moving objects should be stored on trajectories for processing past queries. Moving objects databases need to provide spatio-temporal index for handling moving objects queries like combined queries. Combined queries consist of a range query selecting trajectories within a specific range and a trajectory query extracting to parts of the whole trajectory. Access methods showing good performance in range queries have a shortcoming that the cost of processing trajectory Queries is high. On the other hand, trajectory-based index schemes like the TB-tree are not suitable for range queries because of high overlaps between index nodes. This paper proposes new TR(Trajectory Riving)-tree which is revised for efficiently processing the combined queries. This index scheme has several features like the trajectory preservation, the increase of the capacity of leaf nodes, and the logical trajectory riving in order to reduce dead space and high overlap between bounding boxes of nodes. In our Performance study, the number of node access for combined queries in TR-tree is about 25% less than the STR-tree and the TB-tree.

Analysis of Object-Oriented Metrics to Predict Software Reliability (소프트웨어 신뢰성 예측을 위한 객체지향 척도 분석)

  • Lee, Yangkyu
    • Journal of Applied Reliability
    • /
    • v.16 no.1
    • /
    • pp.48-55
    • /
    • 2016
  • Purpose: The purpose of this study is to identify the object-oriented metrics which have strong impact on the reliability and fault-proneness of software products. The reliability and fault-proneness of software product is closely related to the design properties of class diagrams such as coupling between objects and depth of inheritance tree. Methods: This study has empirically validated the object-oriented metrics to determine which metrics are the best to predict fault-proneness. We have tested the metrics using logistic regressions and artificial neural networks. The results are then compared and validated by ROC curves. Results: The artificial neural network models show better results in sensitivity, specificity and correctness than logistic regression models. Among object-oriented metrics, several metrics can estimate the fault-proneness better. The metrics are CBO (coupling between objects), DIT (depth of inheritance), LCOM (lack of cohesive methods), RFC (response for class). In addition to the object-oriented metrics, LOC (lines of code) metric has also proven to be a good factor for determining fault-proneness of software products. Conclusion: In order to develop fault-free and reliable software products on time and within budget, assuring quality of initial phases of software development processes is crucial. Since object-oriented metrics can be measured in the early phases, it is important to make sure the key metrics of software design as good as possible.

On the Organization of Object-Oriented Model Bases for Structured Modeling (구조적 모델링을 위한 객체지향적 모델베이스 조직화)

  • 정대율
    • The Journal of Information Systems
    • /
    • v.5
    • /
    • pp.149-173
    • /
    • 1996
  • This paper focus on the development of object-oriented model bases for Structured Modeling. For the model base organization, object modeling techniques and model typing concept which is similar to data typing concept are used. Structured modeling formalizes the notion of a definitional system as a way of dscribing models. From the object-oriented concept, a structured model can be represented as follows. Each group of similar elements(genus) is represented by a composite class. Other type of genera can be represented in a similar manner. This hierarchical class composition gives rise to an acyclic class-composition graph which corresponds with the genus graph of structured model. Nodes in this graph are instantiated to represent the elemental graph for a specific model. Taking this class composition process one step further, we aggregate the classes into higher-level composite classes which would correspond to the structured modeling notion of a module. Finally, the model itself is then represented by a composite class having attributes each of whose domain is a composite class representing one of the modules. The resulting class-composition graph represent the modular tree of the structured.

  • PDF