• Title/Summary/Keyword: 속성 그래프

Search Result 103, Processing Time 0.036 seconds

A Hypergraph-based Modeling for Temporal RDF (하이퍼 그래프 기반 Temporal RDF 모델링 기법)

  • Lee, Taewhi;Im, Dong-Hyuk
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2015.04a
    • /
    • pp.694-696
    • /
    • 2015
  • RDF 데이터에 대한 시간 속성에 대한 연구는 트리플의 속성에 시간을 부여하는 방법이 많이 사용되고 있다. 하지만 트리플마다 시간 속성을 부여하는 방법은 저장 및 관리 측면에서 비효율적이다. 본 논문에서는 하이퍼그래프 기반의 RDF 시간 속성 모델링 방법을 제안한다. 하나의 트리플마다 시간 속성을 부여하는 것이 아닌 여러 재의 트리플을 하나의 하이퍼 간선으로 연결하여 시간 속성을 부여하는 방법으로 기존 방법보다 RDF 데이터가 가지는 의미에 적합하며 직관적으로 이해하기가 쉽다. 또한 시간 속성 RDF에서 지원해야 하는 시간 관계를 하이퍼그래프의 여러 속성을 이용하여 처리할 수 있는 장점을 가지게 된다.

Proposal of Minimum Spanning Tree Algorithm using 2-Edges Connected Grap (2-간선 연결 그래프를 사용한 최소신장트리 알고리즘 제안)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.4
    • /
    • pp.233-241
    • /
    • 2014
  • This paper suggests a fast minimum spanning tree algorithm which simplify the original graph to 2-edge connected graph, and using the cycling property. Borůvka algorithm firstly gets the partial spanning tree using cycle property for one-edge connected graph that selects the only one minimum weighted edge (e) per vertex (v). Additionally, that selects minimum weighted edge between partial spanning trees using cut property. Kruskal algorithm uses cut property for ascending ordered of all edges. Reverse-delete algorithm uses cycle property for descending ordered of all edges. Borůvka and Kruskal algorithms always perform |e| times for all edges. The proposed algorithm obtains 2-edge connected graph that selects 2 minimum weighted edges for each vertex firstly. Secondly, we use cycle property for 2-edges connected graph, and stop the algorithm until |e|=|v|-1 For actual 10 benchmark data, The proposed algorithm can be get the minimum spanning trees. Also, this algorithm reduces 60% of the trial number than Borůvka, Kruskal and Reverse-delete algorithms.

Research on Performance of Graph Algorithm using Deep Learning Technology (딥러닝 기술을 적용한 그래프 알고리즘 성능 연구)

  • Giseop Noh
    • The Journal of the Convergence on Culture Technology
    • /
    • v.10 no.1
    • /
    • pp.471-476
    • /
    • 2024
  • With the spread of various smart devices and computing devices, big data generation is occurring widely. Machine learning is an algorithm that performs reasoning by learning data patterns. Among the various machine learning algorithms, the algorithm that attracts attention is deep learning based on neural networks. Deep learning is achieving rapid performance improvement with the release of various applications. Recently, among deep learning algorithms, attempts to analyze data using graph structures are increasing. In this study, we present a graph generation method for transferring to a deep learning network. This paper proposes a method of generalizing node properties and edge weights in the graph generation process and converting them into a structure for deep learning input by presenting a matricization We present a method of applying a linear transformation matrix that can preserve attribute and weight information in the graph generation process. Finally, we present a deep learning input structure of a general graph and present an approach for performance analysis.

