• Title/Summary/Keyword: Pattern Dictionary

Search Result 49, Processing Time 0.026 seconds

Convolutional Neural Network and Data Mutation for Time Series Pattern Recognition (컨벌루션 신경망과 변종데이터를 이용한 시계열 패턴 인식)

  • Ahn, Myong-ho;Ryoo, Mi-hyeon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.05a
    • /
    • pp.727-730
    • /
    • 2016
  • TSC means classifying time series data based on pattern. Time series data is quite common data type and it has high potential in many fields, so data mining and machine learning have paid attention for long time. In traditional approach, distance and dictionary based methods are quite popular. but due to time scale and random noise problems, it has clear limitation. In this paper, we propose a novel approach to deal with these problems with CNN and data mutation. CNN is regarded as proven neural network model in image recognition, and could be applied to time series pattern recognition by extracting pattern. Data mutation is a way to generate mutated data with different methods to make CNN more robust and solid. The proposed method shows better performance than traditional approach.

  • PDF

A Recognition of Handwritten English Characters Using Back Propagation Algorithm and Dictionary (역전파 알고리듬과 사전을 이용한 필기체 영문자 인식)

  • 김응성;조성환;이근영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.2
    • /
    • pp.157-168
    • /
    • 1993
  • In this paper, it is shown that neural networks trained with back propagation algorithm and dictionary can be applied to recognize handwritten English characters. To eliminate the useless data part and to minimize the variety of characters from the scanned image file, various preprocessings : that is, segmentation, centering, noise filtering, sealing and thinning are performed. After these, characteristic features are derived from thinned character pattern. The neural network is trained by using the extracted features for sample data, and all test data are classified into English alphabets according to their features through the neural network. Finally, the ways of reducing learning time and improving recognition rate, and the relationship between learning time and hidden layer nodes are considered. As a result of this study, after successful training, a high recognition rate has been obtained with this system for the trained patterns and about 93% for test patterns. Using dictionary, the recognition rate was about 97% for test pattern.

  • PDF

Recognition of Handwritten-Hangeul by shape Pattern (Shape Pattern에 의한 필기체의 한글 인식)

  • 박종욱;이주근
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.22 no.5
    • /
    • pp.1-9
    • /
    • 1985
  • In this paper, a new methods which decomposes the handwritten-Hangout shape panerns into subpatterns and recognizes the decomposed subpatterns are proposed. the feature vcfices arc detected by searching boundary of the shape pattern and a topolo-gical structure is represented by a bridge links and contact links between the feature vertices. From the tpcological structure, Hangout shape patterns are decomposed into the subpatterns of 44-Korean alphabet. The 학obol and the local attributes are extracted from the subpattrrns and the subpatterns are recognized by matching those attributes with the dictionary. It is assured that this method is more effect and reasonable for deformed handwrioen Hangout shape patterns. Experimental results show that recognition rate is 99(%) and recogni-tion time is also reduced as those using the thinning process.

  • PDF

A Study on the Musical Theme Clustering for Searching Note Sequences (음렬 탐색을 위한 주제소절 자동분류에 관한 연구)

  • 심지영;김태수
    • Journal of the Korean Society for information Management
    • /
    • v.19 no.3
    • /
    • pp.5-30
    • /
    • 2002
  • In this paper, classification feature is selected with focus of musical content, note sequences pattern, and measures similarity between note sequences followed by constructing clusters by similar note sequences, which is easier for users to search by showing the similar note sequences with the search result in the CBMR system. Experimental document was $\ulcorner$A Dictionary of Musical Themes$\lrcorner$, the index of theme bar focused on classical music and obtained kern-type file. Humdrum Toolkit version 1.0 was used as note sequences treat tool. The hierarchical clustering method is by stages focused on four-type similarity matrices by whether the note sequences segmentation or not and where the starting point is. For the measurement of the result, WACS standard is used in the case of being manual classification and in the case of the note sequences starling from any point in the note sequences, there is used common feature pattern distribution in the cluster obtained from the clustering result. According to the result, clustering with segmented feature unconnected with the starting point Is higher with distinct difference compared with clustering with non-segmented feature.

Sign Language Transformation System based on a Morpheme Analysis (형태소분석에 기초한 수화영상변환시스템에 관한 연구)

  • Lee, Yong-Dong;Kim, Hyoung-Geun;Jeong, Woon-Dal
    • The Journal of the Acoustical Society of Korea
    • /
    • v.15 no.6
    • /
    • pp.90-98
    • /
    • 1996
  • In this paper we have proposed the sign language transformation system for deaf based on a morpheme analysis. The proposed system extracts phoneme components and connection informations of the input character sequence by using a morpheme analysis. And then the sign image obtained by component analysis is correctly and automatically generated through the sign image database. For the effective sign language transformation, the language description dictionary which consists of a morpheme analysis part for analysis of input character sequence and sign language description part for reference of sign language pattern is costructed. To avoid the duplicating sign language pattern, the pattern is classified a basic, a compound and a similar sign word. The computer simulation shows the usefulness of the proposed system.

  • PDF

