• Title/Summary/Keyword: Cross-correlation Algorithm

Search Result 297, Processing Time 0.027 seconds

Simulation of Active Noise Control on Harmonic Sound (복수조화음에 대한 능동소음제어 시뮬레이션)

  • Kwon, O-Cheol;Lee, Gyeong-Tae;Lee, Hae-Jin;Yang, In-Hyung;Oh, Jae-Eung
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2007.11a
    • /
    • pp.737-742
    • /
    • 2007
  • The method of the reducing duct noise can be classified by passive and active control techniques. However, passive control has a limited effect of noise reduction at low frequencies (below 500Hz) and is limited by the space. On the other hand, active control can overcome these passive control limitations. The active control technique mostly uses the Least-Mean-Square (LMS) algorithm, because the LMS algorithm can easily obtain the complex transfer function in real-time particularly when the Filtered-X LMS (FXLMS) algorithm is applied to an active noise control (ANC) system. However, the convergence performance of the LMS algorithm decreases slightly so it may delay the convergence time when the FXLMS algorithm is applied to the active control of duct noise. Thus the Co-FXLMS algorithm was developed to improve the control performance in order to solve this problem. The Co-FXLMS algorithm is realized by using an estimate of the cross correlation between the adaptation error and the filtered input signal to control the step size. In this paper, the performance of the Co-FXLMS algorithm is presented in comparison with the FXLMS algorithm. Simulation results show that active noise control using Co-FXLMS is effective in reducing duct noise.

  • PDF

A New Calculation Method of Equalizer algorithms based on the Probability Correlation (확률분포 상관도에 기반한 Equalizer 알고리듬의 새로운 연산 방식)

  • Kim, Namyong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.15 no.5
    • /
    • pp.3132-3138
    • /
    • 2014
  • In many communication systems, intersymbol interference, DC and impulsive noise are hard-to-solve problems. For the purpose of cancelling such interferences, the concept of lagged cross-correlation of probability has been used for blind equalization. However, this algorithm has a large burden of computation. In this paper, a recursive method of the algorithm based on the lagged probability correlation is proposed. The summation operation in the calculation of gradient of the cost is transformed into a recursive gradient calculation. The recursive method shows to reduce the high computational complexity of the algorithm from O(NM) to O(M) for M symbols and N block data having advantages in implementation while keeping the robustness against those interferences. From the results of the simulation, the proposed method yields the same learning performance with reduced computation complexity.

Incomplete Cholesky Decomposition based Kernel Cross Modal Factor Analysis for Audiovisual Continuous Dimensional Emotion Recognition

  • Li, Xia;Lu, Guanming;Yan, Jingjie;Li, Haibo;Zhang, Zhengyan;Sun, Ning;Xie, Shipeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.2
    • /
    • pp.810-831
    • /
    • 2019
  • Recently, continuous dimensional emotion recognition from audiovisual clues has attracted increasing attention in both theory and in practice. The large amount of data involved in the recognition processing decreases the efficiency of most bimodal information fusion algorithms. A novel algorithm, namely the incomplete Cholesky decomposition based kernel cross factor analysis (ICDKCFA), is presented and employed for continuous dimensional audiovisual emotion recognition, in this paper. After the ICDKCFA feature transformation, two basic fusion strategies, namely feature-level fusion and decision-level fusion, are explored to combine the transformed visual and audio features for emotion recognition. Finally, extensive experiments are conducted to evaluate the ICDKCFA approach on the AVEC 2016 Multimodal Affect Recognition Sub-Challenge dataset. The experimental results show that the ICDKCFA method has a higher speed than the original kernel cross factor analysis with the comparable performance. Moreover, the ICDKCFA method achieves a better performance than other common information fusion methods, such as the Canonical correlation analysis, kernel canonical correlation analysis and cross-modal factor analysis based fusion methods.

