• Title/Summary/Keyword: Software Graph

Search Result 313, Processing Time 0.026 seconds

An Effective Scene Compositor in MPEG-4 Player (MPEG-4재생기에서의 효율적인 장면 구성기)

  • Lee Hyunju;Kim Sangwook
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.12
    • /
    • pp.1611-1620
    • /
    • 2004
  • MPEG-4 supports dynamic scene composition through add/delete/replace of object or change of object's properties. Other existing MPEG-4 players focus on transmitting and playing the multimedia data according to MPEG-4 standard. It is insufficient for MPEG-4's characteristic such as playback of various objects and playback of dynamic scene composition. In this paper, we propose an effective scene compositor which is the core component of MPEG-4 player The scene compositor is an optimized processor that searches efficiently the scene graph, creates the data structure for independent management of object information and improves processing ability of user interaction. The scene compositor supports sufficiently scene description information, and is managed independently in player for component extension and application of mobile environment.

Character Grouping using 3-D Neighborhood Graph on Raster Map (래스터 지도상에서 3차원 인접 그래프를 이용한 문자 그룹핑)

  • Gang, Yong-Bin;Ok, Se-Yeong;Jo, Hwan-Gyu
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.2
    • /
    • pp.273-283
    • /
    • 1999
  • 래스터 지도에서 직선 또는 곡선과 중첩되어 있는 경우의 문자는 추출하기가 쉽지 않다. 따라서 본 논문에서는 고립되어 있는 문자뿐만 아니라 문자이외의 요소와 중첩되어 있는 문자도 효과적으로 추출할수 있는 분할 정복(divide and conquer) 개념에 기반한 문자 추출방법을 제시한다. 이를 위해 먼저 이미지의 연결 요소로부터 볼록다각형(convex hull)을 생성한다. 그리고 이 다각형이 충분한게 문자영역만을 포함할때가지 볼록 다각형을 이등분하면서 가장 긴 선분(투사 선분)을 기준으로 두 영역으로 분할한다. 다음으로 문자를 추출하기 위해서 이 선분을 기준으로 연결 요소상의 픽셀의 밀집도를 계산하는 알고리즘(프로파일링)을 적용한다. 또한 지도상에서 추출된 개별적인 문자들을 의미있는 단어들로 묶기(grouping)한 새로운 알고리즘을 소개한다. 특히 지도상에 나타나는 문자의 종류는 매우 다양하고 또한 이 문자들이 놓여있는 방향 역시 일정하지 않기 때문에 이러한 단어를 찾는 kd법은 쉽지 않다. 이를 위해 본 논문에서는 3차원 인접 그래프(3-D neighborhood graph)G를 소개한다. 이 그래프 G에서 각 노드는 하나의 분리된 문자를 나타내며 자신의 크기와 위치에 따라서 3차원 공간상에서 위치하게된다. 따라서, 크기가 큰 (작은)문자들은 보다 큰 (작은) z값을 가지고 되며 이 그래프 G에서 서로 인접한 노드들을 연결함으로써 지도상에 존재하는 서로 다른 종류의 문자 스트링을 추출할수 있다. 실험결과는 서로 다른 지도 이미지에 대해서 약 95% 이상의 단어 추출율을 보여준다.

Off-line Handwritten Digit Recognition by Combining Direction Codes of Strokes (획의 방향 코드 조합에 의한 오프라인 필기체 숫자 인식)

  • Lee Chan-Hee;Jung Soon-Ho
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.12
    • /
    • pp.1581-1590
    • /
    • 2004
  • We present a robust off-line method recognizing handwritten digits by only using stroke direction codes as a feature of handwritten digits. This method makes general 8-direction codes for an input digit and then has the multi-layered neural networks learn them and recognize each digit. The 8-direction codes are made of the thinned results of each digit through SOG*(Improved Self-Organizing Graph). And the usage of these codes simplifies the complex steps processing at least two features of the existing methods. The experimental result shows that the recognition rates of this method are constantly better than 98.85% for any images in all digit databases.

Post-pillars design for safe exploitation at Trepça hard rock mine (Kosovo) based on numerical modeling

  • Ibishi, Gzim;Genis, Melih;Yavuz, Mahmut
    • Geomechanics and Engineering
    • /
    • v.28 no.5
    • /
    • pp.463-475
    • /
    • 2022
  • In the mine exploitation stage; one of the critical issues is the stability assessment of post-pillars. The instability of post-pillars leads to serious safety hazards in mining operations. The focus of this study is to assess the stability of post-pillars in the 130# stope in the central ore body at Trepça hard rock mine by employing both conventional (i.e., critical span curve) and numerical methods (i.e., FLAC3D). Moreover, a new numerical based index (i.e., Pillar Yield Ratio-PYR) was proposed. The aim of PYR index is to determine a border line between stable, potentially unstable, and failure state of post-pillars at a specific mine site. The critical value of pillar width to height ratio is 2.5 for deep production stopes (e.g., > 800 m). Results showed that pillar size, mining height and mining depth significantly have affected the post-pillar stability. The reliability of numerical based index (i.e., PYR) is verified based on empirical underground pillar stability graph developed by Lunder, 1994. The proposed pillar yield ratio index and pillar stability graph can be used as a design tool in new mining areas at Trepça hard rock mine and for other situations with similar geotechnical conditions.

