• Journal of Korea Multimedia Society
• /
• v.8 no.6
• /
• pp.844-855
• /
• 2005

This paper proposes a human action recognition scheme for Intelligent Web Browser. Based on the principle that a human action can be defined as a combination of multiple articulation movements, the inference of stochastic grammars is applied to recognize each action. Human actions in 3 dimensional (3D) world coordinate are measured, quantized and made into two sets of 4-chain-code for xy and zy projection planes, consequently they are appropriate for applying the stochastic grammar inference method. We confirm this method by experiments, that various physical actions can be classified correctly against a set of real world 3D temporal data. The result revealed a comparatively successful achievement of $93.8\%$ recognition rate through the experiments of 8 movements of human head and $84.9\%$ recognition rate of 60 movements of human upper body. We expect that this scheme can be used for human-machine interaction commands in a web browser.

• Journal of Broadcast Engineering
• /
• v.12 no.6
• /
• pp.624-629
• /
• 2007

While single view video coding uses the temporal prediction scheme, multi-view video coding (MVC) applies both temporal and inter-view prediction schemes. Thus, the key problem of MVC is how to reduce the inter-view redundancy efficiently, because various existing video coding schemes have already provided solutions to reduce the temporal correlation. In this paper, we propose a global disparity compensation scheme which increases the inter-view correlation and a new inter-view prediction structure based on the global disparity compensation. By experiment, we demonstrate that the proposed global disparity compensation scheme is less sensitive to change of the search range. In addition, the new Inter-view prediction structure achieved about $0.1{\sim}0.3dB$ quality improvement compared to the reference software.

• Journal of information and communication convergence engineering
• /
• v.2 no.1
• /
• pp.26-31
• /
• 2004

In the last few years, The Semantic Web has increased the interest in ontologies. Ontology is an essential component of the semantic web. Ontologies continue to change and evolve. We consider the management of versions in ontology. We study a set of changes based on domain changes, changes in conceptualization, metadata changes, and temporal dimension. In many cases, we want to be able to search in historical versions, query changes in versions, retrieve versions on the temporal dimension. In order to support an ontology query language that supports temporal operations, we consider temporal dimension includes transaction time and valid time. Ontology versioning brings about massive amount of versions to be stored and maintained. We present the storage policies that are storing all the versions, all the sequence of changed element, all the change sets, the aggregation of change sets periodically, and the aggregation of change sets using a criterion. We conduct a set of experiments to compare the performance of each storage policies. We present the experimental results for evaluating the performance of different storage policies from scheme 1 to scheme 5.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.4
• /
• pp.309-318
• /
• 2004

This paper proposes the H.264-based selective fine granular scalable (FGS) coding scheme that selectively uses the temporal prediction data in the enhancement layer. The base layer of the proposed scheme is basically coded by the H.264 (MPEG-4 Part 10 AVC) visual coding scheme that is the state-of-art in codig efficiency. The enhancement layer is basically coded by the same bitplane-based algorithm of the MPEG-4 (Part 2) fine granular scalable coding scheme. In this paper, we introduce a new algorithm that uses the temproal prediction mechanism inside the enhancement layer and the effective selection mechanism to decide whether the temporally-predicted data would be sent to the decoder or not. Whenever applying the temporal prediction inside the enhancement layer, the temporal redundancies may be effectively reduced, however the drift problem would be severly occurred especially at the low bitrate transmission, due to the mismatch bewteen the encoder's and decoder's reference frame images. Proposed algorithm selectively uses the temporal-prediction data inside the enhancement layer only in case those data could siginificantly reduce the temporal redundancies, to minimize the drift error and thus to improve the overall coding efficiency. Simulation results, based on several test image sequences, show that the proposed scheme has 1∼3 dB higher coding efficiency than the H.264-based FGS coding scheme, even 3∼5 dB higher coding efficiency than the MPEG-4 FGS international standard.

• Journal of KIISE:Software and Applications
• /
• v.29 no.9
• /
• pp.631-644
• /
• 2002

In this paper efficient algorithms for content-based video retrieval using motion information are proposed, including temporal scale-invariant retrieval and temporal scale-absolute retrieval. In temporal scale-invariant video retrieval, the distance transformation is performed on each trail image in database. Then, from a given que교 trail the pixel values along the query trail are added in each distance image to compute the average distance between the trails of query image and database image, since the intensity of each pixel in distance image represents the distance from that pixel to the nearest edge pixel. For temporal scale-absolute retrieval, a new coding scheme referred to as Motion Retrieval Code is proposed. This code is designed to represent object motions in the human visual sense so that the retrieval performance can be improved. The proposed coding scheme can also achieve a fast matching, since the similarity between two motion vectors can be computed by simple bit operations. The efficiencies of the proposed methods are shown by experimental results.

