• Title/Summary/Keyword: Character Relationship Graph

Search Result 8, Processing Time 0.02 seconds

Algebraic Structure for the Recognition of Korean Characters (한글 문자의 인식을 위한 대수적 구조)

  • Lee, Joo-K.;Choo, Hoon
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.12 no.2
    • /
    • pp.11-17
    • /
    • 1975
  • The paper examined the character structure as a basic study for the recognition of Korean characters. In view of concave structure, line structure and node relationship of character graph, the algebraic structure of the basic Korean characters is are analized. Also, the degree of complexities in their character structure is discussed and classififed. Futhermore, by describing the fact that some equivalence relations are existed between the 10 vowels of rotational transformation group by Affine transformation of one element into another, it could be pointed out that the geometrical properting in addition to the topological properties are very important for the recognition of Korean characters.

  • PDF

A Study of Story Visualization Based on Variation of Characters Relationship by Time (등장인물들의 시간적 관계 변화에 기초한 스토리 가시화에 관한 연구)

  • Park, Seung-Bo;Baek, Yeong Tae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.3
    • /
    • pp.119-126
    • /
    • 2013
  • In this paper, we propose and describe the system to visualize the story of contents such as movies and novels. Character-net is applied as story model in order to visualize story. However, it is the form to be accumulated for total movie story, though it can depict the relationship between characters. We have developed the system that analyzes and shows the variation of Character-net and characters' tendency in order to represent story variation depending on movie progression. This system is composed by two windows that can play and analyze sequential Character-nets by time, and can analyze time variant graph of characters' degree centrality. First window has a function that supports to find important story points like the scenes that main characters appear or meet firstly. Second window supports a function that track each character's tendency or a variation of his tendency through analyzing in-degree graph and out-degree. This paper describes the proposed system and discusses additional requirements.

Detection of Conflict Transition Scene Using Character Regions (인물 면적을 이용한 갈등 전환 장면 검출)

  • Park, Seung-Bo;Lee, Chang-Hyun
    • Journal of Broadcast Engineering
    • /
    • v.26 no.5
    • /
    • pp.543-552
    • /
    • 2021
  • The story is formed by the flow of the development and resolution of the conflict between the characters. Namely, the story consists of conflict setting, development, and resolution. Character region is an important expression technique to describe the emotions or states of characters and the relationship between characters and the environment. The purpose of this paper is to propose a method for detecting the transition of conflict from the graph of character region's change. To this end, we present a method of generating a change graph of a character region in a movie by calculating the character region and a method of detecting a conflict transition scene from a graph of character region's change. To verify the performance of the proposed method, an experiment was conducted to extract conflict transition scenes for 7 movies, and performance evaluation results of 73.57% accuracy and 77.26% recall were obtained. This proves that it is possible to extract conflict transition scenes based on the character region.

Actantial Model-based Character Role Recognition using Emotional Flow Graph among Characters in Text Stories (텍스트 스토리에서 등장인물간 감정 흐름 그래프를 이용한 행위소 모델 기반의 등장인물 역할 인식)

  • Yu, Hye-Yeon;Kim, Moon-Hyun;Bae, Byung-Chull
    • Journal of Internet Computing and Services
    • /
    • v.22 no.1
    • /
    • pp.51-63
    • /
    • 2021
  • Identifying characters who appear in a story and analyzing their relationships is essential to understanding the story. This paper aims to identify the two actants (or character roles) as Helper and Opponent in Greimas's Actantial model by identifying Subject (i.e., protagonist) and analyzing the emotional interactions between the Subject and the two actants (Helper/Opponent). Our proposed method consists of three steps. First, we identify objects (i.e., characters) appearing in the text story. Next, we extract relational information through the interaction of the characters, and then classify emotions in the text expressed as relational information. Finally, we represent the flow of emotional relations among characters as a directed graph. The node with the highest degree is considered as the Subject because it includes the most relational information. The node that sends the most positive/negative emotions to the Subject is considered as the Helper/Oppenent, respectively. Our research contributes to the computer-based narrative understanding by providing a computational method that automatically extracts the three key character roles (Subject, Helper, and Opponent) from the text story.

