Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
The KIPS Transactions:PartB
Journal Basic Information
Journal DOI :
Korea Information Processing Society
Editor in Chief :
Volume & Issues
Volume 12B, Issue 7 - Dec 2005
Volume 12B, Issue 6 - Oct 2005
Volume 12B, Issue 5 - Oct 2005
Volume 12B, Issue 4 - Aug 2005
Volume 12B, Issue 3 - Jun 2005
Volume 12B, Issue 2 - Apr 2005
Volume 12B, Issue 1 - Feb 2005
Selecting the target year
Object Detection using Multiple Color Normalization and Moving Color Information
Kim, Sang-Hoon ;
The KIPS Transactions:PartB, volume 12B, issue 7, 2005, Pages 721~728
DOI : 10.3745/KIPSTB.2005.12B.7.721
This paper suggests effective object detection system for moving objects with specified color and motion information. The proposed detection system includes the object extraction and definition process which uses MCN(Multiple Color Normalization) and MCWUPC(Moving Color Weighted Unmatched Pixel Count) computation to decide the existence of moving object and object segmentation technique using signature information is used to exactly extract the objects with high probability. Finally, real time detection system is implemented to verify the effectiveness of the technique and experiments show that the success rate of object tracking is more than
of total 120 image frames.
Watermarking Using Multiresolution Wavelet Transform and Image Fusion
Kim Dong-Hyun ; Jun Kye-Suk ; Lee Dae-Young ;
The KIPS Transactions:PartB, volume 12B, issue 7, 2005, Pages 729~736
DOI : 10.3745/KIPSTB.2005.12B.7.729
In this paper. the proposed method for the digital watermarking is based on the multiresolution wavelet transform. The 1-level Discrete Wavelet Transform(DWT) coefficients of a
binary logo image used as a watermarks. The LL band and middle frequency band of the host image that the 3-level DWT has been performed are divided into
size and we use large coefficients at the divided blocks to make threshold. we set the thresholds that completely insert the watermark in each frequency of the host image. The thresholds in each frequency of the host image differ each other. The watermarks where is the same positions are added to the larger coefficients than threshold in the blocks at LL band and middle frequency band in order to prevent the quality deterioration of the host image. The watermarks are inserted in LL band and middle frequency band of the host image. In order to be invisibility of the watermark, the Human Visual System(HVS) is applied to the watermark. We prove the proper embedding method by experiment. We rapidly detect the watermark using this watermarking method. And because the small size watermarks are inserted by HVS, the results confirm the superiority of the proposed method on invisibility and robustness.
Three-Level Color Clustering Algorithm for Binarizing Scene Text Images
Kim Ji-Soo ; Kim Soo-Hyung ;
The KIPS Transactions:PartB, volume 12B, issue 7, 2005, Pages 737~744
DOI : 10.3745/KIPSTB.2005.12B.7.737
In this paper, we propose a three-level color clustering algerian for the binarization of text regions extracted from natural scene images. The proposed algorithm consists of three phases of color segmentation. First, the ordinary images in which the texts are well separated from the background, are binarized. Then, in the second phase, the input image is passed through a high pass filter to deal with those affected by natural or artificial light. Finally, the image Is passed through a low pass filter to deal with the texture in texts and/or background. We have shown that the proposed algorithm is more effective used gray-information binarization algorithm. To evaluate the effectiveness of the proposed algorithm we use a commercial OCR software ARMI 6.0 to observe the recognition accuracies on the binarized images. The experimental results on word and character recognition show that the proposed approach is more accurate than conventional methods by over
Transmission Error Detection and Copyright Protection for MPEG-2 Video Based on Channel Coded Watermark
Bae, Chang-Seok ; Yuk, Ying-Chung ;
The KIPS Transactions:PartB, volume 12B, issue 7, 2005, Pages 745~754
DOI : 10.3745/KIPSTB.2005.12B.7.745
This paper proposes an information hiding algorithm using channel coding technique which can be used to detect transmission errors and to protect copyright for MPEG-2 video The watermark signal is generated by applying copyright information of video data to a convolutional encoder, and the signal is embedded into macro blocks in every frame while encoding to MPEG-2 video stream In the decoder, the embedded signal is detected from macro blocks in every frame, and the detected signal is used to localize transmission errors in the video stream. The detected signal can also be used to claim ownership of the video data by decoding it to the copyright Information. In this stage, errors in the detected watermark signal can be corrected by channel decoder. The 3 video sequences which consist of 300 frames each are applied to the proposed MPEG-2 codec. Experimental results show that the proposed method can detect transmission errors in the video stream while decoding and it can also reconstruct copyright information more correctly than the conventional method.
Recovery of Missing Motion Vectors Using Modified ALA Clustering Algorithm
Son, Nam-Rye ; Lee, Guee-Sang ;
The KIPS Transactions:PartB, volume 12B, issue 7, 2005, Pages 755~760
DOI : 10.3745/KIPSTB.2005.12B.7.755
To transmit a video bit stream over low bandwith, such as mobile, channels, encoding algorithms for high bit rate like H.263+ are used. In transmitting video bit-streams, packet losses cause severe degradation in image quality. This paper proposes a new algorithm for the recovery of missing or erroneous motion vectors when H.263+ bit-stream is transmitted. Considering that the missing or erroneous motion vectors are closely related with those of neighboring blocks, this paper proposes a temporal-spatial error concealment algorithm. The proposed approach is that missing or erroneous Motion Vectors(MVs) are recovered by clustering the movements of neighboring blocks by their homogeneity. MVs of neighboring blocks we clustered according to ALA(Average Linkage Algorithm) clustering and a representative value for each cluster is determined to obtain the candidate MV set. By computing the distortion of the candidates, a MV with the minimum distortion is selected. Experimental results show that the proposed algorithm exhibits better performance in subjective and objective evaluation than existing methods.
The Abstraction Retrieval System of Cultural Videos using Scene Change Detection
Kang Oh-Hyung ; Lee Ji-Hyun ; Rhee Yang-Won ;
The KIPS Transactions:PartB, volume 12B, issue 7, 2005, Pages 761~766
DOI : 10.3745/KIPSTB.2005.12B.7.761
This paper proposes a video model for the implementation of the cultural video database system. We have utilized an efficient scene change detection method that segments cultural video into semantic units for efficient indexing and retrieval of video. Since video has a large volume and needs to be played for a longer time, it implies difficulty of viewing the entire video. To solve this Problem. the cultural video abstraction was made to save the time and widen the choices of video the video abstract is the summarization of scenes, which includes important events produced by setting up the abstraction rule.
Object Contour Tracking Using Snakes in Stereo Image Sequences
Kim Shin-Hyoung ; Jang Jong Whag ;
The KIPS Transactions:PartB, volume 12B, issue 7, 2005, Pages 767~774
DOI : 10.3745/KIPSTB.2005.12B.7.767
In this paper, we present a snake-based scheme for tracking object contour using disparity information taken from a stereo image sequence with cluttered background. The proposed method is composed of two steps. First, 3-D motion of object is estimated and candidate snake points are selected in disparity space. Second, object contour is extracted by using a modified snake algorithm with disparity information. The proposed algorithm can successfully extract the concave contour of objects and track the object contour in complex image. Performance of the proposed algorithm has been verified by simulation.
Web-Cached Multicast Technique for on-Demand Video Distribution
Kim, Back-Hyun ; Hwang, Tae-June ; Kim, Ik-Soo ;
The KIPS Transactions:PartB, volume 12B, issue 7, 2005, Pages 775~782
DOI : 10.3745/KIPSTB.2005.12B.7.775
In this paper, we propose multicast technique in order to reduce the required network bandwidth by n times, by merging the adjacent multicasts depending on the number of HENs (Head-End-Nodes) n that request the same video. Allowing new clients to immediately join an existing multicast through patching improves the efficiency of the multicast and offers services without any initial latency. A client might have to download data through two channels simultaneously, one for multicast and the other for patching. The more the frequency of requesting the video is, the higher the probability of caching it among HENs increases. Therefore, the requests for the cached video data can be served by HENs. Multicast from server is generated when the playback time exceeds the amount of cached video data. Since the interval of multicast can be dynamically expanded according to the popularity of videos, it can be reduced the server`s workload and the network bandwidth. We perform simulations to compare its performance with that of conventional multicast. From simulation results, we confirm that the Proposed multicast technique offers substantially better performance.
ForwardCast : A New VOD Streaming Method in P2P
Yoon Soo-Mi ; Kim Sang-Chul ; Kim Joong-Hwan ;
The KIPS Transactions:PartB, volume 12B, issue 7, 2005, Pages 783~788
DOI : 10.3745/KIPSTB.2005.12B.7.783
Recently researches that apply P2P networks to VOD streaming have been actively published In the previous works on VOD streaming, they aimed at achieving two major goals, which are zero-delay transmission and minimization of service rejection ratio. This paper proposes a new method, called ForwardCast, for VOD streaming based on a P2P-based multicasting tree in order to achieve theses two goals. In this method,- basically a new client selects one of the preceding clients and starts receiving a whole video from the selected one without any delay. In some situation, two preceding clients are selected to transfer the ending part of the video and its the remaining part simultaneously. In our experiment, ForwardCast can reduce the rejection ratio compared to previous works without increasing server stress.
A Design of a Multi-tier Hybrid Multimedia System
Na, Yun-Ji ;
The KIPS Transactions:PartB, volume 12B, issue 7, 2005, Pages 789~794
DOI : 10.3745/KIPSTB.2005.12B.7.789
The multimedia system using computing environment should support the fast access speed on the large scaled high quality data in the functional side. And it can support interaction and adaptiveness on system users. But it is hard to support it all effectively in the existing multimedia systems. In this paper, we design the multi-tier hybrid multimedia system. The proposed system is based on the characteristics of a multimedia medium, and it has the merits of the CD-ROM based method and the web based method. On the experiments, we verified the efficiency of the proposed system.
3-D Facial Animation on the PDA via Automatic Facial Expression Recognition
Lee Don-Soo ; Choi Soo-Mi ; Kim Hae-Hwang ; Kim Yong-Guk ;
The KIPS Transactions:PartB, volume 12B, issue 7, 2005, Pages 795~802
DOI : 10.3745/KIPSTB.2005.12B.7.795
In this paper, we present a facial expression recognition-synthesis system that recognizes 7 basic emotion information automatically and renders face with non-photorelistic style in PDA For the recognition of the facial expressions, first we need to detect the face area within the image acquired from the camera. Then, a normalization procedure is applied to it for geometrical and illumination corrections. To classify a facial expression, we have found that when Gabor wavelets is combined with enhanced Fisher model the best result comes out. In our case, the out put is the 7 emotional weighting. Such weighting information transmitted to the PDA via a mobile network, is used for non-photorealistic facial expression animation. To render a 3-D avatar which has unique facial character, we adopted the cartoon-like shading method. We found that facial expression animation using emotional curves is more effective in expressing the timing of an expression comparing to the linear interpolation method.
Visual Media Service Retrieval Using ASN.1-based Ontology Reasoning
Min, Young-Kun ; Lee, Bog-Ju ;
The KIPS Transactions:PartB, volume 12B, issue 7, 2005, Pages 803~810
DOI : 10.3745/KIPSTB.2005.12B.7.803
Information retrieval is one of the most challenging areas in which the ontology technology is effectively used. Among them image retrieval using the image meta data and ontology is the one that can substitute the keyword-based image retrieval. In the paper, the retrieval of visual media such as the art image and photo picture is handled. It is assumed that there are more than one service providers of the visual media and also there is one central service broker that mediates the user`s query. Given the user`s query the first step that must be done in the service broker is to get the list of candidate service providers that fit the query. This is done by defining various ontologies such as the service ontology and matching the query against the ontology and providers. A novel matching method based on the ASN.1. The experiment shows that the method is more effective than existing tree-based and interval-based methods. Ontology merging issue is also handled that can happen when the service providers register their service into the service broker. An effective method is also proposed.
Reinforcement Method for Automated Text Classification using Post-processing and Training with Definition Criteria
Choi, Yun-Jeong ; Park, Seung-Soo ;
The KIPS Transactions:PartB, volume 12B, issue 7, 2005, Pages 811~822
DOI : 10.3745/KIPSTB.2005.12B.7.811
Automated text categorization is to classify free text documents into predefined categories automatically and whose main goals is to reduce considerable manual process required to the task. The researches to improving the text categorization performance(efficiency) in recent years, focused on enhancing existing classification models and algorithms itself, but, whose range had been limited by feature based statistical methodology. In this paper, we propose RTPost system of different style from i.ny traditional method, which takes fault tolerant system approach and data mining strategy. The 2 important parts of RTPost system are reinforcement training and post-processing part. First, the main point of training method deals with the problem of defining category to be classified before selecting training sample documents. And post-processing method deals with the problem of assigning category, not performance of classification algorithms. In experiments, we applied our system to documents getting low classification accuracy which were laid on a decision boundary nearby. Through the experiments, we shows that our system has high accuracy and stability in actual conditions. It wholly did not depend on some variables which are important influence to classification power such as number of training documents, selection problem and performance of classification algorithms. In addition, we can expect self learning effect which decrease the training cost and increase the training power with employing active learning advantage.
Improved Ant Colony System for the Traveling Salesman Problem
Kim, In-Kyeom ; Yun, Min-Young ;
The KIPS Transactions:PartB, volume 12B, issue 7, 2005, Pages 823~828
DOI : 10.3745/KIPSTB.2005.12B.7.823
Ant Colony System (ACS) applied to the traveling salesman problem (TSP) has demonstrated a good performance on the small TSP. However, in case of the large TSP. ACS does not yield the optimum solution. In order to overcome the drawback of the An for the large TSP, the present study employs the idea of subpath to give more irormation to ants by computing the distance of subpath with length u. in dealing with the large TSP, the experimental results indicate that the proposed algorithm gives the solution much closer to the optimal solution than does the original ACS. In comparison with the original ACS, the present algorithm has substantially improved the performance. By utilizing the proposed algorithm, the solution performance has been enhanced up to
for some graphs and around at
for averaging over all graphs.
A Korean Homonym Disambiguation System Using Refined Semantic Information and Thesaurus
Kim Jun-Su ; Ock Cheol-Young ;
The KIPS Transactions:PartB, volume 12B, issue 7, 2005, Pages 829~840
DOI : 10.3745/KIPSTB.2005.12B.7.829
Word Sense Disambiguation(WSD) is one of the most difficult problem in Korean information processing. We propose a WSD model with the capability to filter semantic information using the specific characteristics in dictionary dictions, and nth added information, useful to sense determination, such as statistical, distance and case information. we propose a model, which can resolve the issues resulting from the scarcity of semantic information data based on the word hierarchy system (thesaurus) developed by Ulsan University`s UOU Word Intelligent Network, a dictionary-based toxicological database. Among the WSD models elaborated by this study, the one using statistical information, distance and case information along with the thesaurus (hereinafter referred to as `SDJ-X model`) performed the best. In an experiment conducted on the sense-tagged corpus consisting of 1,500,000 eojeols, provided by the Sejong project, the SDJ-X model recorded improvements over the maximum frequency word sense determination (maximum frequency determination, MFC, accuracy baseline) of
for nouns and inter-eojeot distance weights by
for verbs). Finally, the accuracy level of the SDJ-X model was higher than that recorded by the model using only statistical information, distance and case information, without the thesaurus by a margin of