• 제목/요약/키워드: Approximation technique

검색결과 562건 처리시간 0.026초

Text-Independent Speaker Verification Using Variational Gaussian Mixture Model

  • Moattar, Mohammad Hossein;Homayounpour, Mohammad Mehdi
    • ETRI Journal
    • /
    • 제33권6호
    • /
    • pp.914-923
    • /
    • 2011
  • This paper concerns robust and reliable speaker model training for text-independent speaker verification. The baseline speaker modeling approach is the Gaussian mixture model (GMM). In text-independent speaker verification, the amount of speech data may be different for speakers. However, we still wish the modeling approach to perform equally well for all speakers. Besides, the modeling technique must be least vulnerable against unseen data. A traditional approach for GMM training is expectation maximization (EM) method, which is known for its overfitting problem and its weakness in handling insufficient training data. To tackle these problems, variational approximation is proposed. Variational approaches are known to be robust against overtraining and data insufficiency. We evaluated the proposed approach on two different databases, namely KING and TFarsdat. The experiments show that the proposed approach improves the performance on TFarsdat and KING databases by 0.56% and 4.81%, respectively. Also, the experiments show that the variationally optimized GMM is more robust against noise and the verification error rate in noisy environments for TFarsdat dataset decreases by 1.52%.

시간시성 Routh 절감화법에 의한 최적제어에 관항 연구 (On Suboptimal Control Via Routh Approximation Method in Time Domain)

  • 박종근;김성중
    • 대한전기학회논문지
    • /
    • 제33권10호
    • /
    • pp.396-401
    • /
    • 1984
  • This paper present a method of using simplified models for deriving suboptimal controllers to the original higher-order systems. Routh approximation method is a very useful technique for reducing the order of a linear systems. This method dose not require a knowlege of system eigenvalues and eigenvectors and possesses many desirable features such as preservation of reduced order model stability and minimum computational requirements. These properties are utilized to derive suboptimal controllers in this paper. In order to implement htese ocntrollers on the original system, the relationship between the state vectors of the original system and the reduced order models is required. A procedure fir evaluating an approximate aggregation matrix is also developed. A numerical example is given for the illustration of this method, shich is compared with the existing Model aggregation method in the resultant figures.

  • PDF

실시간 응용을 위한 DFT구현시 계수 근사에 기인한 오차 해석에 관한 연구 (Analysis of the errors caused by the finite-bit real-time implementation of DFT)

  • 김재화;김병기;장태규
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1996년도 하계학술대회 논문집 B
    • /
    • pp.1012-1014
    • /
    • 1996
  • This paper proposes a real-time OFT implementation technique which is based on the finite-bit approximation of the DFT coefficients. The effect of the approximation is analytically investigated and its result is obtained in the form of an equation of noise to signal ratio. The analysis result is confirmed by comparing it with those of the computer simulation and the actual experiment for human sleep EEG data.

  • PDF

Development of a Consistent General Order Nodal Method for Solving the Three-Dimensional, Multigroup, Static Neutron Diffusion Equation

  • Kim, H.D.
    • 한국원자력학회:학술대회논문집
    • /
    • 한국원자력학회 1996년도 춘계학술발표회논문집(1)
    • /
    • pp.34-39
    • /
    • 1996
  • A consistent general order nodal method for solving the 3-D neutron diffusion equation in (x-y-z) geometry has ben derived by using a weighted integral technique and expanding the spatial variables by the Legendre orthogonal series function. The equation set derived can be converted into any order nodal schemes. It forms a compact system for general order of nodal moments. The method utilizes the analytic solutions of the transverse-integrated quasi -one dimensional equations and a consistent expansion for the spatial variables so that it renders the use of an approximation for the transverse leakages no necessary. Thus, we can expect extremely accurate solutions and the solution would converge exactly when the mesh width is decreased or the approximation order is increased since the equation set is consistent mathematically.

  • PDF

