• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.2
• /
• pp.366-373
• /
• 2017

In this paper, we propose a variable weighted average (VWA) learning method in order to improve the performance of the fuzzy ART neural network that has been developed by Grossberg. In a conventional method, the Fast Commit Slow Recode (FCSR), when an input pattern falls in a category, the representative pattern of the category is updated at a fixed learning rate regardless of the degree of similarity of the input pattern. To resolve this issue, a variable learning method proposes reflecting the distance between the input pattern and the representative pattern to reduce the FCSR's category proliferation issue and improve the pattern recognition rate. However, these methods still suffer from the category proliferation issue and limited pattern recognition rate due to inevitable excessive learning created by use of fuzzy AND. The proposed method applies a weighted average learning scheme that reflects the distance between the input pattern and the representative pattern when updating the representative pattern of a category suppressing excessive learning for a representative pattern. Our simulation results show that the newly proposed variable weighted average learning method (VWA) mitigates the category proliferation problem of a fuzzy ART neural network by suppressing excessive learning of a representative pattern in a noisy environment and significantly improves the pattern recognition rates.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.4
• /
• pp.47-60
• /
• 2011

With the increase in the use of mobile banking service, mobile banking has become an attractive target to attackers. Even though many security measures are applied to the current mobile banking service, some threats such as physical theft or penetration to a mobile device from remote side are still remained as unsolved. With aiming to fill this void, we propose a novel approach to prevent e-financial incidents by analyzing mobile device user's input patterns. This approach helps us to distinguish between original user's usage and attacker's usage through analyzing personal input patterns such as input time-interval, finger pressure level on the touch screen. Our proposed method shows high accuracy, and is effective to prevent the e-finance incidents proactively.

• The Journal of Information Technology
• /
• v.5 no.2
• /
• pp.17-26
• /
• 2002

On this paper, we propose SOSL(Self-Organized Supervised Learning) and it's architecture SOSL is hybrid type neural network. It consists of several CBP (Component Back Propagation) neural networks, and a modified PCA neural networks. CBP neural networks perform supervised learning procedure in parallel to clustered and complex input patterns. Modified PCA networks perform it's learning in order to transform dimensions of original input patterns to lower dimensions by clustering and local projection. Proposed SOSL can effectively apply to neural network learning with large input patterns results in huge networks size.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.14 no.5
• /
• pp.15-21
• /
• 1977

The syntactic pattern recognition system of Korean characters is composed of three main functional parts; Preprocessing, Graph-representation, and Segmentation. In preprocessing routine, the input pattern has been thinned using the Hilditch's thinning algorithm. The graph-representation is the detection of a number of nodes over the input pattern and codification of branches between nodes by 8 directional components. Next, segmentation routine which has been implemented by top down nondeterministic parsing under the control of tree grammar identifies parts of the graph-represented Pattern as basic components of Korean characters. The authors have made sure that this system is effective for recognizing Korean characters through the recognition simulations by digital computer.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2012.05a
• /
• pp.387-388
• /
• 2012

본 논문에서는 사람들의 키 입력 패턴은 각자 고유한 패턴을 지니고 있다는 점에서 시작한다. 즉, 키스트로크 기반 사용자 인증이라는 방식의 사용자 인증이 존재하고 있다. 다만 키 입력 패턴을 통한 사용자를 인증할 때의 정확도가 문제가 될 것인데, 본 논문에서는 다수의 사람들에게 다수의 단어를 입력하게 하였을 시 각 단어마다 가장 긴 지연을 지니고 있는 구간이 존재한다는 것을 가정으로 하였다. 정확도 향상의 문제를 해결하기 위해서 키 입력시 가장 긴 지연을 가지는 구간에 지연시간별로 특수문자를 추가시켜 줌으로서 단순한 조합의 비밀번호를 좀 더 강력하게 만들 수 있었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11B
• /
• pp.1020-1029
• /
• 2008