Deep Neural Network-Based Scene Graph Generation for 3D Simulated Indoor Environments (3차원 가상 실내 환경을 위한 심층 신경망 기반의 장면 그래프 생성)

  • Shin, Donghyeop;Kim, Incheol
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.8 no.5
    • /
    • pp.205-212
    • /
    • 2019
  • Scene graph is a kind of knowledge graph that represents both objects and their relationships found in a image. This paper proposes a 3D scene graph generation model for three-dimensional indoor environments. An 3D scene graph includes not only object types, their positions and attributes, but also three-dimensional spatial relationships between them, An 3D scene graph can be viewed as a prior knowledge base describing the given environment within that the agent will be deployed later. Therefore, 3D scene graphs can be used in many useful applications, such as visual question answering (VQA) and service robots. This proposed 3D scene graph generation model consists of four sub-networks: object detection network (ObjNet), attribute prediction network (AttNet), transfer network (TransNet), relationship prediction network (RelNet). Conducting several experiments with 3D simulated indoor environments provided by AI2-THOR, we confirmed that the proposed model shows high performance.

Road Object Graph Modeling Method for Efficient Road Situation Recognition (효과적인 도로 상황 인지를 위한 도로 객체 그래프 모델링 방법)

  • Ariunerdene, Nyamdavaa;Jeong, Seongmo;Song, Seokil
    • Journal of Platform Technology
    • /
    • v.9 no.4
    • /
    • pp.3-9
    • /
    • 2021
  • In this paper, a graph data model is introduced to effectively recognize the situation between each object on the road detected by vehicles or road infrastructure sensors. The proposed method builds a graph database by modeling each object on the road as a node of the graph and the relationship between objects as an edge of the graph, and updates object properties and edge properties in real time. In this case, the relationship between objects represented as edges is set when there is a possibility of approach between objects in consideration of the position, direction, and speed of each object. Finally, we propose a spatial indexing technique for graph nodes and edges to update the road object graph database represented through the proposed graph modeling method continuously in real time. To show the superiority of the proposed indexing technique, we compare the proposed indexing based database update method to the non-indexing update method through simulation. The results of the simulation show the proposed method outperforms more than 10 times to the non-indexing method.

Verification of Reverse specification for Real-Time System in Abstract Timed Machine (추상 시간 기계를 사용한 실시간 시스템의 역명세 검증)

  • 박지연;노경주;이문근
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.489-491
    • /
    • 2000
  • 본 논문은 ATM(Abstract Timed Machine)으로 명세된 실시간 시스템을 검증하기 위한 방법을 기술한다. ATM은 임무 위급 시스템인 실시간 시스템을 명세, 분석, 검증하기 위한 정형기법이다. ATM은 모드와 전이, 포트로 구성된다. 다른 정형기법과 비교하여 ATM은 소프트웨어의 순환공학 과정에서 사용하기 위해 설계되었다. 역공학 과정에서 ATM은 계산 논리 뿐만 아니라 실시간 시스템의 실제 소스코드에 있는 설계나 환경정보를 표현할 수 있다. 이러한 목적을 위해 ATM은 다양한 모드를 사용한다. ATM을 사용한 실시간 시스템의 검증은 도달성 그래프를 생성함으로써 수행한다. 도달성 그래프는 상태와 시간을 추상화되고 압축된 형태로 표현할 수 있으며 그 결과 시간 속성을 지닌 상태 공간을 감소시킬 수 있다. 또한 시스템의 교착상태를 쉽게 발견할 수 있다. 본 논문은 ATM과 실행 모델, 도달성 그래프, 검증을 위한 속성 등을 기술하며 이들을 다른 정형 기법들과 예제를 통하여 비교한다.

  • PDF

Scene Graph Generation by Exploration of Agent in Three-Dimensional Space (3차원 공간에서 에이전트의 탐색을 통한 장면 그래프 생성)

  • Shin, Donghyeop;Kim, Incheol
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2018.10a
    • /
    • pp.742-745
    • /
    • 2018
  • 장면 그래프는 영상 내 물체들의 정보를 나타내는 지식 그래프이다. 본 논문에서는 3차원 공간에서 에이전트의 탐색을 통해, 장면 그래프를 생성하는 모델을 제안한다. 3차원 공간에 대한 장면 그래프는 물체들의 위치, 종류, 속성뿐만 아니라 물체들 간의 관계 정보를 포함한다. 이에 따라 장면 그래프는 다양한 문제 해결에 기초 데이터로써 활용될 수 있다. 본 논문은 장면 그래프를 생성하기 위해 필요한 기능들을 정의하고, 기능에 따라 4가지 부분 네트워크들을 제안한다. 또한 각 부분 네트워크들의 학습 및 성능 평가를 위해, 3차원 실내 가상환경인 AI2-THOR에서 데이터들을 수집하였고, 다양한 실험을 통해 각 부분 네트워크들의 성능을 검증하였다.

