• Journal of Korea Entertainment Industry Association
• /
• v.14 no.5
• /
• pp.49-57
• /
• 2020

This paper analyzed maximized the tension not by functional restriction but by psychological response inducement to form the tension of the horror game from the point of space time view. In order that, We arranged three major situations inducing the tension in the horror game and prepared space time analysis base. Pure fiction time of game itself is applied on game time excluding the time creating the cut-scene and the game space is organized with various combination of three space types. This analysis result can help horror game design by discovering the relationship between space time structure and tension forming of the horror game. These analysis results allow us to find guidelines for the time and space design of horror games that can be flexibly linked to game events and contexts by controlling the player's dynamic/static tension and temporary/continuous tension.

• Journal of the Korean Society of Safety
• /
• v.39 no.1
• /
• pp.62-69
• /
• 2024

Ensuring swift on-site access to fire engines is crucial in preserving the golden time and minimizing damage. However, various mobility constraints in alleyways hinder the timely entry of fire engines to the fire scene, significantly impairing their initial response capabilities. Therefore, this study analyzed the significant mobility constraints of fire engines, focusing on Seoul, which has many old town areas. By leveraging survey responses from firefighting experts and actual observations, this study quantitatively assessed the frequency and severity of mobility constraint factors affecting the disaster responses of fire engines. Survey results revealed a consistent set of top five factors regarding the frequency and disturbance level, including illegally parked cars, narrow paths, motorcycles, poles, and awnings/banners. A comparison with actual road-view images showed notable consistency between the survey and observational results regarding the appearance frequency of mobility constraint factors in vulnerable areas in Seoul. Furthermore, the study emphasized the importance of tailored management strategies for each mobility constraint factor, considering its characteristics, such as dynamic or static. The findings of this study can serve as foundational data for creating more detailed fire safety maps and advancing technologies that monitor the mobility of fire engines through efficient vision-based inference using CCTVs in the future.

• The Journal of Information Technology
• /
• v.7 no.2
• /
• pp.93-104
• /
• 2004

Sports scene is characterized by large amount of global motion due to pan and zoom of camera motion, and includes many small objects moving independently. Some short period of sports games is thrilling to televiewers, and important to producers. At the same time that kinds of scenes exhibit exceptionally dynamic motions and it is very difficult to analyze the motions with conventional algorithms. In this thesis, several algorithms are proposed for global motion analysis on these dynamic scenes. It is shown that proposed algorithms worked well for motion compensation and panorama synthesis. When cascading the inter frame motions, accumulated errors are unavoidable. In order to minimize these errors, interpolation method of motion vectors is introduced. Affined transform or perspective projection transform is regarded as a square matrix, which can be factorized into small amount of motion vectors. To solve factorization problem, we preposed the adaptation of Newton Raphson method into vector and matrix form, which is also computationally efficient. Combining multi frame motion estimation and the corresponding interpolation in hierarchical manner enhancement algorithm of motion parameters is proposed, which is suitable for motion compensation and panorama synthesis. The proposed algorithms are suitable for special effect rendering for broadcast system, video indexing, tracking in complex scenes, and other fields requiring global motion estimation.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.30 no.1D
• /
• pp.79-87
• /
• 2010

The urban street has been escaped from functional and uniformed arrangement for merely movement to the space which can take the role of cozy and familiar culture. Therefore I tried to prepare a plan for the wide roads having streetscape which reveal area's identity as well as coziness and convenience by grasping the problem and its solution through analysing and deducing various elements with the subject of streetscape among urban landscape components, especially composing wide road's streetscape. First of all, this study made a simulation by deducing components of wide road's streetscape and controlling them with theoretical review of streetscape and consideration of wide road's local characteristic. With the evaluation on the base of them, that following four components could be the representative things of entrance part was confirmed by this study. They were familiar streetscape,symbolic scene as as an entrance gate, continuous and dynamic streetscape, and interesting and pleasant streetscape. And for the middle part, those four components could represent the wide road's streetscapeI were confirmed. They were familiar streetscape, safe and tender streetscape, pleasant and dynamic streetscape, and symbolic streetscape. It seems that the components of the streetscape obtained from the analysis of this study are utilized as reference data in the case of a future streetscape design conclusively.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.44 no.2
• /
• pp.37-51
• /
• 2016