Coordinated Direct and Relayed Transmission based on NOMA and Backscattering

  • Fang, Zhaoxi;Lu, Yingzhi;Zhou, Jing;Li, Qi;Shi, Haiyan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제16권9호
    • /
    • pp.3124-3137
    • /
    • 2022
  • We propose a spectral-efficient coordinated direct and relayed transmission (CDRT) scheme for a relay-assisted downlink system with two users. The proposed scheme is based on backscatter communication (BC) and non-orthogonal multiple access (NOMA) technique. With the proposed BC-NOMA-CDRT scheme, both users can receive one packet within one time slot. In contrast, in existing NOMA-CDRT schemes, the far user is only able to receive one packet in two time slots due to the half-duplex operation of the relay. We investigate the outage of the BC-NOMA-CDRT scheme, and derive the outage probability expressions in closed-form based on Gamma distribution approximation and Gaussian approximation. Numerical results show that the analytical results are accurate and the BC-NOMA-CDRT scheme outperforms the conventional NOMA-CDRT significantly.

Radon RBF Network에 의해 그린 보증 함수의 근사화 (Approximation of Green Warranty Function by Radon Radial Basis Function Network)

  • 이상현;임종한;문경일
    • 한국인터넷방송통신학회논문지
    • /
    • 제12권3호
    • /
    • pp.123-131
    • /
    • 2012
  • 오래 전부터 연료의 가격은 상승하고 있다. 제조업체는 보증을 통해 실용적인 대안을 찾고자 전기와 강력한 바이오 연료를 이용하여 차량의 성장가능을 연구하고 있다. 이제, 이러한 녹색 환경(emission) 관련된 보증은 보증기간이 확장되며, 이러한 보증을 "수퍼 보증" 이라 불린다. 본 논문의 주요 결과는 라돈 변환의 역행렬을 보증공간의 수치를 줄이기 위해 사용되며, 응용 프로그램 및 RBF 네트워크를 사용하여 대략적인 이변량의 보증 기능에 새로운 방법을 제시한다. 이 방법은 다음과 같은 단계로 구성되어 있다. 첫째, 라돈 변환을 이용하여, 이변량 보증 함수의 1차원 함수를 줄일 수 있다. 둘째, 1 차원 함수의 각 신경 서브 네트워크와 신경 네트워크 기법을 사용하여 근사할 수 있다. 셋째, 이러한 신경 sub-networks 형태로 최종 근사 신경망 함께 결합 된다. 넷째, 라 돈 변환의 역함수 값을 사용 하여 최종 근사 신경 네트워크에 우리가 주어진 함수 근사화를 얻을 수 있다. 또한, 우리는 자동차 회사의 일부 그린 보증 데이터를 가지고 위의 방법을 적용한다.

MIN-SUM 복호화 알고리즘을 이용한 LDPC 오류정정부호의 성능분석 (Convergence of Min-Sum Decoding of LDPC codes under a Gaussian Approximation)

  • Heo, Jun
    • 한국통신학회논문지
    • /
    • 제28권10C호
    • /
    • pp.936-941
    • /
    • 2003
  • 최근에 소개된 density evolution 기법은 sum-product 알고리즘에서 LDPC 부호가 갖는 성능의 한계를 분석하였다[1]. 또한. Iterative decoding 알고리즘에서 전달되는 정보가 Gaussian 확률분포를 갖는 점을 이용하여 기존의 density evolution 기법을 단순화 시킨 연구결과가 소개되었다[2]. 한편. LDPC 부호의 한계 성능을 sum-product가 아닌 min-sum 알고리즘에서 분석한 결과가 최근에 발표되었다[3]. 본 논문에서는 이러한 일련의 연구 결과를 바탕으로 min-sum 알고리즘을 이용하면서 Gaussian 확률 분포 특성을 이용한 density evolution 기법을 소개한다. 제안된 density evolution 기법은 기존의 방법보다 적은 계산으로 정확한 threshold를 구할 수 있으며. 그 결과가 numerical simulation 결과와 잘 일치함을 나타내었다.

