• Annual Conference of KIPS
• /
• 2005.05a
• /
• pp.851-854
• /
• 2005

본 논문에서는 영상 내 객체들의 운동시차를 이용하여 실시간으로 2차원 영상을 입체 영상으로 변환하는 알고리즘을 제안하였다. 제안한 입체 영상 변환 알고리즘은 영상 내 객체 분할, 운동시차를 이용한 운동 객체 검출, 시차 처리를 이용하여 입체 영상으로 변환한다. 입체 영상 변환 알고리즘의 성능 평가를 위해 좌안과 우안 영상의 절대 차이 영상을 이용하여 기존의 MTD 방식과 시뮬레이션 결과를 비교, 분석하였다. 제안한 알고리즘은 영상의 운동 방향 및 속도에 상관없이 다양한 영상원에 대해 실시간 입체 영상 변환이 가능하다. 입체 영상 변환 장치는 VHDL로 설계하였으며, FPGA 테스트 보드 구현을 통해 성능 및 기능을 검증하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.7A
• /
• pp.1170-1181
• /
• 2001

본 논문은 다양한 실시간 스케줄링 알고리즘과 자원 접근 제어 정책을 통합적으로 설계/구현하되 필요에 따라 시스템을 선택적으로 재구성할 수 있게 하는 통합 실시간 스케줄링 모델을 제안한다. 제안 모델은 [3, 4]에서 제안된 기존 모델에 자원 관리자 및 대기 큐 관리자가 추가되었다. 사용자는 태스크 및 자원 속성을 기반 스케줄링 알고리즘에 상관없이 동일하게 지정할 수 있다. 반면 시스템 설계자는 우선순위 역전 문제를 해결하고 공유 자원에 대한 한정된 블록킹 시간을 보장하기 위한 다양한 자원 접근 제어 정책들을 하위 단계의 복잡한 커널 모듈을 수정하지 않고도 효율적으로 개발할 수 있다. Real-Time Linux [6]에 제안된 스케줄러 모델을 구현한 후, 이를 기반으로 다양한 스케줄링 알고리즘과 자원 접근 제어 정책들을 시험적으로 구현하여 보았다. 여러 성능 실험을 통해 제안 모델을 기반으로 다양한 알고리즘과 정책을 구현한다 해도 실행시의 오버헤드는 크지 않은 반면, 시스템 재구성과 자원 접근 제어 정책을 효과적으로 지원할 수 있다는 것을 확인할 수 있었다.

• Journal of IKEEE
• /
• v.20 no.4
• /
• pp.420-423
• /
• 2016

In this paper, we proposed an implementation of panoramic image stitching that operates in real time at the embedded environment by applying ROI based PROSAC algorithm using the directionality of the image. The conventional panoramic image stitching applies SURF or SIFT algorithm which contains unnecessary computation and a lots of data to detect feature points. In this paper, we use the direction of the input image and we proposed the method of reducing the unnecessary computation by using ROI. We use a gyro sensor and an acceleration sensor. Output data from gyro and acceleration sensors can be calibrated by complementary filter. The calibration does not affect the operating time of the proposed image stitching algorithm in embedded environment. Therefore, it is possible to operate in real-time.

• The Journal of Engineering Research
• /
• v.3 no.1
• /
• pp.57-64
• /
• 1998

This paper presents an architecture of a real-time two-dimensional median filter. The architecture has appropriate characteristics for the VLSI implementation such as small memory requirements, regular computations, and local data transfers. For the efficient two-dimensional median filter, a separable two-dimensional median filtering structure and a bit-sliced pipelined median searching algorithm are used. A behavioral simulator is implemented with C language and used for the analysis of the presented architecture.

• The Journal of Society for e-Business Studies
• /
• v.15 no.4
• /
• pp.303-317
• /
• 2010

In this paper, we propose a novel approach to fault prediction for real-time business process monitoring method using extended KNN imputation based LOF prediction. Existing rule-based approaches to process monitoring has some limitations like late alarm for fault occurrence or no indicators about real-time progress, since there exist unobserved attributes according to the monitoring phase during process executions. To improve these limitations, we propose an algorithm for LOF prediction by adopting the imputation method to assume unobserved attributes. LOF of ongoing instance is calculated by assuming next probable progresses after the monitoring phase, which is conducted during entire monitoring phases so that we can predict the abnormal termination of the ongoing instance. By visualizing the real-time progress in terms of the probability on abnormal termination, we can provide more proactive operations to opportunities or risks during the real-time monitoring.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.5B
• /
• pp.348-356
• /
• 2012

