• Title/Summary/Keyword: 접근 판단 알고리즘

Search Result 116, Processing Time 0.029 seconds

A Study on the Simple Algorithm for Discrimination of Voiced Sounds (유성음 구간 검출을 위한 간단한 알고리즘에 관한 연구)

  • 장규철;우수영;박용규;유창동
    • The Journal of the Acoustical Society of Korea
    • /
    • v.21 no.8
    • /
    • pp.727-734
    • /
    • 2002
  • A simple algorithm for discriminating voiced sounds in a speech is proposed in this paper. In addition to low-frequency energy and zero-crossing rate (ZCR), both of which have been widely used in the past for identifying voiced sounds, the proposed algorithm incorporates pitch variation to improve the discrimination rate. Based on TIMIT corpus, evaluation result shows an improvement of 13% in the discrimination of voiced phonemes over that of the traditional algorithm using only energy and ZCR.

Robust RGB image-based gait analysis in various environment (다양한 환경에 강건한 RGB 영상 기반 보행 분석)

  • Ahn, Ji-min;Jeung, Gyeo-wun;Shin, Dong-in;Won, Geon;Park, Jong-beom
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2018.10a
    • /
    • pp.441-443
    • /
    • 2018
  • This paper deals with the analysis of leg motion using RGB image. We used RGB image as gait analysis element by using BMC(Background Model Challenge) method and by using combining object recognition segmentation algorithm and attitude detection algorithm. It is considered that gait analysis incorporating image can be used as a parameter for classification of gait pattern recognition and abnormal gait.

  • PDF

A Korean POS Tagging System with Handling Corpus Errors (말뭉치 오류를 고려한 HMM 한국어 품사 태깅 시스템)

  • Seol, Yong-Soo;Kim, Dong-Joo;Kim, Kyu-Sang;Kim, Han-Woo
    • KSCI Review
    • /
    • v.15 no.1
    • /
    • pp.117-124
    • /
    • 2007
  • 통계 기반 접근 방법을 이용한 품사태깅에서 태깅 정확도는 훈련 데이터의 양에 좌우될 뿐 아니라, 말뭉치가 충분할지라도 수작업으로 구축한 말뭉치의 경우 항상 오류의 가능성을 내포하고 있으며 언어의 특성상 통계적으로 신뢰할만한 데이터의 수집에도 어려움이 따른다. 훈련 데이터로 사용되는 말뭉치는 많은 사람들이 수작업으로 구축하므로 작업자 중 일부가 언어에 대한 지식이 부족하다거나 주관적인 판단에 의한 태깅 실수를 포함할 수도 있기 때문에 단순한 저빈도와 관련된 잡음 외의 오류들이 포함될 수 있는데 이러한 오류들은 재추정이나 평탄화 기법으로 해결될 수 있는 문제가 아니다. 본 논문에서는 HMM(Hidden Markov Model)을 이용한 한국어 품사 태깅에서 재추정 후 여전히 존재하는 말뭉치의 잡음에 인한 태깅 오류 해결을 위해 비터비 알고리즘적용 단계에서 데이터 부족과 말뭉치의 오류로 인해 문제가 되는 부분을 찾아내고 규칙을 통해 수정을 하여 태깅 결과를 개선하는 방안을 제안한다. 실험결과는 오류가 존재하는 말뭉치를 사용하여 구현된 HMM과 비터비 알고리즘을 적용한 태깅 정확도에 비해 오류를 수정하는 과정을 거친 후 정확도가 향상됨을 보여준다.

  • PDF

