• Title/Summary/Keyword: 보도 프레임

Search Result 1,298, Processing Time 0.036 seconds

Facial Expression Control of 3D Avatar using Motion Data (모션 데이터를 이용한 3차원 아바타 얼굴 표정 제어)

  • Kim Sung-Ho;Jung Moon-Ryul
    • The KIPS Transactions:PartA
    • /
    • v.11A no.5
    • /
    • pp.383-390
    • /
    • 2004
  • This paper propose a method that controls facial expression of 3D avatar by having the user select a sequence of facial expressions in the space of facial expressions. And we setup its system. The space of expression is created from about 2400 frames consist of motion captured data of facial expressions. To represent the state of each expression, we use the distance matrix that represents the distances between pairs of feature points on the face. The set of distance matrices is used as the space of expressions. But this space is not such a space where one state can go to another state via the straight trajectory between them. We derive trajectories between two states from the captured set of expressions in an approximate manner. First, two states are regarded adjacent if the distance between their distance matrices is below a given threshold. Any two states are considered to have a trajectory between them If there is a sequence of adjacent states between them. It is assumed . that one states goes to another state via the shortest trajectory between them. The shortest trajectories are found by dynamic programming. The space of facial expressions, as the set of distance matrices, is multidimensional. Facial expression of 3D avatar Is controled in real time as the user navigates the space. To help this process, we visualized the space of expressions in 2D space by using the multidimensional scaling(MDS). To see how effective this system is, we had users control facial expressions of 3D avatar by using the system. As a result of that, users estimate that system is very useful to control facial expression of 3D avatar in real-time.

Betweenness Centrality-based Evacuation Vulnerability Analysis for Subway Stations: Case Study on Gwanggyo Central Station (매개 중심성 기반 지하철 역사 재난 대피 취약성 분석: 광교중앙역 사례연구)

  • Jeong, Ji Won;Ahn, Seungjun;Yoo, Min-Taek
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.44 no.3
    • /
    • pp.407-416
    • /
    • 2024
  • Over the past 20 years, there has been a rapid increase in the number and size of subway stations and underground structures worldwide, and the importance of safety for subway users has also continuously grown. Subway stations, due to their structural characteristics, have limited visibility and escape routes in disaster situations, posing a high risk of human casualties and economic losses. Therefore, an analysis of disaster vulnerabilities is essential not only for existing subway systems but also for deep underground facilities like GTX. This paper presents a case study applying a betweenness centrality-based disaster vulnerability analysis framework to the case of Gwanggyo Central Station. The analysis of Gwanggyo Central Station's base model and various disaster scenarios revealed that the betweenness centrality distribution is symmetrical, following the symmetrical spatial structure of the station, with high centrality concentrated in the central areas of basement levels one and two. These areas exhibited values more than 220% above the average, indicating a high likelihood of bottleneck phenomena during evacuation in disaster situations. To mitigate this vulnerability, scenarios were proposed to distribute evacuation flows concentrated in the central areas, enhancing the usability of peripheral areas as evacuation routes by connecting staircases continuously. This modification, when considered, showed a decrease in centrality concentration, confirming that the proposed addition of evacuation paths could effectively contribute to dispersing the flow of evacuation in Gwanggyo Central Station. This case study demonstrates the effectiveness of the proposed framework for assessing evacuation vulnerability in enhancing subway station user safety and can be effectively applied in disaster response and management plans for major underground facilities.

