• Proceedings of the IEEK Conference
• /
• 2001.06d
• /
• pp.69-72
• /
• 2001

This paper proposes a positional estimation method for extracted line features by stereo vision. Based on given reference plane, planar surfaces corresponding the given plane are first extracted. Then, features in the planar surfaces are selected. Using the Extended Kalman Filter the feature positions are estimated by combining area- and feature-based stereo matching results. Experimental results show the proposed method is feasible.

• Journal of Digital Contents Society
• /
• v.5 no.4
• /
• pp.257-263
• /
• 2004

This paper is related to the object-based stereo matching algorithm which makes it possible to estimate inner-region disparities for each segmented region. First, several sample points are selected for effectively representing the segmented region, Next, stereo matching is applied to the small area within segmented region which existed in the neighborhood or each sample point. Finally, inner-region disparities are interpolated using a plane equation with disparity of each selected sample. According to the proposed method, the problem of feature-based method that the depth estimation is possible only in the feature points can be solved through the propagation of the disparity in the sample point into the inside of the region. Also, as selecting sample points in contour of segmented region we can effectively suppress obscurity which is occurred in the depth estimation of the monotone region in area-based methods.

• Proceedings of the KSME Conference
• /
• 2001.06b
• /
• pp.706-711
• /
• 2001

This paper represents a relaxation matching algorithm based on global structure constraint satisfaction. Relaxation matching algorithm is a conventional approach to the matching problem. However, we confronted some problems such as null-matching and multi-matching problems by just using the relaxation matching technique. In order to solve the problems, in this paper, the matching problem is regarded as constraint satisfaction problem, and a relaxation matching algorithm is proposed based on global structure constraint satisfaction. The proposed algorithm is applied a landslide picture to show the effectiveness. When the algorithm is processed at landslide inspecting and monitoring system, motion parameters such as displacement area and its direction are computed. Once movement is recognized, displacements are estimated graphically with statistical amount in the image plane. Simulation has been done to prove the proposed algorithm by using time-sequence image of landslide inspection and monitoring system.

• Journal of Korean Society for Geospatial Information Science
• /
• v.4 no.1 s.6
• /
• pp.93-102
• /
• 1996

For an atomatic generation of DEM(Digital Elevation Model) by computer, it is a time-consumed work to determine adquate matches from stereo images. Correlation and evenly distributed area-based method is generally used for matching operation. In this paper, we propose a new approach that computes matches efficiantly by changing the size of mask window and search area according to the given terrain information. For image segmentation, at first edge-preserving smoothing filter is used for preprocessing, and then region growing algorithm is applied for the filterd images. The segmented regions are classifed into mountain, plain and water area by using MRF(Markov Random Filed) model. Maching is composed of predicting parallex and fine matching. Predicted parallex determines the location of search area in fine matching stage. The size of search area and mask window is determined by terrain information for each pixel. The execution time of matching is reduced by lessening the size of search area in the case of plain and water. For the experiments, four images which are covered $10km{\times}10km(1024{\times}1024\;pixel)$ of Taejeon-Kumsan in each are studied. The result of this study shows that the computing time of the proposed method using terrain information for matching operation can be reduced from 25% to 35%.

• Proceedings of the KSRS Conference
• /
• v.2
• /
• pp.594-597
• /
• 2006

Image co-registration is the process of overlaying two images of the same scene. One of which is a reference image, while the other (sensed image) is geometrically transformed to the one. Numerous methods were developed for the automated image co-registration and it is known as a time-consuming and/or computation-intensive procedure. In order to improve efficiency and effectiveness of the co-registration of satellite imagery, this paper proposes a pre-qualified area matching, which is composed of feature extraction with Laplacian filter and area matching algorithm using correlation coefficient. Moreover, to improve the accuracy of co-registration, the outliers in the initial matching point should be removed. For this, two outlier detection techniques of studentized residual and modified RANSAC algorithm are used in this study. Three pairs of Landsat images were used for performance test, and the results were compared and evaluated in terms of robustness and efficiency.

• Korean Journal of Remote Sensing
• /
• v.22 no.5
• /
• pp.439-443
• /
• 2006

Image co-registration is the process of overlaying two images of the same scene. One of which is a reference image, while the other (sensed image) is geometrically transformed to the one. Numerous methods were developed for the automated image co-registration and it is known as a timeconsuming and/or computation-intensive procedure. In order to improve efficiency and effectiveness of the co-registration of satellite imagery, this paper proposes a pre-qualified area matching, which is composed of feature extraction with Laplacian filter and area matching algorithm using correlation coefficient. Moreover, to improve the accuracy of co-registration, the outliers in the initial matching point should be removed. For this, two outlier detection techniques of studentized residual and modified RANSAC algorithm are used in this study. Three pairs of Landsat images were used for performance test, and the results were compared and evaluated in terms of robustness and efficiency.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.6
• /
• pp.85-90
• /
• 1998

The most important step image processing is stereo matching process. That is finding pixels of 3 dimensional pair in the left and right image. There are two matching methods. One is an area based approach and the other is a feature based approach. An area based approach needs much calculation time. In the other hand, we have the advantage of calculation time in the feature based approach, but can not obtain matched data for all pixels in the image. In recent years, fuzzy image processing methods are developed to manage vagueness and noise in image and ambiguous, inconsistent knowledge in recognition step. In this paper, we propose a fuzzy stereo matching algorithm. This method converts brightness data of image to fuzzy membership value and processes an area based approach method for stereo matching algorithm. We experiment with some stereo images to validate effectiveness of this algorithm.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1678-1680
• /
• 2002

Stereo matching technique is used in many practical fields like satellite image analysis and computer vision. In this paper, we suggest a method to extract a target object image from a complicated background. For example, human face image can be extracted from random background. This method can be applied to computer vision such as security system, dressing simulation by use of extracted human face, 3D modeling, and security system. Many researches about stereo matching have been performed. Conventional approaches can be categorized into area-based and feature-based method. In this paper, we start from area-based method and apply area tracking using scanning window. Coarse depth information is used for area merging process using area searching data. Finally, we produce a target object image.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.825-832
• /
• 2010

This paper presents only a matching algorithm based on Delaunay triangulation and Parametrization from the extracted minutiae points. This method maps local neighborhood of points of two different point sets to unit-circle using topology information by Delaunay triangulation method from feature points of real fingerprint. Then, a linked convex polygon that includes an interior point is constructed as one-ring which is mapped to unit-circle using Parametrization that keep shape preserve. In local matching, each area of polygon in unit-circle is compared. If the difference of two areas are within tolerance, two polygons are consider to be matched and then translation, rotation and scaling factors for global matching are calculated.

• Journal of Korean Society for Geospatial Information Science
• /
• v.12 no.2 s.29
• /
• pp.61-66
• /
• 2004

By the advent of the high-resolution Satellite imagery, there are increasing needs in image mosaicking technology which can be applied to various application fields such as GIS(Geographic Information system). To mosaic images, various methods such as image matching and histogram modification are needed. In this study, automated image mosaicking is performed using image matching method based on the multi-resolution wavelet analysis(MWA). Specifically, both area based and feature based matching method are embedded in the multi-resolution wavelet analysis to construct seam line.; seam points are extracted then polygon clipping method are applied to define overlapped area of two adjoining images. Before mosaicking, radiometric correction is proceeded by using histogram matching method. As a result, mosaicking area is automatically extracted by using polygon clipping method. Also, seamless image is acquired using multi-resolution wavelet analysis.