• Journal of the Korean Institute of Telematics and Electronics
• /
• v.17 no.3
• /
• pp.12-19
• /
• 1980

A speech recognition system for separately pronounced Korean digits is described. The system is composed of four stages ; parameter extraction, segmentation by voiced-unovied analysis, formant tracking and pattern matching. Digit speech is segmented into an unvoiced segment and/or a voiced one using ZCR and energy measurements, then to estimate the first three formant frequencies a relatively simple formant tracking scheme is applied to the raw formant data extracted from linear prediction spectra. Finally, pattern matching is made using dynamic programmig method. Recognition experiment is carried out for 150 digit utterences spoken by three male speakers, and recgnition rate 94 % is obtained.

• Journal of applied mathematics & informatics
• /
• v.36 no.5_6
• /
• pp.419-428
• /
• 2018

Let us think of adding each digit of a natural number, in bases b, that are e-powered. By studying for a number becoming greater than or equal to oneself, we will consider values of ${\lim}_{b{\rightarrow}{\infty}}{\frac{N(e,b)}{b^e}}$.

• The Journal of the Acoustical Society of Korea
• /
• v.3 no.1
• /
• pp.25-35
• /
• 1984

This paper analysis the Dynamic Time Warping algorithms for time normalization of speech pattern and discusses the Dynamic Programming algorithm for spoken Korean isolated digits recognition. In the DP matching, feature vectors of the reference and test pattern are consisted of first three formant frequencies extracted by power spectrum density estimation algorithm of the ARMA model. The major differences in the various DTW algorithms include the global path constrains, the local continuity constraints on the path, and the distance weighting/normalization used to give the overall minimum distance. The performance criterias to evaluate these DP algorithms are memory requirement, speed of implementation, and recognition accuracy.

• Proceedings of the KSPS conference
• /
• 2003.05a
• /
• pp.131-134
• /
• 2003

This paper describes an efficient algorithm to generate compact and complete prompts lists for connected spoken digits database. In building a connected spoken digit recognizer, we have to acquire speech data in various contexts. However, in many speech databases the lists are made by using random generators. We provide an efficient algorithm that can generate compact and complete lists of digits in various contexts. This paper includes the proof of optimality and completeness of the algorithm.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.3
• /
• pp.97-104
• /
• 1995

This paper is a study on the recognition of continuous digits for the implementation of a voice dialing system, and proposes an method of speech recognition using syntactic analysis and One-Stage DP. In order to perform the speech recognition, first of all, we make DMS model by section division algorithm and let continuous digits data be recognized through the proposed One-Stage DP method using syntactic analysis. In this study, 7 continuous digits of 21 kinds which is pronounced by 8 male speakers two or three times, are used. The speaker dependent and speaker independent recognition are performed with the above data by way of the conventional One-Stage DP and the proposed One-Stage DP using syntactic analysis under the condition of laboratory environment. From the recognition experiments, it is shown that the proposed method was better than the established method. And, the recognition accuracy of speaker dependence and independence by the proposed One-Stage DP using syntactic analysis was about 91.7% and 89.7%.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.5
• /
• pp.74-82
• /
• 1995

This paper is study on the voice dialing using HMM and post processing of the connected digits. HMM algorithm is widely used in the speech recognition with a good result. But, the maximum likelihood estimation of HMM(Hidden Markov Model) training in the speech recognition does not lead to values which maximize recognition rate. To solve the problem, we applied the post processing to segmental K-means procedure are in the recognition experiment. Korea connected digits are influenced by the prolongation more than English connected digits. To decrease the segmentation error in the level building algorithm some word models which can be produced by the prolongation are added. Some rules for the added models are applied to the recognition result and it is updated. The recognition system was implemented with DSP board having a TMS320C30 processor and IBM PC. The reference patterns were made by 3 male speakers in the noisy laboratory. The recognition experiment was performed for 21 sort of telephone number, 252 data. The recognition rate was $6\%$ in the speaker dependent, and $80.5\%$ in the speaker independent recognition test.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.1
• /
• pp.44-52
• /
• 2001

This paper describes an off-line method for recognizing totally unconstrained handwritten digits using modified chaotic neural networks(MCNN). The chaotic neural networks(CNN) is modified to be a useful network for solving complex pattern problems by enforcing dynamic characteristics and learning process. Since the MCNN has the characteristics of highly nonlinear dynamics in structure and neuron itself, it can be an appropriate network for the robust classification of complex handwritten digits. Digit identification starts with extraction of features from the raw digit images and then recognizes digits using the MCNN based classifier. The performance of the MCNN classifier is evaluated on the numeral database of Concordia University, Montreal, Canada. For the relative comparison of recognition performance, the MCNN classifier is compared with the recurrent neural networks(RNN) classifier. Experimental results show that the classification rate is 98.0%. It indicates that the MCNN classifier outperforms the RNN classifier as well as other classifiers that have been reported on the same database.