Effect of Achyranthis Radix and Drynariae Rhizoma Extracts on Antioxidant Activity and Antioxidant Enzymes (우슬과 골쇄보의 추출물이 항산화 활성 및 항산화 효소 대사에 미치는 효과)

  • Kang, Mi Young;Lee, Soo Hyun;Lee, Sang Won;Cha, Sun Woo;Song, Jae Lim;Lee, Sang Chul
    • Korean Journal of Plant Resources
    • /
    • v.28 no.5
    • /
    • pp.600-607
    • /
    • 2015
  • In vitro and in vivo experiments using Achyranthis radix and Drynariae rhizoma extracts were conducted. Antioxidant properties were analyzed and the effects on bone, glucose and lipid metabolism were investigated. Drynariae rhizoma (64.67%) obtained higher DPPH radical scavenging activity compared to Achyranthis radix (19.03%). Similar results were obtained in the reducing power. No differences were observed on the ABTS radical scavenging ability and SOD. In contrast, Achyranthis radix (77.60%) has higher chelating ability compared to Drynariae rhizoma (46.21%). In vivo experiments revealed higher plasma TBARS in OVX-DR than in OVX-AR. Opposite result was seen in erythrocyte TBARS. Hepatic, nephritic and erythrocyte enzymes were considered for the antioxidant enzyme activities. GSH-Px and PON of hepatic enzymes were higher in OVX-AR. While the CAT and GR were higher in OVX-DR. SOD, GSH-Px, GR and PON of nephritic enzymes of OVX-DR were higher compared to OVX-AR. Almost similar values were obtained in CAT using both extracts. The OVX treated rats obtained higher CAT and GR in the erythrocyte enzymes compared to SHAM. The SOD of erythrocyte enzymes in OVX-DR was higher compared to OVX-AR. On the other hand, the GSH-Px was higher in OVX-AR.

Scalable RDFS Reasoning using Logic Programming Approach in a Single Machine (단일머신 환경에서의 논리적 프로그래밍 방식 기반 대용량 RDFS 추론 기법)

  • Jagvaral, Batselem;Kim, Jemin;Lee, Wan-Gon;Park, Young-Tack
    • Journal of KIISE
    • /
    • v.41 no.10
    • /
    • pp.762-773
    • /
    • 2014
  • As the web of data is increasingly producing large RDFS datasets, it becomes essential in building scalable reasoning engines over large triples. There have been many researches used expensive distributed framework, such as Hadoop, to reason over large RDFS triples. However, in many cases we are required to handle millions of triples. In such cases, it is not necessary to deploy expensive distributed systems because logic program based reasoners in a single machine can produce similar reasoning performances with that of distributed reasoner using Hadoop. In this paper, we propose a scalable RDFS reasoner using logical programming methods in a single machine and compare our empirical results with that of distributed systems. We show that our logic programming based reasoner using a single machine performs as similar as expensive distributed reasoner does up to 200 million RDFS triples. In addition, we designed a meta data structure by decomposing the ontology triples into separate sectors. Instead of loading all the triples into a single model, we selected an appropriate subset of the triples for each ontology reasoning rule. Unification makes it easy to handle conjunctive queries for RDFS schema reasoning, therefore, we have designed and implemented RDFS axioms using logic programming unifications and efficient conjunctive query handling mechanisms. The throughputs of our approach reached to 166K Triples/sec over LUBM1500 with 200 million triples. It is comparable to that of WebPIE, distributed reasoner using Hadoop and Map Reduce, which performs 185K Triples/sec. We show that it is unnecessary to use the distributed system up to 200 million triples and the performance of logic programming based reasoner in a single machine becomes comparable with that of expensive distributed reasoner which employs Hadoop framework.

Adaptive In-loop Filter Method for High-efficiency Video Coding (고효율 비디오 부호화를 위한 적응적 인-루프 필터 방법)

  • Jung, Kwang-Su;Nam, Jung-Hak;Lim, Woong;Jo, Hyun-Ho;Sim, Dong-Gyu;Choi, Byeong-Doo;Cho, Dae-Sung
    • Journal of Broadcast Engineering
    • /
    • v.16 no.1
    • /
    • pp.1-13
    • /
    • 2011
  • In this paper, we propose an adaptive in-loop filter to improve the coding efficiency. Recently, there are post-filter hint SEI and block-based adaptive filter control (BAFC) methods based on the Wiener filter which can minimize the mean square error between the input image and the decoded image in video coding standards. However, since the post-filter hint SEI is applied only to the output image, it cannot reduce the prediction errors of the subsequent frames. Because BAFC is also conducted with a deblocking filter, independently, it has a problem of high computational complexity on the encoder and decoder sides. In this paper, we propose the low-complexity adaptive in-loop filter (LCALF) which has lower computational complexity by using H.264/AVC deblocking filter, adaptively, as well as shows better performance than the conventional method. In the experimental results, the computational complexity of the proposed method is reduced about 22% than the conventional method. Furthermore, the coding efficiency of the proposed method is about 1% better than the BAFC.

