• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.681-684
• /
• 2000

본 논문은 Client & Server 모델을 기반으로 선로 이용률과 응답시간을 분석, 조합하여 웹 상에서 해당 목적지 경로 사이에 있을 수 있는 bottleneck 구간을 탐지하기 위한 시스템을 설계하였다. 이를 위해 traceroute를 이용하여 사용자와 해당 목적지 경로 사이의 인터페이스들을 추적하였다. 추적된 인터페이스들의 IP로 TCP/IP 표준 네트워크 망 관리 프로토콜인 SNMP Polling을 하여 인터페이스로부터 각종 MIB 정보들을 가져와 각 인터페이스간의 선로 이용률을 분석해냈으며, 또한 정확한 bottleneck 구간을 알아내고자 각 라우터로 ping을 실행시켜 응답시간을 계산하였다. 이렇게 얻은 선로 이용률과 응답시간으로 보다 정확한 트래픽 정보와 bottleneck 구간을 분석해낼 수 있었다. 이러한 분석 시스템으로 인해 사용자들은 전문적인 지식 없이 단지 자신의 컴퓨터의 웹브라우저를 통한 서버 분석 시스템 접속만으로도 해당 구간의 어떤 부분이 bottleneck 구간인지를 탐지, 분석할 수 있을 것이다.

• The Bulletin of The Korean Astronomical Society
• /
• v.35 no.1
• /
• pp.37.2-37.2
• /
• 2010

한국천문연구원에서는 이동형 레이저위성추적(SLR) 시스템을 개발하고 있다. 이동형 레이저위성추적 시스템의 광학부는 송신광학계, 수신광학계, 광신호유도계로 구성되어 있으며, 주야간에 운영되는 시스템의 특성상 광신호유도계는 특별한 구성과 기능을 갖는다. 본 연구에서는 주야간 위성추적을 위해 요구되는 광신호유도계의 구성과 기능을 소개하며, 또한 광신호유도 광학계의 광학설계에 대해서도 논한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.771-773
• /
• 1998

광선 추적법(Ray-Tracer)은 물체에 직.간접적으로 영향을 미치는 빛의 반사 및 굴절 경로를 역추적함으로써 실제감있는 이미지를 생성하는 렌더링(rendering)기법이다. 이러한 광성 추적법을 장시간의 계산을 필요로 하는 단점이 있으나. 각각의 광선을 병렬적으로 추적함으로써 속도의 향상을 피할 수 있다. 본 논문에서는 자바를 사용하는 메시지 기반 병렬 프로그래밍 시스템인 JPVM 상에서 동작하는 병렬 광선 추적기를 구현하였다. 병렬 광성 추적기를 사용자에 의해 지정된 장면 정의 파일(Scene Defintion File)을 읽어 들여 피싱(parsing)한후, 생성된 장면 객체를 각 worker프로그램에게 전송한다. 병렬 광선 추적기는 전체 화면 영역을 분활하여 각 worker 프로그램에 할당하며, worker프로그램들은 자신에게 할당된 영역의 이미지를 병렬적으로 생성한다. 실험 결과, 병렬 광선 추적기는 단일 광선 추적기에 비해 빠르게 렌더링을 수행하였으며, worker프로그램의 수가 증가함에 따라 수행 속도가 향상되었다.

• KIISE Transactions on Computing Practices
• /
• v.22 no.2
• /
• pp.61-68
• /
• 2016

Surveillance cameras have been installed in many places because security and safety has become an important issue in modern society. However, watching surveillance videos and judging accidental situations is very labor-intensive and time-consuming. So now, requests for research to automatically analyze the surveillance videos is growing. In this paper, we propose a surveillance system to track multiple persons in videos and to summarize the videos based on tracking information. The proposed surveillance summarization system applies an adaptive illumination correction, subtracts the background, detects multiple persons, tracks the persons, and saves their tracking information in a database. The tracking information includes tracking one's path, their movement status, length of staying time at the location, enterance/exit times, and so on. The movement status is classified into six statuses(Enter, Stay, Slow, Normal, Fast, and Exit). This proposed summarization system provides a person's status as a graph in time and space and helps to quickly determine the status of the tracked person.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.9
• /
• pp.2274-2279
• /
• 2009

This paper describes the radar tracking errors due to the presence of surface reflected waves. We investigate the previous studies on tracking errors and developed a tracking error estimation program using Matlab. We suggest an accurate error prediction method by considering the antenna beamwidth and surface reflection coefficient. The presented results well agree with theoretical predictions.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2023.05a
• /
• pp.40-41
• /
• 2023

This paper introduces the design of detection, recognition, and tracking algorithms for VTS radar image-based objects. The detection of objects in radar images utilizes artificial intelligence technology to determine the presence or absence of objects, and can classify the type of object using AI technology. Tracking involves the continuous tracking of detected objects over time, including technology to prevent confusion in the movement path. In particular, for land-based radar, there are unnecessary areas for detection depending on the terrain, so the function of detecting and recognizing vessels within the region of interest (ROI) set in the radar image is included. In addition, the extracted coordinate information is designed to enable various applications and interpretations by calculating speed, direction, etc.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2003.06a
• /
• pp.79-79
• /
• 2003

• Proceedings of the Optical Society of Korea Conference
• /
• 2008.02a
• /
• pp.237-238
• /
• 2008

• Journal of IKEEE
• /
• v.13 no.2
• /
• pp.150-158
• /
• 2009

For the autonomous movement, the optimal path planning connecting between current and target positions is essential, and the optimal path of mobile robot means obstacle-free and the shortest length path to a target position. Many actual mobile robots should move without any information of surrounded obstacles. Thus, this paper suggests new methods of path planning and obstacle avoidment, suitable in unknown environments. This method of path planning always tracks the local target expected as the optimal one, and the result of continuous tracking becomes the first generated moving path. This path, however, do not regard the collision with obstacles. Thus, this paper suggests a new method of obstacle avoidance resembled with the Potential Field method. Finally, a simulation confirms the performance and correctness of the path planning and obstacle avoidance, suggested in this paper.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.11
• /
• pp.82-88
• /
• 2007

In this paper, we present a pattern comparison algorithm for reducing fault candidate lists. The number of fault candidates determines the total fault simulation time. To decrease the total fault diagnosis time, the reduction of the number of fault candidates is essential. Critical path tracing determines fault candidate lists detected by a set of tests using a backtracing algorithm starting at the primary outputs of a circuit. The proposed algorithm reduces fault candidates comparing failing patterns with good patterns during critical path tracing process. As we reduce all fault candidates of the circuit to more accurately suspected fault candidates, we can greatly reduce fault simulation time. The proposed algorithm greatly increases simulation speed than that of a conventional backtracing method. The proposed algorithm is applicable to both combinational and sequential circuits. Experimental results on ISCAS#85 and ISCAS#89 benchmark circuits showed fault candidates are pruned and fault diagnosis time is also decreased in proportion to fault candidate decrease.