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
Video Storage System based on Priority-Oriented Retrieval and Adapted Buffer Management
Journal of Korea Multimedia Society, volume 5, issue 1, 2002, Pages 1~9
Video server which stores video streams should serve more users with the requested streams rapidly, satisfying their time constraints. In this paper, we propose the storage system that does not only maintain fast responses but also increase the number of users supported, with satisfying the time constraints characteristics of the video streams. When the video streams are retrieved in storage system under multiple disks environments, it can not only maintain the rapid responses but also can save the disk bandwidth owing to the retrieval based on priority. Also, it utilizes the given buffer capacity efficiently owing to determining the stream segment size heuristically, which is adapted to the buffer capacity Consequentially, these policies can increase the number of users supported. The correctness of the proposed policies is not only analyzed theoretically but also evaluated through simulations.
Morphological Vehicle Classification Algorithm for Intelligent Transportation System
Journal of Korea Multimedia Society, volume 5, issue 1, 2002, Pages 10~17
It is necessary to induce for using mass transit instead of passenger car, which is high occupied roadway. It is necessary to develop the automated enforcement system to do manage such things. There are lots of problems to enforce the exclusive roadway. One of the biggest problem is the difficulty of vehicle classification. In this paper, morphological vehicle classification algorithm is proposed. Vehicle object is separated from background using frame difference, then the proposed unique weighted skeleton feature is extracted. The experiments show that the vehicle identification results produced by weighted skeleton feature seem to be good quality.
MBO-Tree: A Hierarchical Representation Scheme for Shapes with Natural Approximation and Effective Localization
Journal of Korea Multimedia Society, volume 5, issue 1, 2002, Pages 18~27
A hierarchical representation scheme for planar curves, MBO-tree, is proposed in this paper, which provides natural approximation and efficient localization. MBO-tree is based on the Douglas-Peucker algorithm (iterative end-point fit algorithm), but approximation errors that are stored with corresponding points in MBO-tree nodes and are used for abstraction measures are adjusted by force to eliminate unnatural approximation. The error adjusting is just making the approximation error of a node in a MBO-tree to be less than or equal to that of its parent. In point of localization, the bounding area of a curve is represented with a minimum bounding octangle (MBO), which can enclose the curve more compactly compared with those of other hierarchical schemes, such as the strip tree, the arc tree and the HAL tree. The MBO satisfies the hierarchical inclusion property that is useful for hierarchical geometrical operations, such as the point-inclusion test and the polygon intersection test. Through several experiments, we found that the proposed scheme was able to approximate more naturally and to localize more effectively.
The Methods for Improvement of MPEG Picture Quality using the Characteristics of Pixels in Block and Inter-Block Correlations
Kyeong Hwan Lee ;
Journal of Korea Multimedia Society, volume 5, issue 1, 2002, Pages 28~37
In this paper, we propose new methods used in MPEG codec that can improve the picture quality degradations of the reconstructed images, such as blocking artifacts, without additional computations. At first, a new 2-step MAD motion search is presented in the motion search and compensation course to reduce the computations and the errors of block boundary pixels. And we also present an overlapped 2-step MAD motion search that use the pixels beyond the block boundary using the reduced computations. In DCT/quantization course for intra-blocks, 1-D DCT predictive quantization and pixel difference predictive quantization, those use the adjacent pixel sets of the Previously reconstructed blocks and improve the inter-block continuity, are presented. As simulation results, proposed methods shows better picture qualities by reducing blocking artifacts than that of the conventional MPEG.
The Design and Implementation of the Adaptive Contrast Controller System
Journal of Korea Multimedia Society, volume 5, issue 1, 2002, Pages 38~46
In this paper, we present an adaptive contrast controller for improving the Quality of motion-picture in the video signals on the display. Using a median of image signals, we can improve the contrast according to the middle brightness, adaptively. In addition, the proposed method is useful for real-time image processing and can be composed of simpler hardware structure than other conventional methods because it does not require field and frame memory for computed data. The proposed method can be applied for video signals as well as the still image, while existing methods are confined to only the static image Also, we designed the algorithm through the VHDL, and implemented it through the FPGA. From the testing results, we see that the proposed method can effectively improve the image contrast.
Hybrid Buffer Replacement Scheme Considering Reference Pattern in Multimedia Storage Systems
Journal of Korea Multimedia Society, volume 5, issue 1, 2002, Pages 47~56
Previous buffer cache schemes for multimedia storage systems only exploited the sequential references of multimedia files and didn't consider looping references. However, in some video applications like foreign language learning, users mark the scene as loop area and then application automatically playbacks the scene several times. In this paper, we propose a new buffer replacement scheme, called HBM(Hybrid Buffer Management), for multimedia storage systems that have both sequential and looping references. Proposed scheme assumes that application layer informs reference pattern of files to file system. Then HBM applies an appropriate replacement policy to each file. Our simulation experiments show that HBM outperforms previous buffer cache schemes such as DISTANCE and LRU.
Design of a Web Based Adaptive Hypermedia System for Education
Journal of Korea Multimedia Society, volume 5, issue 1, 2002, Pages 59~67
In this paper, I discuss the problems of developing web based adaptive hypermedia for education using extensible Markup Language(XML). Adaptive hypermedia systems are capable of altering the Presentation of the contents of the hypermedia on the basis of a dynamic understanding of the individual student. The student profile is contained in a student model, while the knowledge about the domain can be represented in the form of a concept based domain model. Accordingly, I define two different markup languages using XML. The one structures the domain model and the another describes the student model. These language can be easily extended and authored, with the result of obtaining a simple methodology for data structuring in the field of web based educational adaptive hypermedia.
A Study on the Performance of Multicast Transmission Protocol using FEC Method and Local Recovery Method based on Receiver in Mobile Host
Journal of Korea Multimedia Society, volume 5, issue 1, 2002, Pages 68~76
Multicast in mobile host has the problem of hast mobility, multicast decision, triangle routing, tunnel convergence, implosion of retransmission, and bandwidth waste. In particular, the bandwidth waste in radio is a definite factor that decreases transmission rate. To solve the problems, this paper proposes a new multicast transmission protocol called FIM(Forward Error Correction Integrated Multicast), which supports reliable packet recovery mechanism by integrating If Mobility Support for the host mobility, IGMP(Interned Group Management Protocol) for the group management, and DVMRP(Distance Vector Multicast Routing Protocol) for the multicast routing, and it also uses FEC and the local recovery method based on receiver. The performance measurement is performed by dividing the losses into the homogeneous independent loss, the heterogeneous independent loss, and the shared source link loss model.. The result shows that the performances improves in proportion to the size of local areal group when the size of transmission group exceeds designated size. This indicates FIM is effective in the environment where there are much of data and many receivers in the mobile host.
An Implementation of a Component Repository based on J2EE Application Model
Journal of Korea Multimedia Society, volume 5, issue 1, 2002, Pages 77~93
Now we are following component-based software development as a solution to improve the reusability, reliability, and extensibility of the software. To support these, the developed components must be reused through component repository at software development. However, traditional centralized repositories couldn't activate component markets since not only the number of users were restricted but also most of the provided components were those on clients like user interface and so on. Recently, a lot of server-side components, reused in a specific domain, have appeared thanks to the development of both Internet technology and component technology such as EJB, DCOM, etc. Therefore, component repositories, based on domain information, classify and provide components and must offer web-based service for many users to use it stably. This study introduces the implementation of a component repository based on J2EE application model. It provides application developers with the service to search and extract appropriate components, and supplies them reliable services in web environment.
Texture Mapping using Multiperiodic Function on the Smooth Genus N Object
Hwa Jin Park ;
Journal of Korea Multimedia Society, volume 5, issue 1, 2002, Pages 94~104
This paper presents a new way of texture mapping on the Genus N object constructed over a single domain. The problem of 2D texture mapping is the discontinuity of texture domain at the virtual boundary on the object. Such phenomenon decreases smoothness of the object as well as looks unnatural. Especially it is necessary for the Genus N object of infinite coninuity to apply the seamless texture mapping. For seamless texture mapping, a multiperiodic function, which transforms a discontinuous function into a continuous function, is suggested. In some applications, however, the visual seams on the textured object provide more realistic appearance. Therefore, this research supports the interactive control from the discontinuity and the continuity across the boundary using the coefficient of the weight function.
The Levelized Schema Extraction in XML Documents
Journal of Korea Multimedia Society, volume 5, issue 1, 2002, Pages 105~113
XML documents, which are becoming new standard for expressing and exchanging data in the Internet, don't have defined schema. It is not adequate to directly apply XML documents to the existing SQL or OQL. Research on how to extract schema for XML documents and query language is going on actively. Fer users' query, the results could be too many or too less. It is important to give the users adequate results. This paper suggests the way to extract many levelized schema according to the frequency of element occurrence in XML documents. The Schema can be reduced or extended to correspond to the users'query more flexibly.
Representation Method of Track Topologies using Railway Graph
Journal of Korea Multimedia Society, volume 5, issue 1, 2002, Pages 114~119
Realtime assignment of railways is an important component in the railway control systems. To solve this problem, we must exactly represent the track topology. Graph is a proper data structure for representing general network topologies, but not Proper for track topologies. In this paper, we define a new data structure, railway graph, which can exactly represent topologies of railway networks. And we describe a path search algorithm in the defined railway graph, and a top-down approach for designing railway network by the Proposed graph.
A New Method for Efficiently Generating of Frequent Items by IRG in Data Mining
Journal of Korea Multimedia Society, volume 5, issue 1, 2002, Pages 120~127
The common problems found in the data mining methods current in use have following problems. First: It is ineffective in searching for frequent items due to changing of minimal support values. Second: It is not adaptable to occurring of unuseful relation rules. Third: It is very difficult to re-use preceding results while adding new transactions. In this paper, we introduce a new method named as SPM-IRG(Selective Patters Mining using item Relation Graph), that is designed to solve above listed problems. SPM-IRG method creates a frequent items using minimal support values obtained by investigating direct or indirect relation of all items in transaction. Moreover, the new method can minimize inefficiency of existing method by constructing frequent items using only the items that we are interested.