• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.1
• /
• pp.402-410
• /
• 2013

In this paper, we propose a new fast block matching algorithm for block matching using the temporal and spatially correlation of the video sequence and local statistics of neighboring motion vectors. Since the temporal correlation of the video sequence between the motion vector of current block and the motion vector of previous block. The proposed algorithm determines the location of a better starting point for the search of an exact motion vector using the point of the smallest SAD(sum of absolute difference) value by the predicted motion vectors of neighboring blocks around the same block of the previous frame and the current frame and the predictor candidate point on each division region by binary-tree structure. Experimental results show that the proposed algorithm has the capability to dramatically reduce the search points and computing cost for motion estimation, comparing to fast FS(full search) motion estimation and other fast motion estimation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.6
• /
• pp.711-718
• /
• 2019

BDD is a well-known alternative to the conventional Boolean logic method in fault tree analysis. As the size of fault tree increases, the calculation time and computer resources for BDD dramatically increase. A new failure path search and path restructure method is proposed for efficient calculation of CS and MCS from BDD. Failure path grouping and bottom-up path search is proved to be efficient in failure path search in BDD and path restructure is also proved to be used in order to reduce the number of CS comparisons for MCS extraction. With these newly proposed methods, the top event probability can be calculated using the probability by ASDMP(Approximate Sum of Disjoint MCS Products), which is shown to be equivalent to the result by the conventional MCUB(Minimal Cut Upper Bound) probability.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.267-270
• /
• 2001

홍채인식 시스템에서 입력된 영상으로부터 정합(matching)에 사용될 홍채 영역을 추출해 내는 과정은 필수적인 과정으로 빠른 처리 속도와 정확성을 요구한다. 기존의 원형검출기나 허프(Hough) 변환을 이용한 방법 등은 홍채의 바깥쪽과 안쪽 경계를 비교적 정확하게 검출해내는 장점이 있으나 탐색영역이 커서 수행시 간이 매우 많이 걸리는 단점이 있다. 따라서 본 논문에서는 이진화와 형태학적 연산(morphology)을 이용하는 새로운 탐색 영역 단축 방법을 제안한다. 제안한 방법은 기존의 홍채영역 검출 방법에 적용할 경우 수행 시간을 효율적으로 단축시킬 수 있다. 검출된 영역에 대해서 주성분 분석법(principal component analysis, PCA)을 이용해 매칭을 수행한 결과 약 95%의 인식율을 나타내었다.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2003.05b
• /
• pp.762-765
• /
• 2003

본 논문에서 제안하는 분절된 화소들의 특징추출 방법은 이진화 영상에서 수직/수평 화소들의 분절점을 탐색하여 추출하는 특징 탐색기이다. 숫자의 구조적인 면을 고려하여 사소한 부분들도 명확한 특징으로 탐지하여 추출하였고, 이러한 방법은 일반적으로 사용하여지는 특징추출방법 몇가지를 선택하여 이용하였고, 제안하는 방법과 결합하여 필기체 숫자를 인식하였다. 인식기를 구현하기 위하여 3개층 구조를 갖는 클러스터 MLP 신경망을 사용하였다 실험 결과 단순히 일반적인 특징만을 활용하여 얻는 인식률 보다 훨씬 향상됨을 보여주었다.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.5 s.335
• /
• pp.47-54
• /
• 2005

This paper proposes and analyzes a Tag Anti-collision algorithm in RFID system. We mathematically compare the performance of the proposed algorithm with existing binary algorithms(binary search algorithm, slotted binary tree algorithm using time slot, and bit-by-bit binary tree algorithm proposed by Auto-ID center). We also validated analytic results using OPNET simulation. Based on analytic result, comparing the proposed Improved bit-by-bit binary tree algerian with bit-by-bit binary tree algorithm which is the best of existing algorithms, the performance of Improved bit-by-bit binary tree algorithm is about $304\%$ higher when the number of tags is 20, and $839\%$ higher when the number of tags is 200.

