Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of Korea Multimedia Society
Journal Basic Information
Journal DOI :
Korea Multimedia Society
Editor in Chief :
Volume & Issues
Volume 10, Issue 12 - Dec 2007
Volume 10, Issue 11 - Nov 2007
Volume 10, Issue 10 - Oct 2007
Volume 10, Issue 9 - Sep 2007
Volume 10, Issue 8 - Aug 2007
Volume 10, Issue 7 - Jul 2007
Volume 10, Issue 6 - Jun 2007
Volume 10, Issue 5 - May 2007
Volume 10, Issue 4 - Apr 2007
Volume 10, Issue 3 - Mar 2007
Volume 10, Issue 1 - Jan 2007
Selecting the target year
A Technique of Converting CXQuery to XQuery for XML Databases
Lee, Min-Young ; Lee, Wol-Young ; Yong, Hwan-Seung ;
Journal of Korea Multimedia Society, volume 10, issue 3, 2007, Pages 289~302
The existing query processing technique for CXQuery, which is able to query regardless of knowledge about XML document structures, is difficult to manage because of table join for query processing and results return, mapping XML documents into relational tables, and so on. In this paper we have developed a converter capable of converting CXQuery to XQuery in order to make use of the query processing techniques for XQuery progressing standardization. The converting speed of the converter takes a trifling time as much as negligible quantities in comparison with the total query processing time. This is also able to query directly XML documents regardless of relational databases, and users can query without knowledge about XML document structures.
Fast Structure Recovery and Integration using Improved Scaled Orthographic Factorization
Park, Jong-Seung ; Yoon, Jong-Hyun ;
Journal of Korea Multimedia Society, volume 10, issue 3, 2007, Pages 303~315
This paper proposes a 3D structure recovery and registration method that uses four or more common points. For each frame of a given video, a partial structure is recovered using tracked points. The 3D coordinates, camera positions and camera directions are computed at once by our improved scaled orthographic factorization method. The partially recovered point sets are parts of a whole model. A registration of point sets makes the complete shape. The recovered subsets are integrated by transforming each coordinate system of the local point subset into a common basis coordinate system. The process of shape recovery and integration is performed uniformly and linearly without any nonlinear iterative process and without loss of accuracy. The execution time for the integration is significantly reduced relative to the conventional ICP method. Due to the fast recovery and registration framework, our shape recovery scheme is applicable to various interactive video applications. The processing time per frame is under 0.01 seconds in most cases and the integration error is under 0.1mm on average.
GPU based Maximum Intensity Projection using Clipping Plane Re-rendering Method
Hong, In-Sil ; Kye, Hee-Won ; Shin, Yeong-Gil ;
Journal of Korea Multimedia Society, volume 10, issue 3, 2007, Pages 316~324
Maximum Intensity Projection (MIP) identifies patients' anatomical structures from MR or CT data sets. Recently, it becomes possible to generate MIP images with interactive speed by exploiting Graphics Processing Unit (GPU) even in large volume data sets. Generally, volume boundary plane is obliquely crossed with view-aligned texture plane in hardware-texture based volume rendering. Since the ray sampling distance is not increased at volume boundary in volume rendering, the aliasing problem occurs due to data loss. In this paper, we propose an efficient method to overcome this problem by Re-rendering volume boundary planes. Our method improves image quality to make dense distances between samples near volume boundary which is a high frequency area. Since it is only 6 clipping planes are additionally needed for Re-rendering, high quality rendering can be performed without sacrificing computational efficiency. Furthermore, our method couldbe applied to Minimum Intensity Projection (MinIP) volume rendering.
IPMP(Intellectual Property Management and Protection) Service Interfaces based on MPEG Multimedia
Choo, Hyon-Gon ; Bang, Gun ; Nam, Je-Ho ;
Journal of Korea Multimedia Society, volume 10, issue 3, 2007, Pages 325~334
In order to increase the promotion of multimedia processing techniques in MPEG standard, MPEG Multimedia Middleware (M3W) which supports middleware interface for multimedia processing is set up. In this paper, multimedia protection and management service interfaces based on MPEG Multimedia Middleware (M3W) are introduced. The service interfaces are based on component models of M3W and support normative IPMP messages. The proposed interfaces are composed of Tool interfaces and Trust management interfaces: Tool interfaces provide the functionality supporting terminal and tool based on the governed decoder model and Trust management interfaces provide the supporting functionality such as license managing and authentication required in DRM devices. As an application of the proposed interfaces, a JAVA based player simulator is shown. The proposed interfaces can be easily implemented under various device and application environments as an ISO/IEC 23004-2 standard middleware platform.
Design and Implementation of Multipoint VoIP using End-point Mixing Model
Lee, Sung-Min ; Lee, Keon-Bae ;
Journal of Korea Multimedia Society, volume 10, issue 3, 2007, Pages 335~347
VoIP (Voice over IP) is a technology to transport video and voice traffic over IP networks such as Internet. Today, the VoIP technology is viewed as the right choice for providing voice, video, and data communication among various terminals over the next generation network. This paper discusses a multipoint VoIP implementation with end-point mixing model which can support multipoint conference without a conference bridge. The multipoint VoIP is implemented with SIP (Session Initiation Protocol), and supports STUN (Simple Traversal of UDP Through NATs) since it works in an asymmetric NAT (Network Address Translator) environment. The characteristics of this paper are as follows. It is possible that all terminals in the hierarchical conference don't receive the duplicated media information because we use the end-point mixing model with the new media processing module. And, the paper solves the problem that the hierarchical conference session should be separated into several sessions when a mixing terminal terminates the hierarchical conference session.
Clock Synchronization for Periodic Wakeup in Wireless Sensor Networks
Kim, Seung-Mok ; Park, Tae-Keun ;
Journal of Korea Multimedia Society, volume 10, issue 3, 2007, Pages 348~357
One of the major issues in recent researches on wireless sensor networks is to reduce energy consumption of sensor nodes operating with limited battery power, in order to lengthen their lifespan. Among the researches, we are interested in the schemes in which a sensor node periodically turns on and off its radio and requires information on the time when its neighbors will wake up (or turn on). Clock synchronization is essential for wakeup scheduling in such schemes. This paper proposes three methods based on the asynchronous averaging algorithm for clock synchronization in sensor nodes which periodically wake up: (1) a fast clock synchronization method during an initial network construction period, (2) a periodic clock synchronization method for saving energy consumption, and (3) a decision method for switching the operation mode of sensor nodes between the two clock synchronization methods. Through simulation, we analyze maximum clock difference and the number of messages required for clock synchronization.
A MPLS Group Restoration using an Aggregation Tree
Lee, Kil-Hung ;
Journal of Korea Multimedia Society, volume 10, issue 3, 2007, Pages 358~364
This paper suggests MPLS restoration method that use an aggregation tree. For the restoration of the MPLS network, this paper presents a scheme that reconstruct multiple path through aggregation tree that grow from many node to a target node. Contrary to a multicast tree where a message that send at one node is passed to a group of node, an aggregation tree is a tree that data is passed from many node to one destination node. Through an experiment we confirmed that the restoration scheme that uses aggregation tree shows taster speed comparing with the existing other restoration scheme.
Development of a Copyright Protection System for Computer Forensics
Lee, Wol-Young ; Hwang, Chul ;
Journal of Korea Multimedia Society, volume 10, issue 3, 2007, Pages 365~372
The information of world is most likely to be created as digital data. These digital productions need some legal protection mechanisms or techniques because users can illegally use them. Thus many researchers are developing various techniques. Currently most techniques are focusing on the physical and chemical methods like disk inspection for taking legal evidence about production infringement. This paper has developed a computer forensics-based copyrights protection system capable of detecting and notifying disobedience facts when user uses illegally a production. Furthermore if the user infringes continually the production the system stores the infringement facts to take the legal evidence by mapping to law for intellectual property right. The technique can protect data from digital evidence manipulation or destruction.
Efficient Protocol for Authentication and Certificate Status Management in PAN
Jang, Hwa-Sik ; Rhee, Kyung-Hyune ;
Journal of Korea Multimedia Society, volume 10, issue 3, 2007, Pages 373~380
In this paper we propose a new efficient authentication protocol that reduces overheads of computation for digital signature generation/verification on mobile devices in the Personal Area Network (PAN). In particular, we focus on eliminating the traditional public key operations on mobile devices without any assistance of a signature server. Moreover, the proposed protocol provides a simplified procedure for certificate status management to alleviate communication and computational costs on mobile devices in the PAN.
Process Annotation for Recording the Manipulation of 3D Structured Models
Lee, Gui-Hyun ; Lim, Soon-Bum ;
Journal of Korea Multimedia Society, volume 10, issue 3, 2007, Pages 381~390
3D object contents are used for various applications in the Web virtual space, where the main concerns are to navigate the 3D virtual space and visualize 3D objects. The techniques to manipulate 3D objects like disassembling and assembling and to record the manipulation process are the very first step. Until now, we can record only the result of 3D object manipulation. Thus, we have tried to study the representation technique to record meaningfully and replay the manipulation process of 3D structured objects. We analyzed the structures and their relations between components to construct 3D objects that are described in XML or VRML. Compared to the previous method, we studied a XML based annotation technique to record and store selectively by user. This technique makes 3D structured objects be used in the various applications by the selective recording and also selective replaying.
Effective Mood Classification Method based on Music Segments
Park, Gun-Han ; Park, Sang-Yong ; Kang, Seok-Joong ;
Journal of Korea Multimedia Society, volume 10, issue 3, 2007, Pages 391~400
According to the recent advances in multimedia computing, storage and searching technology have made large volume of music contents become prevalent. Also there has been increasing needs for the study on efficient categorization and searching technique for music contents management. In this paper, a new classifying method using the local information of music content and music tone feature is proposed. While the conventional classifying algorithms are based on entire information of music content, the algorithm proposed in this paper focuses on only the specific local information, which can drastically reduce the computing time without losing classifying accuracy. In order to improve the classifying accuracy, it uses a new classification feature based on music tone. The proposed method has been implemented as a part of MuSE (Music Search/Classification Engine) which was installed on various systems including commercial PDAs and PCs.
A Scheme of Transmission of Multimedia Stream Through SCTP
Seok, Seung-Joon ;
Journal of Korea Multimedia Society, volume 10, issue 3, 2007, Pages 401~410
Multimedia streams transmitted through the Internet have a strict playback delay time. Multimedia data arriving aster the playback time cannot be played in the receiver and are discarded. Thus, this paper proposed a protocol, in which the multimedia stream server determines whether data can be played in the receiver before sending the data. The proposed model has a PSCTP sub-layer on top of existing PR-SCTP and decides whether to send data messages, which have come from the multimedia applicationserver, and which PR-SCTP stream the data will be sent to. In addition, the proposed model uses the differentiated retransmission function of PR-SCTP. We evaluated the performance of SCTP, PR-SCTP and PSCTP using NS2 simulator. According to the results of the evaluation, the PSCTP protocol decreased the volume of transmission and increased the video decodable ratio compared to other protocols.
Development of a Decompiler for Verification and Analysis of an Intermediate Code in ANSI C Compiler
Kim, Young-Keun ; Kwon, Hyeok-Ku ; Lee, Yang-Sun ;
Journal of Korea Multimedia Society, volume 10, issue 3, 2007, Pages 411~419
Mounted on mobile device, set-top box, or digital TV, EVM is a virtual machine solution that can download and execute dynamic application programs. And the SIL(Standard Intermediate Language) is intermediate language of the EVM, which has a set of opcodes for object-oriented language and a sequential language. Since the C compiler used on each platform depends on the hardware, it converts C program to objective code, and then executes. To solve this problem, our research team developed ANSI C compiler and the EVM. Our ANSI C compiler outputs the SIL code based on stack machine. This paper presents the SIL-to-C decompiler in which converts the SIL code to three address code. Thus, the decompiler allows us to verify SIL code created by ANSI C compiler, and analyze a program from C language source level.