• Title/Summary/Keyword: 평균 탐색률

Search Result 78, Processing Time 0.028 seconds

Hierarchical Hidden Markov Model for Finger Language Recognition (지화 인식을 위한 계층적 은닉 마코프 모델)

  • Kwon, Jae-Hong;Kim, Tae-Yong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.9
    • /
    • pp.77-85
    • /
    • 2015
  • The finger language is the part of the sign language, which is a language system that expresses vowels and consonants with hand gestures. Korean finger language has 31 gestures and each of them needs a lot of learning models for accurate recognition. If there exist mass learning models, it spends a lot of time to search. So a real-time awareness system concentrates on how to reduce search spaces. For solving these problems, this paper suggest a hierarchy HMM structure that reduces the exploration space effectively without decreasing recognition rate. The Korean finger language is divided into 3 categories according to the direction of a wrist, and a model can be searched within these categories. Pre-classification can discern a similar finger Korean language. And it makes a search space to be managed effectively. Therefore the proposed method can be applied on the real-time recognition system. Experimental results demonstrate that the proposed method can reduce the time about three times than general HMM recognition method.

Fuzzy Stretching Method of Color Image (컬러 영상에서의 퍼지 스트레칭 기법)

  • Kim, Kwang-Baek
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.5
    • /
    • pp.19-23
    • /
    • 2013
  • TIn this paper, we propose a novel fuzzy stretching method that adopts a triangle type fuzzy membership function to control the highest and lowest brightness limit dynamically. As an essential procedure to enhance the brightness contrast, stretching is an important procedure in color image processing. While popular Ends-in Search stretching method should be provided fixed minimum and maximum brightness threshold from experience, our proposed method determines them dynamically by fuzzy membership functions. The minimum and maximum limit is determined by computing the lowest and highest pixel value according to the membership degree of our designed triangle type membership function. The experiment shows that the proposed method result in far less skewed histogram than those of Ends-in Search stretching thus successfully verifies its effectiveness.

Handwritten Hangul Word Recognition from Small Vocabulary using Grapheme Combination Type (자모 결합 유형을 이용한 적은 어휘에서의 필기 한글 단어 인식)

  • Jin, Yu-Ho;Kim, Ho-Yeon;Kim, In-Jung;Kim, Jin-Hyeong
    • Journal of KIISE:Software and Applications
    • /
    • v.28 no.1
    • /
    • pp.52-63
    • /
    • 2001
  • 필기 단어 인식 방법에는 낱자별 분할 및 낱자 단위 인식을 통해 인식하는 방법과 단어 사전을 이용하여 단어와 영상을 직접 비교하는 방법이 있다. 이 중 후자는 인식 대상이 되는 단어들이 작은 수의 어휘로 제한되었을 대 매우 효과적이다. 본 논문에서는 입력 영상이 주어졌을 때 자모를 순차적으로 탐색하고 그 결과의 최적 조합을 찾아 인식하는 사전을 이용한 필기 한글 단어 인식 방법을 제안한다. 입력 영상은 사전의 각 단어와의 매칭을 통해 인식된다. 단어는 필기 순서로 정렬된 자모열로 표현하고 입력 영상은 획들의 집합으로 표현한다. 단어의 자모들은 입력 영상으로부터 추출된 획들의 집합으로부터 단계적으로 탐색된다. 각 단계에서는 전 단계까지의 매칭 상태와 탐색하려는 자모의 형태로부터 자모가 존재할 것이라고 기대되는 정합 기대 영역을 설정한 후 그 안에서 자모 탐색기를 이용해 자모를 찾는다. 자모 탐색기는 획들의 집합으로 이루어진 복수의 자모 후보와 그 점수를 출력한다. 각 단계마다 생성된 자모 후보들은 최적의 단어 매칭을 찾기 위한 탐색 공간을 이룬다. 본 연구에서는 단어 사전을 trie로 구성하고, 탐색 과정에서 dynamic programming을 이용하여 효과적으로 탐색을 수행하였다. 또한 인식 속도를 향상시키기 위해 산전 축소, 탐색 공간 축소 등 다양한 지식을 이용하였다. 제안하는 방법은 무제약으로 쓰여진 필기 단어도 인식 할 수 있을 뿐 아니라, 동적 사전을 이용하기 때문에 사전의 내용이 변하는 환경에서도 적용할 수 있다. 인식 실험에서는 39개의 단어로 이루어진 사전에 대하여 613개의 단어 영상에 대해 실험한 결과 98.54%의 높은 인식률을 보임으로써 제안하는 방법이 매우 효과적임을 확인하였다. 아니라 곰팡이 균주도 실제 praxis에 적합하게 개발시킬수 있다. 따라서 앞으로 발효육제품제조에 있어 starter culture가 갖는 의미는 매우 중요하며 특히 짧은 숙성기간을 거치는 발효소시지의 제조에 있어서는 필수불가결한 공정의 한 분야로 자리잡게 될 것이다.큰 차이 없었으나 이중포장과 진공포장은 상당히 효과적임을 알 수 있었다.로는 18%에 비하여 22%가 더 적합한 것으로 생각되었다.$0.15{\sim}0.35%$이었다.irc}C$에서 $13.49{\times}10^{-3}$이었다. 이 값들을 Arrhenius식에 대입하여 구한 활성화 에너지는 24.795 kJ/Kmol이었다. 이 값으로부터 결정한 살균 포장약주 명가의 상용 저장 수명은 $10^{\circ}C$에서 2년, $20^{\circ}C$에서 1년 4개월, $25^{\circ}C$에서 1년 2개월 이었다. 서울의 매월 평균 온도를 기준으로 계산할 때 본제품의 상용저장기간은 1년 8개월이었다.로 반죽이 호화되고 가열시간이 그 이상으로 증가할 때도 반죽의 호화가 약간은 진행되지만 $90^{\circ}C$ 이상의 가열온도에서는 가열시간 0.5분 이내에 반죽의 호화가 급속히 일어나고 가열 시간을 증가시켜도 더이상의 호화는 일어나지 않았다. 같은 조건에서는 waxy corn starch 반죽의 호화 속도가 corn starch보다 더 빠른 것으로 나타났다. 대표적으로 52% 수분함량에서 반응속도상수(k)와 가열온도(T)사이의 관계식은 corn starch의 경우 $logk=11.1140-4.1226{\times}10^3(1/T)

  • PDF

