• Title/Summary/Keyword: CTC Algorithm

Search Result 14, Processing Time 0.019 seconds

CRNN-Based Korean Phoneme Recognition Model with CTC Algorithm (CTC를 적용한 CRNN 기반 한국어 음소인식 모델 연구)

  • Hong, Yoonseok;Ki, Kyungseo;Gweon, Gahgene
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.8 no.3
    • /
    • pp.115-122
    • /
    • 2019
  • For Korean phoneme recognition, Hidden Markov-Gaussian Mixture model(HMM-GMM) or hybrid models which combine artificial neural network with HMM have been mainly used. However, current approach has limitations in that such models require force-aligned corpus training data that is manually annotated by experts. Recently, researchers used neural network based phoneme recognition model which combines recurrent neural network(RNN)-based structure with connectionist temporal classification(CTC) algorithm to overcome the problem of obtaining manually annotated training data. Yet, in terms of implementation, these RNN-based models have another difficulty in that the amount of data gets larger as the structure gets more sophisticated. This problem of large data size is particularly problematic in the Korean language, which lacks refined corpora. In this study, we introduce CTC algorithm that does not require force-alignment to create a Korean phoneme recognition model. Specifically, the phoneme recognition model is based on convolutional neural network(CNN) which requires relatively small amount of data and can be trained faster when compared to RNN based models. We present the results from two different experiments and a resulting best performing phoneme recognition model which distinguishes 49 Korean phonemes. The best performing phoneme recognition model combines CNN with 3hop Bidirectional LSTM with the final Phoneme Error Rate(PER) at 3.26. The PER is a considerable improvement compared to existing Korean phoneme recognition models that report PER ranging from 10 to 12.

An Algorithm for train conflict detection and resolution occurring in large station with high density traffic (대형.고밀도역 역내 열차 경합 검지 및 해소를 위한 수리 모형 및 해법)

  • Park, Bum-Hwan;Kim, Kyung-Min;Hong, Soon-Heum;Kim, Young-Hoon;Ahn, Jin;Lee, Young-Su;Ha, Sung-Tae
    • Proceedings of the KSR Conference
    • /
    • 2007.05a
    • /
    • pp.1466-1474
    • /
    • 2007
  • In large station with high density traffic, trains is hardly controlled by CTC but by station dispatcher because CTC has difficulties in monitoring all states of affairs happening within the station such as departs and arrivals of many trains from different lines and shunting trains between yards and platforms, etc. Therefore station dispatcher has to make quick decision about how to schedule all trains including trains to arrive and depart before long. And such decisions become harder when an unexpected delay occurs. This study suggests a mathematical model and algorithm about how to detect in advance and resolve efficiently the conflicts occurring within a station and it will be shown how to reduce delay using our approach by means of analysing the schedule of ChyungRyangRi station.

  • PDF

LSTM RNN-based Korean Speech Recognition System Using CTC (CTC를 이용한 LSTM RNN 기반 한국어 음성인식 시스템)

  • Lee, Donghyun;Lim, Minkyu;Park, Hosung;Kim, Ji-Hwan
    • Journal of Digital Contents Society
    • /
    • v.18 no.1
    • /
    • pp.93-99
    • /
    • 2017
  • A hybrid approach using Long Short Term Memory (LSTM) Recurrent Neural Network (RNN) has showed great improvement in speech recognition accuracy. For training acoustic model based on hybrid approach, it requires forced alignment of HMM state sequence from Gaussian Mixture Model (GMM)-Hidden Markov Model (HMM). However, high computation time for training GMM-HMM is required. This paper proposes an end-to-end approach for LSTM RNN-based Korean speech recognition to improve learning speed. A Connectionist Temporal Classification (CTC) algorithm is proposed to implement this approach. The proposed method showed almost equal performance in recognition rate, while the learning speed is 1.27 times faster.

