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

Although guided-waves are very efficient for long-range nondestructive damage inspection, it is not easy to extract meaningful pulses of small magnitude out of noisy signals. The ultimate goal of this research is to develop an efficient signal processing technique for the current guided-wave technology. The specific contribution of this investigation towards achieving this goal, a two-stage Gabor pulse-based matching pursuit algorithm is proposed : rough approximations with a set for predetermined parameters characterizing the Gabor pulse and fine adjustments of the parameters by optimization. The parameters estimated from the measured signal are then used to assess not only the location but also the size of a crack existing in a rod. To validate the effectiveness of the proposed method, the longitudinal wave-based damage detection in rods is considered. To estimate the crack size, Love's theory for the dispersion of longitudinal waves is employed.

• 반도체디스플레이기술학회지
• /
• 제17권2호
• /
• pp.41-46
• /
• 2018

This paper proposes a new method for the number recognition on dot matrix LED display. The proposed method uses morphological processing that dilates dots of numbers and connects the dots into strokes. The size of numbers is normalized using horizontal projection because the gaps of dots are different according to the size of numbers. The numbers are segmented by connected component analysis and finally, template matching method recognizes the segmented numbers. The proposed method is implemented using C language in Raspberry Pi system with a camera module for a real-time image processing. Experiments were conducted by using various dot matrix LED displays. The results show that the proposed method is successful for the number recognition on dot matrix LED display.

• 반도체디스플레이기술학회지
• /
• 제21권1호
• /
• pp.22-26
• /
• 2022

This paper proposes a new method for the recognition of road surface marks and numbers. The proposed method designates a region of interest on the road surface without first detecting a lane. The road surface markings are extracted by location and size using a connection component analysis. Distortion due to the perspective effect is minimized by normalizing the size of the road markings. The road surface marking of the connected component is recognized by matching it with the stored road marking templates. The proposed method is implemented using C language in Raspberry Pi 4 system with a camera module for a real-time image processing. The system was fixedly installed in a moving vehicle, and it recorded a video like a vehicle black box. Each frame of the recorded video was extracted, and then the proposed method was tested. The results show that the proposed method is successful for the recognition of road surface marks and numbers.

• ETRI Journal
• /
• 제35권1호
• /
• pp.154-157
• /
• 2013

This letter proposes a memory-based parallel string matching engine using the compressed state transitions. In the finite-state machines of each string matcher, the pointers for representing the existence of state transitions are compressed. In addition, the bit fields for storing state transitions can be shared. Therefore, the total memory requirement can be minimized by reducing the memory size for storing state transitions.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(4)
• /
• pp.39-42
• /
• 2000

Motion estimation plays an important role for video coding. In this paper, we derive optimal search patterns for fast block matching motion estimation. By analyzing the block matching algorithm as a function of block shape and size, we can find an optimal search pattern for initial motion estimation. The proposed idea, which has been verified experimentally by computer simulations, can provide an analytical basis for the current MPEG-2 proposals. In order to choose a more compact search pattern for BMA, we exploit the statistical relationship between the motion and the frame difference of each block.

• Journal of Astronomy and Space Sciences
• /
• 제15권1호
• /
• pp.229-234
• /
• 1998

We study on a terrain contour matching algorithm using Radial Basis Functions(RBFs) for aided inertial navigation system for position fixing aircraft, cruise missiles or re-entry vehicles. The parameter optimization technique is used for updating the parameters describing the characteristics of an area with modified Gaussian least square differential correction algorithm and the step size limitation filter according to the amount of updates. We have applied the algorithm for matching a sampled area with a target area supposed that the area data are available from Radar Terrain Sensor(RTS) and Reference Altitude Sensor(RAS)

• 대한전자공학회논문지
• /
• 제26권9호
• /
• pp.1420-1427
• /
• 1989

A new block matching algorithm that improved the existing block matching algorithm in terms of image quality is proposed in this paper. The subblock of image including the vertical edge of object is subdivided into new two subblocks, and the moving vector found. The result of computer simulation shows on real image that the image quality by the algorithm becomes higher than that of the three step search algorithm by 1.1dB.

