• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.1
• /
• pp.97-107
• /
• 2002

In this paper, we propose the realization of on-line handwritten Chinese character recognition for mobile personal digital assistants (PDA). We focus on the development of an algorithm having a high recognition performance under the restriction that PDA requires small memory storage and less computational complexity in comparison with PC. Therefore, we use index matching method having computational advantage for fast recognition and we suggest a unit reconstruction method to minimize the memory size to store the character models and to accomodate the various changes in stroke order and stroke number of each person in handwriting Chinese characters. We set up standard model consisting of 1800 characters using a set of pre-defined units. Input data are measured by similarity among candidate characters selected on the basis of stroke numbers and region features after preprocessing and feature extracting. We consider 1800 Chinese characters adopted in the middle and high school in Korea. We take character sets of five person, written in printed style, irrespective of stroke ordering and stroke numbers. As experimental results, we obtained an average recognition time of 0.16 second per character and the successful recognition rate of 94.3% with MIPS R4000 CPU in PDA.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.65-72
• /
• 2010

Nowadays, most hospitals have been used to create MRI or CT and managed them. Doctors depend on fast access to images such as magnetic resonance imaging (MRIs), computerized tomography (CT) scans, and X-rays for accurate diagnoses. Those image data are related privacy of a patient. Therefore, it should be protected from hackers and managed perfectly. In this paper, we propose a data hiding method into MRI or CT related a condition and intervention of a patient, and it is suggested that how to authenticate patient information from an image. In this way, we create hash code using HMAC with patient information, and hash code and patient information is hided into an image. After then, doctor will check authentication using HMAC. In addition, we use a reversible data hiding DE(Difference Expansion) algorithm to hide patient information. This technique is possible to reconstruct the original image with stego image. Therefore, doctor can easily be possible to check condition of a patient. As a consequence of an experiment with MRI image, data hiding, extraction and reconstruct is shown compact performance.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.12
• /
• pp.23-31
• /
• 2011

The simple bacteria cooperative optimization (sBCO) algorithm that we developed as one of optimization algorithms has shown relatively good performances, but their performances were limited by step-by-step movement of individuals at a time. In order to solve this problem, we proposed a new method that assigned a speed to each individual according to its rank and it was confirmed that it improved the performances of sBCO in some degree. In addition to the assigning of speed to the individuals, we employed a new mutation operation that most existing evolutionary algorithms used in order to enhance the performances of sBCO in this paper. A specific percent of bad individuals are mutated within an area that is proportion to the rank of the individual in the mutation operation. That is, Gaussian noise of large standard deviation is added as the fitness of individuals is low. From this, the probability that the individuals with lower ranks can be located far from its parent will be increased. This causes that the probability of falling into local optimum areas is decreased and the probability of fast escaping the local optimum areas is increased. From experimental results with four function optimization problems, we showed that the performances of sBCO with mutation operation and individual speed were increased. If the optimization function is quite complex, however, the performances are not always better. We should devise a new method for solving this problem as a further work.

• Journal of the Korean Society of Laryngology, Phoniatrics and Logopedics
• /
• v.15 no.1
• /
• pp.31-36
• /
• 2004