This paper proposes an high speed pattern matching algorithm and its implementation. The pattern matcher is used to check patterns from realtime input packet. The proposed algorithm can find exact string, range of string values, and combination of string values from input packet at high speed. Given string and rule set are modelled as a state transition graph which can find overlapped strings simultaneously, and the state transition graph is partitioned according to input implicants to reduce implementation complexity. The pattern matcher scheme uses the transformed state transition graph and input packet as an input. The pattern matcher was modelled and implemented in VHDL language. Experimental results show the proprieties of the proposed approach.

• Journal of Korea Multimedia Society
• /
• v.9 no.9
• /
• pp.1118-1130
• /
• 2006

Existed pattern analysis algorithms in data streams environment have researched performance improvement and effective memory usage. But when new data streams come, existed pattern analysis algorithms have to analyze patterns again and have to generate pattern tree again. This approach needs many calculations in real situation that needs real time pattern analysis. This paper proposes a method that continuously analyzes patterns of incoming data streams in real time. This method analyzes patterns fast, and thereafter obtains real time patterns by updating previously analyzed patterns. The incoming data streams are divided into several sequences based on time based window. Informations of the sequences are inputted into a hash table. When the number of the sequences are over predefined bound, patterns are analyzed from the hash table. The patterns form a pattern tree, and later created new patterns update the pattern tree. In this way, real time patterns are always maintained in the pattern tree. During pattern analysis, suffixes of both new pattern and existed pattern in the tree can be same. Then a pointer is created from the new pattern to the existed pattern. This method reduce calculation time during duplicated pattern analysis. And old patterns in the tree are deleted easily by FIFO method. The advantage of our algorithm is proved by performance comparison with existed method, MILE, in a condition that pattern is changed continuously. And we look around performance variation by changing several variable in the algorithm.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06d
• /
• pp.54-57
• /
• 2011

안드로이드와 같이 패턴 잠금을 기본으로 하는 스마트폰 OS가 보급 되면서 패턴 잠금이 널리 사용되고 있다. 그러나 현재의 패턴 잠금 시스템은 패턴 입력의 실수와 악의적인 접근에 의한 입력에 대해 동일한 페널티를 부여하기 때문에 보안에 취약한 문제점을 가지고 있다. 본 논문에서는 입력 패턴의 분석 방법을 제안하고 분석을 통해, 패턴을 '일치', '부분 일치'와 '불일치'로 분류하여 그에 따른 페널티의 여부를 달리함으로써 보안을 강화하는 방법을 제시한다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.04a
• /
• pp.567-570
• /
• 2004

기존의 엘리베이터 시스템은 모든 교통 상황에 대해서 고정된 속도 패턴을 사용함으로써 교통량 변화에 다양한 속도 패턴을 제공 할 수 없었다. 운송 속도와 승차감은 엘리베이터 속도 패턴을 결정하기 위한 두개의 중요한 요소이다. 기동과 정지 시에 변속 충격을 줄이기 위해서 가속과 감속 시간이 적절히 조정되어졌다. 운송능력을 향상시키기 위해서 교통량 변화에 맞추어 저크를 조정하였고 이와 같은 방법으로 6개의 속도 패턴 곡선과 엘리베이터의 속도 제어를 위해서 뉴로 퍼지 시스템을 구현하였다. 구현된 뉴로 퍼지 시스템은 2개의 입력변수와 1개의 출력을 가진 시스템이다. 전반부는 교통량의 변화를 나타내며 후반부는 입력에 대응되는 속도 패턴을 적용시켰다.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2001.06a
• /
• pp.205-208
• /
• 2001

본 논문은 Biometrics분야 중 다른 생체학적 특징보다도 정확도면에서 가장 뛰어난 특징인 안구의 홍채 패턴을 이용하여 사용자를 인증 하는 시스템에 관한 연구이다. 입력된 안구 영상으로부터 전처리과정을 거쳐 극좌표 변환을 통해 홍채 패턴을 추출한 후 웨이블릿 변환을 이용하여 특징패턴을 압축하였으며, PCA(Principal Component Analysis:주성분 해석)의 한 종류인 GHA(Generalized Hebbian Algorithm)를 사용하여 등록된 사용자의 패턴 DB 에서 Basis 배열을 추출하고, 구축된 Basis 배열과 입력 영상 패턴과의 비교 Matching을 통하여 사용자를 인증하는 시스템을 제안한다.