• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2007년도 춘계학술발표회 논문집
• /
• pp.187-190
• /
• 2007

This study is for analyzing best band in image matching using correlation coefficient of left and right images of stereo image pair, lot red, green, blue band images separated from color aerial photo and gray image converted from the same color aerial photo image. The image matching is applied to construct Digital Elevation Model(DEM) or terrain data. The correlation coefficients and variation by change of pixel patch size are computed from pixel patches of which sizes are $11{\times}11{\sim}101{\times}101$. Consequently, the correlation coefficient in red band image is highest. The lowest is in blue band. Therefore, to construct terrain data using image matching, the red band image is preferable. As the size of pixel patch is growing, the correlation coefficient is increasing. But increasing rate declines from $51{\times}51$ image patch size and above. It is proved that the smaller pixel patch size than $51{\times}51$ is applied to construct terrain data using image matching.

• 한국소음진동공학회논문집
• /
• 제24권4호
• /
• pp.310-316
• /
• 2014

The location template matching(LTM) method is a technique of identifying an impact location on a structure, and requires a certain measure of similarity between two time signals. In general, the correlation coefficient is widely used as the measure of similarity, while the group delay based method is recently proposed to improve the accuracy of the impact localization. Another possible measure is the frequency response assurance criterion(FRAC), though this has not been applied yet. In this paper, these three different measures of similarity are examined comparatively by using experimental data in order to understand the properties of these measures of similarity. The comparative study shows that the correlation coefficient and the FRAC give almost the same information while the group delay based method gives the shape oriented information that is best suitable for the location template matching method.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2014년도 춘계학술대회 논문집
• /
• pp.506-511
• /
• 2014

The location template matching (LTM) method is a technique of identifying an impact location on a structure, and requires a certain measure of similarity between two time signals. In general, the correlation coefficient is widely used as the measure of similarity, while the group delay based method is recently proposed to improve the accuracy of the impact localization. Another possible measure is the frequency response assurance criterion (FRAC), though this has not been applied yet. In this paper, these three different measures of similarity are examined comparatively by using experimental data in order to understand the properties of these measures of similarity. The comparative study shows that the correlation coefficient and the FRAC give almost the same information while the group delay based method gives the shape oriented information that is best suitable for the location template matching method.

• 대한의용생체공학회:학술대회논문집
• /
• 대한의용생체공학회 1997년도 춘계학술대회
• /
• pp.230-234
• /
• 1997

The matching pursuit (MP) algorithm developed by S. Mallat and Z. Zhang is applied to magnetic resonance (MR) imaging. Since matching pursuit is a greedy algorithm to find waveforms which are the best match for an object-signal, the signal can be decomposed with a few iterations. In this paper, we propose an application of the MP algorithm to the MR imaging to reduce imaging time. Inner products of residual signals and selected waveforms in the MP algorithm are derived from the MR signals by excitation of RF pulses which are fourier transforms of selected waveforms. Results from computer simulations demonstrate that the imaging time is reduced by using the MP algorithm and further a progressive reconstruction can be achieved.

• 반도체디스플레이기술학회지
• /
• 제8권4호
• /
• pp.95-100
• /
• 2009

This paper presents an efficient disparity matching, using sum of absolute difference (SAD) and dynamic programming (DP) algorithm. This algorithm makes use of one of area-based algorithm which is the absolute sum of the pixel difference corresponding to the window size. We use the information of the right eye brightness (B) and the left eye brightness to get an best matching results and apply the results to the left eye image using the window go by the brightness of the right eye image. This is that we can control the brightness. The major feature of this algorithm called SAD+DP+B is that although Root Mean Square (RMS) performance is slightly less than SAD+DP, due to comparing original image, its visual performance is increased drastically for matching the disparity map on account of its matching compared to SAD+DP. The simulation results demonstrate that the visual performance can be increased and the RMS is competitive with or slightly higher than SAD+DP.

• 품질경영학회지
• /
• 제45권4호
• /
• pp.829-846
• /
• 2017

Purpose: This paper compares the effectiveness of typical selective assembly criteria and suggests the most promising one. Based on the result of a computer simulation, the key issues of selective assembly are examined and the best criterion is recommended from the effectiveness perspective. Methods: Using JAVA program, production of ten thousand units for each pair of components are simulated for selective assembly of the two types. And the number of mismatching and the fraction nonconforming for each criterion are determined. Results: The best match criterion appeared to be most promising from the perspectives of both mismatching and nonconforming problems. Its effectiveness appears to be also good even when the precision of one component is different from that of the other. Conclusion: For designing an optimal method for selective assembly, the best match criterion is recommendable as the base criterion.