PrimeFilter: An Efficient XML Data Filtering based on Prime Number Indexing (PrimeFilter: 소수 인덱싱 기법에 기반한 효율적 XML 데이타 필터링)

  • Kim, Jae-Hoon;Kim, Sang-Wook;Park, Seog
    • Journal of KIISE:Databases
    • /
    • v.35 no.5
    • /
    • pp.421-431
    • /
    • 2008
  • Recently XML is becoming a de facto standard for online data exchange between heterogeneous systems and also the research of streaming XML data filtering comes into the spotlight. Since streaming XML data filtering technique needs rapid matching of queries with XML data, it is required that the query processing should be efficiently performed. Until now, most of researches focused only on partial sharing of path expressions or efficient predicate processing and they were work for time and space efficiency. However, if containment relationship between queries is previously calculated and the lowest level query is matched with XML data, we can easily get a result that high level queries can match with the XML data without any other processing. That is, using this containment technique can be another optimal solution for streaming XML data filtering. In this paper, we suggest an efficient XML data filtering based on prime number indexing and containment relationship between queries. Through some experimental results, we present that our suggested method has a better performance than the existing method. All experiments have shown that our method has a more than two times better performance even though each experiment has its own distinct test purpose.

Study on the Visual Characteristics and Subjectivity in the Live Action Based Virtual Reality (실사기반 가상현실 영상의 특징과 주체 구성에 대한 연구)

  • Jeon, Gyongran
    • Cartoon and Animation Studies
    • /
    • s.48
    • /
    • pp.117-139
    • /
    • 2017
  • The possibility of interactivity of digital media environment is adopted in human expression system and integrates the dynamic aspect of digital technology with expressive structure, thereby transforming the paradigm of image acceptance as well as image expression range. Virtual reality images have an important meaning in that they are changing the one-way mechanism of production and acceptance of images that lead to producers-video-audiences beyond the problem of verisimilitude such as how vividly they simulate reality. First of all, the virtual reality image is not one-sided but interactive image composed by the user. Viewing a virtual reality image does not just see the camera shine, but it gets the same view as in the real world. Therefore, the image that was controlled through framing changes to be configured positively by the user. This implies a change in the paradigm of image acceptance as well as a change in the existing form of the image itself. In addition, the narrative structure of the image and the subjects that are formed in the process are also required to be discussed. In the virtual reality image, the user 's gaze is a fusion of the gaze inside the image and the gaze outside the image. This is because the position of the user as the subject of the gaze in the virtual reality image is continuously restricted by the device of the discourse such as the editing and the narration of the shot. The significance of the virtual reality image is not aesthetically perfect but it is reconstructed according to the user to reflect the existence of the user positively and engage the user in the image.

