• 제목/요약/키워드: peak finding algorithms

검색결과 7건 처리시간 0.019초

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
    • 한국컴퓨터정보학회논문지
    • /
    • 제21권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)

  • 민경일;남기봉
    • 한국광학회지
    • /
    • 제11권6호
    • /
    • pp.395-399
    • /
    • 2000
  • 백색광 간섭계에서는 신속하고 그리고 정확하게 주사방향의 간섭무늬 봉우리점을 추출하는 것이 중요한 관건이다. 봉우리점 산출 속도 향상을 목표로 하여 많은 연구가 진행되어 왔지만, 본 연구에서는 가장 간단한 셈법을 이용하여 기준 시료가 얼마나 정확하게 재구성 되는가를 비교 검토하였다. 두 방법 모두 nm 수준의 정밀도로 단차를 측정할 수 있었는데 역상관을 이용한 셈법이 표면 구조나 수직한 면의 재구성에 더 충실한 결과를 산출함이 관찰되었다.

  • PDF

Spatial experience based route finding using ontologies

  • Barzegar, Maryam;Sadeghi-Niaraki, Abolghasem;Shakeri, Maryam
    • ETRI Journal
    • /
    • 제42권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)

  • 김성종;강영준;최인영;홍경민;유원재
    • 한국정밀공학회지
    • /
    • 제32권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)

  • 김낙현
    • 전자공학회논문지B
    • /
    • 제33B권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)

  • 문주현
    • 한국분무공학회지
    • /
    • 제28권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)

  • 김현명
    • 대한교통학회지
    • /
    • 제27권1호
    • /
    • pp.143-155
    • /
    • 2009
  • 현재 이용되는 모든 동적 통행배정모형들은 출발시간을 기준으로 기종점간의 통행량을 정의하고 있다. 하지만, 동적 OD가 출발시간을 통행수요의 동적 기준점으로 이용하는 것은 동적 통행배정 모형의 계산상 편의를 위한 것이다. 즉, 통행이 활동참여를 위해 발생하고 종료된다는 것을 고려하면 이러한 출발시간 기준 기종점표는 모든 종류의 통행들에 적용될 수는 없다. 예를 들어, 오전의 출근통행은 업무개시시간을 고려한 희망도착시간이 기준시간이 되고, 통근자들이 가정을 떠나는 출발시간은 희망도착시간과 예상 기종점 통행시간을 고려해 결정되는 것이다. 그러나 현재 개발되어 있는 모든 통행배정기법들은 출발시간으로부터 시간의 흐름에 따라 기점에서 종점으로 통행을 이동시키기 때문에 통행수요를 종점 희망도착시간을 기준으로 역방향계산을 할 수 없다. 따라서 현실과 동일한 결정과정을 통해 동적 통행배정을 할 수 있는 모형은 아직 개발되지 않았다. 본 연구에서는 이러한 문제인식 아래 희망도착시간을 기준으로 정의된 동적 기종점표를 교통망에 부하할 수 있는 동적 통행배정모형을 개발하였다. 개발된 모형은 희망도착시간분포와 예상 경로 통행시간을 이용하여 출발시간분포를 갱신하는 방법을 이용하였으며, GLS함수를 통해 수학식을 구성하였다. 개발된 모형은 두 가지의 소규모 교통망들에 적용되어 그 성능을 확인하였다.