• 제목/요약/키워드: Real Time Algorithm

검색결과 5,406건 처리시간 0.029초

DSRC 자료를 이용한 고속도로 단기 통행시간 예측 (Short-Term Prediction of Travel Time Using DSRC on Highway)

  • 김형주;장기태
    • 대한토목학회논문집
    • /
    • 제33권6호
    • /
    • pp.2465-2471
    • /
    • 2013
  • 현재까지 통행시간 예측과 관련된 다양한 연구들이 수행되었지만, 한국고속도로 특성에 맞는 예측방법론에 대한 실증연구는 부족한 실정이다. 이에 본 연구에서는 실제 통행시간을 기반으로한 DSRC 자료를 바탕으로 한국고속도로에 적절한 예측방법론을 도출한다. 경부고속도로 안성 JC~오산IC 구간의 24시간 DSRC 자료를 이용하며 단주기 통행시간 예측 및 비선형 관계에서 높은 정확도를 보이는 인공신경망 기법을 적용한다. 이어서 랜덤난수를 이용한 통행시간 예측결과의 정확도 검증을 실시한다. 통행시간 예측결과 오차율이 약 4%로 우수한 예측력을 보였으며, 이는 패턴기반 인공신경망 예측시 이력자료의 전처리 과정과 최적의 입력층 및 은닉층의 선정으로 인한 결과로 판단된다. 통행시간 예측결과의 검증을 위해서 랜덤난수를 이용하였으며, 랜덤난수가 이력자료 패턴에 포함되지 않은 경우 실측치와의 오차율이 18.98%로 높게 도출되었다. 이는 인공신경망을 이용한 통행시간 예측시 패턴DB가 예측의 정확도에 주요하게 작용한 결과로 판단된다. 본 연구의 결과를 통해서 한국고속도로 특성에 맞는 통행시간 예측 및 정보제공이 가능할 것으로 판단된다.

운동분석 및 측정을 위한 실시간 마커 인식 알고리즘 (Real Time Maker Detection Algorithm for Motion Analysis)

  • 이승민;이주연;황준;김문화
    • 한국정보처리학회논문지
    • /
    • 제5권5호
    • /
    • pp.1367-1376
    • /
    • 1998
  • 본 논문에서는 영상처리기(image processor)가 내장되어 있지 않은 영상획득기(frame grabber) CCD 카메라만을 가지고 2차원 및 3차원 운동 측정과 분석을 위한 실시간 마커 인식 알고리즘을 개발하였다. 검색 범위의 축소를 통해 마커 출현 예상 위치를 추정하는 추적 알고리즘을 제시하며, 예상 범위 내에서 실제 마커를 탐색하는 알고리즘으로서 전화면 검색기법, 회오리 검색 기법, 사방팔방 기법을 제시하며, 인식된 마커의 중점을 찾는 알고리즘을 제시한다. 본 연구에서 제시한 알고리즘들은 실시간 마커 인식을 위해 검색 대상의 범위를 축소하는데 그 목적을 두었다. 인식된 마커의 중점을 찾는 알고리즘은 기존의 외곽선 축출 방법보다 빠른 중점 축출 알고리즘이다.

  • PDF

A Random Deflected Subgradient Algorithm for Energy-Efficient Real-time Multicast in Wireless Networks

  • Tan, Guoping;Liu, Jianjun;Li, Yueheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권10호
    • /
    • pp.4864-4882
    • /
    • 2016
  • In this work, we consider the optimization problem of minimizing energy consumption for real-time multicast over wireless multi-hop networks. Previously, a distributed primal-dual subgradient algorithm was used for finding a solution to the optimization problem. However, the traditional subgradient algorithms have drawbacks in terms of i) sensitivity to iteration parameters; ii) need for saving previous iteration results for computing the optimization results at the current iteration. To overcome these drawbacks, using a joint network coding and scheduling optimization framework, we propose a novel distributed primal-dual Random Deflected Subgradient (RDS) algorithm for solving the optimization problem. Furthermore, we derive the corresponding recursive formulas for the proposed RDS algorithm, which are useful for practical applications. In comparison with the traditional subgradient algorithms, the illustrated performance results show that the proposed RDS algorithm can achieve an improved optimal solution. Moreover, the proposed algorithm is stable and robust against the choice of parameter values used in the algorithm.