Integration of Component Image Information and Design Information by Graph to Support Product Design Information Reuse (제품 설계 정보 재사용을 위한 그래프 기반의 부품 영상 정보와 설계 정보의 병합)

  • Lee, Hyung-Jae;Yang, Hyung-Jeong;Kim, Kyoung-Yun;Kim, Soo-Hyung;Kim, Sun-Hee
    • The KIPS Transactions:PartD
    • /
    • v.13D no.7 s.110
    • /
    • pp.1017-1026
    • /
    • 2006
  • Recently, distributed collaborative development environment has been recognized an alternative environment for product development in which multidisciplinary participants are naturally involving. Reuse of Product design information has long been recognized as one of core requirements for efficient product development. This paper addresses an image-based retrieval system to support product design information reuse. In the system, product images obtained from multi-modal devices are utilized to reuse design information. The proposed system conducts the segmentation of a product image by using a labeling method and generates an attributed relational graph (ARG) that represents properties of segmented regions and their relationships. The generated ARG is extended by integrating corresponding part/assembly information. In this manner, the reuse of assembly design information using a product image has been realized. The main advantages of the presented system are following. First, the system is not dependent to specific design tools, because it utilizes multimedia images that can be obtained easily from peripheral devices. Second ratio-based features extracted from images enable image retrievals that contain various sizes of parts. Third, the system has shown outstanding search performance, because we applied various information of segmented part regions and their relationships between parts.

A XML Instance Repository Model based on the Edge-Labeled Graph (Edge-Labeled 그래프 기반의 XML 인스턴스 저장 모델)

  • Kim Jeong-Hee;Kwak Ho-Young
    • Journal of Internet Computing and Services
    • /
    • v.4 no.6
    • /
    • pp.33-42
    • /
    • 2003
  • A XML Instance repository model based on the Edge-Labeled Graph is suggested for storing the XML instance in Relational Databases, This repository model represents the XML instance as a data graph based on the Edge-Labeled Graph, extracts the defined value based on the structure of data path, element, attribute, and table index table presented as database schema, and stores these values using the Mapper module, In order to support querry, XML repository model offers the module translating XQL which is a query language under XPATH to SQL, and has DBtoXML generator module restoring the stored XML instance. As a result, it is possible to represent the storage relationship between the XML instances and the proposed repository model in terms of Graph-based Path, and it shows the possibility of easy search of specific element and attribute information.

  • PDF

MPEG-4 realtime rendering on ITV system (ITV 시스템에서 MPEG-4 실시간 장면 랜더링)

  • 이윤주;김상욱
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.04b
    • /
    • pp.417-419
    • /
    • 2000
  • 본 논문은 실시간 운영체제 기반의 ITV 시스템에서 MPEG-4 멀티미디어 장면을 실시간으로 랜더링하는 방법을 제시한다. MPEG-4 멀티미디어 스트림의 랜더링을 위한 장면 구성은 ITV 시스템에서 네트워크를 통해 전송되는 멀티미디어 스트림을 파싱 및 해석하여 장면그래프를 구성하고, 장면 랜더러가 이 장면 그래프를 이용하여 화면에 실시간으로 랜더링한다. MPEG-4 장면 랜더링 화면에서 사용자의 객체 교체나 객체 속성 변환 랜더링 이벤트가 발생하면, MPEG-4 장면 그래프를 실시간으로 갱신시켜 사용자 인터페이스에 랜더링한다.

  • PDF