• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.2
• /
• pp.211-219
• /
• 1988

In this paper effective block matching algorithms are proposed to find the motion vector. There are two approaches to the estimation of the motion vector in MCC (motion compensated coding), i.e.pel(pixel element) recursive algorithm and block matching algorithm. The search algorithm in this paper is based on the block matching method. The advantage of this algorithm is the reduction of the computation time. In order to reduce the computation time, three mathods are proposed in this paper. These new algorithms are faster than other methods. Compared with the three step algorithm by Koga et al., the average ratio of the computational savings obtained from the proposed algorithm is about 3-4.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.3
• /
• pp.208-217
• /
• 2012

This paper presents two adaptive fingerprint matching methods. First, we experiment an adaptive threshold selection of 1:N matching system in order to raise the reliability of the matching score. Second, we propose a adaptive threshold selection using fitting algorithm for high speed matching. The experiment was conducted on the NITZEN database, which has 5247 samples. Consequently, this paper shows that our suggested method can perform 1.88 times faster matching speed than the bidirectional matching speed. And, we prove that FRR of our suggested method decreases 1.43 % than that of the unidirectional matching.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.11
• /
• pp.1189-1195
• /
• 2008

We introduce a MEMS-based pedestrian dead reckoning (PDR) system. A walking navigation algorithm for pedestrians is presented and map-matching algorithm for the navigation system based on dead reckoning (DR) is proposed. The PDR is equipped on the human body and provides the position information of pedestrians. And this is able to be used in ubiquitous sensor network (USN), U-hearth monitoring system, virtual reality (VR) and etc. The PDR detects a step using a novel technique and simultaneously estimates step length. Also an azimuth of the pedestrian is calculated using a fluxgate which is the one of magnetometers. Map-matching algorithm can be formulated to integrate the positioning data with the digital road network data. Map-matching algorithm not only enables the physical location to be identified from navigation system but also improves the positioning accuracy. However most of map-matching algorithms which are developed previously are for the car navigation system (CNS). Therefore they are not appropriate to implement to pedestrian navigation system based on DR system. In this paper, we propose walking navigation system and map-matching algorithm for PDR.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.278-281
• /
• 2009

In this paper, we propose a fast partial distortion algorithm using normalized dithering matching scan to get uniform distribution of partial distortion which can reduce only unnecessary computation significantly. Our algorithm is based on normalized dithering order matching scan and calibration of threshold error using LOG value for each sub-block continuously for efficient elimination of unlike candidate blocks while keeping the same prediction quality compared with the full search algorithm. Our algorithm reduces about 60% of computations for block matching error compared with conventional PDE (partial distortion elimination) algorithm without any prediction quality, and our algorithm will be useful to real-time video coding applications using MPEG-4 AVC or MPEG-2.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.38 no.2
• /
• pp.165-172
• /
• 2020

There is growing interest in Vision-based video image matching owing to the constantly developing technology of unmanned-based systems. The purpose of this paper is the development of a fast and effective matching technique for the UAV oblique video image. We first extracted initial matching points using NCC (Normalized Cross-Correlation) algorithm and improved the computational efficiency of NCC algorithm using integral image. Furthermore, we developed a triangulation-based outlier removal algorithm to extract more robust matching points among the initial matching points. In order to evaluate the performance of the propose method, our method was quantitatively compared with existing image matching approaches. Experimental results demonstrated that the proposed method can process 2.57 frames per second for video image matching and is up to 4 times faster than existing methods. The proposed method therefore has a good potential for the various video-based applications that requires image matching as a pre-processing.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.1
• /
• pp.94-99
• /
• 2007

In this paper, a 2-dimensional edge-based matching algorithm is proposed that combines the generalized Hough transform (GHT) and the Chamfer matching to complement weakness of either method. First, the GHT is used to find approximate object positions and orientations, and then these positions and orientations are used as starling parameter values to find more accurate position and orientation using the Chamfer matching. Finally, matching accuracy is further refined by using a subpixel algorithm. The algorithm was implemented and successfully tested on a number of images containing various electronic components.

• Journal of KIISE:Software and Applications
• /
• v.32 no.10
• /
• pp.949-955
• /
• 2005

In this Paper, we propose fast block matching algorithm by dividing complex areas based on complexity order of reference block and square sub-block to reduce an amount of computation of full starch(FS) algorithm for fast motion estimation, while keeping the same prediction quality compared with the full search algorithm. By using the fact that matching error is proportional to the gradient of reference block, we reduced unnecessary computations with square sub-block adaptive matching scan based image complexity instead of conventional sequential matching scan and row/column based matching scan. Our algorithm reduces about $30\%$ of computations for block matching error compared with the conventional partial distortion elimination(PDE) algorithm without any prediction quality, and our algorithm will be useful in real-time video coding applications using MPEG-4 AVC or MPEG-2.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.11
• /
• pp.1027-1033
• /
• 2012

Semantic-based information retrieval techniques understand the meanings of the concepts that users specify in their queries, but the traditional semantic matching methods based on the ontology tree have three weaknesses which may lead to many false matches, causing the falling precision. In order to improve the matching precision and the recall of the information retrieval, this paper proposes a multi-agent improved semantic similarity matching algorithm based on the ontology tree, which can avoid the considerable computation redundancies and mismatching during the entire matching process. The results of the experiments performed on our algorithm show improvements in precision and recall compared with the information retrieval techniques based on the traditional semantic similarity matching methods.

• Journal of Communications and Networks
• /
• v.14 no.3
• /
• pp.257-266
• /
• 2012

A decode-and-forward two-way relay system benefits from orthogonal frequency division multiplexing (OFDM) and relay transmission. In this paper, we consider a decode-and-forward two-way relay system over OFDMwith two strategies: A joint subcarrier matching algorithm and a power allocation algorithm operating with a total power constraint for all subcarriers. The two strategies are studied based on average capacity using numerical analysis by uniformly allocating power constraints for each subcarrier matching group. An optimal subcarrier matching algorithm is proposed to match subcarriers in order of channel power gain for both transmission sides. Power allocation is defined based on equally distributing the capacity of each hop in each matching group. Afterward, a modified water-filling algorithm is also considered to allocate the power among all matching groups in order to increase the overall capacity of the network. Finally, Monte Carlo simulations are completed to confirm the numerical results and show the advantages of the joint subcarrier matching, power allocation and water filling algorithms, respectively.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.12
• /
• pp.1817-1824
• /
• 1990

This paper describes a shape matching algorithm for occluded or distorted two-dimensional objects. In our approach, the shape matchin is viewed as a segment matching problem. A shape matching algorithm, based on both the stochastic labeling technique and the hypothesis generate-test paradigm, is proposed, and a simple technique which performs the stochastic labeling process in accordance with the definition of consisten labeling assignment without requiring an iterative updating process of probability valiues is also proposed. Several simulation results show that the proposed algorithm is very effective when occlusion, scaling or change of orientation has occurred in the object.