Modern optical mechanisms slanted toward Ocular-centrism have neglected diverse functions of vision, judged objects in abstract and binary perspectives, and organized spaces accordingly, there by neglecting the function of eyes groping objects. Recently, various experiences have been induced through communication with other senses by the complex perception beyond the binary perception system of vision. Haptic perception is dynamic vision that induces accompanying bodily experiences through interaction among the various senses; it recognizes the characteristics of material properties and various sensitive stimulations of human beings. This study elaborates on the major features of haptic perception by examining the theoretical background of this concept, which stimulates the active experience of the subject and determines how characteristics of haptic perception are displayed in picturesque gardens. In order to identify the major features of haptic perception, this study examines how Adolf Hildebrand's theory of vision is developed, expanded, and reinterpreted by Alois Riegl, Wilhelm Worringer, Walter Benjamin, Maurice Merleau Ponty, and Gilles Deleuze in the histories of philosophy and aesthetics. Based thereon, the core differences in haptic perception models and visual perception models are analyzed, and the features of haptic perception are identified. Then, classical gardens are set for visual perception and picturesque gardens are set for haptic perception so that the features from haptic perception identified previously are projected onto the picturesque gardens. The research results drawn from this study regarding features of haptic perception presented in picturesque gardens are as follows. The core differences of haptic perception in contrast to visual perception can be summarized as ambiguity and obscureness of boundaries, generation of dynamic perspectives, induction of motility by indefinite circulation, and strangeness and sublime beauty by the impossibility of perception. In picturesque gardens, the ambiguity and obscureness of boundaries are presented in the irregularity and asymmetric elements of planes and the rejection of a single view, and the generation of dynamic perspectives results from the adoption of narrative structure and overlapping of spaces through the creation of complete views, medium range views, and distant views, which the existing gardens lack. Thus, the scene composition technique is reproduced. The induction of motility by indefinite circulation is created by branching circulation, and strangeness and sublime beauty are presented through the use of various elements and the adoption of 'roughness', 'irregularity', and 'ruins' in the gardens.

• Journal of Intelligence and Information Systems
• /
• v.19 no.4
• /
• pp.81-96
• /
• 2013

Video information retrieval has become a very important issue because of the explosive increase in video data from Web content development. Meanwhile, content-based video analysis using visual features has been the main source for video information retrieval and browsing. Content in video can be represented with content-based analysis techniques, which can extract various features from audio-visual data such as frames, shots, colors, texture, or shape. Moreover, similarity between videos can be measured through content-based analysis. However, a movie that is one of typical types of video data is organized by story as well as audio-visual data. This causes a semantic gap between significant information recognized by people and information resulting from content-based analysis, when content-based video analysis using only audio-visual data of low level is applied to information retrieval of movie. The reason for this semantic gap is that the story line for a movie is high level information, with relationships in the content that changes as the movie progresses. Information retrieval related to the story line of a movie cannot be executed by only content-based analysis techniques. A formal model is needed, which can determine relationships among movie contents, or track meaning changes, in order to accurately retrieve the story information. Recently, story-based video analysis techniques have emerged using a social network concept for story information retrieval. These approaches represent a story by using the relationships between characters in a movie, but these approaches have problems. First, they do not express dynamic changes in relationships between characters according to story development. Second, they miss profound information, such as emotions indicating the identities and psychological states of the characters. Emotion is essential to understanding a character's motivation, conflict, and resolution. Third, they do not take account of events and background that contribute to the story. As a result, this paper reviews the importance and weaknesses of previous video analysis methods ranging from content-based approaches to story analysis based on social network. Also, we suggest necessary elements, such as character, background, and events, based on narrative structures introduced in the literature. We extract characters' emotional words from the script of the movie Pretty Woman by using the hierarchical attribute of WordNet, which is an extensive English thesaurus. WordNet offers relationships between words (e.g., synonyms, hypernyms, hyponyms, antonyms). We present a method to visualize the emotional pattern of a character over time. Second, a character's inner nature must be predetermined in order to model a character arc that can depict the character's growth and development. To this end, we analyze the amount of the character's dialogue in the script and track the character's inner nature using social network concepts, such as in-degree (incoming links) and out-degree (outgoing links). Additionally, we propose a method that can track a character's inner nature by tracing indices such as degree, in-degree, and out-degree of the character network in a movie through its progression. Finally, the spatial background where characters meet and where events take place is an important element in the story. We take advantage of the movie script to extracting significant spatial background and suggest a scene map describing spatial arrangements and distances in the movie. Important places where main characters first meet or where they stay during long periods of time can be extracted through this scene map. In view of the aforementioned three elements (character, event, background), we extract a variety of information related to the story and evaluate the performance of the proposed method. We can track story information extracted over time and detect a change in the character's emotion or inner nature, spatial movement, and conflicts and resolutions in the story.

• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.529-542
• /
• 2000

Recent years, the use of multimedia information is rapidly increasing, and the video media is the most rising one than any others, and this field Integrates all the media into a single data stream. Though the availability of digital video is raised largely, it is very difficult for users to make the effective video access, due to its length and unstructured video format. Thus, the minimal interaction of users and the explicit definition of video structure is a key requirement in the lately developing image and video management systems. This paper defines the terms and hierarchical video structure, and presents the system, which construct the clustering-based video hierarchy, which facilitate users by browsing the summary and do a random access to the video content. Instead of using a single feature and domain-specific thresholds, we use multiple features that have complementary relationship for each other and clustering-based methods that use normalization so as to interact with users minimally. The stage of shot boundary detection extracts multiple features, performs the adaptive filtering process for each features to enhance the performance by eliminating the false factors, and does k-means clustering with two classes. The shot list of a result after the proposed procedure is represented as the video hierarchy by the intelligent unsupervised clustering technique. We experimented the static and the dynamic movie videos that represent characteristics of various video types. In the result of shot boundary detection, we had almost more than 95% good performance, and had also rood result in the video hierarchy.

• Journal of Broadcast Engineering
• /
• v.19 no.6
• /
• pp.896-906
• /
• 2014

In this paper, a real-time dual-mode temporal synchronization and compensation method based on a new reliability measure in stereoscopic video is proposed. The goal of temporal alignment is to detect the temporal asynchrony and recover synchronization of the two video streams. The accuracy of the temporal synchronization algorithm depends on the 3DTV contents. In order to compensate the temporal synchronization error, it is necessary to judge whether the result of the temporal synchronization is reliable or not. Based on our recently developed temporal synchronization method[1], we define a new reliability measure for the result of the temporal synchronization method. Furthermore, we developed a dual-mode temporal synchronization method, which uses a usual texture matching method and the temporal spatiogram method[1]. The new reliability measure is based on two distinctive features, a dynamic feature for scene change and a matching distinction feature. Various experimental results show the effectiveness of the proposed method. The proposed algorithms are evaluated and verified through an experimental system implemented for 3DTV.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.665-670
• /
• 2003

In the applications like automatic masks generation for semiconductor production, a drawing consists of lots of polygons that are partitioned into trapezoids. The addition/deletion of a polygon to/from the drawing is performed through geometric operations such as insertion, deletion, and search of trapezoids. Depending on partitioning algorithm being used, a polygon can be partitioned differently in terms of shape, size, and so on. So, It's necessary to invent some comparison algorithm of sets of trapezoids in which each set represents interested parts of a drawing. This comparison algorithm, for example, may be used to verify a software program handling geometric objects consisted of trapezoids. In this paper, given k sets of trapezoids in which each set forms the regions of interest of each drawing, we present how to compare the k sets to see if all k sets represent the same geometric scene. When each input set has the same number n of trapezoids, the algorithm proposed has O(2$^{k-2}$ $n^2$(log n＋k)) time complexity. It is also shown that the algorithm suggested has the same time complexity O( $n^2$ log n) as the sweeping-based algorithm when the number k(<< n) of input sets is small. Furthermore, the proposed algorithm can be kn times faster than the sweeping-based algorithm when all the trapezoids in the k input sets are almost the same.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.74-86
• /
• 2006

This paper proposes a robust and computationally efficient algorithm for automatic video object segmentation. For implementing the spatio-temporal segmentation, which aims for efficient combination of the motion segmentation and the color segmentation, an SOM-based hierarchical clustering method in which the segmentation process is regarded as clustering of feature vectors is employed. As results, problems of high computational complexity which required for obtaining exact segmentation results in conventional video object segmentation methods, and the performance degradation due to noise are significantly reduced. A measure of motion vector reliability which employs MRF-based MAP estimation scheme has been introduced to minimize the influence from the motion estimation error. In addition, a noise elimination scheme based on the motion reliability histogram and a clustering validity index for automatically identifying the number of objects in the scene have been applied. A cross projection method for effective object tracking and a dynamic memory to maintain temporal coherency have been introduced as well. A set of experiments has been conducted over several video sequences to evaluate the proposed algorithm, and the efficiency in terms of computational complexity, robustness from noise, and higher segmentation accuracy of the proposed algorithm have been proved.