Background and Objectives : It has been shown that the epilaryngeal tube in the human airway is responsible for vocal ring, or the singer's formant. In previous study, authors showed that in trained tenors, besides the conventional singer's formant in the region of ,5500Hz, another energy peak was observed in the region of 8,000Hz. This peak was interpreted as the second resonance of the epilarynx tube. Singers in other voice categories who produce vocal ring are assumed to have the same peak, but no measurements have as yet been made. Materials and Methods : Fifteen tenors, fourteen baritones, seven sopranos and five mezzo sopranos attending the music college, department of vocal music who could reliably produce the head and chest registers were chosen for this study. Each subject was asked to produce an/ah/sound for at least three seconds for the head register sound(tenors ; G4, barions ; E4 sopranos ; F5 and mezzosopranos ; C5) and for the chest register sound (tenors ; C3, baritones ; D3, sopranos ; D4 and Mezzosoprano ; A3). The sound data was analyzed using the Fast Fourier Transform (FFT)-based power spectrum, Long term average(LTA) power spectrum using the FFT algorithm of the Computerized Speech Lab (CSL, Kay elemetrics, Model 4300B, USA). Statistical analysis was performed using the Mann-Whitney test of the Statistical Package for Social sciences(SPSS). Results : For head register sounds, a significant increase was seen in the 2,200-3,400Hz region(p<0.05) and the Similar to the head register sounds, there was a significant increase in energy in the four trained singer group compared with the untrained group in the 2,200-3,100Hz region(p<0.05), the 7,800-8,400Hz region(p<0.05) for the chest register sounds. Conclusions : When good vocal production was made for the head and chest registers, an energy peak was observed near 2,500Hz, a frequency already known as the "singer's formant', in all subjects in the study group. Another region of increased energy was observed around 8,000Hz that had not been noticed previously. The authors believe this region to be the second singer's formant.

• Korean Journal of Clinical Laboratory Science
• /
• v.52 no.3
• /
• pp.229-236
• /
• 2020

Sixty-five molds isolated from clinical specimens were included in this study. All the isolates were molds that could be identified morphologically, strains that are difficult to identify because of morphological similarities, and strains that require species-level identification. PCR and direct sequencing were performed to target the internal transcribed spacer (ITS) region, the D1/D2 region, and the β-tubulin gene. Comparative sequence analysis using the GenBank database was performed using the basic local alignment search tool (BLAST) algorithm. The fungi identified morphologically to the genus level were 67%. Sequencing analysis was performed on 62 genera and species level of the 65 strains. Discrepancies were 14 (21.5%) of the 65 strains between the results of phenotypic and molecular identification. B. dermatitidis, T. marneffei, and G. argillacea were identified for the first time in Korea using the DNA sequencing method. Morphological identification is a very useful method in terms of the reporting time and costs in cases of frequently isolated and rapid growth, such as Aspergillus. When molecular methods are employed, the cost and clinical significance should be considered. On the other hand, the molecular identification of molds can provide fast and accurate results.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.4
• /
• pp.60-70
• /
• 2000

An 8$\times$8+20-bit MAC is designed with low power design methodologies at each of the system design levels. At algorithm level, a new method for multipl $y_tract operation is proposed, and it saves the transistor counts over conventional methods in hardware realization. A new Booth selector circuit using NMOS pass-transistor logic is also proposed at circuit level. It is superior to other circuits designed by CMOS in power-delay-product. And at architecture level, we adopted an ELM adder that is known to be the most efficient in power consumption, operating frequency, area and design regularity as the final adder. For registers, dynamic CMOS single-edge triggered flip-flops are used because they need less transistors per bit. To increase the operating frequency 2-stage pipeline architecture is adopted, and fast 4：2 compressors are applied in Wallace tree block. As a simulation result, the designed MAC in 0.6${\mu}{\textrm}{m}$ 1-poly 3-metal CMOS process is operated at 200MHz, 3.3V and consumed 35㎽ of power in multiply operation, and operated at 100MHz consuming 29㎽ in MAC operations, respectively.ly.

• Journal of Broadcast Engineering
• /
• v.18 no.2
• /
• pp.178-184
• /
• 2013

In this paper, we propose an efficient parallelization technique of PU-level motion estimation (ME) in the next generation video coding standard, high efficiency video coding (HEVC) to reduce the time complexity of video encoding. It is difficult to encode video in real-time because ME has significant complexity (i.e., 80 percent at the encoder). In order to solve this problem, various techniques have been studied, and among them is the parallelization, which is carefully concerned in algorithm-level ME design. In this regard, merge estimation method using merge estimation region (MER) that enables ME to be designed in parallel has been proposed; but, parallel ME based on MER has still unconsidered problems to be implemented ideally in HEVC test model (HM). Therefore, we propose two strategies to implement stable parallel ME using MER in HM. Through experimental results, the excellence of our proposed methods is shown; the encoding time using the proposed method is reduced by 25.64 percent on average of that of HM which uses sequential ME.

