• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.9
• /
• pp.1244-1253
• /
• 2021

In this paper, we propose a method for predicting in advance whether pedestrians will enter the hazardous area after the current time using the pedestrian trajectory prediction method and an efficient simplification method of the trajectory prediction network. In addition, we propose a method to apply KD(Knowledge Distillation) to a small network for real-time operation in an embedded environment. Using the correlation between predicted future paths and hazard zones, we determined whether to enter or not, and applied efficient KD when learning small networks to minimize performance degradation. Experimentally, it was confirmed that the model applied with the simplification method proposed improved the speed by 37.49% compared to the existing model, but led to a slight decrease in accuracy. As a result of learning a small network with an initial accuracy of 91.43% using KD, It was confirmed that it has improved accuracy of 94.76%.

• Proceedings of the KIEE Conference
• /
• 1999.11c
• /
• pp.661-663
• /
• 1999

본 논문에서는 새로운 경로 계획 방법으로 중심 이등에 의한 경로 알고리즘을 제안한다. 제안된 알고리즘을 사용하여 곡률 반경을 이용한 경로 계획의 문제점인 각도오차가 커질수록 우회하는 현상을 보다 효율적으로 해결함을 시뮬레이션을 통하여 보인다. 또한 제안된 경로 알고리즘에 칼만 필터를 이용한 예측기를 적용시켜 로봇이 공을 추정하는데 발생할 수 있는 잡음에 강인함을 보이며 신뢰성 있는 결과를 확인한다.

• 한국ITS학회:학술대회논문집
• /
• 2004.11a
• /
• pp.154-162
• /
• 2004

• The Journal of the Korea Contents Association
• /
• v.9 no.9
• /
• pp.1-8
• /
• 2009

H.264/AVC video coding standard uses the rate distortion optimization method which determines the best coding mode for macroblock(MB) to improve coding efficiency. Whereas RDO selects the best coding mode, it causes the heavy computational burden comparing with previous standards. To reduce the complexity, in this paper, a fast intra prediction mode decision algorithm using directional gradients is proposed. The proposed algorithm is composed of 2-path structure. In the first path, $16{\times}16$ intra prediction mode is determined using directional gradients. In the second path, 3 modes instead of 9 modes are chosen for RDO to decide the best mode for $4{\times}4$ block. Finally, the two modes determined in the two-path decision process are compared to decide the final block mode. Experimental results show that the computation time of the proposed method is decreased to about 77% of the exhaustive mode decision method with negligible quality loss.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2021.11a
• /
• pp.181-182
• /
• 2021

본 연구에서는 자율운항선박의 원격 관제 및 제어하는 과정에서 원격 운항자에게 사전 충돌 위험 정보를 제공하기 위해 선박자동식별시스템(AIS, Automatic Identification System)의 항적 정보를 토대로 자율운항선박의 운항 경로 상에 잠재된 충돌 위험 영역을 예측하기 위한 기초 연구를 수행하였다. 자율운항선박의 운항 경로 상에 근접한 타선의 AIS 정보에는 기본적으로 선박의 위치, 속도, 침로에 대한 정보가 반영되어 있으므로, 이러한 정보를 토대로 일정 시간 동안 운항 경로를 예측할 수 있다. 그리고 예측한 정보를 기반으로 대표적 충돌 위험 지수인 최근접점(CPA, Closest Point of Approach)과 최근접점 거리(DCPA, Distance to CPA) 정보를 활용하여 충돌 위험 영역을 2차원 공간상에서 예측하였다. 제안된 방법은 실제 AIS 항적 데이터를 활용한 수치 시뮬레이션을 수행하여 초기 결과를 검증하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.181-190
• /
• 1996

Pipelined architecture improves processor performance by overlapping the execution of several different instructions. The effect of control hazard stalls the pipeline and reduces processor performance. In order to reduce the effect of control hazard caused by branch, we proposes a new approach combining both branch prediction and two paths strategy. In addition, we verify the performance improvement in a proposed approach by utilizing system performance metric CPI rather than BEP.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.111-112
• /
• 2015

