• Title/Summary/Keyword: maximum a posteriori

Search Result 162, Processing Time 0.021 seconds

Improving SVM with Second-Order Conditional MAP for Speech/Music Classification (음성/음악 분류 향상을 위한 2차 조건 사후 최대 확률기법 기반 SVM)

  • Lim, Chung-Soo;Chang, Joon-Hyuk
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.5
    • /
    • pp.102-108
    • /
    • 2011
  • Support vector machines are well known for their outstanding performance in pattern recognition fields. One example of their applications is music/speech classification for a standardized codec such as 3GPP2 selectable mode vocoder. In this paper, we propose a novel scheme that improves the speech/music classification of support vector machines based on the second-order conditional maximum a priori. While conventional support vector machine optimization techniques apply during training phase, the proposed technique can be adopted in classification phase. In this regard, the proposed approach can be developed and employed in parallel with conventional optimizations, resulting in synergistic boost in classification performance. According to experimental results, the proposed algorithm shows its compatibility and potential for improving the performance of support vector machines.

Emotion recognition in speech using hidden Markov model (은닉 마르코프 모델을 이용한 음성에서의 감정인식)

  • 김성일;정현열
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.3 no.3
    • /
    • pp.21-26
    • /
    • 2002
  • This paper presents the new approach of identifying human emotional states such as anger, happiness, normal, sadness, or surprise. This is accomplished by using discrete duration continuous hidden Markov models(DDCHMM). For this, the emotional feature parameters are first defined from input speech signals. In this study, we used prosodic parameters such as pitch signals, energy, and their each derivative, which were then trained by HMM for recognition. Speaker adapted emotional models based on maximum a posteriori(MAP) estimation were also considered for speaker adaptation. As results, the simulation performance showed that the recognition rates of vocal emotion gradually increased with an increase of adaptation sample number.

  • PDF

Effect of filters and reconstruction method on Cu-64 PET image

  • Lee, Seonhwa;Kim, Jung min;Kim, Jung Young;Kim, Jin Su
    • Journal of Radiopharmaceuticals and Molecular Probes
    • /
    • v.3 no.2
    • /
    • pp.65-71
    • /
    • 2017
  • To assess the effects of filter and reconstruction of Cu-64 PET data on Siemens scanner, the various reconstruction algorithm with various filters were assessed in terms of spatial resolution, non-uniformity (NU), recovery coefficient (RC), and spillover ratio (SOR). Image reconstruction was performed using filtered backprojection (FBP), 2D ordered subset expectation maximization (OSEM), 3D reprojection algorithm (3DRP), and maximum a posteriori algorithms (MAP). For the FBP reconstruction, ramp, butterworth, hamming, hanning, or parzen filters were used. Attenuation or scatter correction were performed to assess the effect of attenuation and scatter correction. Regarding spatial resolution, highest achievable volumetric resolution was $3.08mm^3$ at the center of FOV when MAP (${\beta}=0.1$) reconstruction method was used. SOR was below 4% for FBP when ramp, Hamming, Hanning, or Shepp-logan filter were used. The lowest NU (highest uniform) after attenuation & scatter correction was 5.39% when FBP (parzen filter) was used. Regarding RC, 0.9 < RC < 1.1 was obtained when OSEM (iteration: 10) was used when attenuation and scatter correction were applied. In this study, image quality of Cu-64 on Siemens Inveon PET was investigated. This data will helpful for the quantification of Cu-64 PET data.

Low Dimensional Multiuser Detection Exploiting Low User Activity

  • Lee, Junho;Lee, Seung-Hwan
    • Journal of Communications and Networks
    • /
    • v.15 no.3
    • /
    • pp.283-291
    • /
    • 2013
  • In this paper, we propose new multiuser detectors (MUDs) based on compressed sensing approaches for the large-scale multiple antenna systems equipped with dozens of low-power antennas. We consider the scenarios where the number of receiver antennas is smaller than the total number of users, but the number of active users is relatively small. This prior information motivates sparsity-embracing MUDs such as sparsity-embracing linear/nonlinear MUDs where the detection of active users and their symbol detection are employed. In addition, sparsity-embracing MUDs with maximum a posteriori probability criterion (MAP-MUDs) are presented. They jointly detect active users and their symbols by exploiting the probability of user activity, and it can be solved efficiently by introducing convex relaxing senses. Furthermore, it is shown that sparsity-embracing MUDs exploiting common users' activity across multiple symbols, i.e., frame-by-frame, can be considered to improve performance. Also, in multiple multiple-input and multiple-output networks with aggressive frequency reuse, we propose the interference cancellation strategy for the proposed sparsity-embracing MUDs. That first cancels out the interference induced by adjacent networks and then recovers the desired users' information by exploiting the low user activity. In simulation studies for binary phase shift keying modulation, numerical evidences establish the effectiveness of our proposed MUDs exploiting low user activity, as compared with the conventional MUD.

