• Title/Summary/Keyword: digit tree

Search Result 12, Processing Time 0.024 seconds

Implementation of Connected-Digit Recognition System Using Tree Structured Lexicon Model (트리 구조 어휘 사전을 이용한 연결 숫자음 인식 시스템의 구현)

  • Yun Young-Sun;Chae Yi-Geun
    • MALSORI
    • /
    • no.50
    • /
    • pp.123-137
    • /
    • 2004
  • In this paper, we consider the implementation of connected digit recognition system using tree structured lexicon model. To implement efficiently the fixed or variable length digit recognition system, finite state network (FSN) is required. We merge the word network algorithm that implements the FSN with lexical tree search algorithm that is used for general speech recognition system for fast search and large vocabulary systems. To find the efficient modeling of digit recognition system, we investigate some performance changes when the lexical tree search is applied.

  • PDF

A Recognition Algorithm of Handwritten Numerals based on Structure Features (구조적 특징기반 자유필기체 숫자인식 알고리즘)

  • Song, Jeong-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.6
    • /
    • pp.151-156
    • /
    • 2018
  • Because of its large differences in writing style, context-independency and high recognition accuracy requirement, free handwritten digital identification is still a very difficult problem. Analyzing the characteristic of handwritten digits, this paper proposes a new handwritten digital identification method based on combining structural features. Given a handwritten digit, a variety of structural features of the digit including end points, bifurcation points, horizontal lines and so on are identified automatically and robustly by a proposed extended structural features identification algorithm and a decision tree based on those structural features are constructed to support automatic recognition of the handwritten digit. Experimental result demonstrates that the proposed method is superior to other general methods in recognition rate and robustness.

A Study on Digit Modeling for Korean Connected Digit Recognition (한국어 연결숫자인식을 위한 숫자 모델링에 관한 연구)

  • 김기성
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • 1998.08a
    • /
    • pp.293-297
    • /
    • 1998
  • 전화망에서의 연결 숫자 인식 시스템의 개발에 대한 내용을 다루며, 이 시스템에서 다양한 숫자 모델링 방법들을 구현하고 비겨하였다. Word 모델의 경우 문맥독립 whole-word 모델을 구현하였으며, sub-word 모델로는 triphone 모델과 불파음화 자음을 모음에 포함시킨 modified triphone 모델을 구현하였다. 그리고 tree-based clustering 방법을 sub-word 모델과 문맥종속 whole-word 모델에 적용하였다. 이와 같은 숫자모델들에 대해 연속 HMM을 이용하여 화자독립 연결숫자 인식 실험을 수행한 결과, 문맥종속 단어 모델이 문맥독립 단어 모델보다 우수한 성능을 나타냈으며, triphone 모델과 modified triphone 모델은 유사한 성능을 나타냈다. 특히 tree-based clustering 방법을 적용한 문맥종속 단어 모델이 4연 숫자열에 대해 99.8%의 단어 dsltlr률 및 99.1%의 숫자열 인식률로서 가장 우수한 성능을 나타내었다.

  • PDF

A Digit Serial Multiplier Over GF(2m)Based on the MSD-first Algorithm (GF(2m)상의 MSD 우선 알고리즘 기반 디지트-시리얼 곱셈기)

  • Kim, Chang-Hoon;Kim, Soon-Cheol
    • The KIPS Transactions:PartA
    • /
    • v.15A no.3
    • /
    • pp.161-166
    • /
    • 2008
  • In this paper, an efficient digit-serial systolic array is proposed for multiplication in finite field GF($2^m$) using the polynomial basis representation. The proposed systolic array is based on the most significant digit first (MSD-first) multiplication algorithm and produces multiplication results at a rate of one every "m/D" clock cycles, where D is the selected digit size. Since the inner structure of the proposed multiplier is tree-type, critical path increases logarithmically proportional to D. Therefore, the computation delay of the proposed architecture is significantly less than previously proposed digit-serial systolic multipliers whose critical path increases proportional to D. Furthermore, since the new architecture has the features of a high regularity, modularity, and unidirectional data flow, it is well suited to VLSI implementation.

A New Systolic Array for LSD-first Multiplication in $CF(2^m)$ ($CF(2^m)$상의 LSD 우선 곱셈을 위한 새로운 시스톨릭 어레이)

  • Kim, Chang-Hoon;Nam, In-Gil
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4C
    • /
    • pp.342-349
    • /
    • 2008
  • This paper presents a new digit-serial systolic multiplier over $CF(2^m)$ for cryptographic applications. When input data come in continuously, the proposed array produces multiplication results at a rate of one every ${\lceil}m/D{\rceil}$ clock cycles, where D is the selected digit size. Since the inner structure of the proposed array is tree-type, critical path increases logarithmically proportional to D. Therefore, the computation delay of the proposed architecture is significantly less than previously proposed digit-serial systolic multipliers whose critical path increases proportional to D. Furthermore, since the new architecture has the features of regularity, modularity, and unidirectional data flow, it is well suited to VLSI implementations.