Massive Graph Expression and Shortest Path Search in Interpersonal Relationship Network (인물관계망의 대용량 그래프 표현과 최단 경로 탐색)

  • Min, Kyoung-Ju;Jin, Byeong-Chan;Jung, Man-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.4
    • /
    • pp.624-632
    • /
    • 2022
  • Relationship networks such as an interpersonal relationship network or navigation route search can be expressed in graph form. However, as the amount of data increase, there is a problem that it is difficult to search for the desired data when it is displayed on one screen. In this paper, we propose a visualization method for searching for people, searching for the shortest path between people, and using graphs to express an interpersonal relationship network with many nodes. Unlike the search for the shortest path in the routing table, the shortest path in the interpersonal relationship network should be changeable according to the intension or importance of the researcher or user who is analyzing it. To this end, the BFS algorithm was modified to apply the characteristics of the interpersonal relationship network. For the verification of the results, the data in the character relationship information of the Korean Classics DB in the Korean Classics Translation Institute was used.

Extracting Beginning Boundaries for Efficient Management of Movie Storytelling Contents (스토리텔링 콘텐츠의 효과적인 관리를 위한 영화 스토리 발단부의 자동 경계 추출)

  • Park, Seung-Bo;You, Eun-Soon;Jung, Jason J.
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.4
    • /
    • pp.279-292
    • /
    • 2011
  • Movie is a representative media that can transmit stories to audiences. Basically, a story is described by characters in the movie. Different from other simple videos, movies deploy narrative structures for explaining various conflicts or collaborations between characters. These narrative structures consist of 3 main acts, which are beginning, middle, and ending. The beginning act includes 1) introduction to main characters and backgrounds, and 2) conflicts implication and clues for incidents. The middle act describes the events developed by both inside and outside factors and the story dramatic tension heighten. Finally, in the end act, the events are developed are resolved, and the topic of story and message of writer are transmitted. When story information is extracted from movie, it is needed to consider that it has different weights by narrative structure. Namely, when some information is extracted, it has a different influence to story deployment depending on where it locates at the beginning, middle and end acts. The beginning act is the part that exposes to audiences for story set-up various information such as setting of characters and depiction of backgrounds. And thus, it is necessary to extract much kind information from the beginning act in order to abstract a movie or retrieve character information. Thereby, this paper proposes a novel method for extracting the beginning boundaries. It is the method that detects a boundary scene between the beginning act and middle using the accumulation graph of characters. The beginning act consists of the scenes that introduce important characters, imply the conflict relationship between them, and suggest clues to resolve troubles. First, a scene that the new important characters don't appear any more should be detected in order to extract a scene completed the introduction of them. The important characters mean the major and minor characters, which can be dealt as important characters since they lead story progression. Extra should be excluded in order to extract a scene completed the introduction of important characters in the accumulation graph of characters. Extra means the characters that appear only several scenes. Second, the inflection point is detected in the accumulation graph of characters. It is the point that the increasing line changes to horizontal line. Namely, when the slope of line keeps zero during long scenes, starting point of this line with zero slope becomes the inflection point. Inflection point will be detected in the accumulation graph of characters without extra. Third, several scenes are considered as additional story progression such as conflicts implication and clues suggestion. Actually, movie story can arrive at a scene located between beginning act and middle when additional several scenes are elapsed after the introduction of important characters. We will decide the ratio of additional scenes for total scenes by experiment in order to detect this scene. The ratio of additional scenes is gained as 7.67% by experiment. It is the story inflection point to change from beginning to middle act when this ratio is added to the inflection point of graph. Our proposed method consists of these three steps. We selected 10 movies for experiment and evaluation. These movies consisted of various genres. By measuring the accuracy of boundary detection experiment, we have shown that the proposed method is more efficient.