• Investigative Magnetic Resonance Imaging
• /
• v.14 no.1
• /
• pp.56-63
• /
• 2010

Purpose : DIR image is relatively free from susceptibility artifacts therefore, DIR image can make it possible to reliably measure cortical thickness/volume. One drawback of the DIR acquisition is the long scan time to acquire the fully sampled 3D data set. To solve this problem, we applied a parallel imaging method (GRAPPA) and verify the reliability of using the volumetric study. Materials and methods : Six healthy volunteers (3 males and 3 females; age $25.33{\pm}2.25$ years) underwent MRI using the 3D DIR sequence at a 3.0T Siemens Tim Trio MRI scanner. GRAPPA simulation was performed from the fully sampled data set for reduction factor 2. Data reconstruction was performed using MATLAB R2009b. Freesurfer v.4.3.0 was used to evaluate the cortical thickness of the entire brain, and to extract white matter information from the DIR image, Analyze 9.0 was used. The global cortical thickness estimated from the reconstructed image was compared with reference image by using a T-test in SPSS. Results : Although reduced SNR and blurring are observed from the reconstructed image, in terms of segmentation the effect was not so significant. The volumetric result was validated that there were no significant differences in many cortical regions. Conclusion : This study was performed with DIR image for a volumetric MRI study. To solve the long scan time of 3D DIR imaging, we applied GRAPPA algorithm. According to the results, fast imaging can be done with reduction factor 2 with little loss of image quality at 3.0T.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.847-854
• /
• 2005

Since the propagation speed of the Internet worms is quite fast, worm detection in early propagation stage is very important for reducing the damage. Virus throttling technique, one of many early worm detection techniques, detects the Internet worm propagation by limiting the connection requests within a certain ratio.[6, 7] The typical throttling technique increases the possibility of false detection by treating destination IP addresses independently in their delay queue managements. In addition, it uses a simple decision strategy that determines a worn intrusion if the delay queue is overflown. This paper proposes a two dimensional delay queue management technique in which the sessions with the same destination IP are linked and thus a IP is not stored more than once. The virus throttling technique with the proposed delay queue management can reduce the possibility of false worm detection, compared with the typical throttling since the proposed technique never counts the number of a IP more than once when it chicks the length of delay queue. Moreover, this paper proposes a worm detection algorithm based on weighted average queue length for reducing worm detection time and the number of worm packets, without increasing the length of delay queue. Through deep experiments, it is verified that the proposed technique taking account of the length of past delay queue as well as current delay queue forecasts the worn propagation earlier than the typical iuぉ throttling techniques do.

• KIISE Transactions on Computing Practices
• /
• v.22 no.2
• /
• pp.69-76
• /
• 2016

With the recent increase of the interest in IoT in almost all areas of industry, computing technologies have been increasingly applied in human environments such as houses, buildings, cars, and streets; in these IoT environments, speech recognition is being widely accepted as a means of HCI. The existing server-based speech recognition techniques are typically fast and show quite high recognition rates; however, an internet connection is necessary, and complicated server computing is required because a voice is recognized by units of words that are stored in server databases. This paper, as a successive research results of speech recognition algorithms for the Korean phonemic vowel 'ㅏ', 'ㅓ', suggests an implementation of speech recognition algorithms for the Korean phonemic vowel 'ㅣ'. We observed that almost all of the vocal waveform patterns for 'ㅣ' are unique and different when compared with the patterns of the 'ㅏ' and 'ㅓ' waveforms. In this paper we propose specific waveform patterns for the Korean vowel 'ㅣ' and the corresponding recognition algorithms. We also presents experiment results showing that, by adding neural-network learning to our algorithm, the voice recognition success rate for the vowel 'ㅣ' can be increased. As a result we observed that 90% or more of the vocal expressions of the vowel 'ㅣ' can be successfully recognized when our algorithms are used.