Handwriting Thai Digit Recognition Using Convolution Neural Networks (다양한 컨볼루션 신경망을 이용한 태국어 숫자 인식)

  • Onuean, Athita;Jung, Hanmin;Kim, Taehong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.05a
    • /
    • pp.15-17
    • /
    • 2021
  • Handwriting recognition research is mainly focused on deep learning techniques and has achieved a great performance in the last few years. Especially, handwritten Thai digit recognition has been an important research area including generic digital numerical information, such as Thai official government documents and receipts. However, it becomes also a challenging task for a long time. For resolving the unavailability of a large Thai digit dataset, this paper constructs our dataset and learns them with some variants of the CNN model; Decision tree, K-nearest neighbors, Alexnet, LaNet-5, and VGG (11,13,16,19). The experimental results using the accuracy metric show the maximum accuracy of 98.29% when using VGG 13 with batch normalization.

  • PDF

An efficient search of binary tree for huffman decoding based on numeric interpretation of codewords

  • Kim, Byeong-Il;Chang, Tae-Gyu;Jeong, Jong-Hoon
    • Proceedings of the IEEK Conference
    • /
    • 2002.07a
    • /
    • pp.133-136
    • /
    • 2002
  • This paper presents a new method of Huffman decoding which gives a significant improvement of processing efficiency based on the reconstruction of an efficient one-dimensional array data structure incorporating the numeric interpretation of the accrued codewords in the binary tree. In the Proposed search method, the branching address is directly obtained by the arithematic operation with the incoming digit value eliminating the compare instruction needed in the binary tree search. The proposed search method gives 30% of improved Processing efficiency and the memory space of the reconstructed Huffman table is reduced to one third compared to the ordinary ‘compare and jump’ based binary tree. The experimental result with the six MPEG-2 AAC test files also shows about 198% of performance improvement compared to those of the widely used conventional sequential search method.

  • PDF

Multi-Operand Radix-2 Signed-Digit Adder using Current Mode MOSEET Circuits

  • Sakamoto, Masahiro;Hamano, Daisuke;Higuchi, Yuuichi;Kiriya, Takechika;Morisue, Mititada
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.167-170
    • /
    • 2000
  • This paper describes a novel multi-operand radix-2 signed-digit(SD) adder. The novel multi-operand addition algorithm can eliminate carry propagation chain by dividing the input operands into even place part and odd place part, and adding them each. The multi-operand adder with this algorithm can add six operands in parallel, and is faster than the ordinary method of SD adder binary tree. A hardware model for proposed adder is shown which is implemented by the current-mode MOSFET circuit technology. Simulations have been made by SPICE in order to verify the function of the proposed circuit.

  • PDF

Unusual data local access using inverse order tree (역순트리를 이용한 특이데이터 국소적 접근)

  • Rim, Kwang-Cheol;Seol, Jung-Ja
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.3
    • /
    • pp.595-601
    • /
    • 2014
  • With the advent of the Smart information-communication era, the number of data has increased exponentially. Accordingly, figuring out and analyzing in which area and circumstance the data has been created becomes one of the factors for prompt actions. In this paper identifies how to analyze the data by implementing a route from the lowest module to highest one in an inverse order for the part judgement for the particular data. The script first identifies cluster analisys, paralizes the analysis using the sum of each factors of the cluster with the tree structure, and finally transpose the answer into number. Also, it is designed to place priority on particular answer, thereafter, draws the wanted answer real-time.

A study on the science and Technology Level in Korea (우리나라의 과학기술수준조사에 관한 연구)

  • 김인호
    • Journal of Korea Technology Innovation Society
    • /
    • v.2 no.3
    • /
    • pp.61-75
    • /
    • 1999
  • This study is focused on acquiring through understanding of the S&T level of Korea to serve as an important basis for the government policy-making and to make available basic information for promoting the National R&D Program effectively. the survey of S&T level is a comparison of the highest level in the world to that of korea in 3 digit of the technology tree table. And survey of technological gaps is determined by year which Korea is able to reach the current level of the advanced countries. The results of the surveys should be applied to strategic technology planning for solving or nar-rowing the technology gap and the major criteria for resources allocation in national R&D Pro-grams. The results of he surveys should be the fundamental information for establishing strategic S&T policy in government.

  • PDF