• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.603-607
• /
• 2003

The judgment of forged passports plays an important role in the immigration control system, for which the automatic and accurate processing is required because of the rapid increase of travelers. So, as the preprocessing phase for the judgment of forged passports, this paper proposed the novel method for the recognition of passport based on the fuzzy binarization and the fuzzy RBF neural network newly proposed. first, for the extraction of individual codes being recognized, the paper extracts code sequence blocks including individual codes by applying the Sobel masking, the horizontal smearing and the contour tracking algorithm in turn to the passport image, binarizes the extracted blocks by using the fuzzy binarization based on the membership function of trapezoid type, and, as the last step, recovers and extracts individual codes from the binarized areas by applying the CDM masking and the vertical smearing. Next, the paper proposed the enhanced fuzzy RBF neural network that adapts the enhanced fuzzy ART network to the middle layer and applied to the recognition of individual codes. The results of the experiment for performance evaluation on the real passport images showed that the proposed method in the paper has the improved performance in the recognition of passport.

• Communications for Statistical Applications and Methods
• /
• v.15 no.4
• /
• pp.517-530
• /
• 2008

In this paper we introduce a time series model using the triangle fuzzy numbers in order to construct a statistical relation for the data which is a sequence of observations which are ordered in time. To estimate the proposed fuzzy model we split of a universal set includes all observation into closed intervals and determine a number and length of the closed interval by the frequency of events belong to the interval. Also we forecast the data by using a difference between observations when the fuzzified numbers equal at successive times. To investigate the efficiency of the proposed model we compare the ordinal and the fuzzy time series model using examples.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.15 no.3
• /
• pp.145-152
• /
• 2015

We consider an online selective-sample learning problem for sequence classification, where the goal is to learn a predictive model using a stream of data samples whose class labels can be selectively queried by the algorithm. Given that there is a limit to the total number of queries permitted, the key issue is choosing the most informative and salient samples for their class labels to be queried. Recently, several aggressive selective-sample algorithms have been proposed under a linear model for static (non-sequential) binary classification. We extend the idea to hidden Markov models for multi-class sequence classification by introducing reasonable measures for the novelty and prediction confidence of the incoming sample with respect to the current model, on which the query decision is based. For several sequence classification datasets/tasks in online learning setups, we demonstrate the effectiveness of the proposed approach.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.10a
• /
• pp.313-320
• /
• 1999

In this paper, a translation, rotation and scale invariant system for the classification of closed 2D images using the bispectrum of a contour sequence and the weighted fuzzy mean method is derived and compared with the classification process using one of the competitive neural algorithm, called a LVQ(Learning Vector Quantization). The bispectrun based on third order cumulants is applied to the contour sequences of the images to extract fifteen feature vectors for each planar image. These bispectral feature vectors, which are invariant to shape translation, rotation and scale transformation, can be used to represent two-dimensional planar images and are fed into an classifier using weighted fuzzy mean method. The experimental processes with eight different shapes of aircraft images are presented to illustrate the high performance of the proposed classifier.

• Journal of applied mathematics & informatics
• /
• v.32 no.1_2
• /
• pp.55-60
• /
• 2014

In this paper, we will obtain Marcinkiewicz's type limit laws for fuzzy random sets as follows : Let {$X_n{\mid}n{\geq}1$} be a sequence of independent identically distributed fuzzy random sets and $E{\parallel}X_i{\parallel}^r_{{\rho_p}}$ < ${\infty}$ with $1{\leq}r{\leq}2$. Then the following are equivalent: $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ a.s. in the metric ${\rho}_p$ if and only if $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ in probability in the metric ${\rho}_p$ if and only if $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ in $L_1$ if and only if $S_n/n^{\frac{1}{r}}{\rightarrow}{\tilde{0}}$ in $L_r$ where $S_n={\Sigma}^n_{i=1}\;X_i$.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.11
• /
• pp.130-137
• /
• 1992

This paper presents the word recognition method using a neural-fuzzy pattern matching, in order to make a proper speech pattern for a spectrum sequence and to improve a recognition rate. In this method, a frequency variation is reduced by generating binary spectrum patterns through associative memory using a neural network, and a time variation is decreased by measuring the simillarity using a fuzzy pattern matching. For this method using binary spectrum patterns and logic algebraic operations to measure the simillarity, memory capacity and computation requirements are far less than those of DTW using a conventional distortion measure. To show the validity of the recognition performance for this method, word recognition experiments are carried out using 28 DDD city names and compared with DTW and a fuzzy pattern matching. The results show that our presented method is more excellent in the recognition performance than the other methods.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.04a
• /
• pp.7-10
• /
• 2007

This paper presents a fuzzy footstep planner for humanoid robots in complex environments. First, we define locomotion primitives for humanoid robots. A global planner finds a global path from a navigation map that is generated based on a combination of 2.5 dimensional maps of the 3D workspace. A local planner searches for an optimal sequence of locomotion primitives along the global path by using fuzzy footstep planning. We verify our approach on a virtual humanoid robot in a simulated environment. Simulation results show a reduction in planning time and the feasibility of the proposed method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.488-491
• /
• 2003

A motion compression method by min s-norm composite fuzzy relational equations (dual-MCF) is proposed, where a motion sequence is divided into intra-pictures (I-pictures) and predictive-pictures (P-pictures). The I-pictures and the P-pictures are compressed by using uniform coders and non-uniform coders, respectively. A design method of non-uniform coders is proposed to perform an efficient compression and reconstruction of the P-pictures, based on the dual overlap level of fuzzy sets and a fuzzy equalization. An experiment using 10 P-pictures confirms that the root means square errors of the proposed method is decreased to 82.9％ of that of the uniform coders, under the condition that the compression rate is 0.0055. An experiment of motion compression and reconstruction is also presented to confirm the effectiveness of the dual-MCF based on the non-uniform coders.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.750-755
• /
• 1998

Due to the temporal spatial correlation of the image sequence, the motion vector of a block is highly related to the motion vectors of its adjacent blocks in the same image frame. If we can obtain useful and enough information from the adjacent motion vectors, the total number of search points used to find the motion vector of the block may be reduced significantly. Using that idea, an efficient fuzzy prediction search (FPS) algorithm for block motion estimation is proposed in this paper. Based on the fuzzy inference process, the FPS can determine the motion vectors of image blocks quickly and correctly.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.49-54
• /
• 2009

A fuzzy weighted mean method on a 2D shape recognition system is introduced in this paper. The bispectrum based on third order cumulant is applied to the contour sequence of each image for the extraction of a feature vector. This bispectral feature vector, which is invariant to shape translation, rotation and scale, represents a 2D planar image. However, to obtain the best performance, it should be considered certain criterion on the calculation of weights for the fuzzy weighted mean method. Therefore, a new method to calculate weights using means by differences of feature values and their variances with the maximum distance from differences of feature values. is developed. In the experiments, the recognition results with fifteen dimensional bispectral feature vectors, which are extracted from 11.808 aircraft images based on eight different styles of reference images, are compared and analyzed.