Implementation of Layered Clouds considering Frame Rate and Reality in Real-time Flight Simulation (비행시뮬레이션에서 프레임율과 현실감을 고려한 계층형 구름 구현 방안)

  • Kang, Seok-Yoon;Kim, Ki-Il
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.1
    • /
    • pp.72-77
    • /
    • 2014
  • There are two main technologies to implement cloud effect in flight simulator, cloud modeling using particle system and texture mapping. In former case, this approach may cause a low frame rate while unrealistic cloud effect is observed in latter case. To Solve this problem, in this paper, we propose how to apply fog effect into camera to display more realistic cloud effect with high frame rate. The proposed method is tested with massive terrain database environment through implemented software by using OpenSceneGraph. As a result, compared to texture mapping method, the degree of difference on frame rate is 1 or 2Hz while the cloud effect is significantly improved as realistic as particle system.

A Program Similarity Check by Flow Graphs of Functional Programs (흐름 그래프 형태를 이용한 함수형 프로그램 유사성 비고)

  • Seo Sunae;Han Taisook
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.4
    • /
    • pp.290-299
    • /
    • 2005
  • Stealing the source code of a program is a serious problem not only in a moral sense but also in a legal sense. However, it is not clear whether the code of a program is copied from another or not. There was a program similarity checker detecting code-copy by comparing the syntax trees of programs. However this method has a limitation that it cannot detect the code-copy attacks when the attacker modifies the syntax of the program on purpose. We propose a program similarity check by program control graph, which reveals not only syntax information but also control dependancy. Our method can detect the code-copy attacks that do not change control dependancy Moreover, we define what code-copy means and establish the connection between code-copy and similarity of program control graph: we prove that two programs are related by copy congruence if and only if the program control graphs of these programs are equivalent. We implemented our method on a functional programming language, nML. The experimental results show us that the suggested method can detect code similarity that is not detected by the existing method.

Static Allocation of C++ Objects to CORBA-based Distributed Systems (C++ 객체의 CORBA 기반 분산 시스템으로의 정적 할당)

  • 최승훈
    • Journal of Internet Computing and Services
    • /
    • v.1 no.2
    • /
    • pp.69-88
    • /
    • 2000
  • One of the most important factors on the performance of the distributed systems is the effective distribution of the software components, There have been a lot of researches on partitioning and allocating the task-based system, while the studies on the allocating the objects of the object-oriented system into the distributed object environments are very little relatively. In this paper. we defines the graph model for partitioning the existing C++ application and allocating the C++ objects into CORBA-base distributed system, In addition, we propose a distributed object allocation algorithm based on this graph model. The performance of distributed systems is determined by the concurrency between objects, the load balance among the processors and the communication cost on the networks. To search for the solutions optimizing the above three factors simultaneously, the object allocation algorithm of this paper is based on the Niched Pareto Genetic Algorithm (NPGA). We performed the experiment on the typical C++ application and CORBA system to prove the effectiveness of our graph model and our object allocation algorithm.

  • PDF

A Method for Detecting Program Plagiarism Comparing Class Structure Graphs (클래스 구조 그래프 비교를 통한 프로그램 표절 검사 방법)

  • Kim, Yeoneo;Lee, Yun-Jung;Woo, Gyun
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.11
    • /
    • pp.37-47
    • /
    • 2013
  • Recently, lots of research results on program comparison have been reported since the code theft become frequent as the increase of code mobility. This paper proposes a plagiarism detection method using class structures. The proposed method constructs a graph representing the referential relationship between the member variables and the methods. This relationship is shown as a bipartite graph and the test for graph isomorphism is applied on the set of graphs to measure the similarity of the programs. In order to measure the effectiveness of this method, an experiment was conducted on the test set, the set of Java source codes submitted as solutions for the programming assignments in Object-Oriented Programming course of Pusan National University in 2012. In order to evaluate the accuracy of the proposed method, the F-measure is compared to those of JPlag and Stigmata. According to the experimental result, the F-measure of the proposed method is higher than those of JPlag and Stigmata by 0.17 and 0.34, respectively.

A Dynamic Resource Allocation Method in Tactical Network Environments Based on Graph Clustering (전술 네트워크 환경에서 그래프 클러스터링 방법을 이용한 동적 자원 할당 방법)

  • Kim, MinHyeop;Ko, In-Young;Lee, Choon-Woo
    • Journal of KIISE:Software and Applications
    • /
    • v.41 no.8
    • /
    • pp.569-579
    • /
    • 2014
  • In a tactical-edge environment, where multiple weapon resources are coordinated together via services, it is essential to make an efficient binding between an abstract service and a resource that are needed to execute composite services for accomplishing a given mission. However, the tactical network that is used in military operation has low bandwidth and a high rate of packet loss. Therefore, communication overhead between services must be minimized to execute composite services in a stable manner in the tactical network. In addition, a tactical-edge environment changes dynamically, and it affects the connectivity and bandwidth of the tactical network. To deal with these characteristics of the tactical network we propose two service-resource reallocation methods which minimize the communication overhead between service gateways and effectively manage neutralization of gateways during distributed service coordination. We compared the effectiveness of these two - methods in terms of total communication overhead between service gateways and resource-allocation similarity between the initial resource allocation and the reallocation result.

A Document Summarization System Using Dynamic Connection Graph (동적 연결 그래프를 이용한 자동 문서 요약 시스템)

  • Song, Won-Moon;Kim, Young-Jin;Kim, Eun-Ju;Kim, Myung-Won
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.1
    • /
    • pp.62-69
    • /
    • 2009
  • The purpose of document summarization is to provide easy and quick understanding of documents by extracting summarized information from the documents produced by various application programs. In this paper, we propose a document summarization method that creates and analyzes a connection graph representing the similarity of keyword lists of sentences in a document taking into account the mean length(the number of keywords) of sentences of the document. We implemented a system that automatically generate a summary from a document using the proposed method. To evaluate the performance of the method, we used a set of 20 documents associated with their correct summaries and measured the precision, the recall and the F-measure. The experiment results show that the proposed method is more efficient compared with the existing methods.