본 논문에서는 Delay Tolerant Networks(DTNs)에서 Markov chain으로 노드의 속성 정보 변화율을 분석하여 노드의 이동 경로를 예측하는 알고리즘을 제안한다. 기존 DTN에서 예측기반 라우팅 기법은 노드가 미리 정해진 스케줄에 따라 이동한다. 이러한 네트워크에서는 스케줄을 예측할 수 없는 환경에서 노드의 신뢰성이 낮아진다. 본 논문에서는 일정 구간의 노드의 속성 정보의 시간에 따른 변화율을 Markov chain을 이용하여 노드의 이동 경로를 예측하는 알고리즘을 제안한다. 제안하는 알고리즘은 노드의 속성 정보 중 노드의 속도와 방향성을 근사한 후, 변화율을 분석하고 이로부터 Markov chain을 이용하여 확률전이 매트릭스를 생성하여 노드의 이동 경로를 예측하는 알고리즘이다. 주어진 모의실험 환경에서 노드의 이동 경로 예측을 통해 중계 노드를 선정하여 라우팅 함으로써 네트워크 오버헤드와 전송 지연 시간이 감소함을 보여주고 있다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1312-1318
• /
• 2006

One of the common services of telematics is the car navigation that finds the shortest path from source to target. Until now, some routing algorithms of the car navigation do not consider the real-time traffic information and use the static shortest path algorithm. In this paper, we prosed the method to predict the traffic flow in the future. This prediction combines two methods. The former is an accumulated speed pattern, which means the analysis results for all past speeds of each road by classfying the same day and the same time inteval. The latter is the Kalman filter. We predicted the traffic flows of each segment by combining the two methods. By experiment, we showed our algorithm gave better precise predicition than only using accumulated speed pattern that is used commonly. The result can be applied to the car navigation to support a dynamic shortest path. In addition, it can give users the travel information to avoid the traffic congestion areas.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.3
• /
• pp.193-207
• /
• 2009

Intracellular signal transduction is achieved by protein-protein interaction. In this paper, we suggest high performance algorithm based on Yeast protein-protein interaction and protein location information. We compare if pathways predicted with high valued weights indicate similar tendency with pathways provided in KEGG. Furthermore, we suggest extracted results, which can imply a discovery of new signaling pathways that is yet proven through experiments. This will be a good basis for research to discover new protein signaling pathways and unknown functions of established proteins.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.33 no.4
• /
• pp.287-296
• /
• 2015

Recent navigation systems provide quick guide services, based on processing real-time traffic information and past traffic information by applying predictable pattern for traffic information. However, the current pattern for traffic information predicts traffic information by processing past information that it presents an inaccuracy problem in particular circumstances(accidents and weather). So, this study presented a more precise predictive traffic information system than historical traffic data first by analyzing route search data which the drivers ask in real time for the quickest way then by grasping traffic congestion levels of the route in which future drivers are supposed to locate. First results of this study, the congested route from Yang Jae to Mapo, the analysis result shows that the accuracy of the weighted value of speed of existing commonly congested road registered an error rate of 3km/h to 18km/h, however, after applying the real predictive traffic information of this study the error rate registered only 1km/h to 5km/h. Second, in terms of quality of route as compared to the existing route which allowed for an earlier arrival to the destination up to a maximum of 9 minutes and an average of up to 3 minutes that the reliability of predictable results has been secured. Third, new method allows for the prediction of congested levels and deduces results of route searches that avoid possibly congested routes and to reflect accurate real-time data in comparison with existing route searches. Therefore, this study enabled not only the predictable gathering of information regarding traffic density through route searches, but it also made real-time quick route searches based on this mechanism that convinced that this new method will contribute to diffusing future traffic flow.