• Proceedings of the KIEE Conference
• /
• 대한전기학회 2000년도 추계학술대회 논문집 학회본부 D
• /
• pp.747-749
• /
• 2000

In this paper, we proposed color stereo matching algorithm using dynamic programming. The conventional gray stereo matching algorithms show blur at depth discontinuities and non-existence of matching pixel in occlusion lesions. Also it accompanies matching error by lack of matching information in the untextured region. This paper defines new cost function makes up for the problems happening in conventional gray stereo matching algorithm. New cost function contain the following properties. I) Edge points are corresponded to edge points. ii) Non-edge points are corresponded to non-edge points. iii) In case of exiting the amount of edges, the cost function has some weight in proportion to path distance. Proposed algorithm was applied in various images obtained by parallel camera model. As the result, proposed algorithm showed improved performance in the aspect of matching error and processing in the occlusion region compared to conventional gray stereo matching algorithms.

• Journal of Institute of Control, Robotics and Systems
• /
• 제13권5호
• /
• pp.493-498
• /
• 2007

In this paper, a 2-dimensional accurate edge-based matching algorithm using subpixel edges is proposed that combines the Generalized Hough Transform(GHT) and the Chamfer matching to complement the weakness of either method. First, the GHT is used to find the approximate object positions and orientations, and then these positions and orientations are used as starting parameter values to find more accurate position and orientation using the Chamfer matching with distance interpolation. Finally, matching accuracy is further refined by using a subpixel algorithm. Testing results demonstrate that greater matching accuracy is achieved using subpixel edges rather than edge pixels.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
• /
• pp.12-14
• /
• 2005

In this paper, we proposed an temporal error concealment (EC) using the proposed boundary matching method and the adaptive block matching method. The proposed boundary matching method improves the spatial correlation of the macroblocks (MBs) by reusing the pixels of the concealed MB to estimate a motion vector of a error MB. The adaptive block matching method inspects the horizontal edge and the vertical edge feature of a error MB surroundings, and it conceals the error MBs in reference to more stronger edge feature. This improves video quality by raising edge connection feature of the error MBs and the neighborhood MBs. In particular, we restore a lost MB as the unit of 8${\times}$16 block or 16${\times}$8 block by using edge feature from the surrounding macroblocks. Experimental results show that the proposed algorithm gives better results than the conventional algorithms from a subjective and an objective viewpoint.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.2389-2392
• /
• 2005

We present fast stereo matching algorithm using edge projection. Traditional stereo matching algorithm uses 2D template for the search of corresponding point thus it requires huge the computational cost. In this paper, we reduce the 2D search problem into 1D using edge projection along vertical and horizontal direction inside the region of interest. Also, by accumulation of edge projection along vertical and horizontal direction, the edge projection within the region of interest could simply be obtained by just subtracting two values. Experimental results show that matching algorithm using edge projection also gives comparable discriminating power compared to that of using intensity.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• 제51권8호
• /
• pp.335-343
• /
• 2002

A segment matching algorithm in stereo vision via the fusion of multiple features on long edge segments is proposed. One problem of the previous segment matching algorithm is the similarity among the segments caused from its short length. In the proposed algorithm, edges are composed of longer segments which are obtained by breaking the edges only at the locations with distinguished changes of the shape. Such long segments can contain extra features such as curvature ratio and length of segments which could not be included in shorter ones. Use of such additional features enhances the matching accuracy significantly To fuse multiple features for matching, weighting value determination algorithm which is computed according to the degree of the contribution of each factor is proposed. The stereo matching simulations with the proposed algorithm are done about various images and their results are included.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 1998년도 하계학술대회 논문집 G
• /
• pp.2225-2227
• /
• 1998

An efficient stereo matching method with variable matching weights is proposed. The edge segment-based stereo matching has been shown to be efficient method. The method includes 5 matching factor with different weights. The ordinary matching weights are not always adequate for every image. Employing different weight sets depending on the complexity shows better matching performance. In this paper, an evaluation criterion for complexity is suggested and the experimental results with the proposed method is shown.

• ETRI Journal
• /
• 제24권1호
• /
• pp.23-30
• /
• 2002

MPEG-7 Visual Standard specifies a set of descriptors that can be used to measure similarity in images or video. Among them, the Edge Histogram Descriptor describes edge distribution with a histogram based on local edge distribution in an image. Since the Edge Histogram Descriptor recommended for the MPEG-7 standard represents only local edge distribution in the image, the matching performance for image retrieval may not be satisfactory. This paper proposes the use of global and semi-local edge histograms generated directly from the local histogram bins to increase the matching performance. Then, the global, semi-global, and local histograms of images are combined to measure the image similarity and are compared with the MPEG-7 descriptor of the local-only histogram. Since we exploit the absolute location of the edge in the image as well as its global composition, the proposed matching method can retrieve semantically similar images. Experiments on MPEG-7 test images show that the proposed method yields better retrieval performance by an amount of 0.04 in ANMRR, which shows a significant difference in visual inspection.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• 제32B권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
• /
• 제16권3호
• /
• pp.264-268
• /
• 2010

The purpose of this paper is to propose new techniques to match measured optical images by using the edge abstraction method and differentiation method based on image processing technology. To do this, we detect the matching template and non-matching template from each optical image. And then, we detect the edge parts of the overlaped image from comer edge abstraction method and remove noise image. At last, these data are related to applied first-order derivative operator. Finally, we show the effectiveness and feasibility of the proposed method through some experiments.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국정보통신학회 2013년도 춘계학술대회
• /
• pp.385-388
• /
• 2013

In this paper, we show the weakness of the image matching method by using MPEG-7 EHD(Edge Histogram Descriptor) and suggest how to improve this weakness by using image normalization. EHD algorithm is an image matching technique that collects edge's slope of distribution and same distribution. However, the EHD error rate is high because EHD is sensitive for changes of object distortion and rotation that will be matched. We improve matching performance by accurately extract edge information in image by using normalization. We compare and analyze the normalized EHD algorithm by using distortion and rotation and it shows robustness for changes of the size and rotation.