• Journal of Korea Multimedia Society
• /
• v.15 no.12
• /
• pp.1430-1441
• /
• 2012

In this paper, we present an algorithm that quickly and effectively estimates orthogonal vanishing points in equirectangular images of urban environment. Our algorithm is based on the RANSAC (RANdom SAmple Consensus) algorithm and on the characteristics of the line segment in the spherical panorama image of the $360^{\circ}$ longitude and $180^{\circ}$ latitude field of view. These characteristics can be used to reduce the geometric ambiguity in the line segment classification as well as to improve the robustness of vanishing point estimation. The proposed algorithm is validated experimentally on a wide set of images. The results show that our algorithm provides excellent levels of accuracy for the vanishing point estimation as well as line segment classification.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2619-2643
• /
• 2018

In this paper, a new clustering algorithm based on the connected region generation (CRG-clustering) is proposed. It is an effective and robust approach to clustering on the basis of the connectivity of the points and their neighbors. In the new algorithm, a connected region generating (CRG) algorithm is developed to obtain the connected regions and an isolated point set. Each connected region corresponds to a homogeneous cluster and this ensures the separability of an arbitrary data set theoretically. Then, a region expansion strategy and a consensus criterion are used to deal with the points in the isolated point set. Experimental results on the synthetic datasets and the real world datasets show that the proposed algorithm has high performance and is insensitive to noise.

• Journal of the Institute of Convergence Signal Processing
• /
• v.16 no.1
• /
• pp.9-14
• /
• 2015

Outlier detection and removal is a crucial step needed for various image processing applications such as image registration. Random Sample Consensus (RANSAC) is known to be the best algorithm so far for the outlier detection and removal. However RANSAC requires a cosiderable computation time. To drastically reduce the computation time while preserving the comparable quality, a outlier detection and removal method based on modified K-means is proposed. The original K-means was conducted first for matching point pairs and then cluster merging and member exclusion step are performed in the modification step. We applied the methods to various images with highly repetitive patterns under several geometric distortions and obtained successful results. We compared the proposed method with RANSAC and showed that the proposed method runs 3~10 times faster than RANSAC.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.5
• /
• pp.73-80
• /
• 2019

In Korea, a budget of tens of trillion won is put into the national R & D project every year. Thanks to these efforts, Korea's ICT industry is gaining global attention. However, there are still a lot of problems that are lacking in terms of the cycle of managing national ICT R&D projects. In particular, the issue of sharing is very insufficient throughout the cycle of the national ICT R&D. In this paper, In this paper, We propose a platfom that can be shared throughout the cycle of managing blockchain-based national ICT R&D projects. This platform we call the Perfect Sharing Project Platform (PSPP). We describe that PSPP can achieve excellent research results through information sharing of project process[1-2]. To support the perfect sharing, this platform uses a new notion of consensus algorithm, called POA (Proof of Atomicity). This platform is suitable for sharing information.

• Korean Journal of Biological Psychiatry
• /
• v.27 no.1
• /
• pp.1-8
• /
• 2020

Objectives In electroconvulsive therapy (ECT) research and practice, the precise determination of seizure duration is important in the evaluation of clinical relevance of the ECT-induced seizure. In this study, we have developed computerized algorithms to assess the duration of ECT-induced seizure. Methods Subjects included 5 males and 6 females, with the mean age of 33.1 years. Total 55 ECT sessions were included in the analysis. We analyzed the standard deviation of a finite block of electroencephalography (EEG) data and the change in the local slope of RR intervals in electrocardiography (ECG) signals during ECT-induced seizure. And then, we compared the calculated seizure durations from EEG recording (EEG algorithm) and ECG recording (ECG algorithm) with values determined by consensus of clinicians based on the recorded EEG (EEG consensus), as a gold standard criterion, in order to testify the computational validity of our algorithms. Results The mean seizure durations calculated by each method were not significantly different in sessions with abrupt flattened postictal suppression and in sessions with non-abrupt flattened postictal suppression. The intraclass correlation coefficients (95% confidence interval) of the three methods (EEG algorithm, ECG algorithm, EEG consensus) were significant in the total sessions [0.79 (0.70-0.86)], the abrupt flattened postictal suppression sessions [0.84 (0.74-0.91)], and the non-abrupt flattened postictal suppression sessions [0.67 (0.45-0.84)]. Correlations between three methods were also statistically significant, regardless of abruptness of transition. Conclusions Our proposed algorithms could reliably measure the duration of ECT-induced seizure, even in sessions with non-abrupt transitions to flat postictal suppression, in which it is typically difficult to determine the seizure duration.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.2
• /
• pp.25-30
• /
• 1985

