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 4, Issue 6 - Dec 2001
Volume 4, Issue 5 - Oct 2001
Volume 4, Issue 4 - Aug 2001
Volume 4, Issue 3 - Jun 2001
Volume 4, Issue 2 - Apr 2001
Volume 4, Issue 1 - Feb 2001
Selecting the target year
A Scheduling Algorithm for Continuous Media
Journal of Korea Multimedia Society, volume 4, issue 5, 2001, Pages 371~376
Since continuous media such as video and audio data are displayed within a certain time constraint, their computation and manipulation should be handled under limited condition. Traditional real-time scheduling algorithms cold be directly applicable, because they are not suitable for multimedia scheduling applications which support many clients at the same time. Rate Regulating Proportional Share Scheduling Algorithm based on the stride scheduler is a scheduling algorithm considered the time constraint of the continuous media. The stride schedulers, which are designed to general tasks, guarantee the fairness of resource allocation and predictability. The key concept of RRPSSA is a rate regulator which prevents tasks from receiving more resource than its share in a given period. But this algorithm loses fairness which is a strong point of the stride schedulers, and does not show graceful degradation of performance under overloaded situation. This paper proposes a new modified algorithm, namely Modified Proportional Share Scheduling Algorithm considering the characteristics of multimedia data such as its continuity and time dependency. Proposed scheduling algorithm shows graceful degradation of performance in overloaded situation and it reduces the scheduling violations up to 70% by maintaining the fair resource allocation. The number of context switching is 8% less than RRPSSA and the overall performance is increased.
The Design of Process-Engine for Distributed Workflow Management System based on Web
Journal of Korea Multimedia Society, volume 4, issue 5, 2001, Pages 377~389
It has a tendency to build Workflow Systems based on the web with the spread of web environment. The important function in Workflow Systems are to automatize job flow according to the predefined regulations, procedures or conditions. Hence, there needs to consider excluding passive jobs, supporting GUI and a migratory information processing for information flow. Distributed Workflow System for workflow of a distributed service system should perform transfer control and Fault-Tolerance between tasks based on process logic, and real time processing. However, the existing mail systems being used are just for transmission and it doesn't fit to automatize job flow. To solve the matter, there needs a Distributed Workflow Engine to design workflow and automatize its control. In this paper, we design a web browser with graphic interface using web mail, a browser creating a script code for a procedural performance. Also, we design a Process-engine has a Preprocessor which tolerates process scheduler for task transaction or server node's faults on distributed environment. The proposed system enhances the reliability and usability of a system reduces the cost rather than a workflow system based on database, for they execute as proxy for a server's fault or suers' absence.
Fast Warping Prediction using Bit-Pattern for Motion Estimation
Journal of Korea Multimedia Society, volume 4, issue 5, 2001, Pages 390~395
In this paper, we propose a fast warping prediction using bit-pattern for motion estimation. Because of the spatial dependency between motion vectors of neighboring node points carrying motion information, the optimization of motion search requires an iterative search. The computational load stemming from the iterative search is one of the major obstacles for practical usage of warping prediction. The motion estimation in the proposed algorithm measures whether the motion content of the area is or not, using bit-pattern. Warping prediction using the motion content of the area make the procedure of motion estimation efficient by eliminating an unnecessary searching. Experimental results show that the proposed algorithm can reduce more 75% iterative search while maintaining performances as close as the conventional warping prediction.
A Face Detection Method using Gradual Expansion of Skin Color Range
Journal of Korea Multimedia Society, volume 4, issue 5, 2001, Pages 396~405
Usually it is difficult to extract facial regions in a complex image by using only a predetermined skin color. Expecially, it is more difficult to separate them from background regions that contains the skin color. This paper proposes a face detection method by using gradual range expansion of an initial skin color. By analyzing the skin color distribution several images that are collected in the Web, the range of dense distribution is selected as the range of the initial skin color. In each expanding step, expanded regions in the image are tested whether they can be actual facial regions by using the information of the shape of general face and the location of face organs. The shape of general face is modeled as an ellipse and the aspect ratio of its bounding box is used to define the shape constraint for faces. Only the eyes and lips are used as the face organs, which can be easily detected by extracting horizontal edges in the expanded regions. through several experiments, it is confirmed that the proposed method can detect exactly not only faces having partly distorted regions by highlight but also faces neighboring similar color regions.
MMAD Computation for Fast Diamond-Search Algorithm
Journal of Korea Multimedia Society, volume 4, issue 5, 2001, Pages 406~413
Ordinary high-speed block matching algorithms have a disadvantage that they need to get MAD (Mean Absolute Distance) as many as the number of search points due to comparing the MAD between the current frame's search block and the reference frame's search block. To solve such disadvantage of high-speed block matching algorithm, the proposed high-speed DS algorithm employs a MMAD calculation method using a specific characteristic that neighboring pixels have almost same values. In this thesis, we can get rid of unnecessary MAD calculation between the search point block by the new calculation method which uses the previously calculated MAD as the current search point and by breaking from the established MAD calculation method which calculates the MAD of a new search point by each search stage. Comparing with the established high-speed block matching algorithm, this new calculation's estimated movement error was shown as similar, and th total calculation amount decreased by
Music Genre Classification using Time Delay Neural Network
Journal of Korea Multimedia Society, volume 4, issue 5, 2001, Pages 414~422
This paper proposes a classifier of music genre using time delay neural network(TDNN) fur an audio data retrieval systems. The classifier considers eight kinds of genres such as Blues, Country, Hard Core, Hard Rock, Jazz, R&B(Soul), Techno and Trash Metal. The comparative unit to classify the genres is a melody between bars. The melody pattern is extracted based un snare drum sound which represents the periodicity of rhythm effectively. The classifier is constructed with the TDNN and uses fourier transformed feature vector of the melody as input pattern. We experimented the classifier on eighty training data from ten musics for each genres and forty test data from five musics for each genres, and obtained correct classification rates of 92.5% and 60%, respectively.
Image Retrieval using Variable Block Size DCT
Journal of Korea Multimedia Society, volume 4, issue 5, 2001, Pages 423~429
In this paper, we propose the improved method for retrieving images with DC element of DCT that is used in image compression such as JPEG/MPEG. The existing method retrieves images with DC of fixed block size DCT. In this method, the increase in the block size results in faster retrieving speed, but it lessens the accuracy. The decrease in the block size improves the accuracy, however, it degrades the retrieving speed. In order to solve this problem, the proposed method utilizes the variable block size DCT. This method first determines the existence of object regions within each block, and then creates an image region table. Based on this table, it determines the size of each block, following a simple rule; decrease the block size in the object regions, and increase the block size in the background regions. The proposed method using variable block size DCT improves about 15% in terms of the accuracy. Additionally, when there rarely exist images of same pattern, it is able to retrieve faster only by comparing the image region patterns.
A Web-based Synchronous Distance Learning System Supporting the Collaborative Browsing
Journal of Korea Multimedia Society, volume 4, issue 5, 2001, Pages 430~438
In this paper, we present the design and implementation of a web-based distance learning system supporting the collaborative browsing. Our system consists of an education affair management system, a video conferencing server/client, a white-board server/client, a session manager and a web browser sharing system. Among other things, our collaborative web browser is unique and not found in any other system. The web browser shows synchronously the same web pages as the lecturer moves through them. Therefore, it allows the student to feel real-time surfing gust as the lecturer would. The session manager supports multi-user and multi-group, and integrates various synchronous collaborative component into one distance learning system by providing the same session data and information of users in a session group. Our collaborative browsing system can increase the efficiency of distance learning and provides the effect of learning in the same classroom by supporting various synchronous functionalities, such as collaborative browsing.
Dynamic Generation of SMIL based Multimedia Documents on the Web
Journal of Korea Multimedia Society, volume 4, issue 5, 2001, Pages 439~445
In this paper, we suggest a method for dynamic generation of SMIL documents by user profiles on the web. Generated multimedia documents are based on the SMIL (Synchronized Multimedia Integration Language) that are recommended by the W3C. The method generates automatically XSLT documents according to user profiles. SMIL documents are produced on real-time by integration of the XSLT documents and the XML documents that are made already. Most of conventional web-based documents are based on the HTML that is difficult to support reusability of documents are relation among multimedia abject. However, the suggested method is based on the XML, and so it supports reusability of documents and produces efficiently various SMIL-based multimedia documents. Application for the suggested method are as follows; Electronic commerce, tele-lecture, a web-based document editing, etc.
A Cyber Educational Environment on the Web using WMT
Journal of Korea Multimedia Society, volume 4, issue 5, 2001, Pages 446~454
A long-distance education method using the computational environment has been developed and implemented for quite some time. However, there has been some difficulty in the simulation of face-to-face instruction due to limitations in performance of the computers and the networks. Continued development of multimedia technologies has now made it possible to simulate face-to-face instruction, recording the teachers' instructions in the form of a screen dump. In this paper, we propose a system that allows the teacher to make loaming materials available on the Web using Window Media Technology(WMT). This technology also allows remote site users to view the contents at their convenience. A media encoder acquires the lessons and stores them as moving pictures. The lessons are displayed on the screen as the teacher explains them. The learning materials are stored in a Windows media file format, the file is stored on a lecture server and provided to the user using a streaming method in real time. The users can view the contents on the Web without requiring a special player. The proposed system consists of a lecture writer module, a lecture server module and a lecture client module.
A Proposal of Parallel Interworking Model for Broadband Access Network
Journal of Korea Multimedia Society, volume 4, issue 5, 2001, Pages 455~464
For future multimedia services, one of the most crucial issues is building an access network that can accommodate multimedia services in subscriber network. The VB5.2 interface of B-ISDN located between an access network and a service node allows dynamic allocation and release of ATM resources. The SG 13 of ITU-T is standardizing the B-BCC protocol, which is sequentially interworked with signaling protocols in the service node. To minimize a connection setup delay of the sequential interworking mode, we proposed the parallel interworking model in which the SN executes simultaneously the connection control protocol of VB5.2 interface and signaling protocol. We simulate two interworking models in terms of a connection setup delay and a completion ratio. The results of simulation show that our proposed parallel interworking model for the VB5.2 interface reduces the setup delay and has the similar completion ratio compared to the sequential interworking model. however, the connection setup delay of parallel interworking model becomes about seven tenths of that of the sequential interworking model and the improvement become larger as the arrival rate increased.
A Method for Generating Large-Interval Itemset using Locality of Data
Journal of Korea Multimedia Society, volume 4, issue 5, 2001, Pages 465~475
Recent1y, there is growing attention on the researches of inducing association rules from large volume of database. One of them is the method that can be applied to quantitative attribute data. This paper presents a new method for generating large-interval itemsets, which uses locality for partitioning the range of data. This method can minimize the loss of data-inherent characteristics by generating denser large-interval items than other methods. Performance evaluation results show that our new approach is more efficient than previously proposed techniques.