Improving Phoneme Recognition based on Gaussian Model using Bhattacharyya Distance Measurement Method (바타챠랴 거리 측정 기법을 사용한 가우시안 모델 기반 음소 인식 향상)

  • Oh, Sang-Yeob
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.1
    • /
    • pp.85-93
    • /
    • 2011
  • Previous existing vocabulary recognition programs calculate general vector values from a database, so they can not process phonemes that form during a search. And because they can not create a model for phoneme data, the accuracy of the Gaussian model can not secure. Therefore, in this paper, we recommend use of the Bhattacharyya distance measurement method based on the features of the phoneme-thus allowing us to improve the recognition rate by picking up accurate phonemes and minimizing recognition of similar and erroneous phonemes. We test the Gaussian model optimization through share continuous probability distribution, and we confirm the heighten recognition rate. The Bhattacharyya distance measurement method suggest in this paper reflect an average 1.9% improvement in performance compare to previous methods, and it has average 2.9% improvement based on reliability in recognition rate.

Logically Partitoned Disk Arrays for Video-On-Demand Servers (주문형 비디오 서버의 성능 개선을 위한 논리적 디스크 분할 기법)

  • 김운석;김지홍;민상렬
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 1998.10a
    • /
    • pp.6-8
    • /
    • 1998
  • 프로세서와 네트워크의 성능이 향상됨에 따라 이들을 이용한 많은 멀티미디어 응용물들이 개발되었다. 특히 인터넷의 발전은 이러한 멀티미디어 응용물들로 하여금 여러 곳에 분산되어 있는 데이터들을 쉽게 이용할 수 있도록 하였다. 멀티미디어 응용물들이 요구하는 데이터는 그 크기가 크고, 실시간 전송을 요구한다는 특성을 가진다. 따라서 이러한 데이터를 제공하는 서버는 여러 데이터를 다수의 사용자에게 일정한 전송률로 제공할 수 있어야 한다. 본 논문에서는 디스크 배열을 이용하는 주문형 비디오 서버에 있어서 디스크 탐색 시간으로 낭비되는 디스크 대역폭을 최소화하는 논리적 디스크 분할 기법과 이에 적합한 비디오 파일 배치 기업을 제시한다. 추가적으로 얻어진 디스크 대역폭들은 보다 많은 사용자 요구들을 처리하기 위해 사용되거나 비동기적인 사용자 요구들을 처리하는데 이용될 수 있는데, 이를 스트림 지원에 이용할 경우, 평균 3~11%정도의 스트림수 증가가 있음을 모의 실험을 통해 확인하였다.

  • PDF

Continuous Speech Recognition Using N-gram Language Models Constructed by Iterative Learning (반복학습법에 의해 작성한 N-gram 언어모델을 이용한 연속음성인식에 관한 연구)

  • 오세진;황철준;김범국;정호열;정현열
    • The Journal of the Acoustical Society of Korea
    • /
    • v.19 no.6
    • /
    • pp.62-70
    • /
    • 2000
  • In usual language models(LMs), the probability has been estimated by selecting highly frequent words from a large text side database. However, in case of adopting LMs in a specific task, it is unnecessary to using the general method; constructing it from a large size tent, considering the various kinds of cost. In this paper, we propose a construction method of LMs using a small size text database in order to be used in specific tasks. The proposed method is efficient in increasing the low frequent words by applying same sentences iteratively, for it will robust the occurrence probability of words as well. We carried out continuous speech recognition(CSR) experiments on 200 sentences uttered by 3 speakers using LMs by iterative teaming(IL) in a air flight reservation task. The results indicated that the performance of CSR, using an IL applied LMs, shows an 20.4% increased recognition accuracy compared to those without it. This system, using the IL method, also shows an average of 13.4% higher recognition accuracy than the previous one, which uses context-free grammar(CFG), implying the effectiveness of it.

  • PDF

