• Title/Summary/Keyword: Karhunen-Loeve Transform

Search Result 26, Processing Time 0.026 seconds

Reduction in Computational Complexity of KLT-CVQ using UTV Decomposition (UTV 분해를 이용한 KLT-CVQ 코더의 계산량 개선)

  • Ju, Hyunho;Kim, Moo Young
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2012.07a
    • /
    • pp.176-177
    • /
    • 2012
  • 사람의 음성을 압축하는 방법으로 Code Excited Linear Prediction (CELP) 코더가 주로 사용되어 왔다. CELP 코더의 수신단에서는 양자화 된 여기신호를 LPC 필터로 합성하여 신호를 복원한다. LPC 합성필터의 영향으로 양자화 된 여기신호의 보로노이 셀 모양이 변형되는 문제점이 있기 때문에 이런 문제점을 해결하기 위해서 Karhunen-Loeve-Transform based Classify vector Quantization (KLT-CVQ) 코더가 제안되었다. 기존 KLT-CVQ 코더는 KLT 변환과 class 선택을 위해서 Eigen Value Decomposition (EVD)을 이용해서 eigen vector와 eigen value를 계산한다. 본 논문에서는 EVD 대신에 UTV Decomposition (UTVD)을 이용하여 KLT-CVQ의 계산량 문제점을 개선하는 방법을 제안한다.

  • PDF

Speaker Recognition Using Optimal Path and Weighted Orthogonal Parameters (최적경로와 가중직교인자를 이용한 화자인식)

  • Park, Seung-Kyu;Bai, Chul-Soo
    • The Journal of the Acoustical Society of Korea
    • /
    • v.11 no.2
    • /
    • pp.68-72
    • /
    • 1992
  • Recently, many researchers have studied the speaker recognition through the statistical processing method using Karhunen-Loeve Transform. However, the content of speaker's identity and the vocalization speed cause speaker recognition rate to be lowered. This parer studies the speaker recognition method using weighted orthogonal parameters which are weighted with eigen-values of speech so as to emphasize the speaker's identity, and optimal path which is made by DWP so as to normalize dynamic time feature of speech. To confirm this method, we compare the speaker recognition rate from this proposed method with that from the conventional statistical processing method. As a result, it is shown that this method is more excellent in speaker recognition rate than conventional method.

  • PDF

Landsat TM Image Compression Using Classified Bidirectional Prediction and KLT (영역별 양방향 예측과 KLT를 이용한 인공위성 화상데이터 압축)

  • Kim Seung-Jin;Kim Tae-Su;Park Kyung-Nam;Kim Young-Choon;Lee Kuhn-Il
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.1
    • /
    • pp.1-7
    • /
    • 2005
  • We propose an effective Landsat TM image compression method using the classified bidirectional prediction (CBP), the classified KLT and the SPIHT. The SPIHT is used to exploit the spatial redundancy of feature bands selected in the visible range and the infrared range separately. Regions of the prediction bands are classified into three classes in the wavelet domain, and then the CBP is performed to exploit the spectral redundancy. Residual bands that consist of difference values between the original band and the predicted band are decorrelated by the spectral KLT Finally, the three dimensional (3-D) SPIHT is used to encode the decorrelated coefficients. Experiment results show that the proposed method reconstructs higher quality Landsat TM image than conventional methods at the same bit rate.

Speaker Recognition Using Dynamic Time Variation fo Orthogonal Parameters (직교인자의 동적 특성을 이용한 화자인식)

  • 배철수
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.17 no.9
    • /
    • pp.993-1000
    • /
    • 1992
  • Recently, many researchers have found that the speaker recognition rate is high when they perform the speaker recognition using statistical processing method of orthogonal parameter, which are derived from the analysis of speech signal and contain much of the speaker's identity. This method, however, has problems caused by vocalization speed or time varying feature of speed. Thus, to solve these problems, this paper proposes two methods of speaker recognition which combine DTW algorithm with the method using orthogonal parameters extracted from $Karthumem-Lo\'{e}ve$ Transform method which applies orthogonal parameters as feature vector to ETW algorithm and the other is the method which applies orthogonal parameters to the optimal path. In addition, we compare speaker recognition rate obtained from the proposed two method with that from the conventional method of statistical process of orthogonal parameters. Orthogonal parameters used in this paper are derived from both linear prediction coefficients and partial correlation coefficients of speech signal.

  • PDF

Speech Recognition Using Linear Discriminant Analysis and Common Vector Extraction (선형 판별분석과 공통벡터 추출방법을 이용한 음성인식)

  • 남명우;노승용
    • The Journal of the Acoustical Society of Korea
    • /
    • v.20 no.4
    • /
    • pp.35-41
    • /
    • 2001
  • This paper describes Linear Discriminant Analysis and common vector extraction for speech recognition. Voice signal contains psychological and physiological properties of the speaker as well as dialect differences, acoustical environment effects, and phase differences. For these reasons, the same word spelled out by different speakers can be very different heard. This property of speech signal make it very difficult to extract common properties in the same speech class (word or phoneme). Linear algebra method like BT (Karhunen-Loeve Transformation) is generally used for common properties extraction In the speech signals, but common vector extraction which is suggested by M. Bilginer et at. is used in this paper. The method of M. Bilginer et al. extracts the optimized common vector from the speech signals used for training. And it has 100% recognition accuracy in the trained data which is used for common vector extraction. In spite of these characteristics, the method has some drawback-we cannot use numbers of speech signal for training and the discriminant information among common vectors is not defined. This paper suggests advanced method which can reduce error rate by maximizing the discriminant information among common vectors. And novel method to normalize the size of common vector also added. The result shows improved performance of algorithm and better recognition accuracy of 2% than conventional method.

  • PDF

High Resolution Time Resolved Contrast Enhanced MR Angiography Using k-t FOCUSS (k-t FOCUSS 알고리듬을 이용한 고분해능 4-D MR 혈관 조영 영상 기법)

  • Jung, Hong;Kim, Eung-Yeop;Ye, Jong-Chul
    • Investigative Magnetic Resonance Imaging
    • /
    • v.14 no.1
    • /
    • pp.10-20
    • /
    • 2010
  • Purpose : Recently, the Recon Challenge at the 2009 ISMRM workshop on Data Sampling and Image Reconstruction at Sedona, Arizona was held to evaluate feasibility of highly accelerated acquisition of time resolved contrast enhanced MR angiography. This paper provides the step-by-step description of the winning results of k-t FOCUSS in this competition. Materials and Methods : In previous works, we proved that k-t FOCUSS algorithm successfully solves the compressed sensing problem even for less sparse cardiac cine applications. Therefore, using k-t FOCUSS, very accurate time resolved contrast enhanced MR angiography can be reconstructed. Accelerated radial trajectory data were synthetized from X-ray cerebral angiography images and provided by the organizing committee, and radiologists double blindly evaluated each reconstruction result with respect to the ground-truth data. Results : The reconstructed results at various acceleration factors demonstrate that each components of compressed sensing, such as sparsifying transform and incoherent sampling patterns, etc can have profound effects on the final reconstruction results. Conclusion : From reconstructed results, we see that the compressed sensing dynamic MR imaging algorithm, k-t FOCUSS enables high resolution time resolved contrast enhanced MR angiography.