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 11, Issue 12 - Dec 2008
Volume 11, Issue 11 - Nov 2008
Volume 11, Issue 10 - Oct 2008
Volume 11, Issue 9 - Sep 2008
Volume 11, Issue 8 - Aug 2008
Volume 11, Issue 7 - Jul 2008
Volume 11, Issue 6 - Jun 2008
Volume 11, Issue 5 - May 2008
Volume 11, Issue 4 - Apr 2008
Volume 11, Issue 3 - Mar 2008
Volume 11, Issue 2 - Feb 2008
Volume 11, Issue 1 - Jan 2008
Selecting the target year
Web Information Extraction and Multidimensional Analysis Using XML
Park, Byung-Kwon ;
Journal of Korea Multimedia Society, volume 11, issue 5, 2008, Pages 567~578
For analyzing a huge amount of web pages available in the Internet, we need to extract the encoded information in web pages. In this paper, we propose a method to extract and convert web information from web pages into XML documents for multidimensional analysis. For extracting information from web pages, we propose two languages: one for describing web information extraction rules based on the object-oriented model, and another for describing regular expressions of HTML tag patterns to search for target information. For multidimensional analysis on XML documents, we propose a method for constructing an XML warehouse and various XML cubes from it like the way we do for relational data. Finally, we show the validness of our method through the application to US patent web pages.
Advanced JPEG bit rate control for the mobile multimedia device
Yang, Yoon-Gi ; Lee, Chang-Su ; Kim, Jin-Yul ;
Journal of Korea Multimedia Society, volume 11, issue 5, 2008, Pages 579~587
Typically, the file sizes of JPEG compressed images with various complexity differ from images regardless of same image size. So, it is not easy to estimate the remaining image counts that should be stored in the limited storage equipped with the digital camera. To solve the problem, the bit rate control employs the modification of quantization table. The previous work assumed that there is linear relation between image activity and modification factor of quantization table, but in this paper, more accurate functional relations based on statistics are employed to improve the bit rate control accuracy. Computer simulations reveals that the standard deviation of the bit rate error of the proposed scheme is 50% less than that of the conventional method.
Selective Encryption Scheme Based on Region of Interest for Medical Images
Lee, Won-Young ; Ou, Yang ; Rhee, Kyung-Hyune ;
Journal of Korea Multimedia Society, volume 11, issue 5, 2008, Pages 588~596
For the patients' privacy, secure access control of medical images is essentially necessary. In this paper, two types of Region of Interest (ROI)-based selective encryption schemes are proposed, which concentrate on the security of crucial parts in medical images. The first scheme randomly inverts the most significant bits of ROI coefficients in several high frequency subbands in the transform domain, which only incurs little loss on compression efficiency. The second scheme employs a symmetric key encryption to encrypt selectively the ROI data in the final code-stream, which provides sufficient confidentiality. Both of two schemes are backward compatible so as to ensure a standard bitstream compliant decoder so the encrypted images can be reconstructed without any crash.
Adaptive Background Modeling for Crowded Scenes
Lee, Gwang-Gook ; Song, Su-Han ; Ka, Kee-Hwan ; Yoon, Ja-Young ; Kim, Jae-Jun ; Kim, Whoi-Yul ;
Journal of Korea Multimedia Society, volume 11, issue 5, 2008, Pages 597~609
Due to the recursive updating nature of background model, previous background modeling methods are often perturbed by crowd scenes where foreground pixels occurs more frequently than background pixels. To resolve this problem, an adaptive background modeling method, which is based on the well-known Gaussian mixture background model, is proposed. In the proposed method, the learning rate of background model is adaptively adjusted with respect to the crowdedness of the scene. Consequently, the learning process is suppressed in crowded scene to maintain proper background model. Experiments on real dataset revealed that the proposed method could perform background subtraction effectively even in crowd situation while the performance is almost the same to the previous method in normal scenes. Also, the F-measure was increased by 5-10% compared to the previous background modeling methods in the video of crowded situations.
Comparisons of Color Spaces for Shadow Elimination
Lee, Gwang-Gook ; Uzair, Muhammad ; Yoon, Ja-Young ; Kim, Jae-Jun ; Kim, Whoi-Yul ;
Journal of Korea Multimedia Society, volume 11, issue 5, 2008, Pages 610~622
Moving object segmentation is an essential technique for various video surveillance applications. The result of moving object segmentation often contains shadow regions caused by the color difference of shadow pixels. Hence, moving object segmentation is usually followed by a shadow elimination process to remove the false detection results. The common assumption adopted in previous works is that, under the illumination variation, the value of chromaticity components are preserved while the value of intensity component is changed. Hence, color transforms which separates luminance component and chromaticity component are usually utilized to remove shadow pixels. In this paper, various color spaces (YCbCr, HSI, normalized rgb, Yxy, Lab, c1c2c3) are examined to find the most appropriate color space for shadow elimination. So far, there have been some research efforts to compare the influence of various color spaces for shadow elimination. However, previous efforts are somewhat insufficient to compare the color distortions under illumination change in diverse color spaces, since they used a specific shadow elimination scheme or different thresholds for different color spaces. In this paper, to relieve the limitations of previous works, (1) the amount of gradients in shadow boundaries drawn to uniform colored regions are examined only for chromaticity components to compare the color distortion under illumination change and (2) the accuracy of background subtraction are analyzed via RoC curves to compare different color spaces without the problem of threshold level selection. Through experiments on real video sequences, YCbCr and normalized rgb color spaces showed good results for shadow elimination among various color spaces used for the experiments.
Graphic Hardware Based Visualization of Three Dimensional Object Boundaries in Volume Data Set Using Three Dimensional Textures
Kim, Hong-Jae ; Choi, Heung-Kook ;
Journal of Korea Multimedia Society, volume 11, issue 5, 2008, Pages 623~632
In this paper, we used the color transfer function and the opacity transfer function for the internal 3D object visualization of an image volume data. In transfer function, creating values of between boundaries generally is ambiguous. We concentrated to extract boundary features for segmenting the visual volume rendering objects. Consequently we extracted an image gradient feature in spatial domain and created a multi-dimensional transfer function according to the GPU efficient improvement. Finally using these functions we obtained a good research result as an implementing object boundary visualization of the graphic hardware based 3D texture mapping.
An Energy Efficient Cluster-based Scheduling Scheme for Environment Information Systems
An, Sung-Hyun ; Kim, Seung-Hoon ;
Journal of Korea Multimedia Society, volume 11, issue 5, 2008, Pages 633~640
Sensor node clustering is one of the most popular research topics to reduce the energy of sensor nodes in wireless sensor networks. Previous researches, however, did not consider prediction effects of sensed environment information on TDMA scheduling of a cluster, resulting energy inefficiency. In this paper, we suggest an energy efficient cluster-based scheduling scheme that can be applied flexibly to many environment information systems. This scheme reflects the environment information obtained at the application layer to the MAC layer to set up the schedule of a cluster. The application layer information sets up the scheduling referring to the similarity of sensed data of cluster head. It determines the data transmission considering the result of similarity. We show that our scheme is more efficient than LEACH and LEACH-C in energy, which are popular clustering schemes, through simulation.
A Power-Aware Scheduling Algorithm with Voltage Transition Overhead
Kweon, Hyek-Seong ; Ahn, Byoung-Chul ;
Journal of Korea Multimedia Society, volume 11, issue 5, 2008, Pages 641~650
As portable devices are used widely, power management algorithm is essential to extend battery use time on small-sized battery power. Although many methods have been proposed, they assumed the voltage transition overhead was negligible or was considered partially. However, the voltage transition overhead might not guarantee to schedule real-time tasks in portable multimedia systems. This paper proposes the adaptive power-aware algorithm to minimize the power consumption by considering the voltage transition overhead. It selects only a few discrete frequencies from the whole frequencies of a system and adjusts the interval between two consecutive frequencies based on the system utilization to reduce the number of frequency change. This algorithm saves the power consumption about 10 to 25 percent compared to a CC RT-DVS method and a frequency-smoothing method.
Implementation of Efficient and Reliable Flash File System
Jin, Jong-Won ; Lee, Tae-Hoon ; Lee, Seung-Hwan ; Chung, Ki-Dong ;
Journal of Korea Multimedia Society, volume 11, issue 5, 2008, Pages 651~660
Flash memory is widely used in embedded systems because of its benefits such as non-volatile, shock resistant, and low power consumption. However, NAND flash memory suffers from out-place-update, limited erase cycles, and page based read/write operations. To solve these problems, YAFFS and RFFS, the flash memory file systems, are proposed. However YAFFS takes long time to mount the file system, because all the files are scattered all around flash memory. Thus YAFFS needs to fully scan the flash memory. To provide fast mounting, RFFS has been proposed. It stores all the block information, the addresses of block information and meta data to use them at mounting time. However additional operations for the meta data management are decreasing the performance of the system. This paper presents a new NAND flash file system called ERFFS (Efficient and Reliable Flash File System) which provides fast mounting and recovery with minimum mata data management. Based on the experimental results, ERFFS reduces the flash mount/recovery time and the file system overhead.
A Reliable Cluster based Dynamic Authentication Mechanism in MANET
Hwang, Yoon-Cheol ; Kim, Jin-Il ;
Journal of Korea Multimedia Society, volume 11, issue 5, 2008, Pages 661~672
Mobile Ad-hoc NETwork is a kind of self-controlled network composed only of mobile hosts. Since its range of use is gradually expanding into various sections applicable to practical lives, active researches are being conducted on it. However, as it depends on cooperation of nodes composing the entire network, due to weakness of wireless link and lack of its central infrastructure, so it is exposed to more serious risk than general network in security. Therefore, this paper proposes Cluster-Based Dynamic Authentication that enables only reliable nodes to participate in communication, by solving lack of centralized infrastructure, using hierarchical Mobile Ad hoc NETwork structure based on cluster, and by complementing security weakness through mutual authentication between hierarchical nodes. Simulation shows that the proposed scheme can complement security weakness of Mobile Ad hoc NETwork and that it is more adequate in reliability and expandability than the existing schemes.
Design and Implementation of a QoS Signaling Protocol for Multimedia Applications in Mobile Network Environments
Kim, Hong-Tae ; Jeong, Seong-Ho ;
Journal of Korea Multimedia Society, volume 11, issue 5, 2008, Pages 673~684
In this paper, we propose a signaling protocol which can support QoS for multimedia applications continuously after handover of a mobile node in the network environment where IP-based wireless access networks co-exist. Since existing RSVP-based signaling protocols can cause the waste of network resources due to double reservation and do not provide fast resource reservation/release, they are not suitable for mobile networks. The proposed QoS signaling protocol can support QoS for multimedia applications using the fast reservation of necessary resources after handover and avoid the waste of resources by resolving the double reservation problem. This paper presents design and implementation architectures of the proposed signaling protocol and analyzes its performance via a physical testbed. Based on the analysis results, it was shown that the proposed protocol is able to support seamless QoS for multimedia applications.
An Efficient Broadcasting Channel Assignment Scheme for Mobile VOD Services
Choi, Young ;
Journal of Korea Multimedia Society, volume 11, issue 5, 2008, Pages 685~691
Recently with the rapid evolution of the mobile computing and communication technologies, mobile VOD service becomes increasingly important for wireless mobile users. The VOD service is being widely used in various areas of application, such as education, entertainment and business, because it provides users convenience in easily having access to video information at any time in any places. However, in reality, the mobile system has many difficulties in providing the smooth VOD service owing to frequent transfers and cutoffs of clients. The importance of a technique to transmit broadcasting is being stressed as a method for providing stabler mobile VOD service to a large number of clients. This paper is aimed at showing how to reduce demands for server bandwidth and delay of earlier service through performance analysis by suggesting an effective VOD broadcasting transmission technique through channel division in the mobile atmosphere. Many researches have been made about regular broadcasting techniques in particular. This study divides the methods used for assigning channels which have been decided by the size of segments into a group of regular channels and assistant channels using wireless gap-fillers to provide effective VOD services to a large number of clients at the mobile environment using small bandwidth resources. The regular channels transfer regular streams, while assistant channels repeatedly transfer the first segment to reduce early service delay time to receive regular streams. In this way, the study suggests a technique to reduce server bandwidth demand and early service delay time. Through the proposed technique, the server bandwidth demand could be reduced by more than 30 percent and the study continuously shows reduced early service delay time through conducting performance analysis.
Automatic Generation of Character-Specific Roadmaps for Path Planning in Computer Games
Yu, Kyeon-Ah ;
Journal of Korea Multimedia Society, volume 11, issue 5, 2008, Pages 692~702
Path planning is gaining more weight in computer games and virtual reality as the number of self-moving characters increases. In the roadmap approach, the map of possible paths is built in advance to plan paths for a character, whose advantage is to provide high-quality paths. On the other hand, a disadvantage is that the road map doesn't reflect properties of characters such as their sizes because they move on the same map once the road map is constructed. In this paper we propose an efficient method to build a different road map for each character so that it can use its own map for path-planning. This method is efficient because the whole map is built once by applying the Visibility Graph regardless of the number of characters and walkable paths are incrementally inserted according to the sizes of characters. The effects of using separate roadmaps are demonstrated through simulations and the trade-offs accompanied with these effects are analyzed.
Improvement of LR Parser using Reduction Goals
Son, Yun-Sik ; Oh, Se-Man ;
Journal of Korea Multimedia Society, volume 11, issue 5, 2008, Pages 703~709
The methodology of the compiler construction improved by well-defined parsing techniques and developments of automatic generation tools. Through them, a variety of compilers for the special applications can be developed effectively: particularly, the compiler for embedded/mobile devices. Also, as contents industry is proliferating recently, the necessity of developing a compiler which is suitable for contents system is highly increasing. These various demands can be resolved by modular techniques and automatic construction of compilers. But, optimization of compiler itself as development tools uses heuristic methods and it needs higher cost. In this paper, we suggest the parsing method which can decrease unnecessary reduce actions by analyzing the characteristics of LR parser. The suggested parsing technique uses lookahead/ states, reachable reduction goals information in parsing process and enhances the parsing efficiency by changing continuous reduce actions to one. Actually, we applied it to the front-end of ANSI C compiler and proved the parsing performance in terms of the number of reduce actions.
Service Identification of Component-Based For Extending Service-Oriented Computing System
Choi, Mi-Sook ; Lee, Seo-Jeong ; Lee, Jong-Suk ; Yang, Seung-Won ;
Journal of Korea Multimedia Society, volume 11, issue 5, 2008, Pages 710~727
Service-oriented computing systems have been issued by their properties of reducing software development time and effort by reusing functional service units. The reusability of services can effectively promote through loose coupling between services. But strong associations of object-oriented systems such as inheritance and aggregation create a rather tight coupling between objects. The component-based systems without inheritance and aggregation create a loose coupling between components. Thus components provide service realization at runtime using the functionality provided by their interfaces. Therefore legacy component-based systems need to have service-oriented computing concept in order to support functional service units efficiently. Also, conventional methods for service-oriented computing system have not suggested the clear classification of service layers, the clear service identification guideline introducing service layers and a service mapping method between serviceces of each layer. Therefore we suggest the service classification and the identification guideline of business view and implementation view introducing layers and propose a mapping between two views. That is, we research service layers, service identification, diversified service sizes and a service mapping method between services of each layer. This can be applied to legacy component-based system to extend to the service-oriented computing system.