• Title/Summary/Keyword: maximum a posteriori

Search Result 162, Processing Time 0.022 seconds

Noisy Environmental Adaptation for Word Recognition System Using Maximum a Posteriori Estimation (최대사후확률 추정법을 이용한 단어인식기의 잡음환경적응화)

  • Lee, Jung-Hoon;Lee, Shi-Wook;Chung, Hyun-Yeol
    • The Journal of the Acoustical Society of Korea
    • /
    • v.16 no.2
    • /
    • pp.107-113
    • /
    • 1997
  • To achive a robust Korean word recognition system for both channel distortion and additive noise, maximum a posteriori estimation(MAP) adaptation is proposed and the effectiveness of environmental adaptation for improving recognition performance is investigated in this paper. To do this, recognition experiments using MAP adaptation are carried out for the three different speech ; 1) channel distortion is introduced, 2) environmental noise is added, 3) both channel distortion and additive noise are presented. Theeffectiveness of additive feature parameters, such as regressive coefficients and durations, for environmental adaptation are also investigated. From the speaker independent 100 words recognition tests, we had 9.0% of recognition improvement for the case 1), more than 75% for the case 2), and 11%~61.4% for the case 3) respectively, resulting that a MAP environmental adaptation is effective for both channel distorted and noise added speech recognition. But it turned out that duration information used as additive feature parameter did not played an important role in the tests.

  • PDF

Design of an Area-Efficient Architecture for Block-wise MAP Turbo Decoder (면적 효율적인 구조의 블록 MAP 터보 복호기 설계)

  • Kang, Moon-Jun;Kim, Sik;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.8A
    • /
    • pp.725-732
    • /
    • 2002
  • Block-wise MAP (Maximum A posteriori) decoding algorithm for turbo-codes requires less memory than Log-MAP decoding algorithm. The ER (Bit Error Rate) performance of previous block-wise MAP decoding algorithm depend on the block length and training length. To maximize hardware utilization and perform successive decoding, the block length is set to be equal to the training length in previous MAP decoding algorithms. Simulation result on the BER performance shows that the EBR performance can be maintained with shorter blocks when training length is sufficient. This paper proposes an architecture for area efficient block-wise MAP decoder. The proposed architecture employs the decoding schema for reducing memory by using the training length, which in N times larger than block length. To efficiently handle the proposed schema, a pipelined architecture is proposed. Simulation results show that memory usage can be reduced by 30%~45% in the proposed architecture without degrading the BER performance.

Local Region Spectral Analysis for Performance Enhancement of Dementia Classification (인지증 판별 성능 향상을 위한 스펙트럼 국부 영역 분석 방법)

  • Park, Jun-Qyu;Baek, Seong-Joon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.11
    • /
    • pp.5150-5155
    • /
    • 2011
  • Alzheimer's disease (AD) and vascular dementia (VD) are the most common dementia. In this paper, we proposed a region selection for classification of AD, VD and normal (NOR) based on micro-Raman spectra from platelet. The preprocessing step is a smoothing followed by background elimination to the original spectra. Then we applied the minmax method for normalization. After the inspection of the preprocessed spectra, we found that 725-777, 1504-1592 and 1632-1700 $cm^{-1}$ regions are the most discriminative features in AD, VD and NOR spectra. We applied the feature transformation using PCA (principal component analysis) and NMF (nonnegative matrix factorization). The classification result of MAP(maximum a posteriori probability) involving 327 spectra transformed features using proposed local region showed about 92.8 % true classification average rate.

Fast Bayesian Inversion of Geophysical Data (지구물리 자료의 고속 베이지안 역산)

  • Oh, Seok-Hoon;Kwon, Byung-Doo;Nam, Jae-Cheol;Kee, Duk-Kee
    • Journal of the Korean Geophysical Society
    • /
    • v.3 no.3
    • /
    • pp.161-174
    • /
    • 2000
  • Bayesian inversion is a stable approach to infer the subsurface structure with the limited data from geophysical explorations. In geophysical inverse process, due to the finite and discrete characteristics of field data and modeling process, some uncertainties are inherent and therefore probabilistic approach to the geophysical inversion is required. Bayesian framework provides theoretical base for the confidency and uncertainty analysis for the inference. However, most of the Bayesian inversion require the integration process of high dimension, so massive calculations like a Monte Carlo integration is demanded to solve it. This method, though, seemed suitable to apply to the geophysical problems which have the characteristics of highly non-linearity, we are faced to meet the promptness and convenience in field process. In this study, by the Gaussian approximation for the observed data and a priori information, fast Bayesian inversion scheme is developed and applied to the model problem with electric well logging and dipole-dipole resistivity data. Each covariance matrices are induced by geostatistical method and optimization technique resulted in maximum a posteriori information. Especially a priori information is evaluated by the cross-validation technique. And the uncertainty analysis was performed to interpret the resistivity structure by simulation of a posteriori covariance matrix.

  • PDF

