• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.5
• /
• pp.397-404
• /
• 2011

This paper proposes an algorithm capable of extracting corresponding points between a pair of stereo images based on dynamic programming. The purpose of extracting the corresponding points is to provide the stereo disparity data to a road-slope estimation algorithm with high accuracy and in real-time. As the road-slope estimation algorithm does not require dense disparity data, the proposed stereo matching algorithm aims at extracting corresponding points accurately and quickly. In order to realize this contradictory goal, this paper exploits dynamic programming, and minimizes matching candidates using vertical components of color edges. Furthermore, the typical occlusion problem in stereo vision is solved. The proposed algorithm is proven to be effective through experiments with various images captured on the roads.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.843-846
• /
• 2000

An optical flow-based motion estimation algorithm is proposed for video coding. The algorithm uses block-matching motion estimation with an adaptive search region. The search region is computed from motion fields that are estimated based on the optical flow. The algorithm is based on the fact that true block-motion vectors have similar characteristics to optical flow vectors. Thereafter, the search region is computed using these optical flow vectors that include spatial relationships. In conventional block matching, the search region is fixed. In contrast, in the new method, the appropriate size and location of the search region are both decided by the proposed algorithm. The results obtained using test images show that the proposed algorithm can produce a significant improvement compared with previous block-matching algorithms.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.24 no.4 s.175
• /
• pp.991-1000
• /
• 2000

Previous area-based stereo matching algorithms find the disparity by first computing the sum of squared differences (SSD) between corresponding points using a rectangular window, and then searching the position of the minimum SSD within the disparity range. These algorithms generate relatively many matching errors around depth discontinuities, since the SSD function may fail to search for the minimum because of varying disparity profiles in such areas. In this paper, in order to improve the matching accuracy around the depth discontinuities, a new correlation function based on robust estimation technique is proposed for stereo matching. In addition, while previous stereo algorithms utilize a single rectangular window for computing the correlation function, the proposed matching algorithm utilizes 4-directional line masks additionally to reduce the matching errors further. It has been turned out that the proposed algorithm reduces matching errors around depth discontinuities significantly. Experimental results are presented in this paper, comparing the performance of the proposed technique with those of previous algorithms using both synthetic and real images.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1437-1446
• /
• 2012

In this paper we propose a new stereo matching algorithm which is suitable for application to obtain depth information with high-speed in stereoscopic camera environment. For satisfying these condition we propose a new adaptive stereo matching technique using frequency information in discrete wavelet (DWT) domain and variable matching window. The size of the matching window is selected by analysis of the local property of the image in spatial domain and the feature and scaling factor of the matching window is selected by the frequency property in the frequency domain. For using frequency information we use local DWT and global DWT. We identified that the proposed technique has better peak noise to signal ratio (PSNR) than the fixed matching techniques with similar complexity.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.2
• /
• pp.43-51
• /
• 1997

In this paper, we quantize the image data to simplify the systolic array architecture for block matching algorithm. As the number of bits for pixel data to be processed is reduced by quantization, one can simplify the hardware of systolic array. Especially, if the bit serial input is used, one can even more simplify the structure of processing element. First, we analize the effect of quantization to a block matching. then we show the structure of quantizer and processing element when bit serial input is used. The simulation results applied to standard images have shown that the proposed block matching method has less prediction error than the conventional high speed algorithm.

• International Journal of Contents
• /
• v.12 no.1
• /
• pp.1-5
• /
• 2016

To manipulate large video contents, effective video indexing and retrieval are required. A large number of video indexing and retrieval algorithms have been presented for frame-wise user query or video content query whereas a relatively few video sequence matching algorithms have been proposed for video sequence query. In this paper, we propose an efficient algorithm that extracts key frames using color histograms and matches the video sequences using edge features. To effectively match video sequences with a low computational load, we make use of the key frames extracted by the cumulative measure and the distance between key frames, and compare two sets of key frames using the modified Hausdorff distance. Experimental results with real sequence show that the proposed video sequence matching algorithm using edge features yields the higher accuracy and performance than conventional methods such as histogram difference, Euclidean metric, Battachaya distance, and directed divergence methods.

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

This paper proposes a matching algorithm using Voronoi diagram for rotation and translation invariant fingerprint identification. The proposed algorithm extracts geometrical structures that are derived from Voronoi diagram of a fingerprint image. Then two features, distances and angles are extracted from the geometrical structures and saved as indexing form for fingerprint matching. This matching algerian has a lower error rate than indexing based methods of old times.

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

A hybrid approach which includes edge- and region-based methods is considered. The modified non-linear Laplacian(MNL) filter is used for feature extraction. The matching algorithm has three steps which are edge, signed region, and residual region matching. At first, the edge points are matched using the sign and direction of edges. Then, the disparity is propagated from edge to inside region. A variable window is used to consider the local method which give accurate matched points and area-based method which can obtain full-resolution disparity map. In addition, a new relaxation algorithm for considering matching possibility derived from normalized error and regional continuity constraint is proposed to reduce the mismatched points. By the result of simulation for various images, this algorithm is insensitive to noise and gives full- resolution disparity map.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.5
• /
• pp.483-488
• /
• 2008

An active omni-directional raging system using an omni-directional vision with structured light has many advantages compared to the conventional ranging systems: robustness against external illumination noise because of the laser structured light and computational efficiency because of one shot image containing $360^{\circ}$ environment information from the omni-directional vision. The omni-directional range data represents a local distance map at a certain position in the workspace. In this paper, we propose a matching algorithm for the local distance map with the given global map database, thereby to localize a mobile robot in the global workspace. Since the global map database consists of line segments representing edges of environment object in general, the matching algorithm is based on relative position and orientation of line segments in the local map and the global map. The effectiveness of the proposed omni-directional ranging system and the matching are verified through experiments.

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

In this paper a hierarchical stereo matching algorithm based on feature extraction is proposed. The boundary (edge) as feature point in an image is first obtained by segmenting an image into red, green, blue and white regions. With the obtained boundary information, disparities are extracted by matching window on the image boundary, and the initial disparity map is generated when assigned the same disparity to neighbor pixels. The final disparity map is created with the initial disparity. The regions with the same initial disparity are classified into the regions with the same color and we search the disparity again in each region with the same color by changing block size and search range. The experiment results are evaluated on the Middlebury data set and it show that the proposed algorithm performed better than a phase based algorithm in the sense that only about 14% of the disparities for the entire image are inaccurate in the final disparity map. Furthermore, it was verified that the boundary of each region with the same disparity was clearly distinguished.