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 9B, Issue 6 - Dec 2002
Volume 9B, Issue 5 - Oct 2002
Volume 9B, Issue 4 - Aug 2002
Volume 9B, Issue 3 - Jun 2002
Volume 9B, Issue 2 - Apr 2002
Volume 9B, Issue 1 - Feb 2002
Selecting the target year
Performance Improvement of the Intelligent System for the Fire Fighting Control using Rule-based and Case-based Reasoning by Clustering in a Ship
Hyeon, U-Seok ;
The KIPS Transactions:PartB, volume 9B, issue 3, 2002, Pages 263~270
DOI : 10.3745/KIPSTB.2002.9B.3.263
Most conventional systems of fire fighting control in a ship have been based on rule-based system in which expert knowledges are expressed with production rules. Renewing and adding of rules is needed continuously for the improvement of the system capability in an already build-up system and such adding and renewing procedures could hinder users from fluent utilization of a system. The author proposes an advanced fire fighting control intelligent system (A-FFIS) using rule-based and carte-based reasoning by clustering to implement conventional hybrid system (H-FFIS). Compared with H-FFIS, new approach with A-FFIS shows that the system proposed here improves fire detection rate and reduces fire detection time.
Computation of Noncentral F Probabilities using multilayer neural network
Gu, Sun-Hee ;
The KIPS Transactions:PartB, volume 9B, issue 3, 2002, Pages 271~276
DOI : 10.3745/KIPSTB.2002.9B.3.271
The test statistic in ANOVA tests has a single or doubly noncentral F distribution and the noncentral F distribution is applied to the calculation of the power functions of tests of general linear hypotheses. Although various approximations of noncentral F distribution are suggested, they are troublesome to compute. In this paper, the calculation of noncentral F distribution is applied to the neural network theory, to solve the computation problem. The neural network consists of the multi-layer perceptron structure and learning process has the algorithm of the backpropagation. Using fables and figs, comparisons are made between the results obtained by neural network theory and the Patnaik`s values. Regarding of accuracy and calculation, the results by neural network are efficient than the Patnaik`s values.
Time Series Perturbation Modeling Algorithm : Combination of Genetic Programming and Quantum Mechanical Perturbation Theory
Lee, Geum-Yong ;
The KIPS Transactions:PartB, volume 9B, issue 3, 2002, Pages 277~286
DOI : 10.3745/KIPSTB.2002.9B.3.277
Genetic programming (GP) has been combined with quantum mechanical perturbation theory to make a new algorithm to construct mathematical models and perform predictions for chaotic time series from real world. Procedural similarities between time series modeling and perturbation theory to solve quantum mechanical wave equations are discussed, and the exemplary GP approach for implementing them is proposed. The approach is based on multiple populations and uses orthogonal functions for GP function set. GP is applied to original time series to get the first mathematical model. Numerical values of the model are subtracted from the original time series data to form a residual time series which is again subject to GP modeling procedure. The process is repeated until predetermined terminating conditions are met. The algorithm has been successfully applied to construct highly effective mathematical models for many real world chaotic time series. Comparisons with other methodologies and topics for further study are also introduced.
A Study on the Design of Telemedicine System Using Image Division Communication
Joung, Ki-Bong ; Oh, Moo-Song ;
The KIPS Transactions:PartB, volume 9B, issue 3, 2002, Pages 287~292
DOI : 10.3745/KIPSTB.2002.9B.3.287
In general cases, the conventional internet connected to a terrestrial network is transmit too large medical images. To overcome this low speed transmitting rate problem of the interned, we have studied about an image division communication system as a fast telemedicine system. The image division communication system was 5-10 times faster than the conventional terrestrial internet link. Also we have developed a Web-based telemedicine system that can access every permitted server of hospitals via the internet. Studied image division communication corrected problem of other reflex quality decline in erratic transmission of reflex by transmission speed imbalance that is problem of single communication techniques that used in existing reflex transmission. Also, could keep quality state of fixed reflex gouge abnormal transmission speed. Visual Basic and C++, ASP programming techniques were used to make our system and it can access and retrieve medical information and image through only public web browse such as internet explorer without additional specific tools. To increase the transmitting speed of our telemedicine system, JPEG method was used. In conclusion, we were able to develop a fast and public telemedicine system using the proposed image division communication system and Web technology. Image division communication system technology increased the speed of the conventional internet and Web technology extended the scope of use for telemedicine system from intrahospital to public use.
Gradual scene change detection using Cut frame difference and Dynamic threshold
Yeum, Sun-Ju ; Kim, Woo-Saeng ;
The KIPS Transactions:PartB, volume 9B, issue 3, 2002, Pages 293~302
DOI : 10.3745/KIPSTB.2002.9B.3.293
Gradual scene change detection is known as more difficult problem then abrupt scene change detection on video data analysis for contents based retrieval. In this paper, we present a new method for scene change detection far both abrupt and gradual change using the variable dynamic threshold arid cut frame difference (CFD). For this, We present the characteristics arid mathematical models of gradual transitions anti then, how can be detected by the CFD. And also we present new scene change detection algorithm based on cut frame difference. By the experimental result using real world video data indicate that the proposed method detect various scene changes both abrupt and gradual change efficiently without time-consuming computation and any dependency on a kind of gradual change effects.
Playback Quantity-based Proxy Caching Scheme for Continuous Media Data
Hong, Hyeon-Ok ; Im, Eun-Ji ; Jeong, Gi-Dong ;
The KIPS Transactions:PartB, volume 9B, issue 3, 2002, Pages 303~310
DOI : 10.3745/KIPSTB.2002.9B.3.303
In this paper, we propose a proxy caching scheme that stores a portion of a continuous media object or an entire object on the Internet. The proxy stores the initial fraction of a continuous media object and determines the optimal size of the initial fraction of the continuous media object to be cached based on the object popularity. Under the proposed scheme, the initial latency of most clients and the data transferred from a remote server can be reduced and limited cache storage space can be utilized efficiently. Considering the characteristics of continuous media, we also propose the novel popularity for the continuous media objects based on the amount of the data of each object played by the clients. Finally, we have performed trace-driven simulations to evaluate our caching scheme and the popularity for the continuous media objects. Through these simulations, we have verified that our caching scheme, PPC outperforms other well-known caching schemes in terms of BHR, DSR and replacement and that popularity for the continuous media objects based on the amount of the playback data can enhance the performance of caching scheme.
Document Image Layout Analysis Using Image Filters and Constrained Conditions
Jang, Dae-Geun ; Hwang, Chan-Sik ;
The KIPS Transactions:PartB, volume 9B, issue 3, 2002, Pages 311~318
DOI : 10.3745/KIPSTB.2002.9B.3.311
Document image layout analysis contains the process to segment document image into detailed regions and the process to classify the segmented regions into text, picture, table or etc. In the region classification process, the size of a region, the density of black pixels, and the complexity of pixel distribution are the bases of region classification. But in case of picture, the ranges of these bases are so wide that it`s difficult to decide the classification threshold between picture and others. As a result, the picture has a higher region classification error than others. In this paper, we propose document image layout analysis method which has a better performance for the picture and text region classification than that of previous methods including commercial softwares. In the picture and text region classification, median filter is used in order to reduce the influence of the size of a region, the density of black pixels, and the complexity of pixel distribution. Futhermore the classification error is corrected by the use of region expanding filter and constrained conditions.
A Design of Clustering Classification Systems using Satellite Remote Sensing Images Based on Design Patterns
Kim, Dong-Yeon ; Kim, Jin-Il ;
The KIPS Transactions:PartB, volume 9B, issue 3, 2002, Pages 319~326
DOI : 10.3745/KIPSTB.2002.9B.3.319
In this paper, we have designed and implemented cluttering classification systems- unsupervised classifiers-for the processing of satellite remote sensing images. Implemented systems adopt various design patterns which include a factory pattern and a strategy pattern to support various satellite images`formats and to design compatible systems. The clustering systems consist of sequential clustering, K-Means clustering, ISODATA clustering and Fuzzy C-Means clustering classifiers. The systems are tested by using a Landsat TM satellite image for the classification input. As results, these clustering systems are well designed to extract sample data for the classification of satellite images of which there is no previous knowledge. The systems can be provided with real-time base clustering tools, compatibilities and components` reusabilities as well.
Multiple Texture Image Recognition with Unsupervised Block-based Clustering
Lee, Woo-Beom ; Kim, Wook-Hyun ;
The KIPS Transactions:PartB, volume 9B, issue 3, 2002, Pages 327~336
DOI : 10.3745/KIPSTB.2002.9B.3.327
Texture analysis is an important technique in many image understanding areas, such as perception of surface, object, shape and depth. But the previous works are intend to the issue of only texture segment, that is not capable of acquiring recognition information. No unsupervised method is basased on the recognition of texture in image. we propose a novel approach for efficient texture image analysis that uses unsupervised learning schemes for the texture recognition. The self-organization neural network for multiple texture image identification is based on block-based clustering and merging. The texture features used are the angle and magnitude in orientation-field that might be different from the sample textures. In order to show the performance of the proposed system, After we have attempted to build a various texture images. The final segmentation is achieved by using efficient edge detection algorithm applying to block-based dilation. The experimental results show that the performance of the system Is very successful.
Adaptive Image Labeling Algorithm Using Non-recursive Flood-Fill Algorithm
Kim, Do-Hyeon ; Gang, Dong-Gu ; Cha, Ui-Yeong ;
The KIPS Transactions:PartB, volume 9B, issue 3, 2002, Pages 337~342
DOI : 10.3745/KIPSTB.2002.9B.3.337
This paper proposes a new adaptive image labeling algorithm fur object analysis of the binary images. The proposed labeling algorithm need not merge/order of complex equivalent labels like classical labeling algorithm and the processing is done during only 1 Pass. In addition, this algorithm can be extended for gray-level image easily. Experiment result with HIPR image library shows that the proposed algorithm process more than 2 times laster than compared algorithm.
Fast Scene Change Detection Algorithm in MPEG Compressed Video by Minimal Decoding
Kim, Gang-Uk ; Lee, Jae-Seung ; Kim, Jong-Hun ; Hwang, Chan-Sik ;
The KIPS Transactions:PartB, volume 9B, issue 3, 2002, Pages 343~350
DOI : 10.3745/KIPSTB.2002.9B.3.343
A scene change detection which involves finding a cut between two consecutive shots is an important step for video indexing and retrieval. This paper proposes an algorithm for fast and accurate detection of abrupt scene changes in an MPEG compressed domain with minimal decoding requirements arid computational effort. The proposed method compares two successive DC images of I-frames for finding the GOP (group of picture) which contain a scene change and uses macroblock-coded type information contained in B-frames to detect the exact frame where the scene change occurred. The experiment results demonstrate that the proposed algorithm has better detection performance, such as precision and recall rate, than the existing method using all DC images. The algorithm has the advantage of speed, simplicity and accuracy. In addition, it requires less amount of storage.
Wavelet based video coding with spatial band coding
Park, Min-Seon ; Park, Sang-Ju ;
The KIPS Transactions:PartB, volume 9B, issue 3, 2002, Pages 351~358
DOI : 10.3745/KIPSTB.2002.9B.3.351
Video compression based on DCT (Discrete Cosine Transform) has weakpoints of blocking artifacts and pixel loss when the resolution is changed. DWT (Discrete Wavelet Transform) based method can overcome such problems. In SAMCoW (Scalable Adaptive Motion Compensation Wavelet), one of wavelet based video coding algorithm, both intra frames and motion compensated error frames are encoded using EZW(Embedded Zerotree Wavelet) algorithm. However the property of wavelets transform coefficients of motion compensated error frames are different from that of still images. Signal energy is not highly concentrated in the lower bands which is true for most still image cases. Signal energy is rather evenly distributed over all frequency bands. This paper suggests a new video coding algorithm utilizing these properties. Spatial band coding which is known to be very effective for encoding images with relative1y high frequency components and not utilizing the interband coefficients correlation is applied instead of EZW to encode both intra and inter frames. In spatial band coding, the position and value of significant wavelet coefficients in each band are progressively transmitted. Unlike EZW, inter band coefficients correlations are not utilized in spatial band coding. It has been shown that spatial band coding gives better performance than EZW when applied to wavelet based video compression.
A Study on Effective Moving Object Segmentation and Fast Tracking Algorithm
Jo, Yeong-Seok ; Lee, Ju-Sin ;
The KIPS Transactions:PartB, volume 9B, issue 3, 2002, Pages 359~368
DOI : 10.3745/KIPSTB.2002.9B.3.359
In this paper, we propose effective boundary line extraction algorithm for moving objects by matching error image and moving vectors, and fast tracking algorithm for moving object by partial boundary lines. We extracted boundary line for moving object by generating seeds with probability distribution function based on Watershed algorithm, and by extracting boundary line for moving objects through extending seeds, and then by using moving vectors. We processed tracking algorithm for moving object by using a part of boundary lines as features. We set up a part of every-direction boundary line for moving object as the initial feature vectors for moving objects. Then, we tracked moving object within current frames by using feature vector for the previous frames. As the result of the simulation for tracking moving object on the real images, we found that tracking processing of the proposed algorithm was simple due to tracking boundary line only for moving object as a feature, in contrast to the traditional tracking algorithm for active contour line that have varying processing cost with the length of boundary line. The operations was reduced about 39% as contrasted with the full search BMA. Tracking error was less than 4 pixel when the feature vector was
through the information of every-direction boundary line. The proposed algorithm just needed 200 times of search operation.
A Vehicle License Plate Recognition Using Intensity Variation and Geometric Pattern Vector
Lee, Eung-Ju ; Seok, Yeong-Su ;
The KIPS Transactions:PartB, volume 9B, issue 3, 2002, Pages 369~374
DOI : 10.3745/KIPSTB.2002.9B.3.369
In this paper, we propose the react-time car license plate recognition algorithm using intensity variation and geometric pattern vector. Generally, difference of car license plate region between character and background is more noticeable than other regions. And also, car license plate region usually shows high density values as well as constant intensity variations. Based on these characteristics, we first extract car license plate region using intensity variations. Secondly, lightness compensation process is performed on the considerably dark and brightness input images to acquire constant extraction efficiency. In the proposed recognition step, we first pre-process noise reduction and thinning steps. And also, we use geometric pattern vector to extract features which independent on the size, translation, and rotation of input values. In the experimental results, the proposed method shows better computation times than conventional circular pattern vector and better extraction results regardless of irregular environment lighting conditions as well as noise, size, and location of plate.
A Study on Stroke Extraction for Handwritten Korean Character Recognition
Choi, Young-Kyoo ; Rhee, Sang-Burm ;
The KIPS Transactions:PartB, volume 9B, issue 3, 2002, Pages 375~382
DOI : 10.3745/KIPSTB.2002.9B.3.375
such as a tablet board. On the contrary, Any dynamic information can not be acquired in off-line handwritten character recognition since there are extreme overlapping between consonants and vowels, and heavily noisy images between strokes, which change the recognition performance with the result of the preprocessing. This paper proposes a method that effectively extracts the stroke including dynamic information of characters for off-line Korean handwritten character recognition. First of all, this method makes improvement and binarization of input handwritten character image as preprocessing procedure using watershed algorithm. The next procedure is extraction of skeleton by using the transformed Lu and Wang`s thinning: algorithm, and segment pixel way is extracted by abstracting the feature point of the characters. Then, the vectorization is executed with a maximum permission error method. In the case that a few strokes are bound in a segment, a segment pixel array is divided with two or more segment vectors. In order to reconstruct the extracted segment vector with a complete stroke, the directional component of the vector is mortified by using right-hand writing coordinate system. With combination of segment vectors which are adjacent and can be combined, the reconstruction of complete stroke is made out which is suitable for character recognition. As experimentation, it is verified that the proposed method is suitable for handwritten Korean character recognition.
Implementation of a Spatial Parser Generator SPG
Jeong, Seok-Tae ; Jeong, Seong-Tae ;
The KIPS Transactions:PartB, volume 9B, issue 3, 2002, Pages 383~388
DOI : 10.3745/KIPSTB.2002.9B.3.383
We developed a spatial parser generator, SPG, which can automatically create a spatial parser if CMG(Constraint Multiset Grammars) grammars for a visual language are provided by the user with GUI(Graphical User Interface). SPG has the following features. (1) The user uses a visual editor to define the grammars of a virtual language and draw the visual language which should be parsed. (2) The user roughly defines CMG grammars in a visual wan at first. Then the user modifies them and defines final grammars. (3) Because SPG has a constraint solver, it maintains constraints in the parsed virtual language according to the grammars.