This paper proposes an algorithm to simplify Boolean functions into near minimal sum-of-products for Programmable Logic Arrays. In contrast to the conventional procedures, where the execution time depends on the number of variables, the execution time by this procedure depends on the degree of consensus of base minterms. Thus as the number of variables is increased, the difference of CPU time becomes larger using this new Procedure than using other procedures and consequently the executable range of input function increasing. The algorithm has been implemented on CYEER 170-740 and it's results were compared with those using Arvalo's algorithm.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2018.01a
• /
• pp.11-12
• /
• 2018

FPC 알고리즘(Fast Paox-based controller algorithm)은 기존에 Paxos 프로토콜을 단순화하고 Paxos를 개발하고 구현하는 복잡성을 완화할 수 있는 다중 SDN 컨트롤러 간에 적용되는 합의를 처리할 수 있는 알고리즘이다. 하지만, 허가를 결정하는 투표 과정에서 불필요한 절차가 존재하여 연산 속도가 감소하고 계산 비용이 많이 든다는 단점이 있다. 본 논문에서는 이러한 단점을 극복하는 해결책을 제시하여 알고리즘의 성능이 향상되는 것을 증명하였다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.630-638
• /
• 2016

In this paper, a feature based panorama image generation algorithm using FAST(Features from Accelerated Segment Test) method that is faster than SIFT(Scale Invariant Feature Transform) and SURF(Speeded Up Robust Features) is proposed. Cylindrical projection is performed to generate natural panorama images with numerous images as input. The occurred error can be minimized by applying RANSAC(Random Sample Consensus) for the matching process. When we synthesize numerous images acquired from different camera angles, we use blending techniques to compensate the distortions by the heterogeneity of border line. In that way, we could get more natural synthesized panorama image. The proposed algorithm can generate natural panorama images regardless the order of input images and tilted images. In addition, the image matching can be faster than the conventional method. As a result of the experiments, distortion was corrected and natural panorama image was generated.

• Journal of Broadcast Engineering
• /
• v.20 no.5
• /
• pp.728-737
• /
• 2015

Stitching algorithm obtain a descriptor of the feature points extracted from multiple images, and create a single image through the matching process between the each of the feature points. In this paper, a feature extraction and matching techniques for the creation of a high-speed panorama using video input is proposed. Features from Accelerated Segment Test(FAST) is used for the feature extraction at high speed. A new feature point matching process, different from the conventional method is proposed. In the matching process, by tracking region containing the feature point through the Mean shift vector required for matching is obtained. Obtained vector is used to match the extracted feature points. In order to remove the outlier, the RANdom Sample Consensus(RANSAC) method is used. By obtaining a homography transformation matrix of the two input images, a single panoramic image is generated. Through experimental results, we show that the proposed algorithm improve of speed panoramic image generation compared to than the existing method.

• Journal of Advanced Navigation Technology
• /
• v.21 no.5
• /
• pp.443-449
• /
• 2017

Swarm of low-cost UAVs for search mission has benefit in the sense of rapid search compared to use of single high-end UAV. As the number of UAVs forming swarm increases, not only the time for the mission planning increases, but also the system to operate UAVs has excessive burden. This paper addresses a decentralized area search algorithm adequate for multiple UAVs which takes advantages of flexibility, robustness, and simplicity. To down the cost, it is assumed that each UAV has limited ability: close-communication, basic calculation, and limited memory. In close-communication, heath conditions and search information are shared. And collision avoidance and consensus of next search direction are then done. To increase weight on un-searched area and to provide overlapped search, the score function is introduced. Performance and operational characteristics of the proposed search algorithm and mission planning logic are verified via numerical simulations.