• 대한공간정보학회지
• /
• 제4권1호
• /
• pp.93-102
• /
• 1996

수치표고모델(DEM, Digital Elevation Model)을 컴퓨터를 이용하여 자동으로 생성할 때 입체영상매칭(stereo matching) 연산은 많은 수행시간이 소요된다. 매칭연산은 일반적으로 상관계수(correlation)에 의한 방법이 사용되고 있으며, 매칭점 분포가 균등한 지역기반방식(area-based method)이 주로 이용되고 있다. 본 논문에서는 지형을 식별하여 매칭연산에서 검색영역(search area)과 기준윈도우(mask window)의 크기를 조정하여 효율적인 매칭을 수행하는 방안을 제시하였다. 영상을 분할하기 위하여 경계보호평활화 필터(edge-preserving smoothing filter)를 사용하여 전처리를 수행하였으며, 필터를 거친 영상에 대해서 영역성장 알고리듬을 적용하였다. 분할된 영역은 MRF(Markov Random Field) 모델에 의한 식별과정을 통하여 산악, 평야, 수계지역으로 식별된다. 영상매칭은 예비시차(predicted parallex) 계산과 상세매칭(fine matching)의 두 단계를 거치며, 예비시차를 이용하여 상세매칭단계에서 검색영역의 위치를 결정한다. 검색영역과 기준윈도우의 크기는 화소에 대한 지형식별정보에 의해 결정된다. 주변화소와 시차가 유사한 평야지역과 수계지역의 검색영역을 축소함으로서 매칭연산시간을 단축시켰다. 대전-금산지역의 $10km{\times}10km(1024{\times}1024)$ 영상을 4개 사용하여 실험한 결과 지형식별정보를 이용하지 않았을 경우보다 영상매칭 수행시간이 $25%{\times}35%$정도 단축시킬 수 있음을 보였다.

• 한국측량학회지
• /
• 제16권2호
• /
• pp.203-211
• /
• 1998

정사투영사진 지도는 입체영상에 존재하는 공액점을 수치적으로 탐색하여 높이를 결정하는 수치사진측량 방법을 사용하여 제작되며, 공액점을 자동으로 결정하기 위한 수치영상정합 방법에 대한 많은 연구가 진행 중이다. 본 연구에서는 수치영상정합에서 공통적으로 사용되는 영상 피라미드의 4가지 축척 계수 변화와 8가지 기준영역의 크기의 변화에 따른 영역기반정합의 정확도에 미치는 영향을 고찰하였다. 각 방법에 대한 영상정합 결과는 l/5,000 수치지도 자료와 비교하였고, 영상정합의 성공률을 분석하여 최적 기준영역의 크기를 결정하였다. 수치지형모델은 결정된 영상정합 결과와 광속조정법을 이용하여 생성하였으며, 수치표고모델과 정사투영사진을 이용하여 정사투영사진 지도를 제작하였다.

• 전자공학회논문지B
• /
• 제29B권10호
• /
• pp.69-77
• /
• 1992

Pattern Recognition is one of the fundamental areas of computer vision. The recognition of patterns with varying size and severe defects is especially important. However, it is known that the conventional algorithms such as GHT or structural approaches have limitations in speed and accuracy. In this paper, in order to avoid above-mentioned problems, we propose a new recognition algorithm which exploits the histogram of contour directions and the sampled spot matching method. While the former provides little influence against size variation, the latter has strong immunity to noise and defects. We applied those proposed algorithms for the recognition of numbers extracted from the car number plates and shapes of aircraft. Experimental result shows that it is possible to solve above-mentioned problems by complementary uses of those two suggested algorithms. The contour directional histogram method resulted in high-speed of average 0.013 sec/char and 0.1 sec/aircraft-image on IBM-386. The accuracy of recognition is as high as 99%. Sampled spot matching method has less speed than the former one, however, it showed fairly strong immunity to noise and defects.