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 7, Issue 12 - Dec 2004
Volume 7, Issue 11 - Nov 2004
Volume 7, Issue 10 - Oct 2004
Volume 7, Issue 9 - Sep 2004
Volume 7, Issue 8 - Aug 2004
Volume 7, Issue 7 - Jul 2004
Volume 7, Issue 6 - Jun 2004
Volume 7, Issue 5 - May 2004
Volume 7, Issue 4 - Apr 2004
Volume 7, Issue 3 - Mar 2004
Volume 7, Issue 2 - Feb 2004
Volume 7, Issue 1 - Jan 2004
Selecting the target year
Proactive Retrieval Method Using Context Patterns in Ubiquitous Computing
Kim, Sung-Rim ; Kwon, Joon-Hee ;
Journal of Korea Multimedia Society, volume 7, issue 8, 2004, Pages 1017~1024
Ubiquitous system requires intelligent environment and system that perceives context in a proactive manner. This paper describes proactive retrieval method using context patterns in ubiquitous computing. And as the user's contexts change, new information is delivered proactively based on user's context patterns. For proactive retrieval, we extract context patterns based on sequential pattern discovery and association rule in data mining. By storing only information to be needed in near future using the context patterns, we solved the problem of speed and storage capacity of mobile devices in ubiquitous computing. We explain algorithms and an example. Several experiments are performed and the experimental results show that our method has a good information retrieval.
Adaptive Motion Estimation Algorithm UsingTemporal Continuity of Motion
Choi, Jung-Hyun ; Lee, Kyeong-Hwan ;
Journal of Korea Multimedia Society, volume 7, issue 8, 2004, Pages 1025~1034
This paper proposes an adaptive motion estimation algorithm using the temporal continuity of motion. We set up a squared global search region (GSR), which basically corresponds to the search region of FSA, and non-squared adaptive local search regions (LSRs), the positions for which are predicted by the motion vectors of the temporal neighbor blocks, are constructed in the GSR. The previous frame blocks that possibly have effects on the current block are to be the temporal neighbor blocks. Because motion estimation is only performed in the areas made by LSRs, we can estimate motion more correctly and reduce processing time. Experimental results show that the proposed method can enhance visual qualities with significant reductions of complexity by reducing search regions, when compared to the conventional methods.
Gesture Recognition and Motion Evaluation Using Appearance Information of Pose in Parametric Gesture Space
Lee, Chil-Woo ; Lee, Yong-Jae ;
Journal of Korea Multimedia Society, volume 7, issue 8, 2004, Pages 1035~1045
In this paper, we describe a method that can recognize gestures and evaluate the degree of the gestures from sequential gesture images by using Gesture Feature Space. The previous popular methods based on HMM and neural network have difficulties in recognizing the degree of gesture even though it can classify gesture into some kinds. However, our proposed method can recognize not only posture but also the degree information of the gestures, such as speed and magnitude by calculating distance among the position vectors substituting input and model images in parametric eigenspace. This method which can be applied in various applications such as intelligent interface systems and surveillance systems is a simple and robust recognition algorithm.
Image Enhancement Using Homomorphic Transformation and Multiscale Decomposition
Ahn, Sang-Ho ; Kim, Ki-Hong ; Kim, Young-Choon ; Kwon, Ki-Ryong ; Seo, Yong-Su ;
Journal of Korea Multimedia Society, volume 7, issue 8, 2004, Pages 1046~1057
An image enhancement method using both homomorphic transformation and multiscale decomposition is proposed. The original image is first transformed to homomorphic domain by taking the logarithm, is then separated to multiscales. These multiscales are combined with weighting. The combined signal is exponentially transformed back into intensity domain. In homomorphic domain, the magnitude control of low frequency component make change the dynamic range, and the magnitude control of the other frequency components contribute to enhancement of the contrast. The "
trous" algorithm, which has a simple and efficient scheme, is used for multiscale decomposition. The performance of proposed method is verified by simulation.
Implementation of Memory Copy Reduction Scheme for Multimedia Service in Embedded Linux Kernel
Kim, Jeong-Won ;
Journal of Korea Multimedia Society, volume 7, issue 8, 2004, Pages 1058~1065
Embedded system is widely used in various applications from simple monitor to a set-top box with CPU, memory and hard disk drives. Specially, embedded OS is ported in moveable or small machinery since it ordinarily transmits multimedia data. In this paper, we propose Null copy scheme on the embedded linux system for multimedia service, which can reduce memory copy overhead from user address space to kernel one, and vice versa. Since embedded system for networked multimedia service has low level computing power as well as memory, the Null copy scheme can provide more improved QoS. Our image transmission experiment results on embedded linux target board(CPU utilization an Deadline miss rates) installed a web camera have shown that the proposed scheme can increase fast response and lower CPU overhead.
Proxy Caching Scheme Based on the User Access Pattern Analysis for Series Video Data
Hong, Hyeon-Ok ; Park, Seong-Ho ; Chung, Ki-Dong ;
Journal of Korea Multimedia Society, volume 7, issue 8, 2004, Pages 1066~1077
Dramatic increase in the number of Internet users want highly qualified service of continuous media contents on the web. To solve these problems, we present two network caching schemes(PPC, PPCwP) which consider the characteristics of continuous media objects and user access pattern in this paper. While there are plenty of reasons to create rich media contents, delivering this high bandwidth contents over the internet presents problems such as server overload, network congestion and client-perceived latency. PPC scheme periodically calculates the popularity of objects based on the playback quantity and determines the optimal size of the initial fraction of a continuous media object to be cached in proportion to the calculated popularity. PPCwP scheme calculates the expected popularity using the series information and prefetches the expected initial fraction of newly created continuous media objects. Under the PPCwP scheme, the initial client-perceived latency and the data transferred from a remote server can be reduced and limited cache storage space can be utilized efficiently. Trace-driven simulation have been performed to evaluate the presented caching schemes using the log-files of iMBC. Through these simulations, PPC and PPCwP outperforms LRU and LFU in terms of BHR and DSR.
A Multicast Regrouping Method for Efficient Utilization of Bandwidth
Noh, Ju-Yi ; Ku, Myung-Mo ; Kim, Sang-Bok ;
Journal of Korea Multimedia Society, volume 7, issue 8, 2004, Pages 1078~1085
The SARLM(Source Adaptive Receiver-Driven Multi-Layered Multicast) has been proposed to address heterogeneous bandwidth constraints through layer merging and splitting. However, this method causes that receivers subscribing to the higher layer drop down to the lower layer and hence may decrease utilization of available bandwidth after layer merging. In this paper, we proposed a multicast regrouping method considering distributive status of receivers according to loss rates. The proposed method weights receivers according to loss rates. And then it groups higher layer with receivers subscribing to lower layer have extra bandwidth and lower layer with receivers subscribing to higher layer have high loss rate. Experimental results show that receivers subscribing to higher layer can receive in high transmission rate and consequently the proposed method effectively improves utilization of available bandwidth.
A Multimedia Data Prefetching Based on 2 Dimensional Block Structure
Kim, Seok-Ju ;
Journal of Korea Multimedia Society, volume 7, issue 8, 2004, Pages 1086~1096
In case of a multimedia application which deals with streaming data, in terms of cache management, cache loses its efficiency due to weak temporal locality of the data. This means that when data have been brought into cache, much of the data are supposed to be replaced without being accessed again during its service. However, there is a good chance that such multimedia data has a commanding locality in it. In this paper, to take advantage of the memory reference regularity which typically innates even in the multimedia data showing up its weak temporal locality, a method is suggested. The suggested method with the feature of dynamic regular-stride reference prefetching can identify for 2-dimensional array format(block pattern). The suggested method is named as block-reference-prediction-technique (BRPT) since it identifies a block pattern and place an address to be prefetched by the regulation of the block format. BRPT proved to be reassuring to reduce memory reference time significantly for applications having abundant block patterns although new rule has complicated the prefetching system even further.
An Efficient Dynamic Load Distribution for the Web Cluster Systems
Seo, Kyung-Ryong ;
Journal of Korea Multimedia Society, volume 7, issue 8, 2004, Pages 1097~1106
The typical web cluster architecture consists of replicated real servers and a virtual server that routes client requests among the real servers. In this paper, we proposed an efficient dynamic load distribution method with load prediction for the web cluster systems. The virtual server transmit status request message to real servers in other to get load states. However the load states dose not accurate during load distribution, thus the virtual server predict the load status of real servers and assign a request of the client to the minimum loaded real server. The proposed distribution methods works not related to partial breakdown of real servers, thus the system works with high availability. We also show that the proposed distribution method preserve scalable property and improve the throughput through a set of simulations.
A Study on DRM Model Using Electronic Cash System
Lee, Deok-Gyu ; Oh, Hyung-Geun ; Lee, Im-Yeong ;
Journal of Korea Multimedia Society, volume 7, issue 8, 2004, Pages 1107~1119
There is Electronic-cash system as important payment means in Electronic-commerce and the requirement of electronic cash is independence, transferability, divisibility etc. This is important requirement in DRM to provide contents as a same requirement to contents. Because contents itself can see that requirement of Electronic-cash can be transferred the control of to contents requirement as monetary concept. Can apply equally in reproduction and copy for contents, anonymity user's access etc, and several relations. In this paper, wish to put by value that is equal about Electronic-cash and contents, and apply concept of Electronic-cash through this and present DRM model after examine requirement of Electronic-cash and DRM's requirement. Concept used in this paper left copy use authority to use hierarchic tree structure and endowed anonymity for contents and anonymity about user for anonymous user. Finally, examines and compares and analyzes proposed existing methods.
Pushback Based Advanced Packet Marking Mechanism for Traceback
Lee, Hyung-Woo ; Choi, Chang-Won ; Kim, Tai-Woo ;
Journal of Korea Multimedia Society, volume 7, issue 8, 2004, Pages 1120~1130
Distributed Denial-of-Service(DDoS) attack prevent users from accessing services on the target network by spoofing its origin source address with a large volume of traffic. The objective of IP Traceback is to determine the real attack sources, as well as the full path taken by the attack packets. Existing IP Traceback methods can be categorized as proactive or reactive tracing. Existing proactive tracing scheme(such as packet marking and messaging) prepares information for tracing when packets are in transit. But, these scheme require additional network overhead. In this paper, we propose a "advanced Traceback" mechanism, which is based on the modified Pushback system with secure router mechanism. Proposed mechanism can detect and control DDoS traffic on router and can generate marked packet for reconstructing origin DDoS attack source, by which we can diminish network overload and enhance Traceback performance.
XML Web Services for Learning ContentsBased on a Pedagogical Design Model
Shin, Haeng-Ja ; Park, Kyung-Hwan ;
Journal of Korea Multimedia Society, volume 7, issue 8, 2004, Pages 1131~1144
In this paper, we investigate a problem with an e-learning system for e-business environments and introduce the solving method of the problem. To be more accurate, existing Web-hosted and ASP (Application Service Provider)-oriented service model is difficult to cooperate and integrate among the different kinds of systems. So we have produced sharable and reusable learning object, they have extracted a principle from pedagogical designs for units of reuse. We call LIO (Learning Item Object). This modeling makes use of a constructing for XML Web Services. So to speak, units of reuse from pedagogical designs are test tutorial, resource, case example, simulation, problem, test, discovery and discussion and then map introduction, fact, try, quiz, test, link-more, tell-more LIO learning object. These typed LIOs are stored in metadata along with the information for a content location. Each one of LIOs is designed with components and exposed in an interface for XML Web services. These services are module applications, which are used a standard SOAP (Simple Object Access Protocol) and locate any computer over Internet and publish, find and bind to services. This guarantees the interoperation and integration of the different kinds of systems. As a result, the problem of e-learning systems for e-business environments was resolved and then the power of understanding about learning objects based on pedagogical design was increased for learner and instruction designers. And organizations of education hope for particular decreased costs in constructing e-learning systems.
A Web-Based Multimedia Dictionary System Supporting Media Synchronization
Choi, Yong-Jun ; Hwang, Do-Sam ;
Journal of Korea Multimedia Society, volume 7, issue 8, 2004, Pages 1145~1161
The purpose of this research is to establish a method for the construction of a multimedia electronic dictionary system by integrating the media data available from linguistic resources on the Internet. As the result of this study, existing text-oriented electronic dictionary systems can be developed into multimedia lexical systems with greater efficiency and effectiveness. A method is proposed to integrate the media data of linguistic resources on the Internet by a web browser. In the proposed method, a web browser carries out all the work related to integration of media data, and it does not need a dedicated server system. The system constructed by our web browser environment integrates text, image, and voice sources, and also can produce moving pictures. Each media is associated with the meaning of data so that the data integration and movement may be specified in the associations. SMIL documents are generated by analyzing the meaning of each data unit and they are executed in a web browser. The proposed system can be operated without a dedicated server system. And also, the system saves storage space by sharing the each media data distributed on the Internet, and makes it easier to update data.
The Implementation of the Web Service for the Conversion of Speech-Recognition Web Page
Oh, Jee-Young ; Kim, Yoon-Joong ;
Journal of Korea Multimedia Society, volume 7, issue 8, 2004, Pages 1162~1169
This paper implemented the web service that converts general web page to the web page using the speech recognition and the web service consumer that provides speech recognition service for the web page. This system has the web service consumer, the web service provider that converts the web page and the web service provider that provides speech recognition. The web service provider that converts the web page analyzes general web page by using the regular expression and converts it to the speech-recognition web page. The speech recognizer is the web service providers that implemented in the previous study. As a result of experiment, we show that this system changes web page by analyzing tags and extracts hyperlink.
A 4-way Pipelined Processing Architecture for Three-Step Search Block Matching Algorithm
Jung, Sung-Tae ; Lee, Sang-Seol ; Nam, Kung-Moon ;
Journal of Korea Multimedia Society, volume 7, issue 8, 2004, Pages 1170~1182
A novel 4-way pipelined processing architecture is presented for three-step search block-matching motion estimation. For the 4-way pipelined processing, we have developed a method which divides the current block and search area into 4 subregions respectively and processes them concurrently. Also, we have developed memory partitioning method to access pixel data from 4 subregions concurrently without memory conflict. The architecture has been designed and simulated with C language and VHDL. Experimental results show that the proposed architecture achieves a high performance for real time motion estimation.
A Linear-Time Heuristic Algorithm for k-Way Network Partitioning
Choi, Tae-Young ;
Journal of Korea Multimedia Society, volume 7, issue 8, 2004, Pages 1183~1194
Network partitioning problem is to partition a network into multiple blocks such that the size of cutset is minimized while keeping the block sizes balanced. Among these, iterative algorithms are regarded as simple and efficient which are based on cell move of Fiduccia and Mattheyses algorithm, Sanchis algorithm, or Kernighan and Lin algorithm. All these algorithms stipulate balanced block size as a constraint that should be satisfied, which makes a cell movement be inefficient. Park and Park introduced a balancing coefficient R by which the block size balance is considered as a part of partitioning cost, not as a constraint. However, Park and Park's algorithm has a square time complexity with respect to the number of cells. In this paper, we proposed Bucket algorithm that has a linear time complexity with respect to the number of cells, while taking advantage of the balancing coefficient. Reducing time complexity is made possible by a simple observation that balancing cost does not vary so much when a cell moves. Bucket data structure is used to maintain partitioning cost efficiently. Experimental results for MCNC test sets show that cutset size of proposed algorithm is 63.33% 92.38% of that of Sanchis algorithm while our algorithm satisfies predefined balancing constraints and acceptable execution time.