S-JND based Perceptual Rate Control Algorithm of HEVC (S-JND 기반의 HEVC 주관적 율 제어 알고리즘)

  • Kim, JaeRyun;Sim, Donggyu
    • Journal of Broadcast Engineering
    • /
    • v.22 no.3
    • /
    • pp.381-396
    • /
    • 2017
  • In this paper, the perceptual rate control algorithm is studied for HEVC (High Efficiency Video Coding) encoder with bit allocation based on perceived visual quality. This paper proposes perceptual rate control algorithm which could consider perceived quality for HEVC encoding method. The proposed rate control algorithm employs adaptive bit allocation for frame and CTU level using the perceived visual importance of each CTU. For performance evaluation of the proposed algorithm, the proposed algorithm was implemented on HM 16.9 and tested for sequences in Class B under the CTC (Common Test Condition) RA (Random Access) case. Experimental results show that the proposed method reduces the bitrate of 3.12%, and improves BD-PSNR of 0.08dB and bitrate accuracy of 0.07% on average. And also, we achieved MOS improvement of 0.16 with the proposed method, compared with the conventional method based on DSCQS (Double Stimulus Continuous Quality Scale).

A Scheduling Scheme Considering Multiple-Target Coverage and Connectivity in Wireless Sensor Networks (무선 센서 네트워크에서 다중 타겟 커버리지와 연결성을 고려한 스케줄링 기법)

  • Kim, Yong-Hwan;Han, Youn-Hee;Park, Chan-Yeol
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3B
    • /
    • pp.453-461
    • /
    • 2010
  • A critical issue in wireless sensor networks is an energy-efficiency since the sensor batteries have limited energy power and, in most cases, are not rechargeable. The most practical manner relate to this issue is to use a node wake-up scheduling protocol that some sensor nodes stay active to provide sensing service, while the others are inactive for conserving their energy. Especially, CTC (Connected Target Coverage) problem has been considered as a representative energy-efficiency problem considering connectivity as well as target coverage. In this paper, we propose a new energy consumption model considering multiple-targets and create a new problem, CMTC (Connected Multiple-Target Coverage) problem, of which objective is to maximize the network lifetime based on the energy consumption model. Also, we present SPT (Shortest Path based on Targets)-Greedy algorithm to solve the problem. Our simulation results show that SPT-Greedy algorithm performs much better than previous algorithm in terms of the network lifetime.

A Study on Microprocessor-Based 3-Phase VVVF Inverter (마이크로 프로세서를 사용한 3상 VVVF 인버터에 관한 연구)

  • 한상수;김재호;최우승
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.6
    • /
    • pp.879-885
    • /
    • 1990
  • The geometrical algorithm for generating a 3-phase SPWM signal for VVVF (Variable Voltage, Variable Frequency) inverter drives is proposed. In this techniques, it is suitable for micro-processor based implementation since the pulsewiths are computable in real time from simple analytic expressions. System hardware consists of the inverter circuit and the 3-phase SPWM signal generating circuit. The inverter circuit is a 3-phase SPWM signal generating circuit is single board micro-processor consisting of Z-80A CPU, EPROMXI, CTC, PIO. The method of controlling VVVF at the inverter output is discussed here.

  • PDF

An Algorithm for detection and Resolution of Train Conflicts Occurring Within Station (역내 열차 경합 검지 및 해소를 위한 수리 모형 및 해법)

  • Park, Bum-Hwan;Kim, Kyung-Min;Hong, Soon-Heum;Kim, Young-Hoon
    • Journal of the Korean Society for Railway
    • /
    • v.10 no.2 s.39
    • /
    • pp.179-185
    • /
    • 2007
  • In large station with high density traffic, trains can be hardly controlled by CTC but by station dispatcher because CTC has difficulties in monitoring all states of affairs happening within each station such as departures, arrivals of many trains from different lines and shunting of trains to move between yards and platforms, etc. Therefore the station's dispatcher has to make quick decision about how to reschedule the times and routes for all the trains scheduled within a specific time window. And such decision becomes harder when an unexpected delay occurs because a delay occurring in a train propagates other trains as time goes on. Generally, it is called the conflict detection and resolution to adjust beforehand the distorted schedule due to a delay to original schedule. Our research is different from the state of the arts in that ours determines simultaneously the routes and the times of arrival and departure of trains, although others do only the arrival and departure time of the trains without considering the alternative routes and shunting of the station. This study suggests a mathematical approach for how to detect in advance and resolve efficiently the conflicts occurring within a station and it will be shown how to reduce delay using our approach by means of analysing the schedule of ChyungRyangRi station.

