• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.543-550
• /
• 2000

An adaptive bit-reduced mean absolute difference (ABRMAD) is presented as a criterion for the block-matching algorithm (BMA) to reduce the complexity of the VLSI Implementation and to improve the processing time. The ABRMAD uses the lower pixel resolution of the significant bits instead of full resolution pixel values to estimate the motion vector (MV) by examining the pixels Ina block. Simulation results show that the 4-bit ABRMAD has competitive mean square error (MSE)results and a half less hardware complexity than the MAD criterion, It has also better characteristics in terms of both MSE performance and hardware complexity than the Minimax criterion and has better MSE performance than the difference pixel counting(DPC), binary block-matching with edge-map(BBME), and bit-plane matching(BPM) with the same number of bits.

• Journal of Korea Multimedia Society
• /
• v.13 no.4
• /
• pp.547-559
• /
• 2010

Delaunay triangulation is suitable for fingerprint matching because of its robustness to rotation and translation. However, missing and spurious minutiae degrade the performance and computational efficiency. In this paper, we propose a method of combining local quality assessment and 4-category minutiae classification to improve accuracy and decrease computational complexity in matching process. Experimental results suggest that removing low quality areas from matching candidate areas and classifying minutiae improve computational efficiency without degrading performance. The results proved that the proposed algorithm outperforms the matching algorithm (BOZORTH3) provided by NIST.

• Proceedings of the Korea Contents Association Conference
• /
• 2003.11a
• /
• pp.290-297
• /
• 2003

A time-series database is a set of data sequences, each of which is a list of changing values corresponding to an object. Subsequence matching under time warping is defined as an operation that finds such subsequences whose time warping distance to a given query sequence are below a tolerance from a time-series database. In this paper, we first point out the characteristics of the previous methods for time-series sequence matching under time warping, and then discuss the approaches for applying them to whole matching as well as subsequence matching. Also, we perform quantitative performance evaluation via a series of experiments with real-life data. There have not been such researches in the literature that compare the performances of all the previous methods of subsequence matching under time warping. Thus, our results would be used as a good reference for showing their relative performances.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.7C
• /
• pp.946-953
• /
• 2004

Fast search and conventional boolean matching motion estimation algorithms reduce computational complexity and data processing time but this algorithms have disadvantages that is difficult of implementation of hardware because of high control overhead and that is less performance than Full search Algorithm(FA). This paper present new all binary block matching algorithm, called Bit Converted All Binary Block Matching(BC-ABBM). Proposed algorithm have performance closed to the FA by boolean only block matching that may be very efficiently implemented in hardware for low bit rate video communication. Simulation results show that the PSNR of the proposed algorithm is about 0.04dB loss than FA but is about 0.6 ∼ 1.4dB gain than fast search algorithm and conventional boolean matching algorithm.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.5
• /
• pp.841-849
• /
• 2001

The pixel information of the object was obtained sequentially and pixels were clustered to a label by the line labeling method. Feature points were determined by finding the slope for edge pixels after selecting the fixed number of edge pixels. The slope was estimated by the least square method to reduce the detection error. Once a matching point was determined by comparing the feature information of the object and the pattern, the parameters for translation, scaling and rotation were obtained by selecting the longer line of the two which passed through the matching point from left and right sides. Finally, modified Hausdorff Distance has been used to identify the similarity between the object and the given pattern. The multi-label method was developed for recognizing the patterns with more than one label, which performs the modified Hausdorff Distance twice. Experiments have been performed to verify the performance of the proposed algorithm and method for simple target image, complex target image, simple pattern, and complex pattern as well as the partially hidden object. It was proved via experiments that the proposed image matching algorithm for recognizing the object had a good performance of matching.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.42 no.4 s.304
• /
• pp.1-10
• /
• 2005

This paper presents a map matching method using multiple hypothesis technique(MHT) to identify the road that a land vehicle is located on. To realize a map matching method using MHT, Pseudo-measurements are generated utilizing adjacent roads of GPS/DR position and the MHT is reformulated as a single target problem. Since pseudo-measurements are generated using digital map, topological properties such as road connection, direction, and road facility information are considered in calculating probabilities of hypotheses. In order to improve the map matching performance under when bias errors exist in digital road map data, a Kalman filter is employed to estimate the biases. Field experimental results show that the proposed map matching method provides the consistent performance even in complex downtown areas, overpass/underpass areas, and in the areas where roads are adjacent in parallel.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.5
• /
• pp.367-377
• /
• 2019

As an alternative navigation system for the non-GNSS (Global Navigation Satellite System) environment, a new type of DBRN (DataBase Referenced Navigation) which applies both gravity gradient and terrain, and combines filter-based algorithm with profile matching was suggested. To improve the stability of the performance compared to the previous study, both centralized and decentralized EKF (Extended Kalman Filter) were constructed based on gravity gradient and terrain data, and one of filters was selected in a timely manner. Then, the final position of a moving vehicle was determined by combining a position from the filter with the one from a profile matching. In the simulation test, it was found that the overall performance was improved to the 19.957m by combining centralized and decentralized EKF compared to the centralized EKF that of 20.779m. Especially, the divergence of centralized EKF in two trajectories located in the plain area disappeared. In addition, the average horizontal error decreased to the 16.704m by re-determining the final position using both filter-based and profile matching solutions. Of course, not all trajectories generated improved performance but there is not a large difference in terms of their horizontal errors. Among nine trajectories, eights show smaller than 20m and only one has 21.654m error. Thus, it would be concluded that the endemic problem of performance inconsistency in the single geophysical DB or algorithm-based DBRN was resolved because the combination of geophysical data and algorithms determined the position with a consistent level of error.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.418-423
• /
• 2004

The motion estimation algorithm based block matching is a widely used in the international standards related to video compression, such as the MPEG series and H.26x series. Full search algorithm(FA) ones of this block matching algorithms is usually impractical because of the large number of computations required for large search region. Fast search algorithms and conventional binary block matching algorithms reduce computational complexity and data processing time but this algorithms have disadvantages that is less performance than full search algorithm. This paper presents new Boolean matching algorithm, called BCBM(Bit Converted Boolean Matching). Proposed algorithm has performance closed to the FA by Boolean only block matching that may be very efficiently implemented in hardware for real time video communication. Simulation results show that the PSNR of the proposed algorithm is about 0.08㏈ loss than FA but is about 0.96∼2.02㏈ gain than fast search algorithm and conventional Boolean matching algorithm.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.2
• /
• pp.96-103
• /
• 2003

This paper describes a method for sinusoidal modeling of audio signals using perceptually weighted matching pursuit. Matching pursuits extracts iteratively the greatest energy signals from the input signals until the residual between the original and the reconstructed signal is zero. In this paper, perceptual matching pursuits using psychoacoustic model to matching pursuit extracts greatest perceived energy iteratively. To evaluate the performance of the perceptual matching pursuits it is compared with the sinusoidal matching pursuits which is not included perceptual weighting. For various audio signals the result of simulation shows that the perceptual matching pursuit is superior to the sinusoidal matching pursuits, especially for a high change rate in time domain it can synthesized original signal.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.689-692
• /
• 1998

Matching two images is an essential step for many computer vision applications. A new approach to the scale and rotation invariant scene matching is presented. A set of andidate parameters are hypthesized by mapping the angular difference and a new distance measure to the hough space and by detecting maximally consistent points. The proposed method is shown to be much faster than the conventinal one where the relaxation process is repeated until convergence, while providing robust matching performance, without a priori information on the geometrical transformation parameters.