• 한국정보컨버전스학회논문지
• /
• 제7권2호
• /
• pp.59-65
• /
• 2014

grassfire 스팟매칭 알고리즘은 중심 스팟을 기준으로 이웃 스팟들의 패턴 유사도에 따라 스팟을 매칭하는 알고리즘으로 잔디에 붙는 불이 사방으로 번져가는 방식을 이용한 grassfire 알고리즘을 이다. 씨드 스팟쌍은 매칭이 정확하게 확인된 스팟쌍으로써 매칭이 시작되는 발화점이며 이것으로부터 스팟매칭이 시작된다. grassfire 스팟매칭 알고리즘에서는 스팟매칭을 시작하는 발화점이 필요한데 기존 grassfire 스팟매칭 알고리즘에서는 한 개의 발화점을 이용하였다. 본 논문에서는 grassfire 알고리즘의 스팟매칭의 성능을 높이기 위하여 한 개의 발화점이 아닌 다중의 발화점을 선정하는 방법을 제안한다. 다중 발화점을 이용한 grassifre 알고리즘은 여러 개의 발화점을 선정한 후 개별 발화점으로부터 스팟매칭을 수행하고 결과들을 계산한다. 제안된 알고리즘은 한 개의 씨드스팟을 이용한 방법보다 스팟 검출율과 스팻매칭 정확도의 측면에서 좋은 성능을 보인다.

• 한국정보통신학회논문지
• /
• 제14권7호
• /
• pp.1667-1679
• /
• 2010

본 논문에서는 최종 변이영상의 정확도를 높이기 위해 영상의 특징점을 이용한 적응적 가변 정합창 방법과 교차 일치성 검사의 신뢰도를 높이는 방법을 제안한다. 제안한 적응적 가변 정합창 방법은 색상정보를 이용하여 영상을 분할하고 분할된 각 영상의 특징점을 찾아 그 특징점들의 유무에 따라 정합창의 크기를 적응적으로 가변시키는 방법이다. 또한 제안한 교차 일치성 검사 방법은 최적의 변이와 차상위 최적의 변이에 대한 비용함수 값들을 비교하여 비용하수 값 자체가 너무 크거나 두 비용함수의 차이가 너무 적은 경우를 찾아내어 처리하는 방법이다. 제안한 두 방법에 대한 Middleburry에서 제공한 네 가지 실험영상을 대상으로 실험한 결과 적응적 가변 정합창 방법은 최대 18.2%의 오차율을 감소시켰다. 또한 제안한 교차 일치성 검사는 최대 7.4%의 신뢰도를 향상시킨 것으로 나타났다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.295-296
• /
• 2006

This paper implements a method that tracking the moving objects that detected by the motion detection function of the digital CCTV system. We simply implement the motion detection function of the digital CCTV system that use frame difference and thresholding. When motion is detected, the motion detection function generates two outputs. One output is the event that the motion is arised in input image frame. The other output is coordinate that motion is exists. Then, do the block matching algorithm[2] using coordinate, that motion is exists, as initial coordinate of the block matching algorithm. The best matched coordinate is new initial coordinate of the block matching algorithm for the next image frame. We simply use the block matching algorithm that implements tracking the moving objects. It is simple, but useful the actual digital CCTV system.

• 산업경영시스템학회지
• /
• 제21권48호
• /
• pp.213-222
• /
• 1998

The objective of this study is to develop a knowledge-based scheduler applying simulation and knowledge base. This study utilizes a machine induction to build knowledge base which enables knowledge acquisition without domain expert. In this study, the best job dispatching rule for each order is selected according to the specifications of the order information. And these results are built to the fact base and knowledge base using the attribute-oriented induction method and simulation. When a new order enters in the developed system, the scheduler retrieves the knowledge base in order to find a matching record. If there is a matching record, the scheduling will be carried out by using the job dispatching rule saved in the knowledge base. Otherwise the best rule will be added to the knowledge base as a new record after scheduling to all the rules. When all these above steps finished the system will furnish a learning function.