Outcomes of Primary Unilateral Cheiloplasty in Same-Day Surgical Settings

  • Khan, Mansoor;Ullah, Hidayat;Aziz, Asif;Tahir, Muhammad
    • Archives of Plastic Surgery
    • /
    • 제43권3호
    • /
    • pp.248-253
    • /
    • 2016
  • Background Financial, clinical, and psychological considerations have made same-day surgery an attractive option for a variety of procedures. This article aimed to analyse the postoperative results of same-day primary unilateral cleft nasolabial repair. Methods This study was performed from 2011 to 2014. Unilateral cleft lip patients fulfilling the inclusion criteria were preoperatively classified as mild, moderate, and severe. All patients underwent same-day surgery and were discharged after satisfying the appropriate clinical criteria, receiving thorough counselling, and the establishment of a means of communication by phone. Postoperative outcomes were assessed and stratified according to preoperative severity and the type of repair. Results A total of 423 primary unilateral cleft lip patients were included. Fisher's anatomical subunit approximation technique was the most common procedure, followed by Noordhoff's technique. The postoperative outcome was good in 89.8% of cases, fair in 9.9% of cases, and poor in 0.2% of cases. The complication rate was 1.18% (n=5), and no instances of mortality were observed. The average hospital stay was 7.5 hours, leading to a cost reduction of 19% in comparison with patients who stayed overnight for observation. Conclusions Mild unilateral cleft lip was the most common deformity for which Fisher's anatomical subunit approximation technique was performed in most of the cases, with satisfactory postoperative outcomes. Refinements in the cleft rhinoplasty techniques over the course of the study improved the results regarding cleft nasal symmetry. Single-day primary unilateral cleft cheiloplasty was found to be a cost-effective procedure that did not pose an additional risk of complications.

스테레오 영상에서의 적응적 영역 가중치 매칭의 효율적 근사화 방법 (An Efficient Approximation method of Adaptive Support-Weight Matching in Stereo Images)

  • 김호영;이성원
    • 방송공학회논문지
    • /
    • 제16권6호
    • /
    • pp.902-915
    • /
    • 2011
  • 영역기반 스테레오 매칭 분야에서 최근 인간의 시각체계(Human Visual System)에 기반하여 영역내의 밝기값과 거리값에 따라 적응적으로 가중치를 부여하는 적응적 영역 가중치(Adaptive Support-Weight, ASW) 방법이 좋은 매칭 결과를 보이고 있다. 그러나 이 방법은 좋은 매칭 결과에 비해서 많은 연산비용을 필요로 하게 되고, 매칭의 실시간 시스템화에 큰 장애요소로 작용한다. 이에 Bilateral filter 수식으로 근사화 후 Integral Histogram 기법을 적용하여 영역 윈도우의 크기에 상관없이 상수 시간 O(1) 내에 매칭을 수행하는 연구가 진행되었다. 하지만 이 방법은 근사화 과정에서의 원 ASW 수식을 왜곡하기 때문에 매칭 정확도의 손실을 가져오게 된다. 본 논문에서는 적응적 영역 가중치 알고리즘의 매칭 정확도를 유지하면서 적응적 영역 가중치 알고리즘의 계산 비용을 줄이는 알고리즘을 제안한다. 이를 위해 영역내의 픽셀을 그룹화하여 근사화된 매칭을 수행하는 Sub-Block 방법과 영상의 에지 정보에 따라 적응적으로 시차 탐색 범위를 조정하는 방법을 제안한다. 결과적으로 제안된 기법은 기존 방식보다 좋은 매칭 정확도를 유지하면서도 효율적으로 계산 수행 시간을 줄이게 된다.

FRACTIONAL CHEBYSHEV FINITE DIFFERENCE METHOD FOR SOLVING THE FRACTIONAL BVPS

  • Khader, M.M.;Hendy, A.S.
    • Journal of applied mathematics & informatics
    • /
    • 제31권1_2호
    • /
    • pp.299-309
    • /
    • 2013
  • In this paper, we introduce a new numerical technique which we call fractional Chebyshev finite difference method (FChFD). The algorithm is based on a combination of the useful properties of Chebyshev polynomials approximation and finite difference method. We tested this technique to solve numerically fractional BVPs. The proposed technique is based on using matrix operator expressions which applies to the differential terms. The operational matrix method is derived in our approach in order to approximate the fractional derivatives. This operational matrix method can be regarded as a non-uniform finite difference scheme. The error bound for the fractional derivatives is introduced. The fractional derivatives are presented in terms of Caputo sense. The application of the method to fractional BVPs leads to algebraic systems which can be solved by an appropriate method. Several numerical examples are provided to confirm the accuracy and the effectiveness of the proposed method.