• Title/Summary/Keyword: random vector

Search Result 551, Processing Time 0.024 seconds

A CELP Speech Coder Using Dispersed-Pulse and Random Codebook (분산펄스와 랜덤 코드북을 이용한 CELP 음성 부호화기)

  • 황윤성;문인섭;이행우;김종교
    • Proceedings of the IEEK Conference
    • /
    • 2001.06d
    • /
    • pp.115-118
    • /
    • 2001
  • This paper presents dispersed-pulse and random codebook for CELP coder. This coder operates on speech frames of 20ms and generates an excitation vector by convoluting dispersion vectors with signed pulses in an algebraic codevector. The improvement of pulse-based fixed codebook is performed at a low bit rate. A high performance fixed-codebook consists of a partial algebraic codebook and a random codebook in unvoiced and stationary noise regions. The proposed CELP coder is quantized with 4kb/s and is compared with G.729 (Bkb/s CS-ACELP). Subjective testing shows better quality than reference coders under some background noise conditions

  • PDF

Restricted maximum likelihood estimation of a censored random effects panel regression model

  • Lee, Minah;Lee, Seung-Chun
    • Communications for Statistical Applications and Methods
    • /
    • v.26 no.4
    • /
    • pp.371-383
    • /
    • 2019
  • Panel data sets have been developed in various areas, and many recent studies have analyzed panel, or longitudinal data sets. Maximum likelihood (ML) may be the most common statistical method for analyzing panel data models; however, the inference based on the ML estimate will have an inflated Type I error because the ML method tends to give a downwardly biased estimate of variance components when the sample size is small. The under estimation could be severe when data is incomplete. This paper proposes the restricted maximum likelihood (REML) method for a random effects panel data model with a censored dependent variable. Note that the likelihood function of the model is complex in that it includes a multidimensional integral. Many authors proposed to use integral approximation methods for the computation of likelihood function; however, it is well known that integral approximation methods are inadequate for high dimensional integrals in practice. This paper introduces to use the moments of truncated multivariate normal random vector for the calculation of multidimensional integral. In addition, a proper asymptotic standard error of REML estimate is given.

Convergence Properties of a Adaptive Learning Algorithm Employing a Ramp Threshold Function (Ramp 임계 함수를 적용한 적응 학습 알고리즘의 수렴성)

  • 박소희;조제황
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2000.08a
    • /
    • pp.121-124
    • /
    • 2000
  • 적응 학습 알고리즘으로 가중치를 변화시키는 단층 신경망의 출력부에 Ramp 임계 함수를 적용하여 입력이 zero-mean Gaussian random vector인 경우 가중치의 stationary point를 구하고, 적응 학습 알고리즘을 유도한다.

  • PDF

After retrospective evaluation of the SETUP rate change during the treatment of head and neck cancer patient with Helical Tomotherapy (두경부환자의 토모테라피 치료시 SETUP 변화율에 대한 후향적 평가)

  • Ha, Tae-young;Kim, Seung-jun;Hwang, Cheol-hwan;Son, Jong-gi
    • The Journal of Korean Society for Radiation Therapy
    • /
    • v.28 no.1
    • /
    • pp.27-34
    • /
    • 2016
  • Purpose : Retrospective evaluation of setup changes using the corrected position during helical tomotherapy Materials and Methods : Head and neck cancer patients were randomly sampled and summarized into 3 groups: Group 1(32) Brain, Group 2 2(28)Maxillar, Nasal cavity, Group 3 (35) Nasopharynx(NPX), Tongue, Tonsil, and Oropharynx(OPX). In 3 groups, the statistical tests based on repeated measurements among 30 times of the duration of treatment by applying X, Y, Z axis errors, roll, weight changes, and vectors as variables. Results : The statistical test results showed that there was no difference between x-axis (p = 0.458) and y-axis (p=0.986) and in roll (p = 0.037), weight change (p <0.001), and the vector (p <0.001). In addition, the pattern between the three groups based on the fraction revealed no difference in x-axis (p = 0.430) and roll (p = 0.299) but a difference in y-axis (.023), weight change (p = 0.001), and vector (p = 0.028). Conclusion : The results of the retrospective evaluation found the change in the group 3 with respect Y, Z, weight, and vector and a larger random error during the treatment including low neck.

  • PDF

Sensorless Vector Control for Induction Motor Drive using Modified Tabu Search Algorithm

  • Lee, Yang-Woo;Kim, Dong-Wook;Lee, Su-Myoung;Park, Kyung-Hun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.377-381
    • /
    • 2003
  • The design of speed controller for induction motor using tabu search is studied. The proposed sensorless vector control for Induction Motor is composed of two parts. The first part is for optimizing the initial parameters of input-output. The second part is for real time changing parameters of input-output using tabu search. Proposed tabu search is improved by neighbor solution creation using Gaussian random distribution. In order to show the usefulness of the proposed method, we apply the proposed controller to the sensorless speed control of an actual AC induction Motor System. The performance of this approach is verified through simulation.

  • PDF