Development of a Cause Analysis Program to Risky Driving with Vision System (Vision 시스템을 이용한 위험운전 원인 분석 프로그램 개발에 관한 연구)

  • Oh, Ju-Taek;Lee, Sang-Yong
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.8 no.6
    • /
    • pp.149-161
    • /
    • 2009
  • Electronic control systems of vehicle are rapidly developed to keep balance of a driver`s safety and the legal, social needs. The driver assistance systems are putted into practical use according to the cost drop in hardware and highly efficient sensor, etc. This study has developed a lane and vehicle detection program using CCD camera. The Risky Driving Analysis Program based on vision systems is developed by combining a risky driving detection algorithm formed in previous study with lane and vehicle detection program suggested in this study. Risky driving detection programs developed in this study with information coming from the vehicle moving data and lane data are useful in efficiently analyzing the cause and effect of risky driving behavior.

  • PDF

Evaluation of Incident Detection Algorithms focused on APID, DES, DELOS and McMaster (돌발상황 검지알고리즘의 실증적 평가 (APID, DES, DELOS, McMaster를 중심으로))

  • Nam, Doo-Hee;Baek, Seung-Kirl;Kim, Sang-Gu
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.7 s.78
    • /
    • pp.119-129
    • /
    • 2004
  • This paper is designed to report the results of development and validation procedures in relation to the Freeway Incident Management System (FIMS) prototype development as part of Intelligent Transportation Systems Research and Development program. The central core of the FIMS is an integration of the component parts and the modular, but the integrated system for freeway management. The whole approach has been component-orientated, with a secondary emphasis being placed on the traffic characteristics at the sites. The first action taken during the development process was the selection of the required data for each components within the existing infrastructure of Korean freeway system. After through review and analysis of vehicle detection data, the pilot site led to the utilization of different technologies in relation to the specific needs and character of the implementation. This meant that the existing system was tested in a different configuration at different sections of freeway, thereby increasing the validity and scope of the overall findings. The incident detection module has been performed according to predefined system validation specifications. The system validation specifications have identified two component data collection and analysis patterns which were outlined in the validation specifications; the on-line and off-line testing procedural frameworks. The off-line testing was achieved using asynchronous analysis, commonly in conjunction with simulation of device input data to take full advantage of the opportunity to test and calibrate the incident detection algorithms focused on APID, DES, DELOS and McMaster. The simulation was done with the use of synchronous analysis, thereby providing a means for testing the incident detection module.

A Heuristic Algorithm for the Two-Dimensional Bin Packing Problem Using a Fitness Function (적합성 함수를 이용한 2차원 저장소 적재 문제의 휴리스틱 알고리즘)

  • Yon, Yong-Ho;Lee, Sun-Young;Lee, Jong-Yun
    • The KIPS Transactions:PartB
    • /
    • v.16B no.5
    • /
    • pp.403-410
    • /
    • 2009
  • The two-dimensional bin packing problem(2D-BPP) has been known to be NP-hard, and it is difficult to solve the problem exactly. Many approximation methods, such as genetic algorithm, simulated annealing and tabu search etc, have been also proposed to gain better solutions. However, the existing approximation algorithms, such as branch-and-bound and tabu search, have shown the low efficiency and the long execution time due to a large of iterations. To solve these problems, we first define the fitness function to simplify and increase the utility of algorithm. The function decides whether an item is packed into a given area, and as an important information for a packing strategy, the number of subarea that can accommodate a given item is obtained from the variant of the fitness function. Then we present a heuristic algorithm BF for 2D bin packing, constructed by the fitness function and subarea. Finally, the effectiveness of the proposed algorithm will be expressed by the comparison experiments with the heuristic and the metaheuristic of the literatures. As comparing with existing heuristic algorithms and metaheuristic algorithms, it has been found that the packing rate of algorithm BP is the same as 97% as existing heuristic algorithms, FFF and FBS, or better than them. Also, it has been shown the same as 86% as tabu search algorithm or better.

Algorithm for Detecting Direction of Single IF Scheme CW Radar Sensor (단일 IF 방식 CW 레이더 센서의 방향 검출 알고리즘)

  • Han, Byung-Hun;Shin, Hyun-Jun;Oh, Chang-Heon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.12
    • /
    • pp.2905-2910
    • /
    • 2015
  • CW Radar Sensors can be categorized into Single and Dual by its IF output type. Dual IF type is used for detecting the direction of moving objects. However, Dual IF type has more complicated circuitry than Single IF type and higher cost due to more parts required. In this paper, we propose an algorithm for Single IF type CW radar sensors to detect the direction of moving objects. It performs FFT on signals created at IF output when an object moves and determines approach, stop and recede according to amplitude variations. In order to verify the algorithm, a function generator is used to create a virtual signal and confirmed that it accurately detects the directions according to amplitude variations.

New Scheme for Smoker Detection (흡연자 검출을 위한 새로운 방법)

  • Lee, Jong-seok;Lee, Hyun-jae;Lee, Dong-kyu;Oh, Seoung-jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.9
    • /
    • pp.1120-1131
    • /
    • 2016
  • In this paper, we propose a smoker recognition algorithm, detecting smokers in a video sequence in order to prevent fire accidents. We use description-based method in hierarchical approaches to recognize smoker's activity, the algorithm consists of background subtraction, object detection, event search, event judgement. Background subtraction generates slow-motion and fast-motion foreground image from input image using Gaussian mixture model with two different learning-rate. Then, it extracts object locations in the slow-motion image using chain-rule based contour detection. For each object, face is detected by using Haar-like feature and smoke is detected by reflecting frequency and direction of smoke in fast-motion foreground. Hand movements are detected by motion estimation. The algorithm examines the features in a certain interval and infers that whether the object is a smoker. It robustly can detect a smoker among different objects while achieving real-time performance.

A Study on Generating Public Library Service Areas Considering User Access Patterns (이용자의 접근 패턴을 고려한 공공도서관 서비스 영역 생성 연구)

  • Woojin Kang;Jongwook Lee
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.34 no.3
    • /
    • pp.89-107
    • /
    • 2023
  • Public libraries should plan and provide services that satisfy various needs of the local community users. In order to understand library users, it is essential first to grasp the service areas of libraries. The current service areas of public libraries are primarily set based on administrative boundaries of the areas where the libraries are located, which limits the consideration of actual user access patterns to the libraries. In this study, we aim to create service areas that incorporate the transportation and geographical characteristics of the library's surroundings and reflect the access patterns of library users. Specifically, we utilized street network data from 502 libraries in 7 metropolitan cities to determine the travel distance and time from user locations, considering gradients, to the libraries. Subsequently, we applied the shortest path algorithm to generate service areas within a 30-minute walking or driving range. As a result, we confirmed that there are differences in the service area patterns of libraries depending on topographical factors, and this better reflects the realistic conditions of library access compared to service areas based on straight-line distances. This method of generating service areas contributes to a more accurate understanding of library users' numbers, characteristics, and needs.

Medical Diagnosis Problem Solving Based on the Combination of Genetic Algorithms and Local Adaptive Operations (유전자 알고리즘 및 국소 적응 오퍼레이션 기반의 의료 진단 문제 자동화 기법 연구)

  • Lee, Ki-Kwang;Han, Chang-Hee
    • Journal of Intelligence and Information Systems
    • /
    • v.14 no.2
    • /
    • pp.193-206
    • /
    • 2008
  • Medical diagnosis can be considered a classification task which classifies disease types from patient's condition data represented by a set of pre-defined attributes. This study proposes a hybrid genetic algorithm based classification method to develop classifiers for multidimensional pattern classification problems related with medical decision making. The classification problem can be solved by identifying separation boundaries which distinguish the various classes in the data pattern. The proposed method fits a finite number of regional agents to the data pattern by combining genetic algorithms and local adaptive operations. The local adaptive operations of an agent include expansion, avoidance and relocation, one of which is performed according to the agent's fitness value. The classifier system has been tested with well-known medical data sets from the UCI machine learning database, showing superior performance to other methods such as the nearest neighbor, decision tree, and neural networks.

  • PDF