• The Journal of the Acoustical Society of Korea
• /
• v.18 no.2
• /
• pp.3-10
• /
• 1999

This paper describes the development and evaluation of a Korean address input system employing automatic speech recognition technique as user interface for input Korean address. Address consists of cities, provinces and counties. The system works on a window 95 environment of personal computer with built-in soundcard. In the speech recognition part, the Continuous density Hidden Markov Model(CHMM) for making phoneme like units(PLUs) and One Pass Dynamic Programming(OPDP) algorithm is used for recognition. For address recognition, Finite State Automata(FSA) suitable for Korean address structure is constructed. To achieve an acceptable performance against the variation of speakers, microphones, and environmental noises, Maximum a posteriori(MAP) estimation is implemented in adaptation. And to improve the recognition speed, fast search method using variable pruning threshold is newly proposed. In the evaluation tests conducted for the 100 connected words uttered by 3 males the system showed above average 96.0% of recognition accuracy for connected words after adaption and recognition speed within 2 seconds, showing the effectiveness of the system.

• The Journal of the Korea Contents Association
• /
• v.6 no.12
• /
• pp.105-112
• /
• 2006

In this study, we propose a simple preprocessing method for classification of basal cell carcinoma (BCC), which is one of the most common skin cancer. The preprocessing step consists of data clipping with a half Hanning window and dimension reduction with principal components analysis (PCA). The application of the half Hanning window deemphasizes the peak near $1650cm^{-1}$ and improves classification performance by lowering the false negative ratio. Classification results with various classifiers are presented to show the effectiveness of the proposed method. The classifiers include maximum a posteriori probability (MAP), k-nearest neighbor (KNN), probabilistic neural network (PNN), multilayer perceptron(MLP), support vector machine (SVM) and minimum squared error (MSE) classification. Classification results with KNN involving 216 spectra preprocessed with the proposed method gave 97.3% sensitivity, which is very promising results for automatic BCC detection.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1373-1379
• /
• 2006

Moving object extraction is one of key research topics for various video services. In this study, a new moving object extraction algorithm is introduced to extract objects using block motion vectors in video data. To do this, 1) a maximum a posteriori probability and Gibbs random field are used to obtain real block motion vectors,2) a 2-D histogram technique is used to determine a global motion, 3) additionally, a block segmentation is fellowed. In the computer simulation results, the proposed technique shows a good performance.

• 한국정보통신설비학회:학술대회논문집
• /
• 2009.08a
• /
• pp.190-196
• /
• 2009

In this paper, performance of a turbo-coded OFDM system is analyzed and simulated in a power line communication channel. Since the power line communication system typically operates in a hostile environment, turbo code has been employed to enhance reliability of transmitted data. The performance is evaluated in terms of bit error probability. As turbo decoding algorithms, MAP (maximum a posteriori), Max-Log-MAP, and SOVA (soft decision Viterbi output) algorithms are chosen and their performances are compared. From simulation results, it is demonstrated that Max-Log-MAP algorithm is promising in terms of performance and complexity. It is shown that performance is substantially improved by increasing the number of iterations and interleaver length of a turbo encoder. The results in this paper can be applied to OFDM-based high-speed power line communication systems.

• Journal of Biomedical Engineering Research
• /
• v.17 no.4
• /
• pp.433-442
• /
• 1996

Since one texture property(i.e coarseness, orientation, regularity, granularity) for ultrasound liver ages was not sufficient enough to classify the characteristics of livers, we used multi texture vectors tracted from ultrasound liver images and a statistical classifier. Multi texture vectors are selected among the feature vectors of the normal liver, fat liver and cirrhosis images which have a good separability in those ultrasound liver images. The statistical classifier uses multi texture vectors as input vectors and classifies ultrasound liver images for each multi texture vector by the Bayes decision rule. Then the decision of the liver disease is made by choosing the maximum value from the averages of a posteriori probability for each multi texture vector In our simulation, we obtained higtler correct ratio than that of other methods using single feature vector, for the test set the correct ratio is 94% in the normal liver, 84% in the fat liver and 86% in the cirrhosis liver.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.2
• /
• pp.6-14
• /
• 2007

