• Title/Summary/Keyword: Graph-based

Search Result 1,784, Processing Time 0.037 seconds

Effective Graph Drawing Tool for Mathematics Education (효과적인 수학 그래프 저작 시스템)

  • Oh, Young-Taek;Kim, Yong-Jun;Kim, Myung-Soo
    • 한국HCI학회:학술대회논문집
    • /
    • 2009.02a
    • /
    • pp.422-427
    • /
    • 2009
  • We present a real-time graph drawing tool for mathematics education. We developed a sketch-based graph drawing interface that recognizes the schematic sketch of a graph. Our system generates figures displaying useful supplementary information such as auxiliary lines, abscissas, and ordinates. The resulting graphs are very similar to the graphs commonly found in textbooks. We also developed a graph retrieval system that makes rapid graph drawing feasible.

  • PDF

A Proposal of Shuffle Graph Convolutional Network for Skeleton-based Action Recognition

  • Jang, Sungjun;Bae, Han Byeol;Lee, HeanSung;Lee, Sangyoun
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.14 no.4
    • /
    • pp.314-322
    • /
    • 2021
  • Skeleton-based action recognition has attracted considerable attention in human action recognition. Recent methods for skeleton-based action recognition employ spatiotemporal graph convolutional networks (GCNs) and have remarkable performance. However, most of them have heavy computational complexity for robust action recognition. To solve this problem, we propose a shuffle graph convolutional network (SGCN) which is a lightweight graph convolutional network using pointwise group convolution rather than pointwise convolution to reduce computational cost. Our SGCN is composed of spatial and temporal GCN. The spatial shuffle GCN contains pointwise group convolution and part shuffle module which enhances local and global information between correlated joints. In addition, the temporal shuffle GCN contains depthwise convolution to maintain a large receptive field. Our model achieves comparable performance with lowest computational cost and exceeds the performance of baseline at 0.3% and 1.2% on NTU RGB+D and NTU RGB+D 120 datasets, respectively.

Task Planning Algorithm with Graph-based State Representation (그래프 기반 상태 표현을 활용한 작업 계획 알고리즘 개발)

  • Seongwan Byeon;Yoonseon Oh
    • The Journal of Korea Robotics Society
    • /
    • v.19 no.2
    • /
    • pp.196-202
    • /
    • 2024
  • The ability to understand given environments and plan a sequence of actions leading to goal state is crucial for personal service robots. With recent advancements in deep learning, numerous studies have proposed methods for state representation in planning. However, previous works lack explicit information about relationships between objects when the state observation is converted to a single visual embedding containing all state information. In this paper, we introduce graph-based state representation that incorporates both object and relationship features. To leverage these advantages in addressing the task planning problem, we propose a Graph Neural Network (GNN)-based subgoal prediction model. This model can extract rich information about object and their interconnected relationships from given state graph. Moreover, a search-based algorithm is integrated with pre-trained subgoal prediction model and state transition module to explore diverse states and find proper sequence of subgoals. The proposed method is trained with synthetic task dataset collected in simulation environment, demonstrating a higher success rate with fewer additional searches compared to baseline methods.

Development of Scene Graph Library for Mobile Platforms (모바일 플랫폼을 위한 장면그래프 라이브러리 개발)

  • Kim, Jun-Ho;Seo, Jin-Seok;Park, Chang-Hoon;Hwang, Jane;Ko, Hee-Dong
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.5
    • /
    • pp.792-801
    • /
    • 2010
  • In this paper, we introduce a novel scene graph library for mobile platforms, called the 'Mobile OpenSceneGraph (Mobile OSG)', as a mobile graphics middleware. Our mobile scene graph library supports several nice properties, including platform-independence, extensibility, touch-based UI supports, and compatibility, by carefully adapting the OpenSceneGraph library, one of the most widely used graphics middlewares for desktop platforms, to mobile platforms. We validate the usefulness of the proposed library for mobiles with the several experimental results including real-time rendering, camera manipulations with a touch-based UI, and animations with switching geometric nodes.

