• The Journal of the Korea Contents Association
• /
• v.12 no.8
• /
• pp.1-12
• /
• 2012

We develop the Spatio-Temporal Graph to imbue the historical context to the situations in a virtual world, and an ontology to enable a structural description of their elements such as the objects, relationships, and activities. In the time dimension the graph models all the temporal phases of the future besides the past and present in a comprehensive manner, and all the spatial aspects in an intuitive but efficient fashion. The overall architecture composing the Physical Layer, Logical Layer and Conceptual Layer which are integrated according to their interrelations allows events occurring in their corresponding worlds to be simulated in historical context. The S-T Graph could be used both to simulate the situations in the virtual world and to realize the knowledge systems of the virtual inhabitants to be used in judging and evaluating those situations. By adding temporal changes to the multi-layered architecture of our virtual world, this model lays a foundation for maximizing the diversity of situations in the simulation of a virtual world.

• Journal of Korea Multimedia Society
• /
• v.15 no.9
• /
• pp.1133-1148
• /
• 2012

This paper presents a hierarchical structuring method for the multidimensional type inheritance indices (MD-TIXs) that support the processing of XML queries in XML databases. MD-TIX uses a multidimensional index structure for efficiently supporting ancestor-descendant explorations that involve both nested element and type inheritance hierarchies. However, In the case of a long Xpath, the building and maintenance of MD-TIX are very difficult because of index entry construction problem. So, we propose a type inheritance index hierarchy method for solving this difficulty. We first construct base indices that support direct relationship explorations between adjacent two types on a given Xpath, and then, based on these base indices, we construct hierarchically the derived indices that support indirect relationship explorations between any two types of Xpath until constructing one target index for supporting the full Xpath. And we also present an algorithm that efficiently constructs a partial index hierarchy for supporting given a set of sub-pathes explorations.

• Journal of the Institute of Convergence Signal Processing
• /
• v.20 no.4
• /
• pp.205-211
• /
• 2019

Steganalysis is a technique that aims to detect and recover data hidden by steganography. Steganalytic methods detect hidden data by analyzing visual and statistical distortions caused during data embedding. However, for recovering the hidden data, they need to know which steganographic methods the hidden data has been embedded by. Therefore, we propose a hierarchical convolutional neural network (CNN) structure that identifies a steganographic method applied to an input image through multi-level classification. We trained four base CNNs (each is a binary classifier that determines whether or not a steganographic method has been applied to an input image or which of two different steganographic methods has been applied to an input image) and connected them hierarchically. Experimental results demonstrate that the proposed hierarchical CNN structure can identify four different steganographic methods (LSB, PVD, WOW, and UNIWARD) with an accuracy of 79%.

• Journal of Broadcast Engineering
• /
• v.16 no.6
• /
• pp.1073-1076
• /
• 2011

In this paper, we propose a scalable random access scheme in SVC based DASH service that enables random access support not only for base layer of SVC but also for enhancement layers. The proposed method includes extension of segment index box ('sidx') from DASH standard, as well as new RAP Synchronization Box ('raps'). Since the proposed scheme provides random access service for movie fragments with SVC encoded video layers, adaptive scalable random access service is possible.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.130-132
• /
• 2011

본 논문은 지상파 방송망 내 전계강도가 낮은 지역에 최소한의 데이터 전송률을 보장하기 위한 계층변조와 다중경로 채널 극복 및 수신 성능 향상을 위한 다중 안테나 수신기법을 SFN에 적용하여 제안하였다. 계층변조는 기존의 데이터 스트림에 부가적인 데이터 스트림을 삽입함에 따라 지상파 3D HDTV 방송 서비스는 더 많은 유효 전송률을 확보하고 고품질 비디오 서비스를 제공할 수 있었다. 그러나 기본 서비스의 품질을 유지하면서 부가적인 서비스의 품질을 보장하기 위한 대책이 필요하다. 그래서 송, 수신 안테나의 이득을 올리기 위해 다중 안테나 사용 방식을 채용하고, 그 수신 성능을 다중 안테나 위치에 따라 비교해 보았다. 그 결과, 수신 안테나가 한 쪽의 송신 안테나에 가까워질수록 실질적인 SNR이 증가하여 BER 성능이 향상되는 것을 확인하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.06a
• /
• pp.323-326
• /
• 2007

When traveling on real road network, it generally takes less travel time in a near straight path than a zig-zaged path with same source and destination. In order to making a left(right/u) turn, the delay should be required to decrease the speed. The traffic signal waiting time of left(right/u) turn is probably longer than straight driving. In this paper, we revise the previous hierarchical path finding algorithm to reduce the number of turns. The algorithm proposed in this paper complied with a hierarchical $A^*$ algorithm, but has a distinct strategy for edge weight. We define an edge that makes a turn as a turn-edge and give the turn-edge lower weight to maintain the straightness of the whole path.

• Journal of Korean Library and Information Science Society
• /
• v.36 no.2
• /
• pp.221-239
• /
• 2005

FRBR, as is new conceptual model of bibliography based on entity-relation model, direct to revision of AACR 3.JSC has progressed work to adopt FRBR conceptual model into cataloging rule, especially for solving the problem of expression level, propose to overall change of uniform title & GMD. This study considers the matters about expression level of FRBR model. And examine possibility of adoption FRBR model to domestic cataloging rule and making out practice.

• The Journal of the Acoustical Society of Korea
• /
• v.24 no.6
• /
• pp.358-364
• /
• 2005

In this Paper. we present a bitrate scalable speech codec which uses an ITU-T G.723.1 as the baseline coder and encodes the synthesis error signal in an enhancement coder. ITU-T P.862 (PESQ) is used to evaluate the Performance of the bitrate scalable coder. Experiments show that 6.7kbps enhancement layer based on G.723.1 5.3kbps produces the increase of 0.39 in MOS and 5.7kbps enhancement layer based on G.723.1 6.3kbps Produces the increase of 0.267 in MOS.

• Proceedings of the Korea Contents Association Conference
• /
• 2004.05a
• /
• pp.351-356
• /
• 2004

The binding update of the Mobile IPv6 which does a route optimization in basic by the node which moves frequently brings about the signaling traffic increase of binding update. It supplements this the MAP(Mobile Anchor Point) for to let, and Hierarchical Mobile IPv6 which considers a macro mobility and a micro rambling regional mobility was proposed. But Mobile IPv6 when transmitting the packet, always does to pass by the mP, the packet intensive actual condition of the MAP to occur it does not guarantee a route optimization. In this study, It accomplishes the course improvement which considers the mobility of mobile node and it interprets the relaxation quality of packet intensive actual condition with the MAP

• The Journal of the Korea Contents Association
• /
• v.7 no.12
• /
• pp.273-282
• /
• 2007

The Domain Name System (DNS) is the core system for managing Internet address resources, providing the most fundamental naming service. Currently, the DNS is classified into a tree structure. In this structure, it is difficult to normally access to the lower DNS, when there is an error in the upper DNS. Such a risk still remains even when a supplementary DNS is operated. However, due to the merit of the DNS enabling fast searches, it is impracticable to abandon the current tree structure. To efficiently correspond to DNS errors, this study suggests a method where the merit of the current tree structure is kept, while a temporary operation of the local DNS is available when errors occur by adding a horizontal and independent DNS structure.