• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.12
• /
• pp.1624-1634
• /
• 1995

Conventional full search block matching algorithm for motion estimation is computationally intensive and the resulting hardware cost is very high. In this paper, we present an efficient block matching algorithm using a 16:1 subsampling technique, and describe its hardware design. The algorithm reduces the number of pixels in calculating the mean absolute difference at each search location, instead of reducing the search locations.The algorithm is an extension of the block mating algorithm with 4:1 subsampling proposed by Liu and Zaccarin such that the amount of computation is reduced by a fact of 4(16 compared to the full search block matching algorithm) while producing similar performance.The algorithm can efficiently be designed into a hardware for real-time applications.

• Proceedings of the KOSOMBE Conference
• /
• v.1997 no.05
• /
• pp.230-234
• /
• 1997

The matching pursuit (MP) algorithm developed by S. Mallat and Z. Zhang is applied to magnetic resonance (MR) imaging. Since matching pursuit is a greedy algorithm to find waveforms which are the best match for an object-signal, the signal can be decomposed with a few iterations. In this paper, we propose an application of the MP algorithm to the MR imaging to reduce imaging time. Inner products of residual signals and selected waveforms in the MP algorithm are derived from the MR signals by excitation of RF pulses which are fourier transforms of selected waveforms. Results from computer simulations demonstrate that the imaging time is reduced by using the MP algorithm and further a progressive reconstruction can be achieved.

• Journal of the Semiconductor & Display Technology
• /
• v.8 no.4
• /
• pp.95-100
• /
• 2009

This paper presents an efficient disparity matching, using sum of absolute difference (SAD) and dynamic programming (DP) algorithm. This algorithm makes use of one of area-based algorithm which is the absolute sum of the pixel difference corresponding to the window size. We use the information of the right eye brightness (B) and the left eye brightness to get an best matching results and apply the results to the left eye image using the window go by the brightness of the right eye image. This is that we can control the brightness. The major feature of this algorithm called SAD+DP+B is that although Root Mean Square (RMS) performance is slightly less than SAD+DP, due to comparing original image, its visual performance is increased drastically for matching the disparity map on account of its matching compared to SAD+DP. The simulation results demonstrate that the visual performance can be increased and the RMS is competitive with or slightly higher than SAD+DP.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2209-2211
• /
• 1998

This paper presents the matching algorithm with the satellite images using the image warping method. Two stereo images, which are used for the DEM(Digital Elevation Model) extraction, are generally distorted because the images are acquired at different locations and angles. Therefore, the matching Process can't be executed with the original images. To solve this problem, a dynamic triangular image warping method is proposed. At first, the initial matching is executed with seed point, and then, using the matched points from the initial matching, the distorted images is compensated. We experimented this algorithm with the parts of the $6000{\times}6000$ SPOT satellite images. The experiment results show this algorithm is superior to other warping algorithm.

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.225-226
• /
• 2007

In this paper, we present our study about the optimization of the block matching algorithm on a VLIW based DSP. The block matching algorithm is well known for its computational burden in motion picture encoding. As supposed to the previous researches where the optimization is achieved by optimizing SAD, the most heavy routine of the block matching, we optimize the block matching algorithm by applying software pipelining technique to the whole routine of the algorithm. Through experiments, the efficiency of the proposed optimization is verified.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.4
• /
• pp.135-141
• /
• 2013

String matching is one of the key algorithms in network security and many areas could be benefit from a faster string matching algorithm. Based on the most efficient string matching algorithm in sual applications, the Boyer-Moore (BM) algorithm, a novel algorithm called RQS is proposed. RQS utilizes an improved bad character heuristic to achieve bigger shift value area and an enhanced good suffix heuristic to dramatically improve the worst case performance. The two heuristics combined with a novel determinant condition to switch between them enable RQS achieve a higher performance than BM both under normal and worst case situation. The experimental results reveal that RQS appears efficient than BM many times in worst case, and the longer the pattern, the bigger the performance improvement. The performance of RQS is 7.57~36.34% higher than BM in English text searching, 16.26~26.18% higher than BM in uniformly random text searching, and 9.77% higher than BM in the real world Snort pattern set searching.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.8
• /
• pp.122-129
• /
• 1997

In this paper, we propose a Hopfield model for solving the part-matching in case that is the number of parts and positions are changed. The goal of this paper is to minimize part-connection in pairs and total path of part-connections. Therefore, this kind of problem is referred to as a combinatiorial optimization problem. First of all, we review the theoretical basis for Hopfield model and present two optimal algorithms of part-matching. The first algorithm is Traveling Salesman Problem(TSP) which improved the original and the second algorithm is Wdighted Matching Problem (WMP). Finally, we show demonstration through com- puter simulation and analyze the stability and feasibility of the generated solutions for the proposed con- nection methods. Therefore, we prove that the second algorithm is better than the first algorithm.

• Journal of Broadcast Engineering
• /
• v.18 no.5
• /
• pp.730-737
• /
• 2013

In this paper, Constrained One-Bit Transform (C1BT) based motion estimation using extension of matching error criterion is proposed. C1BT based motion estimation algorithm exploiting Number of Non-Matching Points (NNMP) instead of Sum of Absolute Differences (SAD) that used in the Full Search Algorithm (FSA) facilitates hardware implementation and significantly reduces computational complexity. However, the accuracy of motion estimation is decreased. To improve inaccurate motion estimation, this algorithm based motion estimation extending matching error criterion of C1BT is proposed in this paper. Experimental results show that proposed algorithm has better performance compared with the conventional algorithm in terms of Peak-Signal-to-Noise-Ratio (PSNR).

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.589-592
• /
• 1999

Matching is a key problem in computer vision, image analysis and pattern recognition. In this paper a multiscale image matching algorithm by wavelet local extrema is proposed. This algorithm is based on the multiscale wavelet transform of the curvature which can utilize both the information of local extrema positions and magnitudes of transform results. This method has advantages in computational cost to a single scale image matching. It is also rotation-, translation-, and scale-independent image matching method. This matching can be used for the recognition of occluded objects.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.9
• /
• pp.1420-1427
• /
• 1989

A new block matching algorithm that improved the existing block matching algorithm in terms of image quality is proposed in this paper. The subblock of image including the vertical edge of object is subdivided into new two subblocks, and the moving vector found. The result of computer simulation shows on real image that the image quality by the algorithm becomes higher than that of the three step search algorithm by 1.1dB.