• 한국지능시스템학회논문지
• /
• 제3권2호
• /
• pp.3-17
• /
• 1993

The fuzzy pattern matching technique has been developed in the framework of fuzzy set and possibility theory in order to take into account the imprecision and the uncertainty pervading values which have to be compared to requirements (which may be fuzzy) in a pattern matching process. This paper restates the basic principles and extends them to situations where (sub)patterns are only required to be satisfied up to a given tolerance (which may be fuzzy), or where the different subparts of a compound pattern may have various levels of importance. Both cases correspond to a weakening of elementary patterns. which can be expressed by a fuzzy relations modelling an approximate equality or an uncertain strict equality respectively. We also study the more sophisticated case where some elementary patterns have not to be satisfied with the highest priority provided that weaker requirements remain satisfied. The fuzzy pattern matching technique applies in a variety of problems including the evaluation of soft queries with respect to a fuzzy database, the evaluation of the fuzzy condition parts of rules in approximate reasoning, or the evaluation of the belonging of an ill-known object to a flexible class in classification problems.

• 전자공학회논문지S
• /
• 제34S권3호
• /
• pp.74-83
• /
• 1997

In this paper, a new stereo matching algorithm is proposed which uses th econstrainted optimization technique and the matching measures between the segments extracted from zero-crossing edges. The initial matching measures and average disparities are calculated by the features of segments on the searching window of the left and right images. The matching measure is calculated by applying an exponential function using the differences of slope, overlapped length and intensity. The coherency constraint is that neighbouring image points corresponding to the same object should have nearly the same disparities. The matching measures are iteratively updated by applying the coherency constraint. Simulation results on various images show that the proposed algorithm more acculately extracts the segment disparity.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1993년도 하계학술대회 논문집 A
• /
• pp.414-417
• /
• 1993

The methods for stereo matching are divided into two techniques: area-based matching and feature-based matching. To find corresponding points by area-based method, it takes a lot of time because there are many points to be matched. Feature-based matching algorithm is often used because with this method it matches only some feature points so that the processing time is fast even though it requires interpolation after matching. In this paper, we propose the smart technique by which we makes features simpler than conventional methods to match an image pair by feature-based matching algorithm.

• 대한원격탐사학회지
• /
• 제10권2호
• /
• pp.133-160
• /
• 1994

In this paper, we propose a comprehensive geometric correction algorithm of Along Track Scanning Radiometer(ATSR) images. The procedure consists of two cascaded modules; precorrection and fine co-location. The pre-correction algorithm is based on the navigation model which was derived in mathematical forms. This model was applied for correction raw(un-geolocated) ATSR images. The non-systematic geometric errors are also introduced as the limitation of the geometric correction by this analytical method. A fast and automatic algorithm is also presented in the paper for co-locating nadir and forward views of the ATSR images by using a binary cross-correlation matching technique. It removes small non-systematic errors which cannot be corrected by the analytic method. The proposed algorithm does not require any auxiliary informations, or a priori processing and avoiding the imperfect co-registratio problem observed with multiple channels. Coastlines in images are detected by a ragion segmentation and an automatic thresholding technique. The matching procedure is carried out with binaty coastline images (nadir and forward), and it gives comparable accuracy and faster processing than a patch based matching technique. This technique automatically reduces non-systematic errors between two views to .$\pm$ 1 pixel.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2004년도 추계학술대회
• /
• pp.1558-1563
• /
• 2004

A measurement technique for the void fraction and the bubble dynamics in gas-liquid two-phase flows has been proposed using a time-resolved two-phase PIV system. For the three-dimensional evaluation of the bubble information, both the images from the front and side views are simultaneously recorded into a high speed CCD camera by reflecting the side image into the front view with the help of a $45^{\circ}$ oriented mirror. Then, a stereo-matching technique is applied to calculate the void fraction, bubble size and shape. To obtain the rising bubble velocities, the 2-frame PTV method was applied. Consequently, the present technique shows good feasibility for the measurements of the volume fractions, mean diameters, aspect ratios and velocities of the bubbles at the three-dimensional point of view.

• 한국지형공간정보학회:학술대회논문집
• /
• 한국지형공간정보학회 2004년도 추계학술발표대회 논문집
• /
• pp.25-31
• /
• 2004

항공사진을 이용하여 도로의 3차원 위치정보를 취득하기 위해서는 도로지역에 대한 정확한 매칭 기법이 필요하다. 본 연구에서는 도로 노면표식의 형상정보와 공간관계를 이용하여 도로 노면표식을 추출하고, 추출된 노면표식의 공간관계를 비교하여 입체항공영상에서 매칭을 수행하는 즉, 관계형 매칭 기법을 제안하였다. 관계형 매칭은 개체에 대한 고수준의 묘사와 부정확한 매칭에 대한 해결책이 요구되어 진다. 또한 최종 결과물에 대한 충분한 검증을 필요로 한다. 본 연구에서는 도로 노면표식의 형상정보를 계산하여 개체를 묘사하였고, 부정확한 매칭에 대한 해결책을 제안하였으며, 도로지역이 평평하다는 성질을 이용하여 최종결과에 대한 검증을 수행하였다. 본 연구의 정확도는 시각적인 평가와 수치사진 측량시스템을 통해 얻은 참고자료와의 비교를 통해 수행하였다.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집B
• /
• 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.

• 대한전자공학회논문지
• /
• 제27권12호
• /
• pp.1810-1816
• /
• 1990

Step discontinuities of microstrip lines are analyzed using the mode-matching technique based on the well-known waveguide model. Including higher-order modes, the generalized scattering matrices are obtained. Asymmetrical step discontinuities as well as symmetrical step discontinuities are analyzed. The resonance characteristics of microstrip patches are calculated by cascading two microstrip step discontinuities through a uniform microstrip line. Experimental results agree well with theroretical ones.

• Communications for Statistical Applications and Methods
• /
• 제12권2호
• /
• pp.509-520
• /
• 2005

Data fusion is defined as the process of combining data and information from different sources for the effectiveness of the usage of useful information contents. In this paper, we propose a data fusion algorithm using k-means clustering method for data enrichment to improve data quality in knowledge discovery in database(KDD) process. An empirical study was conducted to compare the proposed data fusion technique with the existing techniques and shows that the newly proposed clustering data fusion technique has low MSE in continuous fusion variables.

• 대한원격탐사학회지
• /
• 제7권1호
• /
• pp.13-27
• /
• 1991

DEM(digital elevation map) is a very useful information in various applications. In this paper, we have studied on the terrain matching algorithm using the DEM, which was proposed by Rodriguez and Aggarwal(1990) for an aircraft navigation system. We evaluated its performance using syntactic images. Cliff maps and critical points are used for the reduction of computation time and information size to be processed. The computer simulation shows that though the computational complexity is high, the technique is efficient even to noisy images.