A Study on the Reduction of Maximum Complexity in SOLA Algorithm for Real Time Implementation (실시간 구현을 위한 SOLA 알고리즘의 계산량 감소에 관한 연구)

  • Ham MyungKyu;Jung HyunUk;Bae MyungJin
    • Proceedings of the Acoustical Society of Korea Conference
    • /
    • spring
    • /
    • pp.101-104
    • /
    • 2004
  • 음성속도변환(TSM : Time Scaling Modification) 알고리즘은 시간축에서 음성 신호의 속도를 변환할 수 있는 방식이다. 이러한, 방법으로는 OLA(Overlap Add), SOLA (Synchronized Overlap Add) 알고리즘 등이 연구 되어 왔다. 2 가지 방식 중에도 동기화를 시켜 overlap 을 시키는 SOLA 알고리즘이 OLA 방법에 비해 음질이 우수하다. 본 논문에서는 TMS320C5416 DSP 에 계산량이 감소된 SOLA 알고리즘을 실시간 구현하였다. 기존의 SOLA 알고리즘에서 동기화를 위해 사용하고 있는 cross-correlation 함수는 곱셈연산에서 발생하는 bit 의 dynamic range 가 커서 나눗셈 연산에서도 과도한 연산량을 필요로 한다. 따라서 이러한 계산량의 감소를 위해 기존의 cross-correlation 함수가 대신 더하기와 빼기의 연산으로 수행되는 NAMDF 함수를 사용하여 계산량을 줄였다. 제안한 방법을 SOLA 알고리즘에 적용하여 성능 평가를 실시하였다. TMS320C5416 DSP 에 실시간으로 실험한 결과 NAMDF 함수를 사용하였을 경우 음질의 저하가 거의 없었으며, 계산량을 기존의 cross-correlation 방식에 비해 6.22MIPS 가까이 감소시킬 수 있었다.

  • PDF

Estimation of daily maximum air temperature using NOAA/AVHRR data (NOAA/AVHRR 자료를 이용한 일 최고기온 추정에 관한 연구)

  • 변민정;한영호;김영섭
    • Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
    • /
    • 2003.04a
    • /
    • pp.291-296
    • /
    • 2003
  • This study estimated surface temperature by using split-window technique and NOAA/AVHRR data was used. For surface monitoring, cloud masking procedure was carried out using threshold algorithm. The daily maximum air temperature is estimated by multiple regression method using independent variables such as satellite-derived surface temperature, EDD, and latitude. When the EDD data added, the highest correlation shown. This indicates that EDD data is the necessary element for estimation of the daily maximum air temperature. We derived correlation and experience equation by three approaching method to estimate daily maximum air temperature. 1) non-considering landcover method as season, 2) considering landcover method as season, and 3) just method as landcover. The last approaching method shows the highest correlation. So cross-validation procedure was used in third method for validation of the estimated value. For all landcover type 5, the results using the cross-validation procedure show reasonable agreement with measured values(slope=0.97, intercept=-0.30, R$^2$=0.84, RMSE=4.24$^{\circ}C$). Also, for all landcover type 7, the results using the cross-validation procedure show reasonable agreement with measured values(slope=0.993, Intercept=0.062, R$^2$=0.84, RMSE=4.43$^{\circ}C$).

  • PDF

Joint Template Matching Algorithm for Associated Multi-object Detection

  • Xie, Jianbin;Liu, Tong;Chen, Zhangyong;Zhuang, Zhaowen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.1
    • /
    • pp.395-405
    • /
    • 2012
  • A joint template matching algorithm is proposed in this paper to reduce the high rate of miss-detection and false-alarm caused by the traditional template matching algorithm during the process of multi-object detection. The proposed algorithm can reduce the influence on each object by matching all objects together according to the correlation information among different objects. Moreover, the rate of miss-detection and false-alarm in the process of single-template matching is also reduced based on the algorithm. In this paper, firstly, joint template is created from the information of relative positions among different objects. Then, matching criterion according to normalized cross correlation is generated for multi-object matching. Finally, the proposed algorithm is applied to the detection of watermarks in bill. The experiments show that the proposed algorithm has lower miss-detection and false-alarm rate comparing to the traditional NCC algorithm during the process of multi-object detection.

Development of Correlation Based Feature Selection Method by Predicting the Markov Blanket for Gene Selection Analysis

  • Adi, Made;Yun, Zhen;Keong, Kwoh-Chee
    • Proceedings of the Korean Society for Bioinformatics Conference
    • /
    • 2005.09a
    • /
    • pp.183-187
    • /
    • 2005
  • In this paper, we propose a heuristic method to select features using a Two-Phase Markov Blanket-based (TPMB) algorithm. The first phase, filtering phase, of TPMB algorithm works by filtering the obviously redundant features. A non-linear correlation method based on Information theory is used as a metric to measure the redundancy of a feature [1]. In second phase, approximating phase, the Markov Blanket (MB) of a system is estimated by employing the concept of cross entropy to identify the MB. We perform experiments on microarray data and report two popular dataset, AML-ALL [3] and colon tumor [4], in this paper. The experimental results show that the TPMB algorithm can significantly reduce the number of features while maintaining the accuracy of the classifiers.

  • PDF

