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 13, Issue 12 - Dec 2010
Volume 13, Issue 11 - Nov 2010
Volume 13, Issue 10 - Oct 2010
Volume 13, Issue 9 - Sep 2010
Volume 13, Issue 8 - Aug 2010
Volume 13, Issue 7 - Jul 2010
Volume 13, Issue 6 - Jun 2010
Volume 13, Issue 5 - May 2010
Volume 13, Issue 4 - Apr 2010
Volume 13, Issue 3 - Mar 2010
Volume 13, Issue 2 - Feb 2010
Volume 13, Issue 1 - Jan 2010
Selecting the target year
Automatic Ontology Generation from Natural Language Sentences Using Predicate Ontology
Min, Young-Kun ; Lee, Bog-Ju ;
Journal of Korea Multimedia Society, volume 13, issue 9, 2010, Pages 1263~1271
Ontologies, the important implementation tools for semantic web, are widely used in various areas such as search, reasoning, and knowledge representation. Developing well-defined ontologies, however, requires a lot of resources in terms of time and materials. There have been efforts to construct ontologies automatically to overcome these problems. In this paper, ontologies are automatically constructed from the natural languages sentences directly. To do this, the analysis of morphemes and a sentence structure is performed at first. then, the program finds predicates inside the sentence and the predicates are transformed to the corresponding ontology predicates. For matching the corresponding ontology predicate from a predicate in the sentence, we develop the "predicate ontology". An experimental comparison between human ontology engineer and the program shows that the proposed system outperforms the human engineer in an accuracy.
A Flash Memory Swap System for Mobile Computers
Jeon, Seon-Su ; Ryu, Yeon-Seung ;
Journal of Korea Multimedia Society, volume 13, issue 9, 2010, Pages 1272~1284
As the mobile computers are becoming powerful and are used like general-purpose computers, operating systems for mobile computers also require swap system functionality that utilizes main memory efficiently. Flash memory is widely used as storage device for mobile computers but current linux swap system does not consider flash memory. Swap system is tightly related with process execution since it stores the contents of process in execution. By taking advantage of this characteristics, in this paper, we study a new linux swap system called PASS(Process-Aware Swap System), which allocates the different flash memory blocks to each process. Trace-driven experimental results show that PASS outperforms existing linux swap system with existing garbage collection schemes in terms of garbage collection cost.
A Task Group-based Real-Time Scheduling Technique m the Non-Preemptive TinyOS
Son, Chi-Won ; Tak, Sung-Woo ;
Journal of Korea Multimedia Society, volume 13, issue 9, 2010, Pages 1285~1298
Since the TinyOS incorporating a non-preemptive task scheduling policy uses a FIFO (First-In First-Out) queue, a task with the highest priority cannot preempt a task with lower priority before the task with lower priority must run to completion. Therefore, the non-preemptive TinyOS cannot guarantee the completion of real-time user tasks within their deadlines. Additionally, the non-preemptive TinyOS needs to meet the deadlines of user tasks as well as those of TinyOS platform tasks called by user tasks in order to guarantee the deadlines of the real-time services requested by user tasks. In this paper, we present a group-based real-time scheduling technique that makes it possible to guarantee the deadlines of real-time user tasks in the TinyOS incorporating a non-preemptive task scheduling policy. The proposed technique groups together a given user task and TinyOS platform tasks called and activated by the user task, and then schedule them as a virtual big task. A case study shows that the proposed technique yields efficient performance in terms of guaranteeing the completion of user tasks within their deadlines and aiming to provide them with good average response time, while maintaining the compatibility of the existing non-preemptive TinyOS platform.
Abstracted Partitioned-Layer Index: A Top-k Query Processing Method Reducing the Number of Random Accesses of the Partitioned-Layer Index
Heo, Jun-Seok ;
Journal of Korea Multimedia Society, volume 13, issue 9, 2010, Pages 1299~1313
Top-k queries return k objects that users most want in the database. The Partitioned-Layer Index (simply, the PL -index) is a representative method for processing the top-k queries efficiently. The PL-index partitions the database into a number of smaller databases, and then, for each partitioned database, constructs a list of sublayers over the partitioned database. Here, the
sublayer in the partitioned database has the objects that can be the top-i object in the partitioned one. To retrieve top k results, the PL-index merges the sublayer lists depending on the user's query. The PL-index has the advantage of reading a very small number of objects from the database when processing the queries. However, since many random accesses occur in merging the sublayer lists, query performance of the PL-index is not good in environments like disk-based databases. In this paper, we propose the Abstracted Partitioned-Layer Index (simply, the APL-index) that significantly improves the query performance of the PL-index in disk-based environments by reducing the number of random accesses. First, by abstracting each sublayer of the PL -index into a virtual (point) object, we transform the lists of sublayers into those of virtual objects (ie., the APL-index). Then, we virtually process the given query by using the APL-index and, accordingly, predict sublayers that are to be read when actually processing the query. Next, we read the sublayers predicted from each sublayer list at a time. Accordingly, we reduce the number of random accesses that occur in the PL-index. Experimental results using synthetic and real data sets show that our APL-index proposed can significantly reduce the number of random accesses occurring in the PL-index.
Vehicle Detection based on the Haar-like feature and Image Segmentation
Choi, Mi-Soon ; Lee, Jeong-Hwan ; Suk, Jung-Hee ; Roh, Tae-Moon ; Shim, Jae-Chang ;
Journal of Korea Multimedia Society, volume 13, issue 9, 2010, Pages 1314~1321
In this paper, we study about the vehicle detection algorithm which is in the process of travelling from the road. An input image is segmented by means of split and merge algorithm. And two largest segmented regions are removed for reducing search region and speed up processing time. In order to detect the back side of the front vehicle considers a vertical/horizontal component, uses an integral image with to apply Haar-like methods which are the possibility of shortening a calculation time, classified with SVM. The simulation result of the method which is proposed appeared highly.
A Study on Embedded DSP Implementation of Keyword-Spotting System using Call-Command
Song, Ki-Chang ; Kang, Chul-Ho ;
Journal of Korea Multimedia Society, volume 13, issue 9, 2010, Pages 1322~1328
Recently, keyword spotting system is greatly in the limelight as UI(User Interface) technology of ubiquitous home network system. Keyword spotting system is vulnerable to non-stationary noises such as TV, radio, dialogue. Especially, speech recognition rate goes down drastically under the embedded DSP(Digital Signal Processor) environments because it is relatively low in the computational capability to process input speech in real-time. In this paper, we propose a new keyword spotting system using the call-command method, which is consisted of small number of recognition networks. We select the call-command such as 'narae', 'home manager' and compose the small network as a token which is consisted of silence with the noise and call commands to carry the real-time recognition continuously for input speeches.
Noise Reduction Method for Image Using Transition-Parameter of Cellular Automata
Kim, Tai-Suk ; Lee, Seok-Ki ; Kwon, Soon-Kak ; Kwon, Oh-Jun ;
Journal of Korea Multimedia Society, volume 13, issue 9, 2010, Pages 1329~1336
Cellular Automata is a discrete dynamical system which natural phenomena may be specified completely in terms of local relation, can increase and decrease the difference of luminance locally according to transition rule by keeping the characteristic of target image. In this paper, we propose a noise reduction method by keeping the characteristic using transition rule of Cellular Automata, also we propose methods of effective transition rule, the selection of parameters, the selection of number of neighborhood pixels. For uniform distribution noise, Gaussian noise, impulse noise, we do an experiment on adaptive state using different mathematical operations and compare its results. It was confirmed that the proposed transition rule is based on fast convergence speed and has stabile results.
Contactless Fingerprint Recognition Based on LDP
Kang, Byung-Jun ; Park, Kang-Ryoung ; Yoo, Jang-Hee ; Moon, Ki-Young ; Kim, Jeong-Nyeo ; Shin, Jae-Ho ;
Journal of Korea Multimedia Society, volume 13, issue 9, 2010, Pages 1337~1347
Fingerprint recognition is a biometric technology to identify individual by using fingerprint features such ridges and valleys. Most fingerprint systems perform the recognition based on minutiae points after acquiring a fingerprint image from contact type sensor. They have an advantage of acquiring a clear image of uniform size by touching finger on the sensor. However, they have the problems of the image quality can be reduced in case of severely dry or wet finger due to the variations of touching pressure and latent fingerprint on the sensor. To solve these problems, the contactless capturing devices for a fingerprint image was introduced in previous works. However, the accuracy of detecting minutiae points and recognition performance are reduced due to the degradation of image quality by the illumination variation. So, this paper proposes a new LDP-based fingerprint recognition method. It can effectively extract fingerprint patterns of iterative ridges and valleys. After producing histograms of the binary codes which are extracted by the LDP method, chi square distance between the enrolled and input feature histograms is calculated. The calculated chi square distance is used as the score of fingerprint recognition. As the experimental results, the EER of the proposed approach is reduced by 0.521% in comparison with that of the previous LBP-based fingerprint recognition approach.
A Method of Upper-Lower Clothes Automatic Matching Using Attribute-values Matrix
Kim, Jung-In ;
Journal of Korea Multimedia Society, volume 13, issue 9, 2010, Pages 1348~1356
With the advancement of information and communication technology, the market of Internet-based fashion/coordination shopping malls have been considerably increasing year by year. As the number of these Internet shopping malls increases, the operators of the malls tend to decorate the first page of their websites with a variety of events and samples of the best-fit upper-lower clothing pairs. They try to provide visitors of their web sites with products that can induce fresh impression by modifying the first page on a daily or a few days basis. If pairs of best-fit upper-lower clothes for various products available in online shopping malls can be calculated and marked, it would help not only to make the first page of the malls more appealing but also to enable users to purchase linked products in a more convenient way, replacing the recommendations usually made by offline clerks. In the paper, we present the results of designing and implementing an upper-lower clothes matching system in which expert coordinators register matching-value of upper and lower clothes in the form of attribute-value matrix.
An Efficient Channel Navigation Scheme based on Patterns of Watching TV Programs
Park, Woo-Ram ; Park, Tae-Keun ;
Journal of Korea Multimedia Society, volume 13, issue 9, 2010, Pages 1357~1364
With the emergence of digital TV broadcasting, various TV channels are provided to a TV audience. But it is getting hard for the audience to find his or her preferred TV programs due to the huge number of TV channels. In order to mitigate the difficulty, channel navigation schemes have been proposed. The schemes predict preferred TV channel from viewer's previous watching histories, and provide the predicted channels when the viewer wants to change TV channel. As channel navigation schemes, there are Most Recently Selected (MRS) scheme providing the most recently watched channel, and Most Frequently Selected (MFS) scheme providing the most frequently selected channel. However, MFS and MRS scheme could be inappropriate to current TV system broadcasting various TV programs in a channel because they are based on the viewer's patterns of watching TV channels. Therefore, this paper proposes an efficient channel navigation scheme, Program Most Frequently Selected (PMFS), based on patterns of watching TV programs instead of TV channels. Simulation results show that the proposed scheme PMFS reduces the seek distance compared to the previous channel navigation schemes, MFS and MRS.
Visual Rhythm of Thriller Movies's Opening Title - Focusing on Identity
Shin, Seung-Yun ; Sung, Bong-Sun ; Kim, Jae-Ho ;
Journal of Korea Multimedia Society, volume 13, issue 9, 2010, Pages 1365~1372
Information of video can be percieved as the form of visual rhythm through temporal ordering systems. The shot, the base unit of video analysis, affects audience psychologicaliy with various temporal combination. Here, psychological stress and density of the story can be adjusted by the point of view shot of character. Acordingly the correlation analysis of shot duration and point of view shot can be useful for visual rhythm research. Identity one of the thriller genre works was selected for analyzing. This works produced by Kyle Cooper, a famous person in the opening sequence field. This works produced by Kyle Cooper, a famous person in the opening sequence field.
3D Flight Path Creation using Sketch Input and Linear Spline Curves
Choi, Jung-Il ; Park, Tae-Jin ; Sohn, Ei-Sung ; Jeon, Jae-Woong ; Choy, Yoon-Chul ;
Journal of Korea Multimedia Society, volume 13, issue 9, 2010, Pages 1373~1381
Current flight maneuver diagram used by pilots is based on 2D spatial presentation, so it has limitation on display 3D flight information and hard to understand it instinctively. Flight animation authoring tools for this diagram are complex to use and lack useful features like non-linear editing of flight path and real-time interactivity on multiple aircrafts. This research focuses on 3D flight path generation method in the animation system for flight maneuver education. This research combines initial sketch input on 2D diagram with the thrust of an aircraft to generate 3D linear spline as close as to real flight. Using suggested linear spline creation method, the flight path can be visualized, edited, and animated in real-time at the flight maneuver briefing and debriefing.
An Improved Dynamics Model for Stone Skipping Simulation
Lee, Nam-Kyung ; Baek, Nak-Hoon ;
Journal of Korea Multimedia Society, volume 13, issue 9, 2010, Pages 1382~1390
We can see interactions between rigid body and fluid every day, anywhere. This kind of rigid body-fluid simulation is one of the most difficult problems in physically-based modeling, mainly due to heavy computations. In this paper, we present a real-time dynamics model for simulating stone skipping, which is a popular rigid body-fluid interaction in the real world. In comparison to the previous works, our improved dynamics model supports the rotation of the stones and also computes frictional forces with respect to the air. We can simulate a realistic result for various user input by using proposed model. Additionally, we present a water surface model to show more realistic ripples interactively. Our methods can be easily adapted to other interactive dynamics systems including 3D game engines.
A Study on the Efficient Improvement of the Animatics for Animation Production in Education
Hong, Il-Yang ;
Journal of Korea Multimedia Society, volume 13, issue 9, 2010, Pages 1391~1398
Animation is breathing life into drawings through motion. Animation is formed by the afterimage phenomenon, that is, deviation of sequential pictures in every frame makes a person possibly perceive it as a live video. Consequently, animation is mostly produced using traditional frame-by-frame methods. The study of relations on timing has been a major concern of animation theory. Nevertheless, issues of timing on production outcomes and effectiveness are mostly ignored. Special focus, analysis and leadership studies on timing are addressed on animatics. Creating better timing through animatics, that is writing movies, directing, scheduling and amending storyboard in pre-production stage, eventually shorten time to animation production. This research is centered on animatics as a cutting edge educational courses. This course will introduce students to the animation production skill and instructors to in-depth teaching points. One of the concepts that we want to go for is keeping animatics apart from mere storyboard. In conjunction with the animation theory, this research conducted under the focus of production of animatics will lead to more efficient way of education on animatics.
Roles of Socio-cultural Dimensions on Metropolitan Teenagers' Mobile Phone Purchases and Mobile Content Uses
Jun, Jong-Woo ; Jung, Jai-Jin ; Jung, Soo-Joo ;
Journal of Korea Multimedia Society, volume 13, issue 9, 2010, Pages 1399~1411
Mobile media have become independent media formats in a current media environment. This study explores mobile media uses of metropolitan Korean teenagers focusing on demographic elements and socio-cultural dimensions. The findings of this study show that demographic variables and socio-cultural variables influenced mobile media purchases and mobile content uses. Specifically, demographic variables explain mobile media purchases more, and socio-cultural variables explain mobile content uses of Korean teenagers. Among significant variables, conformity and self demonstration are core elements explaining teenagers' consumer behaviors. These findings could provide implications to both academicians and practitioners.