A Study of the Automatic Extraction of Hypernyms arid Hyponyms from the Corpus (코퍼스를 이용한 상하위어 추출 연구)

  • Pang, Chan-Seong;Lee, Hae-Yun
    • Korean Journal of Cognitive Science
    • /
    • v.19 no.2
    • /
    • pp.143-161
    • /
    • 2008
  • The goal of this paper is to extract the hyponymy relation between words in the corpus. Adopting the basic algorithm of Hearst (1992), I propose a method of pattern-based extraction of semantic relations from the corpus. To this end, I set up a list of hypernym-hyponym pairs from Sejong Electronic Dictionary. This list is supplemented with the superordinate-subordinate terms of CoroNet. Then, I extracted all the sentences from the corpus that include hypemym-hyponym pairs of the list. From these extracted sentences, I collected all the sentences that contain meaningful constructions that occur systematically in the corpus. As a result, we could obtain 21 generalized patterns. Using the PERL program, we collected sentences of each of the 21 patterns. 57% of the sentences are turned out to have hyponymy relation. The proposed method in this paper is simpler and more advanced than that in Cederberg and Widdows (2003), in that using a word net or an electronic dictionary is generally considered to be efficient for information retrieval. The patterns extracted by this method are helpful when we look fer appropriate documents during information retrieval, and they are used to expand the concept networks like ontologies or thesauruses. However, the word order of Korean is relatively free and it is difficult to capture various expressions of a fired pattern. In the future, we should investigate more semantic relations than hyponymy, so that we can extract various patterns from the corpus.

  • PDF

A study on User Authentication Technology of Numeric based Pattern Password (숫자기반의 패턴 형식 패스워드 사용자인증 기술)

  • Ju, Seung-Hwan;Seo, Hee-Suk
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.9
    • /
    • pp.65-73
    • /
    • 2012
  • The traditional text-based password is vulnerable guessing, dictionary attacks, keyloggers, social engineering, stole view, etc. these vulnerability effect more serious problem in a mobile environment. In this study, By using the pattern number to enter the password of an existing four-digit numeric password, User easily use to new password system. The technology on pattern based numerical password authorization proposed in this paper would intensify the security of password which holds existing 10 numbers of cases by authorizing a user and would not invade convenience of use by providing high security and making users memorize only four numbers like old method. Making users not have inconvenience and raising complexity, it would have a strength to an shoulder surfing attack of an attacker. So I study password system that represents the shape-based of number. I propose the new password system to prevent peeking attacks and Brute-force attack, and this proposal is to review the security and usability.

A Study on the Hangul Recognition Using Hough Transform and Subgraph Pattern (Hough Transform과 부분 그래프 패턴을 이용한 한글 인식에 관한 연구)

  • 구하성;박길철
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.3 no.1
    • /
    • pp.185-196
    • /
    • 1999
  • In this dissertation, a new off-line recognition system is proposed using a subgraph pattern, neural network. After thinning is applied to input characters, balance having a noise elimination function on location is performed. Then as the first step for recognition procedure, circular elements are extracted and recognized. From the subblock HT, space feature points such as endpoint, flex point, bridge point are extracted and a subgraph pattern is formed observing the relations among them. A region where vowel can exist is allocated and a candidate point of the vowel is extracted. Then, using the subgraph pattern dictionary, a vowel is recognized. A same method is applied to extract horizontal vowels and the vowel is recognized through a simple structural analysis. For verification of recognition subgraph in this paper, experiments are done with the most frequently used Myngjo font, Gothic font for printed characters and handwritten characters. In case of Gothic font, character recognition rate was 98.9%. For Myngjo font characters, the recognition rate was 98.2%. For handwritten characters, the recognition rate was 92.5%. The total recognition rate was 94.8% with mixed handwriting and printing characters for multi-font recognition.

  • PDF

A Study on the Analysis of Disaster Safety Lexicon Patterns in Social Media (소셜미디어를 통해 본 재난안전 분야 어휘 사용 양상 분석)

  • Kim, Tae-Young;Lee, Jung-Eun;Oh, Hyo-Jung
    • The Journal of the Korea Contents Association
    • /
    • v.17 no.10
    • /
    • pp.85-93
    • /
    • 2017
  • Standardization of disaster safety lexicon is important as the most basic process for successful accident prevention and response. A lack of understanding of disaster safety lexicon leads lack of communication and information sharing, which can be a problem in communicating with appropriate responses in case of a disaster. Currently disaster and safety control agencies produce and manage heterogeneous information and they also develop and use word dictionaries individually. To solve this problem, identifying differences of disaster safety lexicon patterns by the user are essential for standardization. In this paper, we conducted lexicon patterns analysis based on social media and revealed the characteristics according to pattern types. At the result, we proposed the standardization and construction methods of disaster safety word dictionary.

Sub-Pixel Rendering Algorithm Using Adaptive 2D FIR Filters (적응적 2차원 FIR 필터를 이용한 부화소 렌더링 기법)

  • Nam, Yeon Oh;Choi, Ik Hyun;Song, Byung Cheol
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.3
    • /
    • pp.113-121
    • /
    • 2013
  • In this paper, we propose a sub-pixel rendering algorithm using learning-based 2D FIR filters. The proposed algorithm consists of two stages: the learning and synthesis stages. At the learning stage, we produce the low-resolution synthesis information derived from a sufficient number of high/low resolution block pairs, and store the synthesis information into a so-called dictionary. At the synthesis stage, the best candidate block corresponding to each input high-resolution block is found in the dictionary. Next, we can finally obtain the low-resolution image by synthesizing the low-resolution block using the selected 2D FIR filter on a sub-pixel basis. On the other hand, we additionally enhance the sharpness of the output image by using pre-emphasis considering RGB stripe pattern of display. The simulation results show that the proposed algorithm can provide significantly sharper results than conventional down-sampling methods, without blur effects and aliasing.