실시간 속기 자막 환경에서 멀티미디어 정보 검색을 위한 Prefix Array (The Prefix Array for Multimedia Information Retrieval in the Real-Time Stenograph)

  • 김동주;김한우
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2006년 학술대회 논문집 정보 및 제어부문
    • /
    • pp.521-523
    • /
    • 2006
  • This paper proposes an algorithm and its data structure to support real-time full-text search for the streamed or broadcasted multimedia data containing real-time stenograph text. Since the traditional indexing method used at information retrieval area uses the linguistic information, there is a heavy cost. Therefore, we propose the algorithm and its data structure based on suffix array, which is a simple data structure and has low space complexity. Suffix array is useful frequently to search for huge text. However, subtitle text of multimedia data is to get longer by time. Therefore, suffix array must be reconstructed because subtitle text is continually changed. We propose the data structure called prefix array and search algorithm using it.

  • PDF

레이더의 부하 상태에 따른 빔 스케줄링 알고리즘의 선택적 적용 (Differential Choice of Radar Beam Scheduling Algorithm According to Radar Load Status)

  • 노지은;김동환;김선주
    • 한국군사과학기술학회지
    • /
    • 제15권3호
    • /
    • pp.322-333
    • /
    • 2012
  • AESA radar is able to instantaneously and adaptively position and control the beam, and such adaptive beam pointing of AESA radar enables to remarkably improve the multi-mission capability. For this reason, Radar Resource Management(RRM) becomes new challenging issue. RRM is a technique efficiently allocating finite resources, such as energy and time to each task in an optimal and intelligent way. Especially radar beam scheduling is the most critical component for the success of RRM. In this paper, we proposed a rule-based scheduling algorithm and Simulated Annealing(SA) based scheduling algorithm, which are alternatively selected and applied to beam scheduler according radar load status in real-time. The performance of the proposed algorithm was evaluated on the multi-function radar scenario. As a result, we showed that our proposed algorithm can process a lot of beams at the right time with real time capability, compared with applying only rule-based scheduling algorithm. Additionally, we showed that the proposed algorithm can save scheduling time remarkably, compared with applying only SA-based scheduling algorithm.

Data anomaly detection and Data fusion based on Incremental Principal Component Analysis in Fog Computing

  • Yu, Xue-Yong;Guo, Xin-Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권10호
    • /
    • pp.3989-4006
    • /
    • 2020
  • The intelligent agriculture monitoring is based on the perception and analysis of environmental data, which enables the monitoring of the production environment and the control of environmental regulation equipment. As the scale of the application continues to expand, a large amount of data will be generated from the perception layer and uploaded to the cloud service, which will bring challenges of insufficient bandwidth and processing capacity. A fog-based offline and real-time hybrid data analysis architecture was proposed in this paper, which combines offline and real-time analysis to enable real-time data processing on resource-constrained IoT devices. Furthermore, we propose a data process-ing algorithm based on the incremental principal component analysis, which can achieve data dimensionality reduction and update of principal components. We also introduce the concept of Squared Prediction Error (SPE) value and realize the abnormal detection of data through the combination of SPE value and data fusion algorithm. To ensure the accuracy and effectiveness of the algorithm, we design a regular-SPE hybrid model update strategy, which enables the principal component to be updated on demand when data anomalies are found. In addition, this strategy can significantly reduce resource consumption growth due to the data analysis architectures. Practical datasets-based simulations have confirmed that the proposed algorithm can perform data fusion and exception processing in real-time on resource-constrained devices; Our model update strategy can reduce the overall system resource consumption while ensuring the accuracy of the algorithm.

레이다용 Phased RF Sub-Array MIMO 알고리즘 실시간 구현 (Real-time Implementation of Phased RF Sub-Array MIMO Algorithm for Radar)

  • 김완식;여환용
    • 문화기술의 융합
    • /
    • 제9권5호
    • /
    • pp.517-522
    • /
    • 2023
  • 기존의 레이다는 RF Sub-Array 방식의 레이다 알고리즘을 적용하여 개발되어 왔고, 최근 차량용 레이다용으로 Full 디지털 방식의 Multiple-Input Multiple-Output (MIMO) 레이다 알고리즘을 적용하여 구현되고 있다. 본 논문에서는 미확보 기술인 RF Sub-Array 방식의 하드웨어에 Phased MIMO 방식을 적용한 레이다 알고리즘을 실시간 가능하도록 구현 및 검증하였다. RF Sub-Array 방식의 Phased MIMO 알고리즘 기술 확보 차원에서 FPGA 기반의 실시간 신호처리를 위한 하드웨어 구조를 제시하고 이에 대한 설계 및 시뮬레이션을 통하여 성능을 먼저 예측하였으며, 이를 통하여 FPGA 기반의 광대역 MIMO FMCW 레이더의 디지털 송수신 신호처리 하드웨어를 개발하였고 최종적으로 RF Sub-Array 방식의 Phased MIMO 레이다 알고리즘을 실시간 구현 및 검증하였다. 이를 바탕으로 향후 테라헤르츠 대역 레이다 등에 필요한 핵심 기술 확보 및 응용할 수 있을 것으로 판단된다.

