• Title/Summary/Keyword: peak finding algorithms

Search Result 7, Processing Time 0.023 seconds

A Study of Peak Finding Algorithms for the Autocorrelation Function of Speech Signal

  • So, Shin-Ae;Lee, Kang-Hee;You, Kwang-Bock;Lim, Ha-Young;Park, Ji Su
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.12
    • /
    • pp.131-137
    • /
    • 2016
  • In this paper, the peak finding algorithms corresponding to the Autocorrelation Function (ACF), which are widely exploited for detecting the pitch of voiced signal, are proposed. According to various researchers, it is well known fact that the estimation of fundamental frequency (F0) in speech signal is not only very important task but quite difficult mission. The proposed algorithms, presented in this paper, are implemented by using many characteristics - such as monotonic increasing function - of ACF function. Thus, the proposed algorithms may be able to estimate both reliable and correct the fundamental frequency as long as the autocorrelation function of speech signal is accurate. Since the proposed algorithms may reduce the computational complexity it can be applied to the real-time processing. The speech data, is composed of Korean emotion expressed words, is used for evaluation of their performance. The pitches are measured to compare the performance of proposed algorithms.

A comparative study on peak finding algorithms in white light interferometry (백색광 간섭계의 봉우리 찾기 셈법 비교)

  • 민경일;남기봉
    • Korean Journal of Optics and Photonics
    • /
    • v.11 no.6
    • /
    • pp.395-399
    • /
    • 2000
  • In white light interferometry, fast and accurate localization of the fringe visibility is the most essential part in application of the principle. So much attention has been concentrated on speeding up the process, we in this study decided to investigate the results of the various peak-finding algorithms. Of the many approaches, two most simplistic algorithms were selected for their straightforwardness and robustness. Both were equally accurate in measuring the step height of a sample, but the method based on the weighted average technique proved to be truer to the surface topography. A model explaining the shortcomings of the correlation technique is presented. ented.

  • PDF

Spatial experience based route finding using ontologies

  • Barzegar, Maryam;Sadeghi-Niaraki, Abolghasem;Shakeri, Maryam
    • ETRI Journal
    • /
    • v.42 no.2
    • /
    • pp.247-257
    • /
    • 2020
  • Spatial experiences in route finding, such as the ability of finding low-traffic routes, exert a significant influence on travel time in big cities; therefore, the spatial experiences of seasoned individuals such as taxi drivers in route finding can be useful for improving route-finding algorithms and preventing using routes having considerable traffic. In this regard, a spatial experience-based route-finding algorithm is introduced through ontology in this paper. To this end, different methods of modeling experiences are investigated. Then, a modeling method is chosen for modeling the experiences of drivers for route finding depending on the advantages of ontology, and an ontology based on the taxi drivers' experiences is proposed. This ontology is employed to create an ontology-based route-finding algorithm. The results are compared with those of Google maps in terms of route length and travel time at peak traffic time. According to the results, although the route lengths of route-finding method based on the ontology of drivers' experiences in three cases (from nine cases) are greater than that based on Google maps, the travel times are shorter in most cases, and in some routes, the difference in travel time reaches only 10 minutes.

Study on Improvement of Measurement Precision in Digital Image Correlation Measurement Method by Using Subpixel Algorithms (이미지 상관법의 서브 픽셀 알고리즘을 이용한 측정 분해능 향상에 관한 연구)

  • Kim, Seung Jong;Kang, Young Jun;Choi, In Young;Hong, Kyung Min;Ryu, Won Jea
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.32 no.12
    • /
    • pp.1039-1047
    • /
    • 2015
  • Contact type sensors (e.g., displacement sensor and strain gauge) were typically used to evaluate the safety and mechanical properties in machines and construction. However, those contact type sensors have been constrained because of measurement problems such as surface roughness, temperature, humidity, and shape. The Digital Image Correlation (DIC) measurement system is a vision measurement system. This measurement system uses the taken image using a CCD camera and calculates the image correlation between the reference image and the deformed image under external force to measure the displacement and strain rates. In this paper, we discuss methods to improve the measurement precision of the digital image correlation measurement system. A tensile test was conducted to compare the precision improvement effects, by using the universal test machine and the DIC measurement system, with the use of subpixel algorithms, i.e., the Coarse Fine Search (CFS) algorithm and the Peak Finding (PF) algorithm.

An area-based stereo matching algorithm using multiple directional masks (다중 방향성 마스크를 이용한 영역 기반 스테레오 정합 알고리즘)

  • 김낙현
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.2
    • /
    • pp.77-87
    • /
    • 1996
  • Existing area-based stereo matching algorithms utilize a single rectangular correlation area for computing cross-correlation between corresponding points in stereo images, and compute disparity by finding the peak in the vicinity of depth discontinuity, since, because of inconstnat disparities around discontinuities, the cross-correlation becomes low in such area. Inthis paper, a new area-based matching strategy is proposed exploiting multiple directional correlation masks instead of a single one. The proposed technique computes multiple cross-covariance functions using each oriented mask. Peaks are detected from each covariance function and the disparity is computed by choosing the location with the highest covariance value. Proposed approach can also be applied to compute disparity gradients without obtaining dense depth data. A number of examples are presented using synthetic and natural stereo images.

  • PDF

Meta-Heuristic Algorithm Comparison for Droplet Impingements (액적 충돌 현상기반 최적알고리즘의 비교)

  • Joo Hyun Moon
    • Journal of ILASS-Korea
    • /
    • v.28 no.4
    • /
    • pp.161-168
    • /
    • 2023
  • Droplet impingement on solid surfaces is pivotal for a range of spray and heat transfer processes. This study aims to optimize the cooling performance of single droplet impingement on heated textured surfaces. We focused on maximizing the cooling effectiveness or the total contact area at the droplet maximum spread. For efficient estimation of the optimal values of the unknown variables, we introduced an enhanced Genetic Algorithm (GA) and Particle swarm optimization algorithm (PSO). These novel algorithms incorporate its developed theoretical backgrounds to compare proper optimized results. The comparison, considering the peak values of objective functions, computation durations, and the count of penalty particles, confirmed that PSO method offers swifter and more efficient searches, compared to GA algorithm, contributing finding the effective way for the spray and droplet impingement process.

Dynamic traffic assignment based on arrival time-based OD flows (도착시간 기준 기종점표를 이용한 동적통행배정)

  • Kim, Hyeon-Myeong
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.1
    • /
    • pp.143-155
    • /
    • 2009
  • A dynamic traffic assignment (DTA) has recently been implemented in many practical projects. The core of dynamic model is the inclusion of time scale. If excluding the time dimension from a DTA model, the framework of a DTA model is similar to that of static model. Similar to static model, with given exogenous travel demand, a DTA model loads vehicles on the network and finds an optimal solution satisfying a pre-defined route choice rule. In most DTA models, the departure pattern of given travel demand is predefined and assumed as a fixed pattern, although the departure pattern of driver is changeable depending on a network traffic condition. Especially, for morning peak commute where most drivers have their preferred arrival time, the departure time, therefore, should be modeled as an endogenous variable. In this paper, the authors point out some shortcomings of current DTA model and propose an alternative approach which could overcome the shortcomings of current DTA model. The authors substitute a traditional definition for time-dependent OD table by a new definition in which the time-dependent OD table is defined as arrival time-based one. In addition, the authors develop a new DTA model which is capable of finding an equilibrium departure pattern without the use of schedule delay functions. Three types of objective function for a new DTA framework are proposed, and the solution algorithms for the three objective functions are also explained.