• Water for future
• /
• v.29 no.1
• /
• pp.203-212
• /
• 1996

The subject research attempts to develop a new temporal interpolation scheme for the method of characteristics. The proposed three-point time-line Lagrange interpolation Reachback (3PR) method is a temporal quadratic interpolation scheme using the three grid points near the intersection between a characteristic line and a previous time-line. The accuracy of the 3PR method is compared with those of temporal and spatial interpolation schemes such as Reachback, Upwind, and quandratic spatial interpolation methods for two pure advection problems. The results show that on the aspects of the numerical damping and/or oscillation the temporal interpolation schemes are better than the spatial ones under the same interpolation order conditions. In addition, the spatial ones under the same interpolation order conditions. In addition, the proposed 3PR method improves the accuracy of Reachback method as well as it contains the merits of time-line interpolation schemes.

• Journal of applied mathematics & informatics
• /
• v.39 no.5_6
• /
• pp.623-641
• /
• 2021

In this paper, numerical treatment of singularly perturbed parabolic delay differential equations is considered. The considered problem have small delay on the spatial variable of the reaction term. To treat the delay term, Taylor series approximation is applied. The resulting singularly perturbed parabolic PDEs is solved using Crank Nicolson method in temporal direction with non-standard finite difference method in spatial direction. A detail stability and convergence analysis of the scheme is given. We proved the uniform convergence of the scheme with order of convergence O(N^-1 + (∆t)²), where N is the number of mesh points in spatial discretization and ∆t is mesh length in temporal discretization. Two test examples are used to validate the theoretical results of the scheme.

• Journal of Information Technology Applications and Management
• /
• v.12 no.3
• /
• pp.27-39
• /
• 2005

The Semantic Web has increased the interest in ontologies recently Ontology is an essential component of the semantic web and continues to change and evolve. We consider versions management schemes in ontology. We study a set of changes based on domain changes, changes in conceptualization, metadata changes, and temporal dimension. Our change specification is represented by a set of changes. A set of changes consists of instance data change, structural change, and identifier change. In order to support a query in ontology versions, we consider temporal dimension includes valid time. Ontology versioning brings about massive amount of versions to be stored and maintained. We present the ontology versions management schemes that are 1) storing all the change sets, 2) storing the aggregation of change sets periodically, and 3) storing the aggregation of change sets using an adaptive criterion. We conduct a set of experiments to compare the performance of each versions management schemes. We present the experimental results for evaluating the performance of the three version management schemes from scheme 1 to scheme 3. Scheme 1 has the least storage usage. The average response time in Scheme 1 is extremely large, those of Scheme 3 is smaller than Scheme 2. Scheme 3 shows a good performance relatively.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.5
• /
• pp.40-47
• /
• 2009

A motion adaptive video noise reduction scheme is proposed by cascading a temporal filter and a spatial filter. After a noise-robust motion detection is performed with a pre-spatial filter, the strength of the motion adaptive temporal filter is controlled by the amount of temporal movement. In order to fully utilize the temporal correlation of video signal, noisy input image is processed first by the temporal filter, therefore, image details of temporally stationary region are quite well preserved while undesired noises are suppressed. In contrast to the pre-spatial filter used for the robust motion detection, the cascaded post-spatial filter removes the remained noises by considering the strength of the temporal filter and the spatial self-similarity search results obtained from the pre-spatial filter.

• The Journal of the Korea Contents Association
• /
• v.13 no.6
• /
• pp.9-19
• /
• 2013

In this paper, we develop a Spatio-Temporal graph as of a key component of our knowledge representation Scheme. We design an integrated representation scheme to depict not only present and past but future in parallel with the spaces in an effective and intuitive manner. An event in general occupies not only a space but a time. Hence a crucial premise for the simulation of virtual situations is to position events in the multi-dimensional context, that is, 3-D space extended by the temporal dimension. Furthermore an event tends to have physical, social and mental aspects intertwined. As a result we need diverse information structures and functions to model entities and relations associated with events and to describe situations in different stances or perspectives of the virtual agents. These structures and functions are implemented in terms of integrated and intuitive representation schemes at different levels such as Ontology View, Instance View, ST View, Reality View. The resulting multi-dimensional comprehensive knowledge structure accommodates multi-layered virtual world developing in the time to maximize the diversity of situations in the historical context. The viability of this knowledge representation scheme is demonstrated with a typical scenario applied to a simulator implemented based on the ST Graph. The virtual stage based on the ST graph can be used to provide natural contexts for situated learning or next-generation simulation games.