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 9, Issue 12 - Dec 2006
Volume 9, Issue 11 - Nov 2006
Volume 9, Issue 10 - Oct 2006
Volume 9, Issue 9 - Sep 2006
Volume 9, Issue 8 - Aug 2006
Volume 9, Issue 7 - Jul 2006
Volume 9, Issue 6 - Jun 2006
Volume 9, Issue 5 - May 2006
Volume 9, Issue 4 - Apr 2006
Volume 9, Issue 3 - Mar 2006
Volume 9, Issue 2 - Feb 2006
Volume 9, Issue 1 - Jan 2006
Selecting the target year
Data Cube Generation Method Using Hash Table in Spatial Data Warehouse
Li, Yan ; Kim, Hyung-Sun ; You, Byeong-Seob ; Lee, Jae-Dong ; Bae, Hae-Young ;
Journal of Korea Multimedia Society, volume 9, issue 11, 2006, Pages 1381~1394
Generation methods of data cube have been studied for many years in data warehouse which supports decision making using stored data. There are two previous studies, one is multi-way array algorithm and the other is H-cubing algorithm which is based on the hyper-tree. The multi-way array algorithm stores all aggregation data in arrays, so if the base data is increased, the size of memory is also grow. The H-cubing algorithm which is based on the hyper-tree stores all tuples in one tree so the construction cost is increased. In this paper, we present an efficient data cube generation method based on hash table using weight mapping table and record hash table. Because the proposed method uses a hash table, the generation cost of data cube is decreased and the memory usage is also decreased. In the performance study, we shows that the proposed method provides faster search operation time and make data cube generation operate more efficiently.
Incremental Batch Update of Spatial Data Cube with Multi-dimensional Concept Hierarchies
Ok, Geun-Hyoung ; Lee, Dong-Wook ; You, Byeong-Seob ; Lee, Jae-Dong ; Bae, Hae-Young ;
Journal of Korea Multimedia Society, volume 9, issue 11, 2006, Pages 1395~1409
A spatial data warehouse has spatial data cube composed of multi-dimensional data for efficient OLAP(On-Line Analytical Processing) operations. A spatial data cube supporting concept hierarchies holds huge amount of data so that many researches have studied a incremental update method for minimum modification of a spatial data cube. The Cube, however, compressed by eliminating prefix and suffix redundancy has coalescing paths that cause update inconsistencies for some updates can affect the aggregate value of coalesced cell that has no relationship with the update. In this paper, we propose incremental batch update method of a spatial data cube. The proposed method uses duplicated nodes and extended node structure to avoid update inconsistencies. If any collision is detected during update procedure, the shared node is duplicated and the duplicate is updated. As a result, compressed spatial data cube that includes concept hierarchies can be updated incrementally with no inconsistency. In performance evaluation, we show the proposed method is more efficient than other naive update methods.
Replica Update Propagation Method for Cost Optimization of Request Forwarding in the Grid Database
Jang, Yong-Il ; Baek, Sung-Ha ; Bae, Hae-Young ;
Journal of Korea Multimedia Society, volume 9, issue 11, 2006, Pages 1410~1420
In this paper, a replica update propagation method for cost optimization of request forwarding in the Grid database is proposed,. In the Grid database, the data is replicated for performance and availability. In the case of data update, update information is forwarded to the neighbor nodes to synchronize with the others replicated data. There are two kinds of update propagation method that are the query based scheme and the log based scheme. And, only one of them is commonly used. But, because of dynamically changing environment through property of update query and processing condition, strategies that using one propagation method increases transmission cost in dynamic environment. In the proposed method, the three classes are defined from two cost models of query and log based scheme. And, cost functions and update propagation method is designed to select optimized update propagation scheme from these three classes. This paper shows a proposed method has an optimized performance through minimum transmission cost in dynamic processing environment.
Pre-aggregation Index Method Based on the Spatial Hierarchy in the Spatial Data Warehouse
Jeon, Byung-Yun ; Lee, Dong-Wook ; You, Byeong-Seob ; Kim, Gyoung-Bae ; Bae, Hae-Young ;
Journal of Korea Multimedia Society, volume 9, issue 11, 2006, Pages 1421~1434
Spatial data warehouses provide analytical information for decision supports using SOLAP (Spatial On-Line Analytical Processing) operations. Many researches have been studied to reduce analysis cost of SOLAP operations using pre-aggregation methods. These methods use the index composed of fixed size nodes for supporting the concept hierarchy. Therefore, these methods have many unused entries in sparse data area. Also, it is impossible to support the concept hierarchy in dense data area. In this paper, we propose a dynamic pre-aggregation index method based on the spatial hierarchy. The proposed method uses the level of the index for supporting the concept hierarchy. In sparse data area, if sibling nodes have a few used entries, those entries are integrated in a node and the parent entries share the node. In dense data area, if a node has many objects, the node is connected with linked list of several nodes and data is stored in linked nodes. Therefore, the proposed method saves the space of unused entries by integrating nodes. Moreover it can support the concept hierarchy because a node is not divided by linked nodes. Experimental result shows that the proposed method saves both space and aggregation search cost with the similar building cost of other methods.
Effective Face Detection Using Principle Component Analysis and Support Vector Machine
Kang, Byoung-Doo ; Kwon, Oh-Hwa ; Seong, Chi-Young ; Jeon, Jae-Deok ; Eom, Jae-Sung ; Kim, Jong-Ho ; Lee, Jae-Won ; Kim, Sang-Kyoon ;
Journal of Korea Multimedia Society, volume 9, issue 11, 2006, Pages 1435~1444
We present an effective and real-time face detection method based on Principal Component Analysis(PCA) and Support Vector Machines(SVMs). We extract simple Haar-like features from training images that consist of face and non-face images, reinterpret the features with PCA, and select useful ones from the large number of extracted features. With the selected features, we construct a face detector using an SVM appropriate for binary classification. The face detector is not affected by the size of a training data set in a significant way, so that it showed 90.1 % detection rates with a small quantity of training data. it can process 8 frames per second for
pixel images. This is an acceptable processing time for a real-time system.
An Adaptive Region-of-Interest Coding Based on EBCOT
Kang, Ki-Jun ; Lee, Bu-Kwon ; Seo, Yeong-Geon ;
Journal of Korea Multimedia Society, volume 9, issue 11, 2006, Pages 1445~1454
To compress a specific part of an image with high quality or to transfer it, JPEG2000 standard offers an ROI(Region-of-Interest) image coding method. What is important in ROI coding is to process relative importance between ROI and background and to process ROI mask. We propose an adaptive ROI coding method supplemented the existing Implicit ROI coding and Modified implicit ROI coding to improve image quality and reduce ROI mask information. The proposed method is an EBCOT-based ROI coding that extracts ROI from the compressed bitstream, and gets the ROI mask information by classifying the codeblocks into 6 patterns. The information includes the pattern type(3bit) and the width(5bit) expressing the boundary between two regions for each codeblock. As a result, the method shows an excellent compression performance in ROI region as well as in the whole region of an image.
An Adaptive Image Enhancement Algorithms Using Saturation Improvement
Jo, Young-Sim ; Yun, Jong-Ho ; Park, Jin-Sung ; Choi, Myung-Ryul ;
Journal of Korea Multimedia Society, volume 9, issue 11, 2006, Pages 1455~1464
In this paper, we propose an adaptive image enhancement algorithm. The proposed algorithm is classified with the MIE technique for intensity enhancement of input image and MSE techniques for saturation enhancement. The MIE technique is proposed to control the gamut mapping problem and a sudden change in image-brightness while Luminance signal is processing, The MSE techniques are proposed to control de-saturation or over-saturation while chrominance signal is processing. The proposed algorithm is focused on processing preference color for human vision in order to generate better image quality than the algorithms focused on processing uniformly to whole images, This algorithm can be applied to a monitor, TV and other display devices for high quality image.
Facial Expression Recognition with Instance-based Learning Based on Regional-Variation Characteristics Using Models-based Feature Extraction
Park, Mi-Ae ; Ko, Jae-Pil ;
Journal of Korea Multimedia Society, volume 9, issue 11, 2006, Pages 1465~1473
In this paper, we present an approach for facial expression recognition using Active Shape Models(ASM) and a state-based model in image sequences. Given an image frame, we use ASM to obtain the shape parameter vector of the model while we locate facial feature points. Then, we can obtain the shape parameter vector set for all the frames of an image sequence. This vector set is converted into a state vector which is one of the three states by the state-based model. In the classification step, we use the k-NN with the proposed similarity measure that is motivated on the observation that the variation-regions of an expression sequence are different from those of other expression sequences. In the experiment with the public database KCFD, we demonstrate that the proposed measure slightly outperforms the binary measure in which the recognition performance of the k-NN with the proposed measure and the existing binary measure show 89.1% and 86.2% respectively when k is 1.
Internetworking Models Between Wireless Sensor Networks and the Internet Based on IPv6
Kwon, Hoon ; Kim, Jeong-Hee ; Kwak, Ho-Young ; Do, Yang-Hoi ; Kim, Dae-Young ; Kim, Do-Hyeun ;
Journal of Korea Multimedia Society, volume 9, issue 11, 2006, Pages 1474~1482
Recently, it is advanced about the variable research of IPv6 and the wireless sensor network. However, the existed researches are not enough about the internetworking technology between the wireless sensor network and the Internet based on IPv6 for supporting ubiquitous service. Accordingly, this paper proposes two internetworking models for connecting the wireless sensor network and Internet based on IPv6. The relay router in the first model and the sink node of the wireless sensor network in the second mode] were used as a gateway. Then we analyze and compare with two internetworking models. Additionally we construct the test-bed connected between the wireless sensor network and KOREN(KOrea advanced REsearch Network) based on IPv6 using the first model. And we verified the operation of the test-bed by experiments.
Efficient Path Finding in 3D Games by Using Visibility Tests
Kim, Hyung-Il ; Jung, Dong-Min ; Um, Ky-Hyun ; Cho, Hyung-Je ; Kim, Jun-Tae ;
Journal of Korea Multimedia Society, volume 9, issue 11, 2006, Pages 1483~1495
The navigation mesh represents a terrain as a set of triangles on which characters may move around. The navigation mesh cab be generated automatically, and it is more flexible in representing 3D surface. The number of triangles to represent a terrain may vary according to the structure of the terrain. As characters are moving around on a navigation mesh, the path planning can be performed more easily by projecting the 3D surfaces into 2D space. However, when the terrain is represented with an elaborated mesh of large number of triangles to achieve more realistic movements, the path finding can be very inefficient because there are too many states(triangles) to be searched. In this paper, we propose an efficient method of path finding in 3D games where the terrain is represented by navigation meshes. Our method uses the visibility tests. When the graph-based search is applied to elaborated polygonal meshes for detailed terrain representation, the path finding can be very inefficient because there are too many states(polygons) to be searched. In our method, we reduce the search space by using visibility tests so that the search can be fast even on the detailed terrain with large number of polygons. First we find the visible vertices of the obstacles, and define the heuristic function as the distance to the goal through those vertices. By doing that, the number of states that the graph-based search visits can be substantially reduced compared to the plane search with straight-line distance heuristic.
Establishing of the Service Desk for Efficient Learning Support at the Universities
Kim, Seong-Cheol ; Park, Jo-Eun ;
Journal of Korea Multimedia Society, volume 9, issue 11, 2006, Pages 1496~1502
Researches, studies, and most administration services at the universities are currently carried out through computers. So the IT infrastructure and. the information system of the university are becoming complicated. When a user has problems in using the information system, it is very difficult to get solution for that problem even a computer center or a help desk exists. In this paper we propose a method to establish a service desk based on the ITIL(Information Technology Infrastructure Library) to support efficient learning at the universities. The proposed method in this paper can be used to establish a systematic learning support system when errors of computation happen in learning, researches, and administrative tasks at the universities.
Response Time Analysis of Web Service Systems with Mixedly Distributed Stochastic Timed Net
Yim, Jae-Geol ; Do, Jae-Su ; Shim, Kyu-Bark ;
Journal of Korea Multimedia Society, volume 9, issue 11, 2006, Pages 1503~1514
Today, consumers can access Internet from everywhere, therefore most commercial and other organizations provide their services on the Web. As the result, countless Web service systems are already on the Internet and more systems are under construction. Therefore, many researches of verifying that the system to be constructed will not have any deadlock and will run successfully without any problem at the early stage of design have been performed. Several Petri net based verification methods have also been published. However, they have focused on building Petri net models of Web service systems and none of them introduces efficient analysis methods. As a mathematical technique with which we can find the minimum duration time needed to fire all the transitions at least once and coming back to the initial marking in a timed net, the minimum cycle time method has been widely used in computer system analysis. A timed net is a modified version of a Petri net where a transition is associated with a delay time. A delay time used in a timed net is a constant even though the duration time associated with an event in the real world is a stochastic number in general. Therefore, this paper proposes 'Mixedly Distributed Stochastic Timed Net' where a transition can be associated with a stochastic number and introduce a minimum cycle time analysis method for 'Mixedly Distributed Stochastic Timed Net'. We also introduce a method of analysing a Web service system's response time with the minimum cycle time analysis method for 'Mixedly Distributed Stochastic Timed Net.'.
Key-Frame Based Real-Time Fluid Simulations
Ryu, Ji-Hyun ; Park, Sang-Hun ;
Journal of Korea Multimedia Society, volume 9, issue 11, 2006, Pages 1515~1528
Systems for physically based fluid animation have developed rapidly in the visual special effects industry and can make very high quality images. However, in the real-time application fields such as computer game, the simulation speed is more critical issue than image quality. This paper presents a real-time method for animating fluid using programmable graphics pipeline. We show that once two key-frames are given, the technique can interactively generate a sequence of images changing from the source key-frame to the target.