The application traffic analysis is getting more and more challenging due to the huge amount of traffic from high-speed network link and variety of applications running on wired and wireless Internet devices. Multi-level combination of various analysis methods is desired to achieve high completeness and accuracy of analysis results for a real-time analysis system, while requires much of processing burden on the contrary. This paper proposes a novel architecture for a real-time traffic analysis system which improves the processing performance on multi-core CPU environment. The main contribution of the proposed architecture is an efficient parallel processing mechanism with multiple threads of various analysis methods. The feasibility of the proposed architecture was proved by implementing and deploying it on our campus network.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.06a
• /
• pp.219-222
• /
• 2001

본 연구의 내용은 실시간 서비스 트래픽, 즉 보장형 서비스를 위한 스케줄링 알고리즘들에 대한 성능분석에 대한 연구이다. 특히 실시간 데이터 전송의 경우, 작은 지연 시간을 요구하면서 안정된 QoS를 요구하고 있다. 기존에 알려진 FQ, WFQ, WF2Q, Virtual Clock 스케줄링 알고리즘들을 사용해서 대기 큐의 수학적 모델이 아닌 시뮬레이션 도구를 사용해서, 지연에 민감한 보장형 서비스 트래픽에 대한 시간 복잡도, 공정성, 처리율 측면으로 성능을 분석하였다.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.254-260
• /
• 2005

In the guaranteed service, a real-time scheduling algorithm must achieve both high level of network utilization and scalable implementation. Here, network utilization indicates the number of admitted real-time sessions. Unfortunately, existing scheduling algorithms either are lack of scalable implementation or can achieve low network utilization. For example, scheduling algorithms based on time-stamps have the problem of O(log N) scheduling complexity where N is the number of sessions. On the contrary, round-robin algorithms require O(1) complexity. but can achieve just a low level of network utilization. In this paper, we propose a scheduling algorithm that can achieve high network utilization without losing scalability. The proposed algorithm is a Hierarchical Round-Robin (H-RR) algorithm that utilizes multiple rounds with different interval sizes. It provides latency bounds similar to those by Packet-by-Packet Generalized Processor Sharing (PGPS) algorithm using a sorted-Priority queue. However, H-RR requires a constant time for implementation.

• Korean Journal of Remote Sensing
• /
• v.28 no.1
• /
• pp.55-67
• /
• 2012

Real-time image georeferencing is required to generate spatial information rapidly from the image sequences acquired by multi-sensor systems. To complement the performance of position/attitude sensors and process in real-time, we should employ on-line aerial triangulation based on a sequential estimation algorithm. In this study, we thus attempt to derive an efficient on-line aerial triangulation algorithm for real-time georeferencing of image sequences. We implemented on-line aerial triangulation using the existing Given transformation update algorithm, and a new inverse normal matrix update algorithm based on observation classification, respectively. To compare the performance of two algorithms in terms of the accuracy and processing time, we applied these algorithms to simulated airborne multi-sensory data. The experimental results indicate that the inverse normal matrix update algorithm shows 40 % higher accuracy in the estimated ground point coordinates and eight times faster processing speed comparing to the Given transformation update algorithm. Therefore, the inverse normal matrix update algorithm is more appropriate for the real-time image georeferencing.

• Journal of Advanced Navigation Technology
• /
• v.22 no.6
• /
• pp.623-629
• /
• 2018

In this paper, we propose a real-time obstacle detection and avoidance path generation algorithm for UAV. 2-D Lidar is used to detect obstacles, and the detected obstacle data is used to generate real-time histogram for local avoidance path and a 2-D SLAM map used for global avoidance path generation to the target point. The VFH algorithm for local avoidance path generation generates a real-time histogram of how much the obstacles are distributed in the vector direction and distance, and this histogram is used to generate the local avoidance path when detecting near fixed or dynamic obstacles. We propose an algorithm, called modified $RRT^*-Smart$, to overcome existing limitations. That generates global avoidance path to the target point by creating lower costs because nodes are checked whether or not straight path to a target point, and given arbitrary lengths and directionality to the target points when nodes are created. In this paper, we prove the efficient avoidance maneuvering through various simulation experiment environment by creating efficient avoidance paths.