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 10B, Issue 7 - Dec 2003
Volume 10B, Issue 6 - Oct 2003
Volume 10B, Issue 5 - Aug 2003
Volume 10B, Issue 4 - Aug 2003
Volume 10B, Issue 3 - Jun 2003
Volume 10B, Issue 2 - Apr 2003
Volume 10B, Issue 1 - Feb 2003
Selecting the target year
Text Summarization using PCA and SVD
Lee, Chang-Beom ; Kim, Min-Soo ; Baek, Jang-Sun ; Park, Hyuk-Ro ;
The KIPS Transactions:PartB, volume 10B, issue 7, 2003, Pages 725~734
DOI : 10.3745/KIPSTB.2003.10B.7.725
In this paper, we propose the text summarization method using PCA (Principal Component Analysis) and SVD (Singular Value Decomposition). The proposed method presents a summary by extracting significant sentences based on the distances between thematic words and sentences. To extract thematic words, we use both word frequency and co-occurence information that result from performing PCA. To extract significant sentences, we exploit Euclidean distances between thematic word vectors and sentence vectors that result from carrying out SVD. Experimental results using newspaper articles show that the proposed method is superior to the method using either word frequency or only PCA.
Latent Semantic Indexing Analysis of K-Means Document Clustering for Changing Index Terms Weighting
Oh, Hyung-Jin ; Go, Ji-Hyun ; An, Dong-Un ; Park, Soon-Chul ;
The KIPS Transactions:PartB, volume 10B, issue 7, 2003, Pages 735~742
DOI : 10.3745/KIPSTB.2003.10B.7.735
In the information retrieval system, document clustering technique is to provide user convenience and visual effects by rearranging documents according to the specific topics from the retrieved ones. In this paper, we clustered documents using K-Means algorithm and present the effect of index terms weighting scheme on the document clustering. To verify the experiment, we applied Latent Semantic Indexing approach to illustrate the clustering results and analyzed the clustering results in 2-dimensional space. Experimental results showed that in case of applying local weighting, global weighting and normalization factor, the density of clustering is higher than those of similar or same weighting schemes in 2-dimensional space. Especially, the logarithm of local and global weighting is noticeable.
Query Expansion and Term Weighting Method for Document Filtering
Shin, Seung-Eun ; Kang, Yu-Hwan ; Oh, Hyo-Jung ; Jang, Myung-Gil ; Park, Sang-Kyu ; Lee, Jae-Sung ; Seo, Young-Hoon ;
The KIPS Transactions:PartB, volume 10B, issue 7, 2003, Pages 743~750
DOI : 10.3745/KIPSTB.2003.10B.7.743
In this paper, we propose a query expansion and weighting method for document filtering to increase precision of the result of Web search engines. Query expansion for document filtering uses ConceptNet, encyclopedia and documents of 10% high similarity. Term weighting method is used for calculation of query-documents similarity. In the first step, we expand an initial query into the first expanded query using ConceptNet and encyclopedia. And then we weight the first expanded query and calculate the first expanded query-documents similarity. Next, we create the second expanded query using documents of top 10% high similarity and calculate the second expanded query- documents similarity. We combine two similarities from the first and the second step. And then we re-rank the documents according to the combined similarities and filter off non-relevant documents with the lower similarity than the threshold. Our experiments showed that our document filtering method results in a notable improvement in the retrieval effectiveness when measured using both precision-recall and F-Measure.
Multi Colony Ant Model using Positive.Negative Interaction between Colonies
Lee, Seung-Gwan ; Chung, Tae-Choong ;
The KIPS Transactions:PartB, volume 10B, issue 7, 2003, Pages 751~756
DOI : 10.3745/KIPSTB.2003.10B.7.751
Ant Colony Optimization (ACO) is new meta heuristics method to solve hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as greedy search. It was firstly proposed for tackling the well known Traveling Salesman Problem (TSP) . In this paper, we introduce Multi Colony Ant Model that achieve positive interaction and negative interaction through Intensification and Diversification to improve original ACS performance. This algorithm is a method to solve problem through interaction between ACS groups that consist of some agent colonies to solve TSP problem. In this paper, we apply this proposed method to TSP problem and evaluates previous method and comparison for the performance and we wish to certify that qualitative level of problem solution is excellent.
Weighted Fuzzy Reasoning Using Weighted Fuzzy Pr/T Nets
Cho, Sang-Yeop ;
The KIPS Transactions:PartB, volume 10B, issue 7, 2003, Pages 757~768
DOI : 10.3745/KIPSTB.2003.10B.7.757
This paper proposes a weighted fuzzy reasoning algorithm for rule-based systems based on weighted fuzzy Pr/T nets, where the certainty factors of the fuzzy production rules, the truth values of the predicates appearing in the rules and the weights representing the importance of the predicates are represented by the fuzzy numbers. The proposed algorithm is more flexible and much closer to human intuition and reasoning than other methods :
calculate the certainty factors using by the simple min and max operations based on the only certainty factors of the fuzzy production rules without the weights of the predicates :
evaluate the belief of the fuzzy production rules using by the belief evaluation functions according to fuzzy concepts in the fuzzy rules without the weights of the predicates, because this algorithm uses the weights representing the importance of the predicates in the fuzzy production rules.
DNA Computing Adopting DNA Coding Method to solve Maximal Clique Problem
Kim, Eun-Kyoung ; Lee, Sang-Yong ;
The KIPS Transactions:PartB, volume 10B, issue 7, 2003, Pages 769~776
DOI : 10.3745/KIPSTB.2003.10B.7.769
DNA computing has used to solve MCP (Maximal Clique Problem). However, when current DNA computing is applied to MCP. it can`t efficiently express vertices and edges and it has a problem that can`t look for solutions, by misusing wrong restriction enzyme. In this paper we proposed ACO (Algorithm for Code Optimization) that applies DNA coding method to DNA computing to solve MCP`s problem. We applied ACO to MCP and as a result ACO could express DNA codes of variable lengths and generate codes without unnecessary vertices than Adleman`s DNA computing algorithm could. In addition, compared to Adleman`s DNA computing algorithm, ACO could get about four times as many as Adleman`s final solutions by reducing search time and biological error rate by 15%.
Machine Printed Character Recognition Based on the Combination of Recognition Units Using Multiple Neural Networks
Lim, Kil-Taek ; Kim, Ho-Yon ; Nam, Yun-Seok ;
The KIPS Transactions:PartB, volume 10B, issue 7, 2003, Pages 777~784
DOI : 10.3745/KIPSTB.2003.10B.7.777
In this Paper. we propose a recognition method of machine printed characters based on the combination of recognition units using multiple neural networks. In our recognition method, the input character is classified into one of 7 character types among which the first 6 types are for Hangul character and the last type is for non-Hangul characters. Hangul characters are recognized by several MLP (multilayer perceptron) neural networks through two stages. In the first stage, we divide Hangul character image into two or three recognition units (HRU : Hangul recognition unit) according to the combination fashion of graphemes. Each recognition unit composed of one or two graphemes is recognized by an MLP neural network with an input feature vector of pixel direction angles. In the second stage, the recognition aspect features of the HRU MLP recognizers in the first stage are extracted and forwarded to a subsequent MLP by which final recognition result is obtained. For the recognition of non-Hangul characters, a single MLP is employed. The recognition experiments had been performed on the character image database collected from 50,000 real letter envelope images. The experimental results have demonstrated the superiority of the proposed method.
Simulation of solar radiation and wind events in the virtual environments
Cho, Jin-Young ; Park, Jong-Hee ;
The KIPS Transactions:PartB, volume 10B, issue 7, 2003, Pages 785~794
DOI : 10.3745/KIPSTB.2003.10B.7.785
Computer simulation of natural phenomena has been inclined to graphic processing for visual reality. This negligence of cosmic causalities in their occurrence and natural laws in their development should lead to limited degree of immersion to the users. We attempt to develop a logical framework for authentic simulation of diverse, unpredictable occurrence and development of natural phenomena (such as solar radiation and wind) based on their associated inherent laws and principles. To this end we structure the relevant objects organized in an ontology and propose a data management method. Then we describe our simulation method for the natural phenomena as delimited in phases and present modeling techniques for qualitative changes of physical objects due to their factors` values beyond normal ranges.
A study on environmental adaptation and expansion of intelligent agent
Baek, Hae-Jung ; Park, Young-Tack ;
The KIPS Transactions:PartB, volume 10B, issue 7, 2003, Pages 795~802
DOI : 10.3745/KIPSTB.2003.10B.7.795
To live autonomously, intelligent agents such as robots or virtual characters need ability that recognizes given environment, and learns and chooses adaptive actions. So, we propose an action selection/learning mechanism in intelligent agents. The proposed mechanism employs a hybrid system which integrates a behavior-based method using the reinforcement learning and a cognitive-based method using the symbolic learning. The characteristics of our mechanism are as follows. First, because it learns adaptive actions about environment using reinforcement learning, our agents have flexibility about environmental changes. Second, because it learns environmental factors for the agent`s goals using inductive machine learning and association rules, the agent learns and selects appropriate actions faster in given surrounding and more efficiently in extended surroundings. Third, in implementing the intelligent agents, we considers only the recognized states which are found by a state detector rather than by all states. Because this method consider only necessary states, we can reduce the space of memory. And because it represents and processes new states dynamically, we can cope with the change of environment spontaneously.
Real-Time Image Mosaic Using DirectX
Chong, Min-Yeong ; Choi, Seung-Hyun ; Bae, Ki-Tae ; Lee, Chil-Woo ;
The KIPS Transactions:PartB, volume 10B, issue 7, 2003, Pages 803~810
DOI : 10.3745/KIPSTB.2003.10B.7.803
In this paper, we describe a fast image mosaic method for constructing a large-scale image with video image captured from cameras that are arranged in radial shape. In the first step, we adopt the phase correlation algorithm to estimate the horizontal and vertical displacement between two adjacent images. Secondly, we calculate the accurate transform matrix among those cameras with Levenberg-Marquardt method. In the last step, those images are stitched into one large scale image in real-time by applying the transform matrix to the texture mapping function of DirectX. The feature of the method is that we do not need to use special hardware devices or write machine-level programs for Implementing a real-time mosaic system since we use conventional graphic APIs (Application Programming Interfaces), DirectX for image synthesis process.
A New Cross and Hexagonal Search Algorithm for Fast Block Matching Motion Estimation
Park, In-Young ; Nam, Hyeon-Woo ; Wee, Young-Cheul ; Kim, Ha-Jine ;
The KIPS Transactions:PartB, volume 10B, issue 7, 2003, Pages 811~814
DOI : 10.3745/KIPSTB.2003.10B.7.811
In this paper, we propose a fast block-matching motion estimation method using the cross pattern and the hexagonal pattern. For the block-matching motion estimation method, full search finds the best motion estimation, but it requires huge search time because it has to check every search point within the search window. The proposed method makes use of the fact that most of motion vectors lie near the center of block. The proposed method first uses the cross pattern to search near the center of block, and then uses the hexagonal pattern to search larger motion vectors. Experimental results show that our method is better than recently proposed search algorithms in terms of mean-square error performance and required search time.
Fingerprint Recognition using Linking Information of Minutiae
Cha, Heong-Hee ; Jang, Seok-Woo ; Kim, Gye-Young ; Choi, Hyung-Il ;
The KIPS Transactions:PartB, volume 10B, issue 7, 2003, Pages 815~822
DOI : 10.3745/KIPSTB.2003.10B.7.815
Fingerprint image enhancement and minutiae matching are two key steps in an automatic fingerprint identification system. In this paper, we propose a fingerprint recognition technique by using minutiae linking information. Recognition process have three steps ; preprocessing, minutiae extraction, matching step based on minutiae pairing. After extracting minutiae of a fingerprint from its thinned image for accuracy, we introduce matching process using minutiae linking information. Introduction of linking information into the minutiae matching process is a simple but accurate way, which solves the problem of reference minutiae pair selection with low cost in comparison stage of two fingerprints. This algorithm is invariable to translation and rotation of fingerprint. The matching algorithm was tested on 500 images from the semiconductor chip style scanner, experimental result revealed the false acceptance rate is decreased and genuine acceptance rate is increased than existing method.
Feature Extraction of Shape of Image Objects in Content-based Image Retrieval
Cho, June-Suh ;
The KIPS Transactions:PartB, volume 10B, issue 7, 2003, Pages 823~828
DOI : 10.3745/KIPSTB.2003.10B.7.823
The main objective of this paper is to provide a methodology of feature extraction using shape of image objects for content-based image retrieval. The shape of most real-life objects is irregular, and hence there is no universal approach to quantify the shape of an arbitrary object. In particular. electronic catalogs contain many image objects for their products. In this paper, we perform feature extraction based on individual objects in images rather than on the whole image itself, since our method uses a shape-based approach of objects using RLC lines within an image. Experiments show that shape parameters distinctly represented image objects and provided better classification and discrimination among image objects in an image database compared to Texture.
A study on the Stochastic Model for Sentence Speech Understanding
Roh, Yong-Wan ; Hong, Kwang-Seok ;
The KIPS Transactions:PartB, volume 10B, issue 7, 2003, Pages 829~836
DOI : 10.3745/KIPSTB.2003.10B.7.829
In this paper, we propose a stochastic model for sentence speech understanding using dictionary and thesaurus. The proposed model extracts words from an input speech or text into a sentence. A computer is sellected category of dictionary database compared the word extracting from the input sentence calculating a probability value to the compare results from stochastic model. At this time, computer read out upper dictionary information from the upper dictionary searching and extracting word compared input sentence caluclating value to the compare results from stochastic model. We compare adding the first and second probability value from the dictionary searching and the upper dictionary searching with threshold probability that we measure the sentence understanding rate. We evaluated the performance of the sentence speech understanding system by applying twenty questions game. As the experiment results, we got sentence speech understanding accuracy of 79.8%. In this case, probability (
) of high level word is 0.9 and threshold probability (
) is 0.38.
A Main Wall Recognition of Architectural Drawings using Dimension Extension Line
Kwon, Young-Bin ;
The KIPS Transactions:PartB, volume 10B, issue 7, 2003, Pages 837~846
DOI : 10.3745/KIPSTB.2003.10B.7.837
This paper deals with plain figures on the architectural drawings of apartment. This kind of architectural drawings consist of main walls represented by two parallel bold lines, symbols (door, window,
), dimension line, extension line, and dimensions represent various numerical values and characters. This paper suggests a method for recognizing main wall which is a backbone of apartment in an architectural drawing. In this thesis, the following modules are realized : an efficient image barbarization, a removal of thin lines, a vectorization of detected lines, a region bounding for main walls, a calculation of extension lines, a finding main walls based on extension line, and a field expansion by searching other main walls which are linked with the detected main walls. Although the windows between main walls are not represented as main walls, a detection module for the windows is considered during the recognition period. So the windows are found as a part of main wall. An experimental result on 9 different architectural drawings shows 96.5% recognition of main walls and windows, which is about 5.8% higher than that of Karl Tombre.
Implementation of New MOD System Using On-demand Multicasting Technique
Kim, Young-Jung ; Hwang, Tae-June ; Kwon, Ki-Seop ; Kim, Ik-Soo ;
The KIPS Transactions:PartB, volume 10B, issue 7, 2003, Pages 847~852
DOI : 10.3745/KIPSTB.2003.10B.7.847
This paper implements MOD system using multicast delivery. Conventional system provide server-based system in multicast delivery but implemented system provides on-demand client-based multicast system. The scheduler aggregates clients` request and it generate multcast group addresses and port numbers according to requested video items and service request time. Then it transmits immediately multicast address to MOD server and client who request service. And then MOD server transmits requested streams with a multicast group address and the client joins the group automatically. The scheduler assigns the same multicast group address when other clients request an identical video within the same scheduling duration. The system can reduce load of server and support many clients at the same time.
Design and Implementation of Web Mail Filtering Agent for Personalized Classification
Jeong, Ok-Ran ; Cho, Dong-Sub ;
The KIPS Transactions:PartB, volume 10B, issue 7, 2003, Pages 853~862
DOI : 10.3745/KIPSTB.2003.10B.7.853
Many more use e-mail purely on a personal basis and the pool of e-mail users is growing daily. Also, the amount of mails, which are transmitted in electronic commerce, is getting more and more. Because of its convenience, a mass of spam mails is flooding everyday. And yet automated techniques for learning to filter e-mail have yet to significantly affect the e-mail market. This paper suggests Web Mail Filtering Agent for Personalized Classification, which automatically manages mails adjusting to the user. It is based on web mail, which can be logged in any time, any place and has no limitation in any system. In case new mails are received, it first makes some personal rules in use of the result of observation ; and based on the personal rules, it automatically classifies the mails into categories according to the contents of mails and saves the classified mails in the relevant folders or deletes the unnecessary mails and spam mails. And, we applied Bayesian Algorithm using Dynamic Threshold for our system`s accuracy.