Feature Compensation Method Based on Parallel Combined Mixture Model (병렬 결합된 혼합 모델 기반의 특징 보상 기술)

  • 김우일;이흥규;권오일;고한석
    • The Journal of the Acoustical Society of Korea
    • /
    • v.22 no.7
    • /
    • pp.603-611
    • /
    • 2003
  • This paper proposes an effective feature compensation scheme based on speech model for achieving robust speech recognition. Conventional model-based method requires off-line training with noisy speech database and is not suitable for online adaptation. In the proposed scheme, we can relax the off-line training with noisy speech database by employing the parallel model combination technique for estimation of correction factors. Applying the model combination process over to the mixture model alone as opposed to entire HMM makes the online model combination possible. Exploiting the availability of noise model from off-line sources, we accomplish the online adaptation via MAP (Maximum A Posteriori) estimation. In addition, the online channel estimation procedure is induced within the proposed framework. For more efficient implementation, we propose a selective model combination which leads to reduction or the computational complexities. The representative experimental results indicate that the suggested algorithm is effective in realizing robust speech recognition under the combined adverse conditions of additive background noise and channel distortion.

ISI Estimation Using Iterative MAP for Faster-Than-Nyquist Transmission (나이퀴스트 율보다 빠른 전송 시스템에서 반복 MAP을 이용한 ISI 추정 기법)

  • Kang, Donghoon;Kim, Haeun;Park, Kyeongwon;Lee, Arim;Oh, Wangrok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.5
    • /
    • pp.967-974
    • /
    • 2017
  • In this paper, we propose an inter-symbol interference (ISI) estimation scheme based on the maximum a posteriori (MAP) algorithm for faster-than-Nyquist (FTN) systems. Unfortunately, the ISI estimator based on the MAP algorithm requires relatively high computational complexity. To reduce the complexity of the MAP based ISI estimator, we propose a hybrid ISI estimation scheme based on the MAP and successive interference cancellation (SIC) algorithms. The proposed scheme not only offers good ISI estimation performances but also requires reasonably low complexity.

Impacts of Non-Uniform Source on BER for SSC NOMA (Part II): Improved BER Performance Analysis

  • Chung, Kyuhyuk
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.13 no.4
    • /
    • pp.48-54
    • /
    • 2021
  • In most existing researches on non-orthogonal multiple access (NOMA) with symmetric superposition coding (SSC), uniform sources have been usually considered. For the first part in this two-part paper, for the strongest channel gain user, we showed that the bit-error rate (BER) for the optimal maximum a-posteriori (MAP) receiver for the non-uniform source improves slightly, compared to that of the conventional receiver for the uniform sources. We demonstrate that in communication scenarios of the non-uniform source NOMA schemes, for the weakest channel gain user, the BER performance of the optimal MAP receiver for a non-uniform source improves greatly, compared to that of the conventional receiver for uniform sources. We first derive an analytical expression of the BER for non-uniform source NOMA with SSC. Then, simulations demonstrate that the BER of the optimal MAP receiver for the non-uniform source improves, compared with that of the conventional maximum likelihood (ML) receiver for the uniform sources. In result, the proposed optimal MAP receiver for the non-uniform source could be a promising scheme for SSC NOMA, with improved BER performances.

A Maximum A Posterior Probability based Multiuser Detection Method in Space based Constellation Network

  • Kenan, Zhang;Xingqian, Li;Kai, Ding;Li, Li
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.12
    • /
    • pp.51-56
    • /
    • 2022
  • In space based constellation network, users are allowed to enter or leave the network arbitrarily. Hence, the number, identities and transmitted data of active users vary with time and have considerable impacts on the receiver's performance. The so-called problem of multiuser detection means identifying the identity of each active user and detecting the data transmitted by each active user. Traditional methods assume that the number of active users is equal to the maximum number of users that the network can hold. The model of traditional methods are simple and the performance are suboptimal. In this paper a Maximum A Posteriori Probability (MAP) based multiuser detection method is proposed. The proposed method models the activity state of users as Markov chain and transforms multiuser detection into searching optimal path in grid map with BCJR algorithm. Simulation results indicate that the proposed method obtains 2.6dB and 1dB Eb/N0 gains respectively when activity detection error rate and symbol error rate reach 10-3, comparing with reference methods.

Improvement of the Adaptive Modulation System with Optimal Turbo Coded V-BLAST Technique using STD Scheme (선택적 전송 다이버시티 기법을 적용한 최적의 터보 부호화된 V-BLAST 적응변조 시스템의 성능 개선)

  • Ryoo, Sang-Jin;Choi, Kwang-Wook;Lee, Kyung-Hwan;You, Cheol- Woo;Hong, Dae-Ki;Hwang, In-Tae;Kim, Cheol-Sung
    • 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.

Automatic Film Restoration Using Distributed Genetic Algorithm (분산 유전자 알고리즘을 이용한 자동 필름 복원)

  • Kim, Byung-Geun;Kim, Kyung-Tai;Kim, Eun-Yi
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.2
    • /
    • pp.1-9
    • /
    • 2009
  • In recent years, a film restoration has gained increasing attention by many researchers, to support multimedia service of high quality. In general, an old film is degraded by dust, scratch, flick, and so on. Among these, the common factors are scratch and blotch, so that many researchers have been investigated to restore these degradations. However, the methods in literature have one major limitation: A method is working well in dealing with scratches, however it is poorly working in processing the blotches. The goal of this work is to develop a robust technique to restore images degraded by both scratches and blotches. For this, we use MRF-MAP (Markov random field - maximum a posteriori) framework, so that the restoration problem is considered as the minimization problem of the posteriori energy function. As the minimization is one of complex combinatorial problem, we use distributed genetic algorithms (DGAs) that effectively deal with combinatorial problems. To asses the validity of the proposed method, it was tested on natural old films and artificially degraded films, and the results were compared with other methods. Then, the results show that the proposed method is superior to other methods.