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 5, Issue 6 - Dec 2002
Volume 5, Issue 5 - Oct 2002
Volume 5, Issue 4 - Aug 2002
Volume 5, Issue 3 - Jun 2002
Volume 5, Issue 2 - Apr 2002
Volume 5, Issue 1 - Feb 2002
Selecting the target year
An Implementation of H.283 Remote Device Control in H.323
Journal of Korea Multimedia Society, volume 5, issue 3, 2002, Pages 239~248
International Standard Organizations such as ITU(International Telecommunication Union) and IETF (Internet Engineering Task Force) are proceeding standardization for various applications and protocols to provide video-conference and multimedia conference services on a variety of networks. Remote device control among these protocols is provided with various capabilities as well as device control to multimedia conference. This protocol for remote device control is standardizing as H.282 recommendation which is specified as core service for the configuration and control of remote device to multimedia conference. The H.282 recommendation does not specify the use of a particular transport protocol. That is, T.120 multimedia conference uses T.136 and H.323 video conference uses H.283 for the transport of H.282 protocol. The introduced system in this paper is based on H.282 and is implemented to be capable of remote device control within the framework of H.323 using H.283. Also, it is shown that a variety of services in the specification of the standard are satisfied through experiments.
A Buffer-constrained Adaptive Quantization Algorithm for Image Compression
Journal of Korea Multimedia Society, volume 5, issue 3, 2002, Pages 249~254
We consider a buffer-constrained adaptive quantization algorithm for image compression. Buffer control algorithm was considered with source coding scheme by some researchers and recently a formal description of the algorithm in terms of rate-distortion has been developed. We propose a buffer control algorithm that incorporates the buffer occupancy into the Lagrange multiplier form in a rate-distortion cost measure. Although the proposed algorithm provides the suboptimal performance as opposed to the optimal Vieterbi algorithm, it can be implemented with very low computaional complexity. In addition stability of this buffer control algorithm has been mentioned briefly using Liapnov stability theory.
An Efficient Shape-Feature Computing Method from Boundary Sequences of Arbitrary Shapes
Journal of Korea Multimedia Society, volume 5, issue 3, 2002, Pages 255~262
A boundary sequence can be a good representation of arbitrary shapes, because it can represent them simply and precisely. However, boundary sequences have not been used as a representation of arbitrary shapes, because the pixel-based shape-features such as area, centroid, orientation, projection and so forth, could not be computed directly from them. In this paper, we show that the shape-features can be easily computed from the boundary sequences by introducing the cross-sections that are defined as vertical (or horizontal) line segments in a shape. A cross-section generation method is proposed, which generates cross-sections of the shape efficiently by tracing the boundary sequence of the shape once. Furthermore, a boundary sequence extraction method is also proposed, which generates a boundary sequence for each shape in a binary image automatically The proposed methods work well even if a shape has holes. Eventually, we show that a boundary sequence can be used effectively for representing arbitrary shapes.
An Adaptive Smoothing for Moire Region using Analysis of Halftone Patterns Interference in Color Inverse Halftoning
Journal of Korea Multimedia Society, volume 5, issue 3, 2002, Pages 263~271
In this paper, we propose a new smoothing method for removing moire patterns using analysis of halftone patterns interference. The proposed method can determine a strength of moire patterns by using gray values of pixels and the size of smoothing mask for moire region is adjusted adaptively according to the strength of moire patterns. Therefore it can remove moire patterns effectively and preserve meaningful high frequencies well, such as edges and textures. The proposed method only refer to predefined lookup table to determine the strength of moire patterns, so it is more efficient than a previous work based on FFT of subblock. It could be applied to field of various multimedia applications that deal with color prints.
Moving Object Extraction and Distance Measurement in Stereo Vision System
Journal of Korea Multimedia Society, volume 5, issue 3, 2002, Pages 272~280
In this paper, we present a method to extract a moving object and to measure the distance to it by using the stereo vision system. The moving factor is to be extracted through a match of a pixel unit for the moving object where the adaptive threshold is effectively dealt with to remove changes in the brightness of the image. The distance to moving object is measured by using a stereo vision system which employs a parallel camera. The experimental results show that the proposed algorithm could be effectively applied to distance measurement to moving object because it has an average error of one percent.
A Study on Association-Rules for Recurrent Items Mining of Multimedia Data
Journal of Korea Multimedia Society, volume 5, issue 3, 2002, Pages 281~289
Few studies have been systematically pursued on a multimedia data mining in despite of the over-whelming amounts of multimedia data by the development of computer capacity, storage technology and Internet. Based on the preliminary image processing and content-based image retrieval technology, this paper presents the methods for discovering association rules from recurrent items with spatial relationships in huge data repositories. Furthermore, multimedia mining algorithm is proposed to find implicit association rules among objects of which content-based descriptors such as color, texture, shape and etc. are recurrent and of which descriptors have spatial relationships. The algorithm with recurrent items in images shows high efficiency to find set of frequent items as compared to the Apriori algorithm. The multimedia association-rules algorithm is specially effective when the collection of images is homogeneous and it can be applied to many multimedia-related application fields.
A Course Scheduling Multi-module System based on Web using Algorithm for Analysis of Weakness
Journal of Korea Multimedia Society, volume 5, issue 3, 2002, Pages 290~297
The appearance of web technology has accelerated the role of the application of multimedia technology, computer communication technology and multimedia application contents. Recently WBI model which is based on web has been proposed in the part of the new activity model of teaching-teaming. How to learn and evaluate is required to consider individual learner's learning level. And it is recognized that the needs of the efficient and automated education agents in the web-based instruction is increased But many education systems that had been studied recently did not service fluently the courses which learners had been wanting and could not provide the way for the learners to study the learning weakness which is observed in the continuous feedback of the course. In this paper we propose design of multi-module system for course scheduling of learner-oriented using weakness analysis algorithm. First proposed system monitors learner's behaviors constantly, evaluates them, and calculates his accomplishment and weakness. From this weakness the multi-agent prepares the learner a suitable course environment to strengthen his weakness. Then the learner achieves an active and complete teaming from the repeated and suitable course.
The Trustable Billing System for Mobile Internet
Journal of Korea Multimedia Society, volume 5, issue 3, 2002, Pages 298~306
As the mobile communication related services are becoming popular, the payment issues on charging for the content services are getting more and more attention. Many contents providers are having difficulties for correctly charging services they provide, because they do not have appropriate payment systems yet. There are also the privacy protection issues, security problems that arise during transactions, and the authentication issues for both the user and the business, to be taken care of. In this paper, the billing system in the mobile internet environment will be discussed. Topics related to the key distribution for exchanging data, and the authentication mechanism for communications will be discussed. Based on this, a trustworthy billing system will be proposed.
Design and Implementation of a Large-Scale Mail Server using Source IP Address Forwarding
Journal of Korea Multimedia Society, volume 5, issue 3, 2002, Pages 307~315
As growing the population of the Internet, e-mail should provide various types of media, and the size of e-mail including multimedia data becomes larger and larger Furthermore, the multimedia e-mail has been used through various communication terminals including mobile devices. The main objectives of this thesis is designing and Implementing efficient mail server which should provide high performance and scalability in terms of storage capacity and the number of mail users. This thesis proposes a cluster-based mail server architecture which has a load-balance node using. If address forwarding for distributing incoming mail messages into distributed mail server nodes.
A Bitmap-based Continuous Block Allocation Scheme for Realtime Retrieval Service
Journal of Korea Multimedia Society, volume 5, issue 3, 2002, Pages 316~322
In this paper we consider continuous block allocation scheme of UNIX file system to support real time retrieval service. The proposed block allocation scheme is designed to place real time data at appropriate disk block location in considering the consume-rate that is given with real time data. To effectively determine the disk block location we analyze the relationship between consume-rate and the two variable factors that are the number of continuous blocks and the cylinder distance of logically consecutive data. In traditional UNIX block allocation scheme it is in fact impossible to find continuous free disk blocks in a specific cylinder location. Thus we propose new bitmap-based free block allocation scheme that enables to determine whether a block in specific cylinder location is free state, or not.
A Study on the Expanded R/R Scheduling in Priority-based
Journal of Korea Multimedia Society, volume 5, issue 3, 2002, Pages 323~330
Recently, the existing embedded real-time operating systems(RTOSs) are being developed in terms of various modified versions in every application fields. Major characteristics and difference of these OSs lie in their distinct development of mechanisms which can be used in various environment and task-scheduling function which can control time-limited contingencies. In this paper, we design and implement round/robin scheduling algorithm based on time-sharing with equal-priority for multiple tasks which are provided preemptive and priority task allocation function in
version 2.03. We propose the most important event-ready list structure in
; kernel, and provide the running result for multiple tasks with equal priority for the proposed structure.
Dynamic Slicing using Dynamic System Dependence Graph
Journal of Korea Multimedia Society, volume 5, issue 3, 2002, Pages 331~341
Traditional slicing techniques make slices through dependence graph and improve the accuracy of slices. However, traditional slicing techniques require many vertices and edges in order to express a data communication link because they are based on static slicing techniques. Therefore the graph becomes very complicated. We propose the representation of a dynamic system dependence graph so as to process the slicing of a software system that is composed of related programs in order to process certain jobs. We also propose programs on efficient slicing algorithm using relations of relative tables in order to compute dynamic slices of a software system. Using a marking table from results of the proposed algorithm can make dynamic system dependence graph for dynamic slice generation. Tracing this graph can generate final slices. We have illustrated our example with C program environment. Consequently, the efficiency of the proposed dynamic system dependence graph technique is also compared with the dependence graph techniques discussed previously. As the results, this is certifying that the dynamic system dependence graph is more efficient in comparison with system dependence graph.
Design and Implementation of Intermediate Code Translator for Native Code Generation from Bytecode
Journal of Korea Multimedia Society, volume 5, issue 3, 2002, Pages 342~350
The execution speed is not an important factor for Java programming language when implementing small size application program which is executed on the web browser, but it becomes a serious limitation when the huge-size programs are implemented. To overcome this problem, the various research is conducted for translating the Bytecode into the target code which can be implemented in the specific processor by using classical compiling methods. In this research, we have designed and realized an intermediate code translator for the native code generation system with which we can directly generate i386 code from Bytecode to improve the execution speed of Java application programs. The intermediate code translator generates the register-based intermediate code from *.class files which are the intermediate code of Java.