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
A Schematic Map Generation System Using Centroidal Voronoi Tessellation and Icon-Label Replacement Algorithm
Ryu Dong-Sung ; Uh Yoon ; Park Dong-Gyu ;
Journal of Korea Multimedia Society, volume 9, issue 2, 2006, Pages 139~150
A schematic map is a special purpose map which is generated to recognize it's objects easily and conveniently via simplifying and highlighting logical geometric information of a map. To manufacture the schematic map with road, label and icon, we must generate simplified route map and replace many geometric objects. Performing a give task, however, there are an amount of overlap areas between geometric objects whenever we process the replacement of geometry objects. Therefore we need replacing geometric objects without overlap. But this work requires much computational resources, because of the high complexity of the original geometry map. We propose the schematic map generation system whose map consists of icons and label. The proposed system has following steps: 1) eliminating kinks that are least relevant to the shape of polygonal curve using DCE(Discrete Curve Evolution) method. 2) making an evenly distributed route using CVT(Centroidal Voronoi Tessellation) and Grid snapping method. Therefore we can keep the structural information of the route map from CVT method. 3) replacing an icon and label information with collision avoidance algorithm. As a result, we can replace the vertices with a uniform distance and guarantee the available spaces for the replacement of icons and labels. We can also minimize the overlap between icons and labels and obtain more schematized map.
A Segmentation Method of Compound Nouns Using Syllable Preference
Park Chan-Ee ; Ryu Bang ; Kim Sang-Bok ;
Journal of Korea Multimedia Society, volume 9, issue 2, 2006, Pages 151~159
The ratio of a segmentation algorithm of compound nouns causes an effect a lot in nouns which are not in the dictionary. The structure of Korean compound nouns are mostly derived from the Chinese characters and it includes some preference ratio. So it will be able to use segmentation rule of compound nouns. This paper suggests a segmentation algorithm using some preference ratio of Korean compound nouns which are not in the dictionary. The experiment resulted in getting 88.49% of correct segmentation and showed effective result from the comparative experimentation with other algorithm.
Face Detection Using Region Segmentation on Complex Image
Park Sun-Young ; Kang Byoung-Doo ; Kim Jong-Ho ; Kwon O-Hwa ; Seong Chi-Young ; Kim Sang-Kyoon ; Lee Jae-Won ;
Journal of Korea Multimedia Society, volume 9, issue 2, 2006, Pages 160~171
In this paper, we propose a face detection method using region segmentation to deal with complex images that have various environmental changes such as mixed background and light changes. To reduce the detection error rate due to background elements of the images, we segment the images with the JSEG method. We choose candidate regions of face based on the ratio of skin pixels from the segmented regions. From the candidate regions we detect face regions by using location and color information of eyes and eyebrows. In the experiment, the proposed method works well with the images that have several faces and different face size as well as mixed background and light changes.
Two-Phase Localization Algorithm in Wireless Sensor Networks
Song Ha-Ju ; Kim Sook-Yeon ; Kwon Oh-Heum ;
Journal of Korea Multimedia Society, volume 9, issue 2, 2006, Pages 172~188
Sensor localization is one of the fundamental problems in wireless sensor networks. Previous localization algorithms can be classified into two categories, the GGB (Global Geometry-Based) approaches and the LGB (Local Geometry-Based). In the GGB approaches, there are a fixed set of reference nodes of which the coordinates are pre-determined. Other nodes determine their positions based on the distances from the fixed reference nodes. In the LGB approaches, meanwhile, the reference node set is not fixed, but grows up dynamically. Most GGB algorithms assume that the nodes are deployed in a convex shape area. They fail if either nodes are in a concave shape area or there are obstacles that block the communications between nodes. Meanwhile, the LGB approach is vulnerable to the errors in the distance estimations. In this paper, we propose new localization algorithms to cope with those two limits. The key technique employed in our algorithms is to determine, in a fully distributed fashion, if a node is in the line-of-sight from another. Based on the technique, we present two localization algorithms, one for anchor-based, another for anchor-free localization, and compare them with the previous algorithms.
A Study on an AOI Management in Virtual Environments Based on the Priority
Yu Seok-Jong ;
Journal of Korea Multimedia Society, volume 9, issue 2, 2006, Pages 189~196
This paper proposes a priority based AOI management model as a method to effectively process message traffic for collaboration in virtual environments. Where message traffic reaches the maximum capacity of the message replay server in DVE, some of the events might be delayed to be updated at the remote clients. Because existing AOI models depend only on the occurrence time of events, they have a problem that more important events in the context might be processed later than less serious ones. Close Interactions with other participants are relatively more important than simple events which happen at a distance from the participant. This study classifies the priorities of events according to the degree of interest, and proposes a method to reduce processing delay time of events highly interested by a user. The proposed model offers a way to effectively utilize limited capacity of a server using a priority queue mechanism, which is able to handle different kinds of events. To prevent from starvation of simple events and to give fairness to the proposed algorithm, event occurrence time is also considered as well as degree of interest when processing events.
Performance Analysis of Fair Packet Schedulers in Bandwidth Utilization
Ahn Hyo-Beom ; Kim Tae-Joon ;
Journal of Korea Multimedia Society, volume 9, issue 2, 2006, Pages 197~207
When the latency of a flow in a fair packet scheduler, which is determined by its rate, violates its required delay bound, the scheduler should reduce the latency with even raising the rate being reserved for the flow. The excessively reserved rate win enforce some outgoing link bandwidth be lost. This loss can not be, unfortunately, evaluated by the three metrics of latency, fairness and implementation complexity used in previous works. This paper is aimed to first introduce the metric of bandwidth utilization to investigate the bandwidth loss in a scheduler and then evaluate the timestamp based schedulers in terms of the bandwidth and payload utilizations. The results show that the bandwidth utilization increases with loosing the required delay bound and, in particular, schedulers with the latency property of WFQ have much better payload utilization by up to 50% than that in the SCFQ one.
A Selective Message Synchronization Mechanism for Networked Virtual Environment
Yun Chung-Ha ; Paik Doo-Won ;
Journal of Korea Multimedia Society, volume 9, issue 2, 2006, Pages 208~214
Participants of a NVE(networked virtual environment) may have different hardwares and network environments, and to guarantee the fairness, messages of participants should be synchronized. A solution for the synchronization problem is to wait for a certain amount of time until the server processes the message. It is not easy to determine a suitable waiting period because of the trade-off between the fairness and the responsiveness. In this paper we propose a method to decide a waiting period by considering only the participants with small network delays and perform experiments for the performance evaluation. Experiments show that the proposed method leads to significant improvement of responsiveness, while retaining fairness.
A Study on Steganographic Method for Binary Images
Ha Soon-Hye ; Kang Hyun-Ho ; Lee Hye-Joo ; Shin Sang-Uk ; Park Young-Ran ;
Journal of Korea Multimedia Society, volume 9, issue 2, 2006, Pages 215~225
Binary images, such as cartoon character images, text images and signature images, which consist of two values with black and white have more difficulties inserting imperceptible secret data than color images. Steganography using binary cover images is not easy to satisfy requirements for both the imperceptibility of stego images and a high embedding rate of secret data at the same time. In this paper, we propose a scheme that can get both the high quality of stego images and a high embedding rate by supplementing the advantages of previous research. In addition, the insertion of the proposed method changes only existing pixels of the imperceptible position and can embed the secret data of [
] bits in a block with size of
Constructing Domain Ontologies Using Japanese DODDLE and General Ontologies
Hong, Yun-Ki ; Yamaguchi, Takahira ; Kim, Tai-Suk ;
Journal of Korea Multimedia Society, volume 9, issue 2, 2006, Pages 226~233
With the advancement of the Internet, bulky information overflows in the Web. When the Internet user wants to get the necessary information, it is essential to use the retrieval system. It is not easy for the user to get the information from the result of the retrieval system. Various research activities have been advanced for the result improvement of the retrieval system. Although retrieval results can be improved with ontology, it usually takes lots of costs for users to construct the Japanese domain ontology. This paper discusses how to integrate search result refinement and domain ontology refinement using the domain ontology tool called Japanese DODDLE, and how to improve the research result using the constructed ontology. To prove the effectiveness of the suggested methodology, the case study with rocket operation is performed and it shows that the methodology can be promising.
A Simple Way to Find Face Direction
Park Ji-Sook ; Ohm Seong-Yong ; Jo Hyun-Hee ; Chung Min-Gyo ;
Journal of Korea Multimedia Society, volume 9, issue 2, 2006, Pages 234~243
The recent rapid development of HCI and surveillance technologies has brought great interests in application systems to process faces. Much of research efforts in these systems has been primarily focused on such areas as face recognition, facial expression analysis and facial feature extraction. However, not many approaches have been reported toward face direction detection. This paper proposes a method to detect the direction of a face using a facial feature called facial triangle, which is formed by two eyebrows and the lower lip. Specifically, based on the single monocular view of the face, the proposed method introduces very simple formulas to estimate the horizontal or vertical rotation angle of the face. The horizontal rotation angle can be calculated by using a ratio between the areas of left and right facial triangles, while the vertical angle can be obtained from a ratio between the base and height of facial triangle. Experimental results showed that our method makes it possible to obtain the horizontal angle within an error tolerance of
, and that it performs better as the magnitude of the vertical rotation angle increases.
Bit-Map Based Hybrid Fast IP Lookup Technique
Oh Seung-Hyun ;
Journal of Korea Multimedia Society, volume 9, issue 2, 2006, Pages 244~254
This paper presents an efficient hybrid technique to compact the trie indexing the huge forward table small enough to be stored into cache for speeding up IP lookup. It combines two techniques, an encoding scheme called bit-map and a controlled-prefix expanding scheme to replace slow memory search with few fast-memory accesses and computations. For compaction, the bit-map represents each index and child pointer with one bit respectively. For example, when one node denotes n bits, the bit-map gives a high compression rate by consumes
index and child link pointers branched out of the node. The controlled-prefix expanding scheme determines the number of address bits represented by all root node of each trie's level. At this time, controlled-prefix scheme use a dynamic programming technique to get a smallest trie memory size with given number of trie's level. This paper proposes standard that can choose suitable trie structure depending on memory size of system and the required IP lookup speed presenting optimal memory size and the lookup speed according to trie level number.
Junk-Mail Filtering by Mail Address Validation and Title-Content Weighting
Kang Seung-Shik ;
Journal of Korea Multimedia Society, volume 9, issue 2, 2006, Pages 255~263
It is common that a junk mail has an inconsistency of mail addresses between those of the mail headers and the mail recipients. In addition, users easily know that an email is a junk or legitimate mail only by looking for the title of the email. In this paper, we tried to apply the filtering classifiers of mail address validation check and the combination method of title-content weighting to improve the performance of junk mail filtering system. In order to verify the effectiveness of the proposed method, we performed an experiment by applying them to Naive Bayesian classifier. The experiment includes the unit testing and the combination of the filtering techniques. As a result, we found that our method improved 11.6% of recall and 2.1% of precision that it contributed the enhancement of the junk mail filtering system.