• Journal of Computing Science and Engineering
• /
• v.8 no.2
• /
• pp.78-86
• /
• 2014

Aiming to solve the problems of high memory access and big storage space and long matching time in the regular expression matching of extended finite automaton (XFA), a new regular expression matching algorithm based on high-efficient finite automaton is presented in this paper. The basic idea of the new algorithm is that some extra judging instruments are added at the starting state in order to reduce any unnecessary transition paths as well as to eliminate any unnecessary state transitions. Consequently, the problems of high memory access consumption and big storage space and long matching time during the regular expression matching process of XFA can be efficiently improved. The simulation results convey that our proposed scheme can lower approximately 40% memory access, save about 45% storage space consumption, and reduce about 12% matching time during the same regular expression matching process compared with XFA, but without degrading the matching quality.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.8
• /
• pp.44-53
• /
• 1992

In this paper, a matching method is proposed to improve the correct matching rate in stereo correspondence matching in which the fingerprint of zero-crossing points on the scale-space is used as the robust matching feature. The dynamic programming, which is appropriate for the fingerprint feature, is introduced for correspondence matching. We also improve the matching rate by using the post-processing for correcting mismatched points. In simulation, we apply the proposed algorithm to the synthetic and real images and obtain good matching results.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.82-90
• /
• 2010

In this paper, A new stereo matching method based on reliability space is proposed to acquire 3D information from 2D image. In conventional stereo matching methods, speed is sacrificed to achieve high accuracy. To increase the matching speed while maintaining a high accuracy, this paper proposes this stereo matching method. It first makes the disparity space image for comparing all of the pixels on the stereo images. Then it produce reliability space through analyzing this value. and, By comparing the reliability space according to disparity, it makes disparity map. Moreover, the parts that make regional boundary errors are corrected by classifying the boundary of each region with the reference to color edge. The performance of the proposed stereo matching method is verified by various experiments. As a result, calculation cost is reduced by 30.6%, while the image quality of proposed method has similar performance with the existing method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.6
• /
• pp.9-18
• /
• 2004

This paper proposes a new and simple stereo matching algorithm using the disparity space image (DSI) technique. First of all, we detect some salient feature points on each scan-line of the image pair and set the matching area using those points and define a simple cost matrix. And we take advantage of matching by pixel-by-pixel instead of using the matching window. While the pixel-by-pixel method boost up the speed of matching, because of no using neighbor information, the correctness of the matching may not be better. To cover this point, we expand the matching path using character of disparity-space-image for using neighbor information. In addition, we devise the compensated matching module using the volume of the disparity space image in order to improve the accuracy of the match. Consequently, we can reduce mismatches at the disparity discontinuities and can obtain the more detailed and correct disparity map.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2004.04a
• /
• pp.209-214
• /
• 2004

This paper presents a RFM-based image matching algorithm which put constraints on the search space through the object-space approach. Also, the detail procedure of generating 3-D surface models from the RFM is introduced as an end-user point of view. The proposed algorithm provides the PML (Piecewise Matching Line) for image matching and reduces the search space to within the confined line-shape area.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.01a
• /
• pp.59-62
• /
• 2011

A new method is proposed for stereo vision where solution to disparity map is presented in terms of Line constraint and Reliability space -- the first constraint proposes a progressive framework for stereo matching which applies local area pixel-values from corresponding lines in the left and right image pairs. The second states that reliability space based on corresponding points records the disparity and then we are able to apply the median filter in order to reduce the noises which occur in the process. A coarse to fine result is presented after the median filtering, which improves the final result qualitatively. Experiment is evaluated by rectified stereo matching images pairs from Middlebury datasets and has proved that those two adopted strategies yield good matching quantitative results in terms of fast running speed.

• Journal of Astronomy and Space Sciences
• /
• v.15 no.1
• /
• pp.229-234
• /
• 1998

We study on a terrain contour matching algorithm using Radial Basis Functions(RBFs) for aided inertial navigation system for position fixing aircraft, cruise missiles or re-entry vehicles. The parameter optimization technique is used for updating the parameters describing the characteristics of an area with modified Gaussian least square differential correction algorithm and the step size limitation filter according to the amount of updates. We have applied the algorithm for matching a sampled area with a target area supposed that the area data are available from Radar Terrain Sensor(RTS) and Reference Altitude Sensor(RAS)

• The Journal of the Korea Contents Association
• /
• v.7 no.12
• /
• pp.311-321
• /
• 2007

For fast and robust face detection, this paper proposes an approach for face detection using fusion of heterogeneous template matching. First, we detect skin regions using a model of skin color which covers various illumination and races. After reducing a search space by region labelling and filtering, we apply template matching with skin color and edge to the detected regions. Finally, we detect a face by finding the best choice of template fusion. Experimental results show the proposed approach is more robust in skin color-like environments than with a single template matching and is fast by reducing a search space to face candidate regions. Also, using a global accumulator can reduce excessive space requirements of template matching.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.293-299
• /
• 1994

A new approach to deal with the model matching problem for square plants is suggested. Admissibility conditions of the model matching error are derived in terms of state-space parameters and the derived formulas are exploited to obtain the solution to the model matching problem in H$_{2}$ norm.

• Proceedings of the Korean Printing Society Conference
• /
• 2000.12a
• /
• pp.0.2-0
• /
• 2000

Most important step for the color matching in scanner is the color coordinate transformation from the scanner RGB space to device independent uniform color space. A variety of color calibration technologies have been developed for input device. Linear or nonlinear matrices have been conveniently applied to correct the color filter\`s mismatch with color matching function in scanners. The color matching accuracy is expected to be further improved when the nonlinear matrices are optimized into subdivided smaller color spaces than in single matrix of the entire color space. This article proposed the scanner calibration method using subspace division regression analysis and it were compared with conventional method.