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
Analysis of Indexing Schemes for Structure-Based Retrieval
Journal of Korea Multimedia Society, volume 7, issue 5, 2004, Pages 601~616
Information retrieval systems for structured documents provide multiple levels of retrieval capability by supporting structure-based queries. In order to process structure-based queries for structured documents, information for structural nesting relationship between elements and for element sequence must be maintained. This paper presents four index structures that can process various query types about structures such as structural relationships between elements or element occurrence order. The proposed algorithms are based on the concept of Global Document Instance Tree.
Moving Objects Modeling for Supporting Content and Similarity Searches
Journal of Korea Multimedia Society, volume 7, issue 5, 2004, Pages 617~632
Video Data includes moving objects which change spatial positions as time goes by. In this paper, we propose a new modeling method for a moving object contained in the video data. In order to effectively retrieve moving objects, the proposed modeling method represents the spatial position and the size of a moving object. It also represents the visual features and the trajectory by considering direction, distance and speed or moving objects as time goes by. Therefore, It allows various types of retrieval such as visual feature based similarity retrieval, distance based similarity retrieval and trajectory based similarity retrieval and their mixed type of weighted retrieval.
A Write Notification Approach for Optimistic Concurrency Control Schemes
SungChan Hong ;
Journal of Korea Multimedia Society, volume 7, issue 5, 2004, Pages 633~639
The performance of optimistic concurrency control schemes which are generally used for Mobile computing is very sensitive to the transaction abort rate. Even if the abort probability can be reduced by back-shifting the timestamp from the time of requesting a commit, some transactions continuously perform unnecessary operations after the transactions accessed write-write conflicting data. In this paper, we propose an optimistic protocol that can abort the transactions during the execution phase by using the write notification approach. The proposed protocol enhances the performance of the optimistic concurrency control by reducing the unnecessary operations. In addition, we present a simulation study that compares our schemes with the timestamp based certification scheme. This study shows that our scheme outperforms the timestamp based certification scheme.
An Improvement of VLC Using Tree Splay Algorithm
Journal of Korea Multimedia Society, volume 7, issue 5, 2004, Pages 640~647
This paper presents a method that, by using a tree splay, dynamically modifies the fixed table of a VLC used in the standards and thus improves the performance of a video encoder. The previous standards, which drew up tables by using a limited number of images, were not able to accommodate the characteristics of new image input. The new method proposed in this paper employs the probabilistic characteristics of an image input, thus making encoding more effective. Furthermore, the present study also proposes a method to regulate the weight in order that the accumulated probabilities can make a dominant symbol emerge, while keeping the probability adequate and thus maximally accommodating the characteristics of the image input. The results from applying the proposed method to a variety of image sequences showed that, while various types of images yielded slightly different results, it improved the performance up to a maximum of 0.23㏈, compared to MPEG-4 standard.
Extraction of a Central Object in a Color Image Based on Significant Colors
SungYoung Kim ; Eunkyung Lim ; MinHwan Kim ;
Journal of Korea Multimedia Society, volume 7, issue 5, 2004, Pages 648~657
A method of extracting central objects in color images without any prior-knowledge is proposed in this paper, which uses basically information of significant color distribution. A central object in an image is defined as a set of regions that lie around center of the image and have significant color distribution against the other surround (or background) regions. Significant colors in an image are first defined as the colors that are distributed more densely around center of the image than near borders. Then core object regions (CORs) are selected as the regions a lot of pixels of which have the significant colors. Finally, the adjacent regions to the CORs are iteratively merged if they are similar to the CORs but not to the background regions in color distribution. The merging result is accepted as the central object that may include differently color-characterized regions and/or two or more objects of interest. Usefulness of the significant colors in extracting the central object was verified through experiments on several kinds of test images. We expect that central objects shall be used usefully in image retrieval applications.
A Study on fast LIFS Image Coding Using Adaptive Orthogonal Transformation
Journal of Korea Multimedia Society, volume 7, issue 5, 2004, Pages 658~667
For digital image compression, various fractal image coding schemes using the self-similarity of image have been studied extensively. This paper discusses the problem that occurs during the calculating process of adaptive orthogonal transformation and provides improvements of LIFS coding scheme using the transformation. This proposed scheme has a better performance than JPEG for a wide range of compression ratio. This research also proposes an image composition method consisting of all domains of the transformation. The results show that the arithmetic operation processes of the encoder and the decoder become much smaller even without the distortion of the coding performance.
Analysis of Usefulness of Domain-Based Network Caching in Mobile Environment
Journal of Korea Multimedia Society, volume 7, issue 5, 2004, Pages 668~679
When users of mobile environments move fast or slow into a number of base stations(BS) and request the services of continuous media data such as video or audio, this study examines what the caching has the usefulness in mobile environments. Namely, to reduce packet disconnections and network overheads in mobile environments and minimize transmission delay time, we propose domain-based hierarchical caching structure and study whether application of caching has the usefulness. So we have a model based on user environments and hierarchical network structure to process continuous media services, and analyze the usefulness of caching which depends on the mobile patterns of user and the locations of caching nodes. And then, we research whether caching offers the usefulness in mobile environments. As the result, we are able to see that an adaptable application of caching is needed because the hit ratio and the number of replacement vary in large according to mobile patterns of user and locations of caching.
Handoff Control Scheme for IP Based Hybrid Mobile Data Network
Journal of Korea Multimedia Society, volume 7, issue 5, 2004, Pages 680~688
In this paper, we propose a new handoff scheme which is efficient in hybrid mobile data network consists of cellular mobile network and wireless LAN. In this scheme, handoff is delayed until connections with wireless LAN and data rates are smoothly decreased according to becon signal strength of wireless LAN. By doing so, data transfer capacity is increased and required data buffer in handoff for mobile and network system can be decreased. We analyze new handoff scheme by computer simulation. The results show that 180Mbytes data can be transferred additionally in handoff processing and required buffer size can be decreased 1/2 with the conditions that mobile speed is 1Km/hr and the data rate of a original call is 2,048Kbps.
Relocation Strategy for an Efficient Management of Replicated Data on Mobile Computing
Lee, Byung-Kwan ; Oh, Am-Suk ; Jeong, Eun-Hee ;
Journal of Korea Multimedia Society, volume 7, issue 5, 2004, Pages 689~697
Rapid advances in mobile computing and the availability of wireless communications will soon provide mobile users with the ability to access data regardless of the location of the user or of the data. SRA(Static Replica Allocation) that is traditional scheme has been used for the replication method on the server. This replicates the data on the replica server after a moving host has been transferred to the cell. This strategy is simple and can easily relocate data. However, if a mobile user does not exist in the cell, the replicated data can be deleted in order to maintain data consistency. In addition to, if the mobile host leaves from replicated cell, it is difficult to access data in terms of replication route. Therefore, this paper proposes a new method of relocation based on data consistency strategy called USRAC(User Selection Replica Allocation based on Consistency) and also analyzes access cost according to the moving rate of mobile users, according to the access rate of mobile hosts, and according to the number of cells of mobile users and mobile hosts.
An Efficient Admission Control and Resource Allocation Methods in DiffServ Networks
Journal of Korea Multimedia Society, volume 7, issue 5, 2004, Pages 698~712
DiffServ network architecture does not define a call admission control procedure explicitly. In this paper, a new DiffServ QoS control mechanism is suggested which, after the call admission control, can execute packet process according to the class while, at the same time, executing on the flow based call admission control in the DiffServ network. Routers on the path from the source to the destination estimate the aggregated class traffic of the existing flows and the new incoming flow and then, perform a call admission control in accordance with the type of classes efficiently based on the required bandwidth per each class that can meet the user's QoS requirements. In order to facilitate the packet process according to the class after the flow based call admission control, a mechanism is suggested that can adjust the network resources to classes dynamically. The performance analysis on this mechanism is carried out through a simulation.
A Study on the CLR Performance Improvement for VBR Traffic in the Wireless ATM Access Network
Journal of Korea Multimedia Society, volume 7, issue 5, 2004, Pages 713~720
In this paper we suggest error control scheme to improve CLR performance degradation on wireless ATM access networks which consist of access node and wireless channel. Based on the cell scale and hurst scale, traffic model of wireless ATM access network is analyzed. The CLR equation due to buffer overflow for wireless access node is derived for VBR traffic. the CLR equation due to random bit errors and burst errors for wireless channel is derived. Using the CLR equation for both access node and wireless channel, the CLR equation of wireless ATM access network is derived, and we evaluate the CLR performance on the wireless ATM access networks with conventional SR ARQ scheme and recommended error control scheme, that is, Type I Hybrid ARQ scheme. It is confirmed that CLR performance of the access networks with recommended error control schemes is superior to that of access networks with conventional error control scheme.
Architecture of Policy-Based Network Management for Providing Internet Differentiated Service on Mobile IP Environment
Journal of Korea Multimedia Society, volume 7, issue 5, 2004, Pages 721~736
Because of increasing the notebook computer and PDA, users' requirement with respect to mobility is growing more and more. However, current IP protocol is not changed IP address and can not deliver IP packets on new location of host in case moving another network. To solve this problem, the IETF has proposed mobile IP. Today users want to be provided suitable QoS in the internet since demand of services is variety. The policy-based network management is method which can solve various problems of QoS, security, and complication of management in IP networks. This paper presents the network topology constitution, operation procedure and architecture of policy-based network management for providing internet DiffServ on mobile IP environment. In this paper we propose policy classes of policy-based DiffServ network management on mobile environment and create policy scenarios using the proposed policy description language to represent the policy classes. Finally, we implemented a policy-based DiffServ network management system on mobile IP environment.
The Call Control Scheme for Multiple Cells CDMA System Under Non-Uniform Traffic Distribution
Journal of Korea Multimedia Society, volume 7, issue 5, 2004, Pages 737~743
In this paper, we propose the call control scheme that can improve the capacity of the wireless system for the non-uniform traffic load distribution and the multiple types of services in multiple cells CDMA system. The number of mobile stations that can be served simultaneously in a base station is limited by the amount of total interference received in CDMA system. Further, the average number of mobile stations in each cell may not be uniformly distributed. Considering this factors, the call admission control scheme using the effective bandwidth concept is adapted in this paper. Thus, the bandwidth for a new call can be varied dynamically for reducing the blocking rate of new calls and the dropping rate of handoff calls. The suggested call control scheme is experimented through a simulation by dynamically assigning the bandwidth to new and handoff calls. The simulation results show that the proposed call control scheme can accommodate more mobile stations than the other methods in multiple cells environment.
A Polarity Based Blind Watermarking Method Considering Wavelet Coefficients Change
Journal of Korea Multimedia Society, volume 7, issue 5, 2004, Pages 744~754
In this paper, a polarity based blind watermarking method considering wavelet coefficients modification is proposed. In this proposed method, we use an asymmetric thresholds watermarking(ATW) in which detection threshold is higher than inserting threshold in order to enhance watermark detection ratio in attacked images. Also, in order to reduce errors in the detected value of watermarks according to small changes in the coefficient values when detecting watermarks, it set the range for movement variation of the coefficients and lowered the sensitivity of variation by ignoring the variations that fall into this range. For this purpose, the polarity preservation threshold
was set and a watermark was detected based on the polarity only for the difference that was larger than
. The experimental results show that the proposed method has good quality and is robust to various attacks such as the JPEG lossy compression, noise addition, cropping, blurring, etc.
Realtime Monitoring and Visualization for PDP System
Journal of Korea Multimedia Society, volume 7, issue 5, 2004, Pages 755~765
Recently, the Internet-based distributed/parallel computing using many of idle hosts has been demonstrated its usefulness for processings of a large-scale task and involving several important issues. While executing a large-scale task, the realtime monitoring is required for adaptive strategy of the performance and state change of host. This paper provides the realtime monitoring and visualization on global computing infrastructure called PDP(Parallel Distributed Processing) which is a parallel computing framework implemented with Jana for parallel computing on the Internet.