In this paper, we propose and observe the Adaptive Modulation system with optimal Turbo Coded V-BLAST (Vertical-Bell-lab Layered Space-Time) technique that is applied the extrinsic information from MAP (Maximum A Posteriori) Decoder in decoding Algorithm of V-BLAST: ordering and slicing. The extrinsic information is used by a priori probability and the system decoding process is composed of the Main Iteration and the Sub Iteration. And comparing the proposed system with the Adaptive Modulation system using conventional Turbo Coded V-BLAST technique that is simply combined V-BLAST with Turbo Coding scheme, we observe how much throughput performance has been improved. In addition, we observe the proposed system using STD (Selection Transmit Diversity) scheme. As a result of simulation, Comparing with the conventional Turbo Coded V-BLAST technique with the Adaptive Modulation systems, the optimal Turbo Coded V-BLAST technique with the Adaptive Modulation systems has better throughput gain that is about 350 Kbps in 11 dB SNR range. Especially, comparing with the conventional Turbo Coded V-BLAST technique using 2 transmit and 2 receive antennas, the proposed system with STD (Selection Transmit Diversity) scheme show that the improvement of maximum throughput is about 1.77 Mbps in the same SNR range.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.905-908
• /
• 2008

In this paper, an Adaptive Modulation (AM) system with an efficient turbo-coded Vertical-Bell-lab Layered Space-Time (V-BLAST) technique is proposed. The proposed decoding algorithm adopts iteratively the extrinsic information from a Maximum a Posteriori (MAP) decoder as a priori probability in the two decoding procedures of the V-BLAST scheme of ordering and slicing. In this analysis, each MIMO channel is assumed to be a part of the system of performance improvement.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.261-262
• /
• 2006

According to the previous work, various well known methods including maximum a posteriori probability classifier (MAP) and multi layer perceptron networks classifier (MLP) showed competitive results. Since even the small errors often leads to a fatal result, we investigated the method that reduces classification error perfectly by screening out some ambiguous patterns. Those ambiguous patterns can be examined by routine biopsy. We incorporated an ambiguous category in MAP and MLP. Classification results involving 216 spectra gave 100% sensitivity for the case of MLP.

• Proceedings of the KIEE Conference
• /
• 2008.04a
• /
• pp.89-90
• /
• 2008

AWGN(Addictive white gaussian noise)에 의해 영상은 자주 훼손되곤 한다. 최근 이를 복원하기위해 웨이블릿(Wavelet) 영역에서의 베이시안(Bayesian) 추정법이 연구되고 있다. 웨이블릿 변환된 영상 신호의 밀도 함수(pdf)는 표족한 첨두와 긴 꼬리(long-tail)를 갖는 경망이 있다. 이러한 사전 밀도 함수(a priori probability density function)를 상황에 적합하게 추정한다면 좋은 성능의 복원 결과를 얻을 수 있다. 빈번이 제안되는 릴도 함수로 가우시안(Gaussian) 분포 참수와 라플라스(Laplace) 분포 함수가 있다. 이들 각각의 모델은 훌륭히 변환 계수들을 모델링하며 나름대로의 장점을 나타낸다. 본 연구에서는 가우시안 분포와 라플라스(Laplace) 분포의 혼합 분포 모델을 밀도 함수로 제안하여, 이 들의 장점을 종합하였다. 이를 MAP(Maximum a Posteriori) 추정 방법에 적용하여 잡음을 제거 하였다. 그 결과 기존의 알고리즘에 비해 시각적인 면(Visual aspect), 수치적인 면(PSNR), 그리고 연산량(Complexity) 측면에서 망상된 결과를 얻었다.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.3
• /
• pp.10-16
• /
• 1999

In this paper, we have studied Continuous Speech Recognition System of Speaker Adaptation using MAPE (Maximum A Posteriori Probability Estimation) which can adapt any small amount of adaptation speech data. Speaker adaptation is performed by the method of MAPB after Concatenation training which is making sentence unit HMM linked by syllable unit HMM and Viterbi segmentation classifies speech data to be adaptation into segmentation of syllable unit data automatically without hand labelling. For car control speech the recognition rates of adaptation of HMM was 77.18% which is approximately 6% improvement over that of unadapted HMM.(in case of O(n)DP)