Design and Implementation of a news Archive System using Shot Types (샷의 타입을 이용한 뉴스 아카이브 시스템의 설계 및 구현)

  • Han, Keun-Ju;Nang, Jong-Ho;Ha, Myung-Hwan;Jung, Byung-Hee;Kim, Kyeong-Soo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.5
    • /
    • pp.416-428
    • /
    • 2001
  • In order to build a news archive system. the news video stream should be first segmented into several articles, ad their contents are abstracted effectively. This abstraction helps the users to understand the contents of the article without playing the whole video stream. This paper proposes a new article boundary detection scheme for the news video streams together with a new news article abstraction scheme using the shot types of the news video data. The shots in the news video are classified into anchor person shots, interview shots, speech shots, reporting shots, graphic shots, and others. Since the news article starts with an anchor shot whose duration is relatively longer than other shots with special screen structure, the article boundary in detected by the computing the length of the shot and checking the screen structure in the proposed scheme. For the effective abstraction of the article video, the graphic image located in the right-top of the anchor shot frames is primarily used in the proposed abstraction scheme since it is the abstraction of the article made by the producer of the news according to its contents so that it contains a lot of meaningful information. The key frames of the other shots except interview and report shots are also used to abstract the contents of the articles in the proposed scheme. Upon experimental results, the precision and recall values of the proposed article boundary detection scheme could be 92% and 96%, respectively. This paper also presents a design and implementation of a prototype news archive system on WWW that consists of an indexing tool, an authoring tool, a database for meta-data of the news, and a browsing tool.

  • PDF

Spatial Join based on the Transform-Space View (변환공간 뷰를 기반으로한 공간 조인)

  • 이민재;한욱신;황규영
    • Journal of KIISE:Databases
    • /
    • v.30 no.5
    • /
    • pp.438-450
    • /
    • 2003
  • Spatial joins find pairs of objects that overlap with each other. In spatial joins using indexes, original-space indexes such as the R-tree are widely used. An original-space index is the one that indexes objects as represented in the original space. Since original-space indexes deal with sizes of objects, it is difficult to develop a formal algorithm without relying on heuristics. On the other hand, transform-space indexes, which transform objects in the original space into points in the transform space and index them, deal only with points but no sites. Thus, spatial join algorithms using these indexes are relatively simple and can be formally developed. However, the disadvantage of transform-space join algorithms is that they cannot be applied to original-space indexes such as the R-tree containing original-space objects. In this paper, we present a novel mechanism for achieving the best of these two types of algorithms. Specifically, we propose a new notion of the transform-space view and present the transform-space view join algorithm(TSVJ). A transform-space view is a virtual transform-space index based on an original-space index. It allows us to interpret on-the-fly a pre-built original-space index as a transform-space index without incurring any overhead and without actually modifying the structure of the original-space index or changing object representation. The experimental result shows that, compared to existing spatial join algorithms that use R-trees in the original space, the TSVJ improves the number of disk accesses by up to 43.1% The most important contribution of this paper is to show that we can use original-space indexes, such as the R-tree, in the transform space by interpreting them through the notion of the transform-space view. We believe that this new notion provides a framework for developing various new spatial query processing algorithms in the transform space.

A Study on freedom of information in the Government 2.0 era (거버먼트 2.0 기반의 정보공개제도 개선방안에 대한 연구)

  • Kim, You-seung
    • The Korean Journal of Archival Studies
    • /
    • no.25
    • /
    • pp.197-231
    • /
    • 2010
  • The concept of Government 2.0 is spreading rapidly in many countries and is fundamentally changing existing freedom of information system which has passively responded to information demands. This study aims at discussing possible strategies for a new freedom of information system that is based on the Government 2.0 notion which presents revolutional approaches to public sector information's creation, management, and usage. For the purpose of the study, precedence studies and researches about both freedom of information system and Government 2.0 are analyzed. Furthermore, mutual relationships between them are discussed. Through this discussion, social and economic benefits from freedom of information systems which are based on Government 2.0 are explored. As a case study, Data.gov services in the US, the UK, and Australia which are recognised as a feasible plan to set up Government 2.0 are analyzed. Their three common characteristics- revaluating public sector information's reuse, establishing exclusive agencies, and providing raw data-are discussed. Then, various mashup services which use Data.gov services' raw data are also studied. Issues related to the freedom of information system in South Korea are examined. As a result, a policy framework for establishing Government 2.0 based freedom of Information system is discussed in terms of three aspects, law, technology and organization.