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
Structured Information Modeling and Query Method for SMIL Documents
Journal of Korea Multimedia Society, volume 7, issue 3, 2004, Pages 293~307
The SMIL(Synchronized Multimedia Integration Language) documents are represented as logical structure information, spatial layout structure information, temporal synchronization structure information and hyperlink structure information, according as the structural characteristics of SMIL documents based on XML. This paper proposes the effective modeling and query method for the multi -structure information of inherent SMIL documents. In particular, we present the object-oriented modeling by using UML class diagram in order to represent the objects classes for the structured information of SMIL documents, and the hierarchical structure and the relationships for the objects classes. In addition, the objects classes definition is specified in compliance with SQL3 for database standard language. We also propose the access method and the query representation for hierarchical structure in order to retrieve efficiently the structural objects of SMIL documents.
Reconstruction of Partially Damaged face for Improving a Face Recognition Rate
Journal of Korea Multimedia Society, volume 7, issue 3, 2004, Pages 308~318
A subject to recognize the damaged facial image is becoming an important issue in commercialization of automatic face recognition. The method to recognize a face on a damaged image is divided into two types. The one is to recognize remainders after removing the damaged information and the other is to recognize a total face after recovering the damaged information. On this paper, we present the reconstruction method by analyzing the main materials after extracting the damaged region through Kohonen network. The suggested algorithm in this paper estimates feature vectors of the damaged region using eigen-faces in PCA and then reconstructs the damaged image. This allows also the reconstruction under the untrained images. Through testing the artificial images where the eye and the mouth which have many effects to face recognition are damaged, the recognition rate of the proposed results showed similar results with the method which used Kohonen network, and improved about 11.8% more than symmetrical property method. Also, in case of the untrained image, our results improved about 14% more than that of the Kohonen method and about 7% more than that of the symmetrical property method.
Region Merging Method Preserving Object Boundary for Color Image Segmentation
Journal of Korea Multimedia Society, volume 7, issue 3, 2004, Pages 319~326
In this paper, we propose color image segmentation by region merging method preserving the boundary of an object. The proposed method selects initial region by using quantized image's index map after vector quantizing an original image. After then, we merge regions by applying boundary restricted factor in order to consider the boundary of an object in HSI color space. Also we merge the regions in RGB color space for non-processed regions in HSI color space. And we reduce processing time by decreasing iterative process in region merging algorithm. Experimental results have demonstrated the superiority in region's segmentation results and processing time for various images.
Halftone Image Watermarking Based on Iterative Error Minimizing Method
Journal of Korea Multimedia Society, volume 7, issue 3, 2004, Pages 327~339
In this paper, we propose a new watermark algorithm for halftone images using iterative error minimizing method. In the proposed method, watermark bits are hidden at pseudo-random locations within a halftone image. To remove the distortions due to the inserted watermark bits and increase the invisibility of watermark, an iterative error minimizing technique is used. We define the halftoning error is defined as the difference between the original grayscale image and HVS-filtered printed halftone image. Then we iteratively find the pixel pattern with minimum halftoning error and displace the original pixel pattern with it. In order to be robust to geometrical modification like cropping or rotation, we insert the same watermark periodically into halftone images. Experiments using printed and scanned images show that the proposed method is a robust method to the geometrical modification and to hide the large amount of data within a halftone image without noticeable distortion.
An Improved CSMA/CD with Channel Reservation Facility
Journal of Korea Multimedia Society, volume 7, issue 3, 2004, Pages 340~348
In this paper, we proposed an efficient medium access protocol to share single transmission medium for several stations. There are two well known types of medium access protocols: collision allowance and collision avoidance, and each of them is adopted to their own suitable network with advantage. Our proposed protocol have channel reservation facility based on collision allow medium access protocol, CSMA/CD. In a collision, the stations delay collision with generating pseudo collision signal to reserve channel. Then, the collision terminates and the stations, which reserve channel successfully, participate the next competition with higher medium access probability. We show that the proposed protocol reduced collision times and improved utilization of the channel.
Image Encryption and Decryption Using SA Algorithm and Optical Correlator System
Journal of Korea Multimedia Society, volume 7, issue 3, 2004, Pages 349~356
In this paper, a practical image security system using SA algorithm and 4-f optical correlator system is proposed. The encrypted image and key image with binary phase components are generated using an iterative SA algorithm. a decrypted image is found through the correlation of the encrypted and key images using 4-f optical correlator system. The encrypted and key images are consisted of binary phase components. So, it is easy to implement the optical security system using the proposed technique. And if we fix the encrypted image in the optical security system and change the key images, we get different images, so it is possible to apply to the distinguished authorization system using different key images. Computer simulations show that despite the binary phase components of the two images(encrypted and key image), decrypted images are generated.
Design and Evaluation of a Channel Reservation Batch-Patching Technique for VOD Services
Journal of Korea Multimedia Society, volume 7, issue 3, 2004, Pages 357~367
In VOD systems the number of channels available to a video server is limited since the number of channels, the video server can support, is determined by the communication bandwidth of the video server. Multicast techniques such as batching, patching and batch-patching have been proposed to reduce I/O demand on the video server by sharing multicast data. In this paper, we propose a channel reservation batch-patching technique that first applies the batching technique to hot video requests and then applies the patching technique to the batches of the hot video requests. And the proposed technique reserves a part of the channel capacity of the video server for many hot video requests, so that the hot video requests can be served without defection. The performance of the proposed technique is compared with those of Patching and Batch-Patching techniques in terms of average service latency, defection rate, fairness and frame reduction rate by simulations.
Implementation of a Template-Based Authoring Tool for Multimedia Content
Journal of Korea Multimedia Society, volume 7, issue 3, 2004, Pages 368~376
Currently, the package tools and software development kits of Microsoft's Windows Media Technology provides users an environment to write, distribute and play multimedia contents. However, it is very difficult for common users to create a media streaming content using the Windows Media technology, because of its technical hardship. Therefore, we developed an easy-to-use authoring tool for multimedia streaming content which can be used in the Windows Media Technology environment. Our authoring tool is based on the web page templates by which HTML codes can be generated automatically. Using the existing streaming media authoring tool provided by the Microsoft, users have to code the temporal markers and the event script commands directly to the ASF(Advanced Systems Format) files or ASX (ASF Stream Redirector) format files. We developed an easy-to-use interface for insetting temporal markers and the event script commands to the ASF files by simple mouse clicking and dragging to minimize the effort of users for creating multimedia streaming content. In addition, we implemented an ASX file creation wizard that allows users to create ASX format file without coding ASX tags. We also implemented various web page templates where the ASF files and the ASX files can be embedded by just clicking the corresponding templates. The target web pages can be automatically generated from those templates and previewed directly on the web browser at the time of creation.
Tree-Based Conversational Interface Supporting Efficient Presentation of Turn Relations
Journal of Korea Multimedia Society, volume 7, issue 3, 2004, Pages 377~387
This paper describes a tree-based conversational interface supporting efficient presentation of turn relations on online conversation. Most of conventional conversational interfaces are difficult to make use of formal conversation such as group meeting, decision-making, etc. due to very simplicity of a con versational interface and restriction of data structure of conversational messages. And a tree-based conversational interface supports formal conversation, but they are difficult to present turn relations because of jumpy display by locations of replied turns and distance between replied turns, etc. So this paper suggests a tree-based conversational interface to present efficiently turn relations using XML-based messages with merits of a text-based interface. The suggested conversational interface was implemented by using XML-, DOM, and JDK. And this paper showed that the conversational interface could be applied to conversation system using client- server architecture. Applications for the conversational interface are as follows: collaboration, distance teaming, online game, etc.
Multi-Layer Sharing Model for Efficient Collaboration in Distributed Virtual Environments
Journal of Korea Multimedia Society, volume 7, issue 3, 2004, Pages 388~398
This paper focuses on the reduction method of message traffic occurred when multiple participants collaborate in the distributed virtual environment. It is referred to as filtering method of update message to minimize data traffic exchanged in the virtual environment, and it is the essential process to improve the scalability of the virtual environment. Spatial partitioning method, a popular filtering technique, divides the whole environment into smaller sub-parts in order to make it small the regions to be maintained consistently. However, it is less flexible and adaptable because the information of area of interest must be configured before simulation. In this paper, the concept of dynamic area of interest is proposed, which is highly adaptable by applying dynamic environmental elements to AOI management. It uses multiple layering and multiple consistency algorithms for dynamic management, and makes it possible to consume system resource efficiently. For performance evaluation, experiments are performed with virtual avatars, measuring message traffic. Finally, the proposed model could be applied to the AOI management systems which accommodate massive users like MMORPG, or virtual communities.
An Implementation of Traffic Management System for Internet QoS Guarantee
Journal of Korea Multimedia Society, volume 7, issue 3, 2004, Pages 399~407
As the number of IP-users are increasing, it is getting so important for service providers to check the state of the current Internet and their service quality by measuring the traffic quality. We describe a general concept of measurement architecture and internet QoS (Quality of Service) parameters, and we review measurement tools. To meet these requirements, we design and implement the Internet traffic management system.
The Design and Implementation of Web-Based Integrated Genome Analysis Tools
Journal of Korea Multimedia Society, volume 7, issue 3, 2004, Pages 408~417
Genome analysis process requires several steps of various software analysis tools. We propose WGAT(Web-based Genome Analysis Tool), which combines several tools for gene analysis and provides a graphic user interface for users. Software tools related to gene analysis are based on Linux or Unix oriented program, which is difficult to install and use for biologists. Furthermore, files generated from gene analysis frequently require manual transformation for next step input file. Web-based tools which are recently developed process orily one sequence at a time. So it needs many repetitive processes to analyze large size data file. WGAT is developed to support Web-based genome analysis for easy use as well as fast service for users. Whole genome data analysis can be done by running WGAT on Linux server and giving sequence data files with various options. Therefore many steps of the analysis can be done automatically by the system. Simulation shows that WGAT method gives 20 times faster analysis when sequence segment is one thousand.
A Reverse Segmentation Algorithm of Compound Nouns Using Affix Information and Preference Pattern
Journal of Korea Multimedia Society, volume 7, issue 3, 2004, Pages 418~426
This paper suggests a reverse segmentation Algorithm using affix information and some preference pattern information of Korean compound nouns. The structure of Korean compound nouns are mostly derived from the Chinese characters and it includes some preference patterns, which are going to be utilized as a segmentation rule in this paper. To evaluate the accuracy of the proposed algorithm, an experiment was performed with 36061 compound nouns. The experiment resulted in getting 99.3% of correct segmentation and showed excellent satisfactory result from the comparative experimentation with other algorithm, especially most of the four or five-syllable compound nouns were successfully segmented without fail.
3D Shape Comparison Using Modal Strain Energy
Journal of Korea Multimedia Society, volume 7, issue 3, 2004, Pages 427~437
Shape comparison between 3D models is essential for shape recognition, retrieval, classification, etc. In this paper, we propose a method for comparing 3D shapes, which is invariant under translation, rotation and scaling of models and is robust to non-uniformly distributed and incomplete data sets. first, a modal model is constructed from input data using vibration modes and then shape similarity is evaluated with modal strain energy. The proposed method provides global-to-local ordering of shape deformation using vibration modes ordered by frequency Thus, we evaluated similarity in terms of global properties of shape without being affected localised shape features using ordered shape representation and modal strain one energy.
Classification of Query E-Mail Using Neural Network
Journal of Korea Multimedia Society, volume 7, issue 3, 2004, Pages 438~449
More and more users are using the query e-mail according to the increment of use of internet. The operator of internet site desires the users to check the FAQ and Q＆A contents first before sending the query e-mail to the operator However the users try to get the solution for a problem easily by simply sending a query e-mail. Therefore the increment of query e-mail is inevitable, and the site operator is suffering from too heavy loads and spending too much time and cost to reply the query e-mail. In this paper, we are proposing an efficient method of classifying the query e-mail of users automatically by using a neural network. To verify the reasonability of our work, the query e-mails of KORNET are used as the test data, which is actually gathered in KT. A total of 210 learning data and 280 test data were used to test the performance of the proposed approach. From the experiments we got the encouraging result from the view point of application in real life. The proposed approach satisfied the request of users who wanted rapid response for their query e-mail.