• Journal of KIISE:Software and Applications
• /
• v.31 no.8
• /
• pp.1113-1120
• /
• 2004

This paper proposes a novel hybrid genetic algorithm for the feature selection. Local search operations are devised and embedded in hybrid GAs to fine-tune the search. The operations are parameterized in terms of the fine-tuning power, and their effectiveness and timing requirement are analyzed and compared. Experimentations performed with various standard datasets revealed that the proposed hybrid GA is superior to a simple GA and sequential search algorithms.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.3
• /
• pp.407-416
• /
• 2021

An active phased array antennas can not only electrically steer the beam by controlling the weighting of the excitation signal, but can also form a pattern null in the direction of the interference source. The weight of the excitation signal to steer the main beam can be easily calculated based on the position of the radiating element. In addition, the weight of the excited signal for pattern null formation can also be calculated by setting the required radiation pattern and using WLSM(Weighted Least Squares Method). However, in a general wireless communication network environment, the location of the interference source is unknown. Therefore, an adaptive pattern null synthesis is needed. In this paper, it was confirmed that pattern null synthesis according to the required radiation characteristic was possible. And based on this, adaptive pattern null synthesis into the direction of an interference source was studied using a binary search algorithm based on observation area. As a result of conducting a simulation based on the presented technique, it was confirmed that adaptive pattern null forming into the direction of an interference is possible in efficient way.

• Journal of the Korean Institute of Gas
• /
• v.1 no.1
• /
• pp.33-40
• /
• 1997

An optimization system, APROGA II using genetic algorithm, was developed to solve multi-modal and multiobjective problems. To begin with, Multi-Niche Crowding(MNC) algorithm was used for multi-modal optimization problem. Secondly, a new algorithm was suggested for multiobjective optimization problem. Pareto dominance tournaments and Sharing on the non-dominated frontier was applied to it to obtain multiple objectives. APROGA II uses these two algorithms and the system has three search engines(previous APROGA search engine, multi-modal search engine and multiobjective search engine). Besides, this system can handle binary and discrete variables. And the validity of APROGA II was proved by solving several test functions and case study problems successfully.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.5
• /
• pp.157-163
• /
• 2017

The binary and interpolation search algorithms are the most famous among search area algorithms, the former running in $O(log_2n)$ on average, and the latter in $O(log_2log_2n)$ on average and O(n) at worst. Also, the interpolation search use only the probability of key value location without priori information. This paper proposes another search algorithm, which I term a 'hybrid block and interpolation search'. This algorithm employs the block search, a method by which MSB index of a data is determined as a block, and the interpolation search to find the exact location of the key. The proposed algorithm reduces the search range with priori information and search the reduced range with uninformed situation. Experimental results show that the algorithm has a time complexity of $O(log_2log_2n_i)$, $n_i{\simeq}0.1n$ both on average and at worst through utilization of previously acquired information on the block search. The proposed algorithm has proved to be approximately 10 times faster than the interpolation search on average.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.9-10
• /
• 2012

이진 특징 기술자는 실수 벡터 형태의 특징 기술자보다 빠르게 특징점 추출 및 정합이 가능하고 메모리 공간도 적게 차지하는 장점이 있다. 하지만, 특징점의 수가 많아질수록 정합에 많은 시간이 소요되므로 실시간 처리가 중요한 객체 추적에 적용하기 위해서는 정합의 고속화 방법에 대한 연구가 필요하다. 이에 본 논문에서는 이진 특징 기술자의 군집화를 통한 특징점의 고속 정합 방법을 제안한다. 제안된 방법은 k-means 군집화 알고리즘을 기반으로 정합을 위한 기술자 탐색을 효과적으로 수행함으로써 군집화를 사용하지 않는 기존의 정합 방법에 비해 빠르면서도 높은 정확도를 유지한다.