• 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.

• Journal of Korea Multimedia Society
• /
• v.11 no.2
• /
• pp.153-162
• /
• 2008

We propose a novel image inpainting method composed of two parts: band matching and seamless cloning. In band matching, a band enclosing the boundary of a missing region is compared to those from the other parts of the image. The inner area of the minimum difference band is then copied to the missing region. Even though this band matching results in successful inpainting in many practical applications, brightness discontinuity (a seam) may appear between the filled missing region and its neighborhood. We apply seamless cloning to remove such discontinuity between the two regions. However, since this basic method using one patch may not deal with cases where there are abrupt changes of color or brightness along the boundary, we furthermore devise one more step: target sub-division. The target area is subdivided into small sub-areas, and the band matching and seamless cloning are applied to each of them. The multiple results from the sub-division are then ordered according to inpainting quality, which is measured based on the edge map or discontinuity map along the boundary band.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.16 no.2
• /
• pp.203-211
• /
• 1998

A traditional method to produce three dimensional orthophoto map has been studied by digital photogrammetry which decides a height by digitally searching conjugate points on the stereo image. Many researches in digital photogrammetric field are still in progress to determine conjugate points automatically. In this study, we analyze the effect of accuracy of area-based image matching with changing eight types of target area size using four types of image pyramid. The result of image matching to each method compared with 1/5,000 digital mapping data. We decided a optimal size of target area on a percentage of image matching. Digital elevation model is generated by matching results and bundle method. As a result, three dimensional orthophoto map is made in terms of digital elevation model and orthophoto.

• 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.

• 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.

• 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 the Korea Institute of Information and Communication Engineering
• /
• v.15 no.9
• /
• pp.2007-2012
• /
• 2011

To reduce huge computation in the block matching, this paper proposes a fast block matching algorithm which limits search points in the search area. On the basis of two facts that most motion vectors are located in central part of search area and matching error is monotonic decreasing toward the best similar block, the proposed algorithm moves a matching pattern between steps by the one pixel, predicts the motion direction for the best similar block from similar blocks decided in previous steps, and limits movements of search points to ${\pm}45^{\circ}C$ on it. As a result, it could remove the needless search points and reduce the block matching computation. In comparison with the conventional similar algorithms, the proposed algorithm caused the trivial image degradation in images with fast motion but kept the equivalent image quality in images with normal motion, and it, meanwhile, reduced from about 20% to over 67% of the their block matching computation.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.3
• /
• pp.32-40
• /
• 1999

In this paper, we present a fast block matching motion estimation algorithm based on successive elimination algorithm (SEA). Based on the characteristic of center-biased motion vector distribution in the search area, the proposed method improves the performance of the SEA with a reduced the number of the search positions in the search area, In addition, to reduce the computational load, this method is combined with both the reduced bits mean absolute difference (RBMAD) matching criterion which can be reduced the computation complexity of pixel comparison in the block matching and pixel decimation technique which reduce the number of pixels used in block matching. Simulation results show that the proposed method provides better performance than existing fast algorithms and similar to full-search block motion estimation algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.119-122
• /
• 2011

The Stereo vision using belief propagation algorithm that has been studied recently yields good performance in disparity extraction. In this paper, BP algorithm is proved theoretically to high precision for a stereo matching algorithm. We derive disparity map from stereo image by using Belief Propagation (BP) algorithm and area-based matching algorithm. Two algorithms are compared using stereo images provided by Middlebury web site. Disparity map error rate decreased from 52.3% to 2.3%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.2
• /
• pp.308-314
• /
• 2006

A line scan camera is applied to enhance COG(Chip On Glass) inspection accuracy to be measured a few micro unit. The foreign substance detection among various faulty factors has been the most difficult technology in the faulty automatic inspection step since COG pattern is very miniature and complexity. In this paper, we proposed two step area segmentation template matching method to increase matching speed. Futhermore to detect foreign substance(such as dust, scratch) with a few micro unit, the new method using gradient mask and AND operation was proposed. The proposed 2 step template matching method increased 0.3 - 0.4 second matching speed compared with conventional correlation coefficient. Also, the proposed foreign substance applied masks enhanced $5-8\%$ faulty detection rate compared with conventional no mask application method.