An Implementation of Efficient Functional Verification Environment for Microprocessor (마이크로프로세서를 위한 효율적인 기능 검증 환경 구현)

  • 권오현;이문기
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.7
    • /
    • pp.43-52
    • /
    • 2004
  • This paper proposes an efficient functional verification environment of microprocessor. This verification environment consists of test vector generator part, simulator part, and comparator part. To enhance efficiency of verification, it use a bias random test vector generator. In a part of simulation, retargetable instruction level simulator is used for reference model. This verification environment is excellent to find error which is not detected by general test vector and will become a good guide to find new error type

Quantitative Structure Activity Relationship Prediction of Oral Bioavailabilities Using Support Vector Machine

  • Fatemi, Mohammad Hossein;Fadaei, Fatemeh
    • Journal of the Korean Chemical Society
    • /
    • v.58 no.6
    • /
    • pp.543-552
    • /
    • 2014
  • A quantitative structure activity relationship (QSAR) study is performed for modeling and prediction of oral bioavailabilities of 216 diverse set of drugs. After calculation and screening of molecular descriptors, linear and nonlinear models were developed by using multiple linear regression (MLR), artificial neural network (ANN), support vector machine (SVM) and random forest (RF) techniques. Comparison between statistical parameters of these models indicates the suitability of SVM over other models. The root mean square errors of SVM model were 5.933 and 4.934 for training and test sets, respectively. Robustness and reliability of the developed SVM model was evaluated by performing of leave many out cross validation test, which produces the statistic of $Q^2_{SVM}=0.603$ and SPRESS = 7.902. Moreover, the chemical applicability domains of model were determined via leverage approach. The results of this study revealed the applicability of QSAR approach by using SVM in prediction of oral bioavailability of drugs.

The Convergence Characteristics of The Time- Averaged Distortion in Vector Quantization: Part I. Theory Based on The Law of Large Numbers (벡터 양자화에서 시간 평균 왜곡치의 수렴 특성 I. 대수 법칙에 근거한 이론)

  • 김동식
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.7
    • /
    • pp.107-115
    • /
    • 1996
  • The average distortio of the vector quantizer is calcualted using a probability function F of the input source for a given codebook. But, since the input source is unknown in geneal, using the sample vectors that is realized from a random vector having probability function F, a time-average opeation is employed so as to obtain an approximation of the average distortion. In this case the size of the smple set should be large so that the sample vectors represent true F reliably. The theoretical inspection about the approximation, however, is not perfomed rigorously. Thus one might use the time-average distortion without any verification of the approximation. In this paper, the convergence characteristics of the time-average distortions are theoretically investigated when the size of sample vectors or the size of codebook gets large. It has been revealed that if codebook size is large enough, then small sample set is enough to obtain the average distortion by approximatio of the calculated tiem-averaged distortion. Experimental results on synthetic data, which are supporting the analysis, are also provided and discussed.

  • PDF

Novel Motion and Disparity Prediction for Multi-view Video Coding

  • Lim, Woong;Nam, Junghak;Sim, Donggyu
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.3 no.3
    • /
    • pp.118-127
    • /
    • 2014
  • This paper presents an efficient motion and disparity prediction method for multi-view video coding based on the high efficient video coding (HEVC) standard. The proposed method exploits inter-view candidates for effective prediction of the motion or disparity vector to be coded. The inter-view candidates include not only the motion vectors of adjacent views, but also global disparities across views. The motion vectors coded earlier in an adjacent view were found to be helpful in predicting the current motion vector to reduce the number of bits used in the motion vector information. In addition, the proposed disparity prediction using the global disparity method was found to be effective for interview predictions. A multi-view version based on HEVC was used to evaluate the proposed algorithm, and the proposed correspondence prediction method was implemented on a multi-view platform based on HEVC. The proposed algorithm yielded a coding gain of approximately 2.9% in a high efficiency configuration random access mode.

Sparse Kernel Regression using IRWLS Procedure

  • Park, Hye-Jung
    • Journal of the Korean Data and Information Science Society
    • /
    • v.18 no.3
    • /
    • pp.735-744
    • /
    • 2007
  • Support vector machine(SVM) is capable of providing a more complete description of the linear and nonlinear relationships among random variables. In this paper we propose a sparse kernel regression(SKR) to overcome a weak point of SVM, which is, the steep growth of the number of support vectors with increasing the number of training data. The iterative reweighted least squares(IRWLS) procedure is used to solve the optimal problem of SKR with a Laplacian prior. Furthermore, the generalized cross validation(GCV) function is introduced to select the hyper-parameters which affect the performance of SKR. Experimental results are then presented which illustrate the performance of the proposed procedure.

  • PDF