• Journal of Audiology & Otology
• /
• v.25 no.4
• /
• pp.171-177
• /
• 2021

Background and Objectives: The purpose of the present study was to validate the performance and diagnostic efficacy of the Korean digits-in-noise (K-DIN) test in comparison to the Korean speech perception-in-noise (K-SPIN) test, which is the representative speech-in-noise test in clinical practice. Subjects and Methods: Twenty-seven subjects (15 normal-hearing and 12 hearing-impaired listeners) participated. The recorded Korean 0-9 digits were used to form quasirandom digit triplets; 50 target digit triplets were presented at the most comfortable level of each subject while presenting speech-shaped background noise at various levels of signal-to-noise ratios (-12.5, -10, -5, or +5 dB). Subjects were then instructed to listen to both target and noise masker unilaterally and bilaterally through a headphone. K-SPIN test was also conducted using the same procedure as the K-DIN. After calculating their percent correct responses, K-DIN and K-SPIN results were compared using a Pearson-correlation test. Results: Results showed a statistically significant correlation between K-DIN and K-SPIN in all hearing conditions (left: r=0.814, p<0.001; right: r=0.788, p<0.001; bilateral: r=0.727, p<0.001). Moreover, the K-DIN test achieved better testing efficacy, shorter average listening time (5 min vs. 30 min), and easier performance of task according to participants' qualitative reports than the K-SPIN test. Conclusions: In this study, the Korean version of digit triplet test was validated in both normal-hearing and hearing-impaired listeners. The findings suggest that the K-DIN test can be used as a simple and time-efficient hearing-in-noise test in audiology clinics in Korea.

• Korean Journal of Audiology
• /
• v.25 no.4
• /
• pp.171-177
• /
• 2021

Background and Objectives: The purpose of the present study was to validate the performance and diagnostic efficacy of the Korean digits-in-noise (K-DIN) test in comparison to the Korean speech perception-in-noise (K-SPIN) test, which is the representative speech-in-noise test in clinical practice. Subjects and Methods: Twenty-seven subjects (15 normal-hearing and 12 hearing-impaired listeners) participated. The recorded Korean 0-9 digits were used to form quasirandom digit triplets; 50 target digit triplets were presented at the most comfortable level of each subject while presenting speech-shaped background noise at various levels of signal-to-noise ratios (-12.5, -10, -5, or +5 dB). Subjects were then instructed to listen to both target and noise masker unilaterally and bilaterally through a headphone. K-SPIN test was also conducted using the same procedure as the K-DIN. After calculating their percent correct responses, K-DIN and K-SPIN results were compared using a Pearson-correlation test. Results: Results showed a statistically significant correlation between K-DIN and K-SPIN in all hearing conditions (left: r=0.814, p<0.001; right: r=0.788, p<0.001; bilateral: r=0.727, p<0.001). Moreover, the K-DIN test achieved better testing efficacy, shorter average listening time (5 min vs. 30 min), and easier performance of task according to participants' qualitative reports than the K-SPIN test. Conclusions: In this study, the Korean version of digit triplet test was validated in both normal-hearing and hearing-impaired listeners. The findings suggest that the K-DIN test can be used as a simple and time-efficient hearing-in-noise test in audiology clinics in Korea.

• Journal of the Korean Mathematical Society
• /
• v.52 no.4
• /
• pp.765-780
• /
• 2015

We consider the problem of characterizing the palindromic sequences ${\langle}c_{d-1},\;c_{d-2}\;,{\cdots},\;c_0\rangle$, $c_{d-1}{\neq}0$, having the property that for any $K{\in}\mathbb{N}$ there exists a number that is a palindrome simultaneously in K different bases, with ${\langle}c_{d-1},\;c_{d-2}\;,{\cdots},\;c_0\rangle$ being its digit sequence in one of those bases. Since each number is trivially a palindrome in all bases greater than itself, we impose the restriction that only palindromes with at least two digits are taken into account. We further consider a related problem, where we count only palindromes with a fixed number of digits (that is, d). The first problem turns out not to be very hard; we show that all the palindromic sequences have the required property, even with the additional point that we can actually restrict the counted palindromes to have at least d digits. The second one is quite tougher; we show that all the palindromic sequences of length d = 3 have the required property (and the same holds for d = 2, based on some earlier results), while for larger values of d we present some arguments showing that this tendency is quite likely to change.