• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.3121-3143
• /
• 2019

Segmentation plays an important role in the field of image processing and computer vision. Intuitionistic fuzzy C-means (IFCM) clustering algorithm emerged as an effective technique for image segmentation in recent years. However, standard fuzzy C-means (FCM) and IFCM algorithms are sensitive to noise and initial cluster centers, and they ignore the spatial relationship of pixels. In view of these shortcomings, an improved algorithm based on IFCM is proposed in this paper. Firstly, we propose a modified non-membership function to generate intuitionistic fuzzy set and a method of determining initial clustering centers based on grayscale features, they highlight the effect of uncertainty in intuitionistic fuzzy set and improve the robustness to noise. Secondly, an improved nonlinear kernel function is proposed to map data into kernel space to measure the distance between data and the cluster centers more accurately. Thirdly, the local spatial-gray information measure is introduced, which considers membership degree, gray features and spatial position information at the same time. Finally, we propose a new measure of intuitionistic fuzzy entropy, it takes into account fuzziness and intuition of intuitionistic fuzzy set. The experimental results show that compared with other IFCM based algorithms, the proposed algorithm has better segmentation and clustering performance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.771-789
• /
• 2019

Text detection has been a popular research topic in the field of computer vision. It is difficult for prevalent text detection algorithms to avoid the dependence on datasets. To overcome this problem, we proposed a novel unsupervised text detection algorithm inspired by bootstrap learning. Firstly, the text candidate in a novel form of superpixel is proposed to improve the text recall rate by image segmentation. Secondly, we propose a unique text sample selection model (TSSM) to extract text samples from the current image and eliminate database dependency. Specifically, to improve the precision of samples, we combine maximally stable extremal regions (MSERs) and the saliency map to generate sample reference maps with a double threshold scheme. Finally, a multiple kernel boosting method is developed to generate a strong text classifier by combining multiple single kernel SVMs based on the samples selected from TSSM. Experimental results on standard datasets demonstrate that our text detection method is robust to complex backgrounds and multilingual text and shows stable performance on different standard datasets.

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

A cascade structured neural network called Sigma-Pi$_{t}$ Cascaded Hybrid Neural Network ($\sigma$$\pi$$_{t}$-CHNN) is Proposed. It is an extended version of the Sigma-Pi Cascaded extended Hybrid Neural Network ($\sigma$$\pi$-CHNN), where the classical multiplicative neuron ($\pi$-neuron) is replaced by the translated multiplicative ($\pi$$_{t}$-neuron) model. The learning algorithm of $\sigma$$\pi$$_{t}$-CHNN is composed of an evolutionary programming method, responsible for determining the network architecture, and of a Levenberg-Marquadt algorithm, responsible for tuning the weights of the network. The $\sigma$$\pi$$_{t}$-CHNN is evaluated in 2 pattern classification problems: the 2 spirals and the sonar problems. In the 2 spirals problem, $\sigma$$\pi$$_{t}$-CHNN can generate neural networks with 10％ less hidden neurons than that in previous neural models. In the sonar problem, $\sigma$$\pi$$_{t}$-CHNN can find the optimal solution for the problem i.e., a network with no hidden neurons. These results confirm the expanded information processing capabilities of $\sigma$$\pi$$_{t}$-CHNN, when compared to previous neural network models. network models.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.2 no.1
• /
• pp.38-42
• /
• 2002

A fast iterative solving method of fuzzy relational equation is proposed. It is derived by eliminating a redundant comparison process in the conventional iterative solving method (Pedrycz, 1983). The proposed method is applied to image reconstruction, and confirmed that the computation time is decreased to 1 / 40 with the compression rate of 0.0625. Furthermore, in order to make any initial solution converge on a reconstructed image with a good quality, a new cost function is proposed. Under the condition that the compression rate is 0.0625, it is confirmed that the root mean square error of the proposed method decreases to 27.34% and 86.27% compared with those of the conventional iterative method and a non iterative image reconstruction method, respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3685-3700
• /
• 2015

To avoid influences caused by pose, illumination and facial expression variations, we propose a robust three-step algorithm based on ASM and POEM for facial landmark localization. Firstly, Model Selection Factor is utilized to achieve a pose-free initialized shape. Then, we use the global shape model of ASM to describe the whole face and the texture model POEM to adjust the position of each landmark. Thirdly, a second localization is presented to discriminatively refine the subtle shape variation for some organs and contours. Experiments are conducted in four main face datasets, and the results demonstrate that the proposed method accurately localizes facial landmarks and outperforms other state-of-the-art methods.

• Computational Structural Engineering
• /
• v.33 no.1
• /
• pp.20-22
• /
• 2020

• Computational Structural Engineering
• /
• v.32 no.4
• /
• pp.11-16
• /
• 2019

• Computational Structural Engineering
• /
• v.34 no.3
• /
• pp.4-9
• /
• 2021

• Journal of The Korean Association of Information Education
• /
• v.25 no.6
• /
• pp.927-934
• /
• 2021

AI(Artificial intelligence) is gradually taking up a large part of our lives, and the pace of AI development is accelerating. It is called ACT that develop students' computational thinking in the way artificial intelligence learns. Among ACTs, pattern recognition is an essential factor in efficiently solving problems. Pattern analysis is part of the pattern recognition process. In fact, Netflix's personalized movie recommendation service and what it named Covid-19 after repeated symptoms are all the results of pattern analysis. While the importance of ACT, including pattern recognition, is highlighted, software education for kindergarten and elementary school lower grades is much insufficient compared to foreign countries. Therefore, this study aims to design and develop textbooks for the development of artificial intelligence-based computational thinking through pattern analysis for kindergarten students.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.14 no.4
• /
• pp.256-267
• /
• 2014

An automatic switch among ensembles of clustering algorithms is proposed as a part of the bibliographic big data retrieval system by utilizing a fuzzy inference engine as a decision support tool to select the fastest performing clustering algorithm between fuzzy C-means (FCM) clustering, Newman-Girvan clustering, and the combination of both. It aims to realize the best clustering performance with the reduction of computational complexity from O($n^3$) to O(n). The automatic switch is developed by using fuzzy logic controller written in Java and accepts 3 inputs from each clustering result, i.e., number of clusters, number of vertices, and time taken to complete the clustering process. The experimental results on PC (Intel Core i5-3210M at 2.50 GHz) demonstrates that the combination of both clustering algorithms is selected as the best performing algorithm in 20 out of 27 cases with the highest percentage of 83.99%, completed in 161 seconds. The self-adapted FCM is selected as the best performing algorithm in 4 cases and the Newman-Girvan is selected in 3 cases.The automatic switch is to be incorporated into the bibliographic big data retrieval system that focuses on visualization of fuzzy relationship using hybrid approach combining FCM and Newman-Girvan algorithm, and is planning to be released to the public through the Internet.