A Neural Network based Block Classifier for High Speed Fractal Image Compression (고속 프랙탈 영상압축을 위한 신경회로망 기반 블록분류기)

  • 이용순;한헌수
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.10 no.3
    • /
    • pp.179-187
    • /
    • 2000
  • Fractal theory has strengths such as high compression rate and fast decoding time in application to image compression, but it suffers from long comparison time necessary for finding an optimally similar domain block in the encoding stage. This paper proposes a neural network based block classifier which enhances the encoding time significantly by classifying domain blocks into 4 patterns and searching only those blocks having the same pattern with the range block to be encoded. Size of a block is differently determined depending on the image complexity of the block. The proposed algorithm has been tested with three different images having various featrues. The experimental results have shown that the proposed algorithm enhances the compression time by 40% on average compared to the conventional fractal encoding algorithms, while maintaining allowable image qualify of PSNR 30 dB.

  • PDF

Genetic Algorithm Based Routing Method for Efficient Data Transmission for Reliable Data Transmission in Sensor Networks (센서 네트워크에서 데이터 전송 보장을 위한 유전자 알고리즘 기반의 라우팅 방법)

  • Kim, Jin-Myoung;Cho, Tae-Ho
    • Journal of the Korea Society for Simulation
    • /
    • v.16 no.3
    • /
    • pp.49-56
    • /
    • 2007
  • There are many application areas of wireless sensor networks, such as combat field surveillance, terrorist tracking and highway traffic monitoring. These applications collect sensed data from sensor nodes to monitor events in the territory of interest. One of the important issues in these applications is the existence of the radio-jamming zone between source nodes and the base station. Depending on the routing protocol the transmission of the sensed data may not be delivered to the base station. To solve this problem we propose a genetic algorithm based routing method for reliable transmission while considering the balanced energy depletion of the sensor nodes. The genetic algorithm finds an efficient routing path by considering the radio-jamming zone, energy consumption needed fur data transmission and average remaining energy level. The fitness function employed in genetic algorithm is implemented by applying the fuzzy logic. In simulation, our proposed method is compared with LEACH and Hierarchical PEGASIS. The simulation results show that the proposed method is efficient in both the energy consumption and success ratio of delivery.

  • PDF

Construction and Validation of Infection Control Practice Scale for Dental Hygienist (치과위생사의 감염관리 실천도 측정도구의 개발과 타당화)

  • Cho, Young-Sik;Jun, Bo-Hye;Choi, Young-Suk
    • Journal of dental hygiene science
    • /
    • v.9 no.1
    • /
    • pp.53-59
    • /
    • 2009
  • Infection control is now recognized as an important quality indicator in dental health service setting. The purpose of this study was to develop and validate Dental Hygienist's Infection Control Practice Scale for quality management of dental health service in Korea. The data of 254 dental hygienists was subjected to exploratory factor analysis using SPSS 16.0 and confirmatory factor analysis using AMOS 16.0. The total items of preliminary scale were 21 items and 5 subscale. Principal component analysis was completed with Varimax rotation. The results show a change in factor structure from 5 factor solution to 4 factor solution. The confirmatory factor analysis confirmed the four subscales(Immunization and periodic tests, Clinical procedure, Handwashing, Personal protection) which have a total of 12 items. After the item deleted because factor loading was low, measured model was tested. The results of the measurement model indicated fit indices: $x^2$= 79.593(df = 38, 0 = 0.000), RMR = 0.045, GFI = 0.940, CFI = 0.904, AGFI = 0.896, NFI = 0.837, TLI = 0.861, RMSEA = 0.67. The squared correlation between four constructs were less than the average variance extracted(AVE) of four constructs. Multiple regression analysis was completed. Dependent variable was the perceived infection control practice by dental hygienist. Independent variables were four summated subscales(R = 0.552, $R^2$= 0.304, Adjusted $R^2$= 0.431, F = 25.813, p = 0.000). Unstandardized coefficients of three independent variables were statistically significant.

  • PDF

Homogenization of Elastic Cracks in Hoek-Brown Rock (Hoek-Brown 암석에서 발생된 탄성균열의 균질화)

  • Lee, Youn-Kyou;Jeon, Seok-Won
    • Tunnel and Underground Space
    • /
    • v.19 no.2
    • /
    • pp.158-166
    • /
    • 2009
  • As a basic study for investigating the development of the stress-induced crack in Hoek-Brown rock, a homogenization technique of elastic cracks is proposed. The onset of crack is monitored by Hoek-Brown empirical criterion, while the orientation of the crack is determined by the critical plane approach. The concept of volume averaging in stress and strain component was invoked to homogenize the representative rock volume which consists of intact rock and cracks. The formulation results in the constitutive relations for the homogenized equivalent anisotropic material. The homogenization model was implemented in the standard FEM code COSMOSM. The numerical uniaxial tests were performed under plane strain condition to check the validity of the propose numerical model. The effect of friction between the loading plate and the rock sample on the mode of deformation and fracturing was examined by assuming two different contact conditions. The numerical simulation revealed that the homogenized model is able to capture the salient features of deformation and fracturing which are observed commonly in the uniaxial compression test.