A Fast Normalized Cross-Correlation Computation for WSOLA-based Speech Time-Scale Modification (WSOLA 기반의 음성 시간축 변환을 위한 고속의 정규상호상관도 계산)

  • Lim, Sangjun;Kim, Hyung Soon
    • The Journal of the Acoustical Society of Korea
    • /
    • v.31 no.7
    • /
    • pp.427-434
    • /
    • 2012
  • The overlap-add technique based on waveform similarity (WSOLA) method is known to be an efficient high-quality algorithm for time scaling of speech signal. The computational load of WSOLA is concentrated on the repeated normalized cross-correlation (NCC) calculation to evaluate the similarity between two signal waveforms. To reduce the computational complexity of WSOLA, this paper proposes a fast NCC computation method, in which NCC is obtained through pre-calculated sum tables to eliminate redundancy of repeated NCC calculations in the adjacent regions. While the denominator part of NCC has much redundancy irrespective of the time-scale factor, the numerator part of NCC has less redundancy and the amount of redundancy is dependent on both the time-scale factor and optimal shift value, thereby requiring more sophisticated algorithm for fast computation. The simulation results show that the proposed method reduces about 40%, 47% and 52% of the WSOLA execution time for the time-scale compression, 2 and 3 times time-scale expansions, respectively, while maintaining exactly the same speech quality of the conventional WSOLA.

Damage detection of subway tunnel lining through statistical pattern recognition

  • Yu, Hong;Zhu, Hong P.;Weng, Shun;Gao, Fei;Luo, Hui;Ai, De M.
    • Structural Monitoring and Maintenance
    • /
    • v.5 no.2
    • /
    • pp.231-242
    • /
    • 2018
  • Subway tunnel structure has been rapidly developed in many cities for its strong transport capacity. The model-based damage detection of subway tunnel structure is usually difficult due to the complex modeling of soil-structure interaction, the indetermination of boundary and so on. This paper proposes a new data-based method for the damage detection of subway tunnel structure. The root mean square acceleration and cross correlation function are used to derive a statistical pattern recognition algorithm for damage detection. A damage sensitive feature is proposed based on the root mean square deviations of the cross correlation functions. X-bar control charts are utilized to monitor the variation of the damage sensitive features before and after damage. The proposed algorithm is validated by the experiment of a full-scale two-rings subway tunnel lining, and damages are simulated by loosening the connection bolts of the rings. The results verify that root mean square deviation is sensitive to bolt loosening in the tunnel lining and X-bar control charts are feasible to be used in damage detection. The proposed data-based damage detection method is applicable to the online structural health monitoring system of subway tunnel lining.

Double Talk Detection Based on the Fuzzy Rules in Adaptive Echo Canceller (적응 반향제거기에서 퍼지규칙에 기초한 동시통화 검출)

  • 류근택;김대성;배현덕
    • The Journal of the Acoustical Society of Korea
    • /
    • v.19 no.7
    • /
    • pp.34-41
    • /
    • 2000
  • This paper proposes a new double-talk detection algorithm which is based on the fuzzy rules, in the adaptive echo canceller of telecommunication system. In this method, the two inputs of the fuzzy inference for detecting double-talk condition are used. One is the cross-correlation coefficient between the error signal and the primary signal which is the summation of the real echo signal and the near-end signal. The other one is the cross-correlation coefficient between the estimation error signal and the primary signal. The fuzzy controller makes a fuzzification for two inputs by the membership functions of trapezoid does the max-min composition using if-then rules. The composed result is defuzzificated by the center gravity method. And by defuzzificated values, the double-talt the echo path variance, and the echo path variance during the double-talk are detected. It is confirmed by computer simulation that this fuzzy double-talk detector is able to estimate the double talk and the echo path variation condition, and even track echo path variation more accurately than the conventional algorithm during the double-talk period.

  • PDF