A Study on the Intelligent Service Selection Reasoning for Enhanced User Satisfaction : Appliance to Cloud Computing Service (사용자 만족도 향상을 위한 지능형 서비스 선정 방안에 관한 연구 : 클라우드 컴퓨팅 서비스에의 적용)

  • Shin, Dong Cheon
    • Journal of Intelligence and Information Systems
    • /
    • v.18 no.3
    • /
    • pp.35-51
    • /
    • 2012
  • Cloud computing is internet-based computing where computing resources are offered over the Internet as scalable and on-demand services. In particular, in case a number of various cloud services emerge in accordance with development of internet and mobile technology, to select and provide services with which service users satisfy is one of the important issues. Most of previous works show the limitation in the degree of user satisfaction because they are based on so called concept similarity in relation to user requirements or are lack of versatility of user preferences. This paper presents cloud service selection reasoning which can be applied to the general cloud service environments including a variety of computing resource services, not limited to web services. In relation to the service environments, there are two kinds of services: atomic service and composite service. An atomic service consists of service attributes which represent the characteristics of service such as functionality, performance, or specification. A composite service can be created by composition of atomic services and other composite services. Therefore, a composite service inherits attributes of component services. On the other hand, the main participants in providing with cloud services are service users, service suppliers, and service operators. Service suppliers can register services autonomously or in accordance with the strategic collaboration with service operators. Service users submit request queries including service name and requirements to the service management system. The service management system consists of a query processor for processing user queries, a registration manager for service registration, and a selection engine for service selection reasoning. In order to enhance the degree of user satisfaction, our reasoning stands on basis of the degree of conformance to user requirements of service attributes in terms of functionality, performance, and specification of service attributes, instead of concept similarity as in ontology-based reasoning. For this we introduce so called a service attribute graph (SAG) which is generated by considering the inclusion relationship among instances of a service attribute from several perspectives like functionality, performance, and specification. Hence, SAG is a directed graph which shows the inclusion relationships among attribute instances. Since the degree of conformance is very close to the inclusion relationship, we can say the acceptability of services depends on the closeness of inclusion relationship among corresponding attribute instances. That is, the high closeness implies the high acceptability because the degree of closeness reflects the degree of conformance among attributes instances. The degree of closeness is proportional to the path length between two vertex in SAG. The shorter path length means more close inclusion relationship than longer path length, which implies the higher degree of conformance. In addition to acceptability, in this paper, other user preferences such as priority for attributes and mandatary options are reflected for the variety of user requirements. Furthermore, to consider various types of attribute like character, number, and boolean also helps to support the variety of user requirements. Finally, according to service value to price cloud services are rated and recommended to users. One of the significances of this paper is the first try to present a graph-based selection reasoning unlike other works, while considering various user preferences in relation with service attributes.

Evaluation of Approximate Exposure to Low-dose Ionizing Radiation from Medical Images using a Computed Radiography (CR) System (전산화 방사선촬영(CR) 시스템을 이용한 근사적 의료 피폭 선량 평가)

  • Yu, Minsun;Lee, Jaeseung;Im, Inchul
    • Journal of the Korean Society of Radiology
    • /
    • v.6 no.6
    • /
    • pp.455-464
    • /
    • 2012
  • This study suggested evaluation of approximately exposure to low-dose ionization radiation from medical images using a computed radiography (CR) system in standard X-ray examination and experimental model can compare diagnostic reference level (DRL) will suggest on optimization condition of guard about medical radiation of low dose space. Entrance surface dose (ESD) cross-measuring by standard dosimeter and optically stimulated luminescence dosimeters (OSLDs) in experiment condition about tube voltage and current of X-ray generator. Also, Hounsfield unit (HU) scale measured about each experiment condition in CR system and after character relationship table and graph tabulate about ESD and HU scale, approximately radiation dose about head, neck, thoracic, abdomen, and pelvis draw a measurement. In result measuring head, neck, thoracic, abdomen, and pelvis, average of ESD is 2.10, 2.01, 1.13, 2.97, and 1.95 mGy, respectively. HU scale is $3,276{\pm}3.72$, $3,217{\pm}2.93$, $2,768{\pm}3.13$, $3,782{\pm}5.19$, and $2,318{\pm}4.64$, respectively, in CR image. At this moment, using characteristic relationship table and graph, ESD measured approximately 2.16, 2.06, 1.19, 3.05, and 2.07 mGy, respectively. Average error of measuring value and ESD measured approximately smaller than 3%, this have credibility cover all the bases radiology area of measurement 5%. In its final analysis, this study suggest new experimental model approximately can assess radiation dose of patient in standard X-ray examination and can apply to CR examination, digital radiography and even film-cassette system.