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 2, Issue 4 - Dec 1999
Volume 2, Issue 3 - Sep 1999
Volume 2, Issue 2 - Jun 1999
Volume 2, Issue 1 - Mar 1999
Selecting the target year
A Video Information Management System for Supporting Caption- and Content-based Searches
Journal of Korea Multimedia Society, volume 2, issue 3, 1999, Pages 231~242
Generally, either caption-based search method or content-based search methods is used to retrieve video information. However, each search method has its limitations. Caption-based search is apt to lose consistency as for user's subjects, and content-based search is hard to extract general means. To enhance efficiency and correctness as for complementing each other, we propose the Integrated Video Data Model(IVDM) which integrates the two search methods, to device the model, we analyze video data and construct the structure of video information hierarchically. IVDM supports caption-based search as assigning meta-data by analyzing thematic-unit in the higher level, and also supports content-based search as extracting feature data by analyzing the content of video data in the lower level. We design Object-Oriented database schema of news video, based-on the IVDM. And we provide 4-type of queries and query processing algorithm to retrieve news video information.
An algorithm for creating index key for MPEG videos
Journal of Korea Multimedia Society, volume 2, issue 3, 1999, Pages 243~251
In this paper, we suggest a novel method which defines index for effectively searching MPEG video data. The traditional methods are slow because they rely on pattern matching of images between extracted shots and user's querying images. Whereas, our method uses a different approach: It transforms images of extracted PFrames into codes and uses the codes for creating index keys. To be specific, we define five features of non-context description for transparency about user's querying.
Design and Implementation of the Video Data Model Based on Temporal Relationship
Journal of Korea Multimedia Society, volume 2, issue 3, 1999, Pages 252~264
The key characteristic of video data is its spatial/temporal relationships. In this paper, we propose an content based video retrieval system based on hierarchical data structure for specifying the temporal semantics of video data. In this system, video data's hierarchical structure temporal relationship, inter video object temporal relationship, and moving video object temporal relationship can be represented. We also implemented these video data's temporal relationship into an object-relational database management system using inheritance, encapsulation function overloading, etc. So more extended and richer temporal functions can be used to support a broad range of temporal queries.
Design and Implementation of Scalable VOD System on Linux
Journal of Korea Multimedia Society, volume 2, issue 3, 1999, Pages 265~276
Video on Demand (VOD) system is definitely one of main applications in upcoming multimedia era. In this research, we have designed and implemented a host-based scalable VOD system (SVOD) which is composed of low cost PC servers and runs on Linux kernel that is currently spotlighted in enterprise and research domains. Our contribution is as follows: first, the previous Ext2 file system was modified to efficiently support continuous media like MPEG stream. Second, the storage server features a host-based scalable architecture. Third, a software MPEG decoder was implemented using Microsoft's DirectShow
COM. Finally, flow control between client and server is provided to suppress overflow and underflow of client circular buffer and supports FF VCR operation. We have known that it is possible to develop a thread-based and scalable VOD system on low cost PC servers and free Linux kernel.
Implementation of a Windows NT Based Stream Server for Multimedia School Systems
Journal of Korea Multimedia Society, volume 2, issue 3, 1999, Pages 277~288
A distributed multimedia school system is developed for the multimedia classroom at high school and university. The system is designed and implemented for students to improve the learning efficiency through the personalized multimedia contents and pace of learning. The previously developed multimedia information retrieval systems have some limitations on being applied to the multimedia classroom: expensive cost per stream or poor retrieval quality inappropriate for education, unscalability of system and service, unfamiliar proprietary client environment, and difficulty for teachers to use the authoring tools and manage the authored teaching materials. The system we developed overcomes the above problems. It is so scalable as to be applicable not only to a segmented classroom but also to the world wide Internet. The stream server is one of the components of the system: stream servers clients, a service gateway system, and a authoring management system. This paper describes the design and implementation of the stream server. A single stream server can simultaneously playback the multimedia streams as many as clients at one classroom. This is achieved only by the software engine without any changes of the hardware architecture. The systematic coupling with other components gives the scalability of the system and the flexibility of services.
An Improved Fractal Color Image Decoding Based on Data Dependence and Vector Distortion Measure
Journal of Korea Multimedia Society, volume 2, issue 3, 1999, Pages 289~296
In this paper, an improved fractal color image decoding method using the data dependence parts and the vector distortion measure is proposed. The vector distortion measure exploits the correlation between different color components. The pixel in RGB color space can be considered as a 30dimensional vector with elements of RGB components. The root mean square error(rms) in RGB color for similarity measure of two blocks R and R' was used. We assume that various parameter necessary in image decoding are stored in the transform table. If the parameter is referenced in decoding image, then decoding is performed by the recursive decoding method. If the parameter is not referenced in decoding image, then the parameters recognize as the data dependence parts and store its in the memory. Non-referenced parts can be decoded only one time, because its domain informations exist in the decoded parts by the recursive decoding method. Non-referenced parts are defined the data dependence parts. Image decoding method using data dependence classifies referenced parts and non-referenced parts using information of transform table. And the proposed method can be decoded only one time for R region decoding speed than Zhang & Po's method, since it is decreased the computational numbers by execution iterated contractive transformations for the referenced range only.
Character Recognition System using Fast Preprocessing Method
Journal of Korea Multimedia Society, volume 2, issue 3, 1999, Pages 297~307
A character recognition system, where a large amount of character images arrive continuously in real time, must preprocess character images very quickly. Moreover, information loss due to image trans-formations such as geometric normalization and thinning needs to be minimized especially when character images are small and noisy. Therefore, we suggest a prompt and effective feature extraction method without transforming original images. For this, boundary pixels are defined in terms of the degree in classification, and those boundary pixels are considered selectively in extracting features. The proposed method is tested by a handwritten character recognition and a car plate number recognition. The experiments show that the proposed method is effective in recognition compared to conventional methods. And an overall reduction of execution time is achieved by completing all the required processing by a single image scan.
Color Inverse Halftoning for Color Prints Halftoned by Clustered-dot Method
Journal of Korea Multimedia Society, volume 2, issue 3, 1999, Pages 308~319
In this paper we propose a new color inverse halftoning for color prints halftoned by clustered-dot. The proposed method divide channel image into blocks and then extract moire region according to its strength. To get more natural continuous tone image in human vision, the proposed method smooths the extracted moire region in proportion to moire strength. It can also preserve the significant edges well by considering edge information of color halftone image in the process of inverse halftoning. Experimental results show that the proposed method can make more improved inverse halftoning. Experimental results show that the proposed method can make more improved inverse halftoning image than the results of previous works. It could be applied to field of multimedia application, such as digital library construction, color print image compression and multimedia authoring.
Analysis on the Regularization Parameter in Image Restoration
Journal of Korea Multimedia Society, volume 2, issue 3, 1999, Pages 320~328
The Laplacian operator is usually used as a regularization operator which may be used as any differential operator in the regularization iterative restoration. In this paper, several kinds of differential operator and 1-H operator that has been used in our lab as well, as a regularization operator, were compared with each other. In the restoration of noisy motion-blurred images, 1-H operator worked better than Laplacian operator in flat region, but in the edge the Laplacian operator operated better. For noisy gaussian-blurred image, 1-H operator worked better in the edge, while in flat region the Laplacian operator resulted better. In regularization, smoothing the noise and resorting the edges should be considered at the same time, so the regions divided into the flat, the middle, and the detailed, which were processed in separate and compared their MSE. Laplacian and 1-H operator showed to be suitable as the regularization operator, while the other differential operators appeared to be diverged as iterations proceeded.
Design of a Wireless ATM MAC Protocol for Multimedia Services
Journal of Korea Multimedia Society, volume 2, issue 3, 1999, Pages 329~338
In this paper we propose a WATM MAC protocol called DTDD/PS (Dynamic Time Division Duplex using Poll/Select scheme). The idea of the DTDD/PS protocol is based that a radio cell is considered as queueing system. The MAC controller in base station is charged in coordinating terminals for the QoS requirement from each terminal. For that reason, terminals send it's own dynamic parameter represented its status, and controller controls the access of terminals and assigns time slots dynamically using received parameters. Therefore this system can satisfy the QoS of real-time service in wireless environments. To evaluate DTDD/PS protocol simulations are executed. In 25Mbps channel capacity, the voice and data coexist traffic situation, as the total number of terminal is increased, the delay of data terminals is increased rapidly. But the case of only increasing data terminals, the number of supported voice terminals is not varying. Therefore we can expect that DTDD/PS protocol can applied to multimedia traffic effectively.
A Priority-based Feedback Control Mechanism for Scalability
Journal of Korea Multimedia Society, volume 2, issue 3, 1999, Pages 339~346
When a multicast video conference system utilizes RTP (Real Time Protocol) and RTCP (Real Time Control Protocol), the loss rate and the synchronization of transfer in RTCP affect the scalability of the system. The random delay technique introduced to resolve the problems is so simple that leads the network to meet some congestion in synchronizing feedback information when lots of people transfer the feedback information simultaneously, which reduces the scalability of system. In this paper, we propose a new feedback control algorithm that provides priority levels with the RTCP packet, which cuts down the feedback delay and increases the scalability. The criteria of providing priority Based on the decided priority level, Agent forced the session participants to provide much more RTCP packets, positively controlled, and the possible bandwidth can be measured. The simulation on this technique decreases the delay, and the feedback messages are equally distributed on a given time period.
An Efficient Syntax Rule for Selective Coding
Journal of Korea Multimedia Society, volume 2, issue 3, 1999, Pages 347~354
Image sequence is compressed and stored as the unit of frame in computer, and reconstructed with desired quality according to several applications. In some cases specific parts are more important than other parts within a frame and these important parts must be reconstructed with high quality compared with the other parts and several schemes are suggested for such application and these schemes need to separate the important parts from a given frame, and also the syntax of shape, texture, and motion information must be defined for important parts and the other parts. But syntax rule in H.261, MPEG1 or MPEG2 is not suitable for our application because the syntax rules in the existing scheme can not express shape information for separating the important regions from each frame. So we propose a new syntax rule which represents the shape, texture and motion information in the circumstances where specific important parts exist in a frame.
Design and Implementation of a Java Package for Sharing Array Data by the DSM Interface on a Cluster of Workstations
Journal of Korea Multimedia Society, volume 2, issue 3, 1999, Pages 355~365
In this paper, we present JPAS(Java Package for Array Sharing) which is a Java Package for sharing arrays of data on a cluster of workstations. It allows us to divide an array of data into several pieces, and to place each piece on a different host. JPAS uses Java RMI so that the entire array can be accessed by a location transparent interface which is similar to that of a distributed shared memory system. JPAS is portable and easy to use since it is implemented using pure Java. In order to reduce network overhead, JPAS allows programmers to use their prior knowledge of the application. Data consistency can be maintained through the value updating methods defined for all the elements of an array. We developed parallel programs which use JPAS, and tested them on a cluster of workstations. The test results show that JPAS is a parallel programming tool with reasonably good performance.