Early Termination of Block Vector Search for Fast Encoding of HEVC Screen Content Coding

  • Ma, Jonghyun;Sim, Donggyu
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.3 no.6
    • /
    • pp.388-392
    • /
    • 2014
  • This paper proposes an early termination method of a block vector search for fast encoding of high efficiency video coding (HEVC) screen content coding (SCC). In the proposed algorithm, two blocks indicated by two block vector predictors (BVPs) were first employed as an intra block copy (IBC) search. If the sum of absolute difference (SAD) value of the block is less than a threshold defined empirically, an IBC BV search is terminated early. The initial threshold for early termination is derived by statistical analysis and it can be modified adaptively based on a quantization parameter (QP). The proposed algorithm is evaluated on SCM-2.0 under all intra (AI) coding configurations. Experimental results show that the proposed algorithm reduces IBC BV search time by 29.23% on average while the average BD-rate loss is 0.41% under the HEVC SCC common test conditions (CTC).

A Perceptual Rate Control Algorithm with S-JND Model for HEVC Encoder (S-JND 모델을 사용한 주관적인 율 제어 알고리즘 기반의 HEVC 부호화 방법)

  • Kim, JaeRyun;Ahn, Yong-Jo;Lim, Woong;Sim, Donggyu
    • Journal of Broadcast Engineering
    • /
    • v.21 no.6
    • /
    • pp.929-943
    • /
    • 2016
  • This paper proposes the rate control algorithm based on the S-JND (Saliency-Just Noticeable Difference) model for considering perceptual visual quality. The proposed rate control algorithm employs the S-JND model to simultaneously reflect human visual sensitivity and human visual attention for considering characteristics of human visual system. During allocating bits for CTU (Coding Tree Unit) level in a rate control, the bit allocation model calculates the S-JND threshold of each CTU in a picture. The threshold of each CTU is used for adaptively allocating a proper number of bits; thus, the proposed bit allocation model can improve perceptual visual quality. For performance evaluation of the proposed algorithm, the proposed algorithm was implemented on HM 16.9 and tested for sequences in Class B and Class C under the CTC (Common Test Condition) RA (Random Access), Low-delay B and Low-delay P case. Experimental results show that the proposed method reduces the bit-rate of 2.3%, and improves BD-PSNR of 0.07dB and bit-rate accuracy of 0.06% on average. We achieved MOS improvement of 0.03 with the proposed method, compared with the conventional method based on DSCQS (Double Stimulus Continuous Quality Scale).

Numerical Analysis of The Foundation Based on The Cap Model(I) (Cap Model을 이용한 기초식반의 수치해석(I) : 실내시험에 의한 Cap Model 의 Parameter 결정)

  • 박병기;정진섭
    • Geotechnical Engineering
    • /
    • v.3 no.1
    • /
    • pp.65-76
    • /
    • 1987
  • This study has been carried out as a basic course for the analysis of foundation deformations based on the Cap model using the finite element methods. Material parameters should firstly be determined in order to use the Cap model for numerical solution. Associated with the fact described above, a method determining the soil parameters is suggested using algorithm for numerical ana])isis from raw truly triaxial compression laboratory test data of Pueblo.Colorado sand by Zaman, et at. (1982) More specifically, the change of soil parameters Is thoroughly examined by weighting the data obtained from CTC and RTE tests, respectively. The main results obtained are as follows; 1. The obtained values of parameters (E, V and 2) are same irrespective of data obtained from various kind of tests. 2. The values of the other parameters are dependent on data used. 3. The determination of parameters is little affected by the weighting factor.

  • PDF