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 11B, Issue 7 - Dec 2004
Volume 11B, Issue 6 - Oct 2004
Volume 11B, Issue 5 - Aug 2004
Volume 11B, Issue 4 - Aug 2004
Volume 11B, Issue 3 - Jun 2004
Volume 11B, Issue 2 - Apr 2004
Volume 11B, Issue 1 - Feb 2004
Volume 11, Issue 2 - 00 2004
Volume 11, Issue 1 - 00 2004
Selecting the target year
A method of describing and retrieving a sequence of moving object using Shape Variation Map
Choi, Min-Seok ; Kim, Whoi-Yul ;
The KIPS Transactions:PartB, volume 11B, issue 1, 2004, Pages 1~6
DOI : 10.3745/KIPSTB.2004.11B.1.001
Motion Information in a video clip often plays an important role in characterizing the content of the clip. A number of methods have been developed to analyze and retrieve video contents using motion information. However, most of these methods focused more on the analysis of direction or trajectory of motion but less on the analysis of the movement of an object. In this paper, we introduce the shape variation descriptor for describing shape variation caused by object movement along time, and propose a method to describe and retrieve the shape variation of the object using shape variation map. The experimental results shows that the proposed method performed much better than the previous method by l1％ and is very effective for describing the shape variation which is applicable to semantic retrieval applications.
Thinning Compensation and Pseudo Minutiae Removal Using Ridge Trace
Lee, Keon-Ik ; Kim, Sung-Nak ;
The KIPS Transactions:PartB, volume 11B, issue 1, 2004, Pages 7~12
DOI : 10.3745/KIPSTB.2004.11B.1.007
This thesis studies about thinning compensation and the removal of pseudo minutiae using ridge trace. As for the process of thinning compensation, first, it removes unnecessary pixel when 8-neighbor connection sum among the pixels with the crossing count number 6 is not 3. Second, it deals with repeatedly until there is no pixel to remove while tracing the ridge, beginning with the pixel equivalent to the ridge and the pixel with the crossing count number 2 among the 8 pixels around the pixels with the crossing count number 6. When the thinning compensation is finished, it extracts substitute minutiae to use the crossing count number and the 8-neighbor connection sum. Among the extracted substitute minutiaes, it extracts the real minutiae to utilize the pseudo minutiae removal algorithm again. It compares with the existing method for the performance evaluation of proposal method. By the experimental results, The proposal method indicated that a degree of thinning is excellent and a lot of minutiaes were removed.
Performance Improvement Method of Face Detection Using SVM
Jee, Hyung-Keun ; Lee, Kyung-Hee ; Chung, Yong-Wha ;
The KIPS Transactions:PartB, volume 11B, issue 1, 2004, Pages 13~20
DOI : 10.3745/KIPSTB.2004.11B.1.013
In the real-time automatic face recognition technique, accurate face detection is essential and very important part because it has the effect to face recognition performance. In this paper, we use color information, edge information, and binary information to detect candidate regions of eyes from Input image, and then detect face candidate region using the center point of the detected eyes. We verify both eye candidate region and face candidate region using Support Vector Machines(SVM). It is possible to perform fast and reliable face detection because we can protect false detection through these verification process. From the experimental results, we confirmed the Proposed algorithm in this paper shows excellent face detection rate over 99%.
The Improved Binary Tree Vector Quantization Using Spatial Sensitivity of HVS
Ryu, Soung-Pil ; Kwak, Nae-Joung ; Ahn, Jae-Hyeong ;
The KIPS Transactions:PartB, volume 11B, issue 1, 2004, Pages 21~26
DOI : 10.3745/KIPSTB.2004.11B.1.021
Color image quantization is a process of selecting a set of colors to display an image with some representative colors without noticeable perceived difference. It is very important in many applications to display a true color image in a low cost color monitor or printer. The basic problem is how to display 256 colors or less colors, called color palette, In this paper, we propose improved binary tree vector quantization based on spatial sensitivity which is one of the human visual properties. We combine the weights based on the responsibility of human visual system according to changes of three Primary colors in blocks of images with the process of splitting nodes using eigenvector in binary tree vector quantization. The test results show that the proposed method generates the quantized images with fine color and performs better than the conventional method in terms of clustering the similar regions. Also the proposed method can get the better result in subjective quality test and WSNR.
Tracking and Interpretation of Moving Object in MPEG-2 Compressed Domain
Mun, Su-Jeong ; Ryu, Woon-Young ; Kim, Joon-Cheol ; Lee, Joon-Hoan ;
The KIPS Transactions:PartB, volume 11B, issue 1, 2004, Pages 27~34
DOI : 10.3745/KIPSTB.2004.11B.1.027
This paper proposes a method to trace and interpret a moving object based on the information which can be directly obtained from MPEG-2 compressed video stream without decoding process. In the proposed method, the motion flow is constructed from the motion vectors included in compressed video. We calculate the amount of pan, tilt, and zoom associated with camera operations using generalized Hough transform. The local object motion can be extracted from the motion flow after the compensation with the parameters related to the global camera motion. Initially, a moving object to be traced is designated by user via bounding box. After then automatic tracking Is performed based on the accumulated motion flows according to the area contributions. Also, in order to reduce the cumulative tracking error, the object area is reshaped in the first I-frame of a GOP by matching the DCT coefficients. The proposed method can improve the computation speed because the information can be directly obtained from the MPEG-2 compressed video, but the object boundary is limited by macro-blocks rather than pixels. Also, the proposed method is proper for approximate object tracking rather than accurate tracing of an object because of limited information available in the compressed video data.
A New Mobile Content Adaptation Based on Content Provider-Specified Web Clipping
Yang, Seo-Min ; Lee, Hyuk-Joon ;
The KIPS Transactions:PartB, volume 11B, issue 1, 2004, Pages 35~44
DOI : 10.3745/KIPSTB.2004.11B.1.035
Web contents created for desktop screens give rise to problems when they are to be displayed on the small screens of mobile terminals. While in some cases some of the objects of a page may not be displayable due to the lack of browser capability, the entire page may not be displayable due to the incompatibility with the browser in other cases. In this paper, we introduce a new mobile content adaptation approach based on web clipping, which transforms an original page into one that is optimally displayed on a mobile terminal. In this method, a source page is automatically clipped and transformed according to the clip specification made by the content provider using a clip editing tool. The clip editing tool allows the user to specify group clips, multi-level cups and dynamic clips as well as simple clips, and the presentation layout through a graphic user interface. Based on the clip specifications, each clip is transformed into an intermediate meta-language document, which in turn is transformed into a presentation page in the target markup language. Transcoding of image objects in major image file formats is also supported.
A Synchronization Error Control System for Web based Multimedia Collaboration Environment
Ko, Eung-Nam ;
The KIPS Transactions:PartB, volume 11B, issue 1, 2004, Pages 45~52
DOI : 10.3745/KIPSTB.2004.11B.1.045
We propose ESS_WMCE. This paper explains the design and implementation of the EDSS running on ESS_WMCE. EDSS is a synchronization error control system for web based multimedia collaboration environment. We have an error detection approach by using hooking method. The technique of an error transmission is a mended model of utilizing an application sharing system. DOORAE is a good framework model for supporting development on application for computer supported cooperated works. It has primitive service functions. Service functions are implemented with an object oriented concept. It is a system that is suitable for detecting and sharing a software error rapidly occurring on web based multimedia collaboration environment by using software techniques. It is able to share an error as well as providing URL synchronization to access shared objects. When an error occurs, this system detects an error by using hooking methods in MS-Windows API(Application Program Interface) function. If an error is found, it is able to provide an error sharing to access shared objects.
Representation and Detection of Video Shot s Features for Emotional Events
Kang, Hang-Bong ; Park, Hyun-Jae ;
The KIPS Transactions:PartB, volume 11B, issue 1, 2004, Pages 53~62
DOI : 10.3745/KIPSTB.2004.11B.1.053
The processing of emotional information is very important in Human-Computer Interaction (HCI). In particular, it is very important in video information processing to deal with a user`s affection. To handle emotional information, it is necessary to represent meaningful features and detect them efficiently. Even though it is not an easy task to detect emotional events from low level features such as colour and motion, it is possible to detect them if we use statistical analysis like Linear Discriminant Analysis (LDA). In this paper, we propose a representation scheme for emotion-related features and a defection method. We experiment with extracted features from video to detect emotional events and obtain desirable results.
Optimized Module Design for Berth Planning of Logistics Information System Using Tabu Search Algorithm
Hong, Dong-Hee ; Kim, Chang-Gon ;
The KIPS Transactions:PartB, volume 11B, issue 1, 2004, Pages 63~70
DOI : 10.3745/KIPSTB.2004.11B.1.063
Port operation is largely divided into gate operation, yard operation and berth operation. Operation strategy and optimal resource allocation for three parts are important in the productivity of the port operation.. Especially the resource allocation planning in berth operation needs optimization, because it is directly connected with the processing time in shipping. Berth planning is not independent on recourse allocation but interrelated with yard stacking area allocation. Therefore, we design the optimized module of berth planning and give priority to interrelationship with yard space allocation, while existing studies design independent resource allocation in berth planning. We suggest constraints by mathematical method, and they are related to yard stacking area allocation with existing constraints. Then we look for solutions, use tabu search to optimize them, and design optimized the berth planning module. In the performance test of optimized module design of berth planning, we find that the berth planning with yard stacking area allocation takes less processing time than without yard stacking area allocation.
A Study of Statistical Learning as a CRM s Classifier Functions
Chang, Keun ; Lee, Jung-Bae ; Lee, Byoung-Soo ;
The KIPS Transactions:PartB, volume 11B, issue 1, 2004, Pages 71~76
DOI : 10.3745/KIPSTB.2004.11B.1.071
The recent ERP and CRM is mostly focused on the conventional function performances. However, the recent business environment has brought the change in market due to the rapid progress of internet and e-commerce. It is mostly becoming e-business and spreading out as development of the relationship with other cooperating companies, the rapid progress of the relationship with customers, and intensification competitive power through the development of business progress in the organization. CRM(custom relationship management) is a kind of the marketing progress which forms, manages, and intensifies the relationship between the customers and companies to manage the acquired customers and increase the worth of customers for the company. It needs the system base which analyzes the information of customers since it functions on the basis of various information about customers and is linked to the business category such as producing, marketing, and decision making. Since ERP is extending its function to SCM, CRM, and SEM(strategic Enterprise Management), the 21 century s ERP develop as the strategy tool of e-business and, as the mediation for this, will subdivide the functions of CRM effectively by the analogic study of data. Also, to accomplish classification work of the file which in existing becomes accomplished with possibility work with an automatic movement with the user will be able to accomplish a more efficiently work the agent which in order leads the machine studying law, it is one thing with system feature.
A Reinforcement Loaming Method using TD-Error in Ant Colony System
Lee, Seung-Gwan ; Chung, Tae-Choong ;
The KIPS Transactions:PartB, volume 11B, issue 1, 2004, Pages 77~82
DOI : 10.3745/KIPSTB.2004.11B.1.077
Reinforcement learning takes reward about selecting action when agent chooses some action and did state transition in Present state. this can be the important subject in reinforcement learning as temporal-credit assignment problems. In this paper, by new meta heuristic method to solve hard combinational optimization problem, examine Ant-Q learning method that is proposed to solve Traveling Salesman Problem (TSP) to approach that is based for population that use positive feedback as well as greedy search. And, suggest Ant-TD reinforcement learning method that apply state transition through diversification strategy to this method and TD-error. We can show through experiments that the reinforcement learning method proposed in this Paper can find out an optimal solution faster than other reinforcement learning method like ACS and Ant-Q learning.
Adaptive Strategy Game Engine Using Non-monotonic Reasoning and Inductive Machine Learning
Kim, Je-Min ; Park, Young-Tack ;
The KIPS Transactions:PartB, volume 11B, issue 1, 2004, Pages 83~90
DOI : 10.3745/KIPSTB.2004.11B.1.083
Strategic games are missing special qualities of genre these days. Game engines neither reason about behaviors of computer objects nor have learning ability that can prepare countermeasure in variously command user`s strategy. This paper suggests a strategic game engine that applies non-monotonic reasoning and inductive machine learning. The engine emphasizes three components -“user behavior monitor”to abstract user`s objects behavior,“learning engine”to learn user`s strategy,“behavior display handler”to reflect abstracted behavior of computer objects on game. Especially, this paper proposes two layered-structure to apply non-monotonic reasoning and inductive learning to make behaviors of computer objects that learns strategy behaviors of user objects exactly, and corresponds in user`s objects. The engine decides actions and strategies of computer objects with created information through inductive learning. Main contribution of this paper is that computer objects command excellent strategies and reveal differentiation with behavior of existing computer objects to apply non-monotonic reasoning and inductive machine learning.
Supporting Media using XML-based Messages on Online Conversational Activity
Kim, Kyung-Deok ;
The KIPS Transactions:PartB, volume 11B, issue 1, 2004, Pages 91~98
DOI : 10.3745/KIPSTB.2004.11B.1.091
This paper proposes how to support various media on online conversational activity using XML(extensible Markup Language). The method converts media information into XML based messages and handles alike conventional text based messages. The XML based messages are unified to an XML document, and then a HTML document is generated using the XML and an XSLT documents in a server. A user in each client can play or present media through the hyperlink that is associated media information on the HTML document. The suggested method supports use of various media (text, image, audio, video, documents, etc) and efficient maintenance of font size, color, and style on messages according to extension and modification of XML tags. For application, this paper implemented the system to support media that has client and server architecture on online conversational activity. A user in each client inputs text or media based message using JAVA applet and servlet on the system, and conversational messages on every users` interfaces are automatically updated whenever a user inputs new message. Media on conversational messages are played or presented according to a user`s click on hyperlink. Applications for the media presentation are as follows : distance learning, online game, collaboration, etc.
A Study On Generation and Reduction of the Notation Candidate for the Notation Restoration of Korean Phonetic Value
Rhee, Sang-Burm ; Park, Sung-Hyun ;
The KIPS Transactions:PartB, volume 11B, issue 1, 2004, Pages 99~106
DOI : 10.3745/KIPSTB.2004.11B.1.099
The syllable restoration is a process restoring a phonetic value recognized in a speech recognition device with the notation form that a vocalization is former. In this paper a syllable restoration rule was composed of a based on standard pronunciation for a syllable restoration process. A syllable restoring regulation was used, and a generation method of a notation candidate set was researched. Also, A study is held to reduce the number of created notation candidate. Three phases of reduction processes were suggested. Reduction of a notation candidate has the non-notation syllable, non-vocabulary syllable and non-stem syllable. As a result of experiment, an average of 74％ notation candidate decrease rates were shown.
ISAAC : An Integrated System with User Interface for Sentence Analysis
Kim, Gon ; Kim, Min-Chan ; Bae, Jae-Hak ; Lee, Jong-Hyeok ;
The KIPS Transactions:PartB, volume 11B, issue 1, 2004, Pages 107~116
DOI : 10.3745/KIPSTB.2004.11B.1.107
This paper introduces ISAAC (An Interface for Sentence Analysis & Abstraction with Cogitation) which provides an integrated user interface for sentence analysis. Into ISAAC, the various linguistic tools and resources are integrated. They are necessary for sentence analysis. Most of the tools and resources for sentence analysis are developed and accumulated independently. In the sentence analyzing with these tools and resources, it is difficult for sentence analyst to manage and control information which is taken on each step. In this respect, we have integrated the usable tools and resources, and made ISAAC to provide the consistent user oriented interface to each function. We have been able to divide sentence analysis process Into 14 steps. In ISAAC, these steps are processed by four individual modules
syntactic analysis of sentence,
retrieval of a root word,
searching category information in Roget s Thesaurus, and
searching category information in OfN(Ontology for Narratives). Therefore, in case of sentence analysis with ISAAC, the process of total 14 steps falls into 4 steps. This means that it is able to improve the performance of sentence analyst to the extent 3.5 times or more. Furthermore, ISAAC undertaking tedious transcription needed to process each step, we expect that ISAAC can help the analyst to maintain the accuracy of sentence analysis.
An Efficient Algorithm for NaiveBayes with Matrix Transposition
Lee, Jae-Moon ;
The KIPS Transactions:PartB, volume 11B, issue 1, 2004, Pages 117~124
DOI : 10.3745/KIPSTB.2004.11B.1.117
This paper proposes an efficient algorithm of NaiveBayes without loss of its accuracy. The proposed method uses the transposition of category vectors, and minimizes the computation of the probability of NaiveBayes. The proposed method was implemented on the existing framework of the text categorization, so called, AI::Categorizer and it was compared with the conventional NaiveBayes with the well-known data, Router-21578. The comparisons show that the proposed method outperforms NaiveBayes about two times with respect to the executing time.