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

• 전자공학회논문지B
• /
• 제32B권1호
• /
• pp.39-49
• /
• 1995

Stereo vision is useful to obtain three dimensional depth information from two images taken from different view points. In this paper, we reduce searching area for correspondence by using the intra-scanline constraint, and utilize the inter-scanline constraint and the property of disparity continuity among the neighboring pixels for relaxation. Nodes with 3-D stucture are located on the axes of two views, and have matching possibility of correspondent pixels of two images. A matching is accepted if a node at the intersection of the disparity axes has the greatest matching possibility. Otherwise, the matching possibility of the node is updated by relaxation with the cooperation of neighboring nodes. Further relaxation with competition of two views is applied to a matching possibility of randomly selected node. The consensus of two views increases the confidence of matching, and removes a blurring phenomenon on the discontinuity of object. This approach has been tested with various types of image such as random dot stereogram and aerial image, and the experimental results show good matching performance.

• 한국통신학회논문지
• /
• 제18권1호
• /
• pp.133-142
• /
• 1993

본 논문은 2차원 물체의 형상 매칭에 관한것으로 다각근사화된 단순 2차원 물체에 적용하였다. 많은 형상 매칭 방법론이 수학적 벡터의 의현에 기초를 두고 확솔적인 패턴 인식을 사용하고 있다. 유출된 형상의 다양성과 많은 데이타량은 형상의 전체적인 구조의 관계를 나타내는데 단점을 갖고 있다. 본 논문에서는 영상을 다 각근사적 과정를 통하여 Relaxation 라벨링 기술을 이용함으로써 형상 매칭의 지점을 해결하였다.

• 전자공학회논문지B
• /
• 제33B권3호
• /
• pp.69-78
• /
• 1996

This paper presetns an iterative relaxation method for stereo matching using matching probability and compatibility coefficients between disparities. Stereo matching can be considered as the labeling problem of assigning unique matches to feature points of image an relaxation labelin gis an iterative procedure which reduces local ambiguities and achieves global consistency. the relation between disparities is determined from highly reliable matches in initial matching and quantitatively expressed in temrs of compatibility coefficient. The matching results of neighbor pixels support center pixel through compatibility coefficients and update its matching probability. The proposed adaptive method reduces the degradtons on the discontinuities of disparity areas and obtains fast convergence.

• 전자공학회논문지S
• /
• 제35S권12호
• /
• pp.55-62
• /
• 1998

두개의 영상을 정합 하는 것은 많은 컴퓨터 시각장치의 응용과정 중 기본적인 과정이다. 본 논문에서는 선형특징을 사용한 정합기법으로서 회전각도와 크기비율에 불변한 영상정합 기법을 제안한다. 영상은 edge 검출, 세선화, 선형화 과정에 의해 선형 세그먼트의 집합으로 묘사된다. 세그먼트 사이의 각도차이와 새로운 거리척도에 의한 크기비율을 사용해 Hough 공간에서 최대로 일치하는 변환 파라메터를 추정한다. 추정된 파라메터는 1단계 relaxation과 Hough 기법으로 이루어진 고속 선형특징 정합과정에 의해 검증된다. 제안한 기법은 변환 파라메터에 대한 사전정보를 필요로 하지 않으며 추출된 선형 세그먼트 크기의 변화에 민감하지 않은 특성과 기존의 relaxation 기법에 비해 빠른 처리속도를 가진다.

• 한국지능시스템학회논문지
• /
• 제19권2호
• /
• pp.236-241
• /
• 2009

분산되어 있거나 이기종의 데이터베이스 통합을 위해 많은 연구가 수행되었으며, 특히 데이터베이스 통합을 위해 데이터베이스의 스키마 매칭이 이슈가 되고 있다. 본 연구에서는 해양GIS 데이터베이스 통합을 위해 해양GIS 데이터베이스 구조를 XML 응용스키마로 변환하고 유사도 측정법과 relaxation labeling 기법을 이용하여 매칭 방법을 연구하였다. XML 응용스키마의 항목 간 유사도 측정은 각 항목이 가지고 있는 범주와 속성으로 계산하며, 각 항목이 계층간 의미적 연계관계를 적용하기 위하여 relaxation labeling 기법을 이용하여 초기 유사도 측정값에 반복적으로 적용하여 유사도 측정값의 변이를 측정하였다. 본 연구에서는 해양GIS 메타데이터 응용 스키마의 예시를 들어 알고리즘을 통한 매칭을 시도하였고, 실험 결과 알고리즘에 따른 초기 계산 값의 변화를 확인하였다.

• 한국컴퓨터정보학회논문지
• /
• 제23권8호
• /
• pp.37-43
• /
• 2018

In this paper, we propose a framework that automatically suggests emotion using emotion analysis method based on facial expression change. We use Microsoft's Emotion API to calculate and analyze emotion values in facial expressions to recognize emotions that change over time. In this step, we use standard deviations based on peak analysis to measure and classify emotional changes. The difference between the classified emotion and the normal emotion is calculated, and the difference is used to recognize the emotion abnormality. We match user's emotions to relatively relaxed emotions using histograms and emotional meshes. As a result, we provide relaxed emotions to users through images. The proposed framework helps users to recognize emotional changes easily and to train their emotions through emotional relaxation.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.689-692
• /
• 1998

Matching two images is an essential step for many computer vision applications. A new approach to the scale and rotation invariant scene matching is presented. A set of andidate parameters are hypthesized by mapping the angular difference and a new distance measure to the hough space and by detecting maximally consistent points. The proposed method is shown to be much faster than the conventinal one where the relaxation process is repeated until convergence, while providing robust matching performance, without a priori information on the geometrical transformation parameters.

• 전자공학회논문지S
• /
• 제34S권9호
• /
• pp.109-117
• /
• 1997

A new relaxation algorithm based on distribution of matched errors and possibility is proposed to solve efficiently correspondence problem. This algorithm can be applied to various method, such as BMA, feature-, and region-based matching methods, by modifying its smoothness function. It consists of two stages which are transformation and iteration process. In transformation stage, the errors obtained by any matching algorithm are transformed to possibility values according to these statistical distribution. Each grade of possility is updated by some constraints which are defined as smoothness, uniqueness, and discontinuity factor in iteration stage. The discontinuity factor is used to reserve discontinuity of disparity. In conventional methods, it is difficult to find proper weights and stop condition, because only two factors, smoothness and uniqueness, have been used. However, in the proposed mthod, the more smoothing is not ocurred because of discontinuity factor. And it is efective to the various image, even if the image has a severe noise and repeating patterns. In addition, it is shown that the convergence rate and the quality of output are improved.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.701-704
• /
• 1998

본 논문에서는 스테레오 정합에서 불연속성과 폐색영역을 고려하고 다중 계층 구조를 사용한 relaxation 알고리듬을 이용하여 좌우 영상간의 최적의 정합점을 찾는 스테레오 정합을 구현하였다. 잡음을 제거하기 위해 베이시안 필터링 방법을 사용하였다. 좌우 영상에서 얻은 변이(disparity)를 이용하여 좌우 폐색영역(occlusion region)을 구한 후, 다시 최적의 변이를 얻기 위해 내삼과정을 통해 양쪽의 정보를 상호 보완하는 병렬적인 relaxation 방법을 구현한다. 구현한 방법은 다양한 영상에 적용하였다.