CHROMATIC NUMBER OF BIPOLAR FUZZY GRAPHS

  • TAHMASBPOUR, A.;BORZOOEI, R.A.
    • Journal of applied mathematics & informatics
    • /
    • v.34 no.1_2
    • /
    • pp.49-60
    • /
    • 2016
  • In this paper, two different approaches to chromatic number of a bipolar fuzzy graph are introduced. The first approach is based on the α-cuts of a bipolar fuzzy graph and the second approach is based on the definition of Eslahchi and Onagh for chromatic number of a fuzzy graph. Finally, the bipolar fuzzy vertex chromatic number and the edge chromatic number of a complete bipolar fuzzy graph, characterized.

Determining Minimal Set of Vertices Limiting The Maximum Path Length in General Directed Graphs (유향 그래프의 최대 경로 길이를 제한하는 최소 노드 집합을 구하는 알고리즘)

  • Lee Dong Ho
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.32B no.1
    • /
    • pp.11-20
    • /
    • 1995
  • A new graph problem is formulated to limit the maximum path length of a general directed graph when a minimal set of vertices together with their incident edges are removed from the graph. An optimal algorithm and a heuristic algorithm are proposed and the proposed heuristic algorithm is shown to be effective through experiments using a collection of graphs obtained from large sequential circuits. The heuristic algorithm is based on a feedback vertex set algorithm based on graph reduction.

  • PDF

Speaker Change Detection Based on a Graph-Partitioning Criterion

  • Seo, Jin-Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.30 no.2
    • /
    • pp.80-85
    • /
    • 2011
  • Speaker change detection involves the identification of time indices of an audio stream, where the identity of the speaker changes. In this paper, we propose novel measures for the speaker change detection based on a graph-partitioning criterion over the pairwise distance matrix of feature-vector stream. Experiments on both synthetic and real-world data were performed and showed that the proposed approach yield promising results compared with the conventional statistical measures.

Remote Diagnosis of Hypertension through HTML-based Backward Inference

  • Song, Yong-Uk;Chae, Young-Moon;Cho, Kyoung-Won;Ho, Seung-Hee
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2001.01a
    • /
    • pp.496-507
    • /
    • 2001
  • An expert system for the diagnosis and indication of hypertension is implemented through HTML-based backward inference. HTML-based backward inference is performed using the hypertext function of HTML, and many HTML files, which are hyperlinked to each other based on the backward rules, should be prepared beforehand. The development and maintenance of the HTML files are conducted automatically using the decision graph. Still, the drawing and input of the decision graph is a time consuming and tedious job if it is done manually. So, automatic generator of the decision graph for the diagnosis and indication of hypertension was implemented. The HTML-based backward inference ensures accessibility, multimedia facilities, fast response, stability, easiness, and platform independency of the expert system. So, this research reveals that HTML-based inference approach can be used for many Web-based intelligent site with fast and stable performance.

  • PDF

A Genetic Algorithm for Directed Graph-based Supply Network Planning in Memory Module Industry

  • Wang, Li-Chih;Cheng, Chen-Yang;Huang, Li-Pin
    • Industrial Engineering and Management Systems
    • /
    • v.9 no.3
    • /
    • pp.227-241
    • /
    • 2010
  • A memory module industry's supply chain usually consists of multiple manufacturing sites and multiple distribution centers. In order to fulfill the variety of demands from downstream customers, production planners need not only to decide the order allocation among multiple manufacturing sites but also to consider memory module industrial characteristics and supply chain constraints, such as multiple material substitution relationships, capacity, and transportation lead time, fluctuation of component purchasing prices and available supply quantities of critical materials (e.g., DRAM, chip), based on human experience. In this research, a directed graph-based supply network planning (DGSNP) model is developed for memory module industry. In addition to multi-site order allocation, the DGSNP model explicitly considers production planning for each manufacturing site, and purchasing planning from each supplier. First, the research formulates the supply network's structure and constraints in a directed-graph form. Then, a proposed genetic algorithm (GA) solves the matrix form which is transformed from the directed-graph model. Finally, the final matrix, with a calculated maximum profit, can be transformed back to a directed-graph based supply network plan as a reference for planners. The results of the illustrative experiments show that the DGSNP model, compared to current memory module industry practices, determines a convincing supply network planning solution, as measured by total profit.