Optimizations for Mobile MIMO Relay Molecular Communication via Diffusion with Network Coding

  • Cheng, Zhen;Sun, Jie;Yan, Jun;Tu, Yuchun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.4
    • /
    • pp.1373-1391
    • /
    • 2022
  • We investigate mobile multiple-input multiple-output (MIMO) molecular communication via diffusion (MCvD) system which is consisted of two source nodes, two destination nodes and one relay node in the mobile three-dimensional channel. First, the combinations of decode-and-forward (DF) relaying protocol and network coding (NC) scheme are implemented at relay node. The adaptive thresholds at relay node and destination nodes can be obtained by maximum a posteriori (MAP) probability detection method. Then the mathematical expressions of the average bit error probability (BEP) of this mobile MIMO MCvD system based on DF and NC scheme are derived. Furthermore, in order to minimize the average BEP, we establish the optimization problem with optimization variables which include the ratio of the number of emitted molecules at two source nodes and the initial position of relay node. We put forward an iterative scheme based on block coordinate descent algorithm which can be used to solve the optimization problem and get optimal values of the optimization variables simultaneously. Finally, the numerical results reveal that the proposed iterative method has good convergence behavior. The average BEP performance of this system can be improved by performing the joint optimizations.

Super-Resolution Reconstruction Algorithm using MAP estimation and Huber function (MAP 추정법과 Huber 함수를 이용한 초고해상도 영상복원)

  • Jang, Jae-Lyong;Cho, Hyo-Moon;Cho, Sang-Bok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.46 no.5
    • /
    • pp.39-48
    • /
    • 2009
  • Many super-resolution reconstruction algorithms have been proposed since it was the first proposed in 1984. The spatial domain approach of the super-resolution reconstruction methods is accomplished by mapping the low resolution image pixels into the high resolution image pixels. Generally, a super-resolution reconstruction algorithm by using the spatial domain approach has the noise problem because the low resolution images have different noise component, different PSF, and distortion, etc. In this paper, we proposed the new super-resolution reconstruction method that uses the L1 norm to minimize noise source and also uses the Huber norm to preserve edges of image. The proposed algorithm obtained the higher image quality of the result high resolution image comparing with other algorithms by experiment.

Iterative Phase estimation based on Turbo code (터보부호를 이용한 반복 위상 추정기법)

  • Ryu, Joong-Gon;Heo, Jun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.12 s.354
    • /
    • pp.1-8
    • /
    • 2006
  • In this paper, we propose carrier phase synchronization algorithm which are base on turbo coded system for DVB-RCS. There have been two categories of phase estimator, single estimator outside turbo code decoder and multiple estimators inside turbo code decoder. In single estimator, we use the estimation algorithm that ML(Maximum Likelihood) and LMS(Least Mean Square), also three different soft decision methods are proposed. Multiple estimator apply PSP(Per Survivor Processing) algorithm additionally. We compared performance between single estimator and Multiple estimator in AWGN channel. We presented the two methods of PSP algorithm for performance elevation. First is the Bi-directional channel estimation and second is binding method.

Turbo Coded OFDM Scheme for a High-Speed Power Line Communication (고속 전력선 통신을 위한 터보 부호화된 OFDM)

  • Kim, Jin-Young;Koo, Sung-Wan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.1
    • /
    • pp.141-150
    • /
    • 2010
  • 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 improved 3dB by increasing the number of iterations, 2 to 8, and interleaver length of a turbo encoder, 100 to 5000. The results in this paper can be applied to OFDM-based high-speed power line communication systems.

Improvement in the classification performance of Raman spectra using a hierarchical tree structure (계층적 트리 구조를 이용한 라만스펙트럼 판별 성능 개선)

  • Park, Jun-Kyu;Baek, Sung-June;Seo, Yu-Gyeong;Seo, Sung-Il
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.8
    • /
    • pp.5280-5287
    • /
    • 2014
  • This paper proposes a method in which classes are grouped as a hierarchical tree structure for the effective classification of the Raman spectra. As experimental data, the Raman spectra of 28 chemical compounds were obtained, and pre-treated with noise removal and normalization. The spectra that induced a classification error were grouped into the same class and the hierarchical structure class was composed. Each high and low class was classified using a PCA-MAP method. According to the experimental results, the classification of 100% was achieved with 2.7 features on average when the proposed method was applied. Considering that the same classification rates were achieved with 6 features using the conventional method, the proposed method was found to be much better than the conventional one in terms of the total computational complexity and practical application.

An Improved Adaptive Background Mixture Model for Real-time Object Tracking based on Background Subtraction (배경 분리 기반의 실시간 객체 추적을 위한 개선된 적응적 배경 혼합 모델)

  • Kim Young-Ju
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.6 s.38
    • /
    • pp.187-194
    • /
    • 2005
  • The background subtraction method is mainly used for the real-time extraction and tracking of moving objects from image sequences. In the outdoor environment, there are many changeable environment factors such as gradually changing illumination, swaying trees and suddenly moving objects , which are to be considered for an adaptive processing. Normally, GMM(Gaussian Mixture Model) is used to subtract the background by considering adaptively the various changes in the scenes, and the adaptive GMMs improving the real-time Performance were Proposed and worked. This paper, for on-line background subtraction, employed the improved adaptive GMM, which uses the small constant for learning rate a and is not able to speedily adapt the suddenly movement of objects, So, this paper Proposed and evaluated the dynamic control method of a using the adaptive selection of the number of component distributions and the global variances of pixel values.

  • PDF