OGM-Based Real-Time Obstacle Detection and Avoidance Using a Multi-beam Forward Looking Sonar

  • Han-Sol Jin;Hyungjoo Kang;Min-Gyu Kim;Mun-Jik Lee;Ji-Hong Li
    • 한국해양공학회지
    • /
    • 제38권4호
    • /
    • pp.187-198
    • /
    • 2024
  • Autonomous underwater vehicles (AUVs) have a limited bandwidth for real-time communication, limiting rapid responses to unexpected obstacles. This study addressed how AUVs can navigate to a target without a pre-existing obstacle map by generating one in real-time and avoiding obstacles. This paper proposes using forward-looking sonar with an occupancy grid map (OGM) for real-time obstacle mapping and a potential field algorithm for avoiding obstacles. The OGM segments the map into grids, updating the obstacle probability of each cell for precise, quick mapping. The potential field algorithm attracts the AUV towards the target and uses repulsive forces from obstacles for path planning, enhancing computational efficiency in a dynamic environment. Experiments were conducted in coastal waters with obstacles to verify the real-time obstacle mapping and avoidance algorithm. Despite the high noise in sonar data, the experimental results confirmed effective obstacle mapping and avoidance. The OGM-based potential field algorithm was computationally efficient, suitable for single-board computers, and demonstrated proper parameter adjustments through two distinct scenarios. The experiments also identified some of challenges, such as dynamic changes in detection rates, propulsion bubbles, and changes in repulsive forces caused by sudden obstacles. An enhanced algorithm to address these issues is currently under development.

시간 지연 2차원 좌표계를 이용한 실시간 QRS 검출에 관한 연구 (A Study on Real Time QRS complex Detection Algorithm Using 2-Dimensional Time-Delay Coordinates)

  • 정석현;이정환;이병채;이명호
    • 대한의용생체공학회:학술대회논문집
    • /
    • 대한의용생체공학회 1995년도 춘계학술대회
    • /
    • pp.277-280
    • /
    • 1995
  • This paper describes a real time QRS detection algorithm. The proposed algorithm detects QRS complex using characteristics of the 2-dimensional phase portrait which is reconstructed from 1-demensional scalar time series. We observe the phase portrait of ECG signal has special trejectory when QRS complex occurs and apply it to detect QRS complexes. In order to evaluate the performance of the proposed algorithm, we use MIT/BIH arrhythmia database. As a result, the proposed algorithm correctly detects 99.3% of the QRS complexes.

  • PDF

산업 현장의 안전거리 계측을 위한 동적 계획 신경회로망 (A Dynamic Programming Neural Network to find the Safety Distance of Industrial Field)

  • 김종만;김원섭;김영민;황종선;박현철
    • 한국전기전자재료학회:학술대회논문집
    • /
    • 한국전기전자재료학회 2001년도 기술교육위원회 창립총회 및 학술대회 의료기기전시회
    • /
    • pp.23-27
    • /
    • 2001
  • Making the safety situation from the various work system is very important in the industrial fields. The proposed neural network technique is the real titre computation method based theory of inter-node diffusion for searching the safety distances from the sudden appearance-objests during the work driving. The main steps of the distance computation using the theory of stereo vision like the eyes of man is following steps. One is the processing for finding the corresponding points of stereo images and the other is the interpolation processing of full image data from nonlinear image data of obejects. All of them request much memory space and titre. Therefore the most reliable neural-network algorithm is drived for real time recognition of obejects, which is composed of a dynamic programming algorithm based on sequence matching techniques. And the real time reconstruction of nonlinear image information is processed through several simulations. I-D LIPN hardware has been composed, and the real time reconstruction is verified through the various experiments.

  • PDF