• 한국측량학회지
• /
• 제38권1호
• /
• pp.35-41
• /
• 2020

3D 레이저 스캐너는 대상물에 대한 많은 양의 데이터를 빠른 시간 내에 취득할 수 있는 효과적인 방법으로 최근 측량, 변위측정, 대상물의 3차원 데이터 생성, 실내공간정보 구축, BIM (Building Information Model) 등 다양한 분야에 활용되고 있다. 3D 레이저 스캐너를 통해 취득되는 점군데이터의 활용을 위해서는 정합과정을 거쳐 많은 측점에서 취득한 데이터를 통일된 좌표체계를 가진 하나의 데이터로 만드는 과정이 필요하다. 따라서 정합 방법에 따른 점군데이터의 정확도에 대한 분석적 연구가 필요하다 이에 본 연구에서는 3D 레이저 스캐너를 통해 취득되는 점군데이터의 정합방법에 따른 정확도를 분석하고자 하였다. 3D 레이저 스캐너를 통해 연구대상지의 점군데이터를 취득하고, 자료처리를 통해 ICP (Iterative Closest Point) 와 형상정합 방법에 의해 점군데이터를 정합하였으며, 토털스테이션 측량성과와 비교하여 정확도를 분석하였다. 정확도 평가 결과 ICP와 형상정합 방법은 각각 토털스테이션 성과와 0.002~0.005m, 0.002~0.009m의 차이를 나타내었다. 각각의 정합 방법은 실험결과 모두 0.01m 미만의 편차를 나타내어 1:1,000 수치지형도의 허용정확도를 만족하였으며, ICP 및 형상정합을 이용한 점군데이터의 정합이 공간정보 구축에 충분히 활용 가능함을 제시하였다. 향후 형상정합 방법에 의한 점군데이터의 정합은 3D 레이저 스캐너를 활용한 공간정보 구축 과정에서 타겟의 설치를 줄임으로써 생산성 향상에 기여할 것이다.

• 한국측량학회지
• /
• 제14권1호
• /
• pp.9-16
• /
• 1996

본 연구에서는 상호표정과 사진기준점측량을 위한 새로운 매칭방법을 제안하였다. 이 방법은 수작업에 의한 점이사와 관측을 대신하여 디지탈 항공사진에서 연결점과 접합점으로 사용할 수 있는 공액점들을 매칭한다. 제안된 매칭방법에는 다음과 같은 세 가지의 독특한 단계가 포함되어 있다. 첫째 단계는 interest point를 찾고 이들을 매칭후보점으로 사용한다. 둘째 단계는 중복찰영된 서상에서 표준상관계수법에 의해 양방향으로(왼쪽에서 오른쪽으로 오른쪽에서 왼쪽으로) 매칭을 실시한다. 세째 단계는 양매칭방향에서 일치성이 있는 쌍들을 선택한다. 제안된 매칭방법에 기초한 컴퓨터 프로그램을 개발하고, 전면지상기준점측량을 실시한 디지탈 항공사진을 이용하여 제안된 방법을 사용하였을 때의 신뢰성과 위치정확도를 조사하기 위한 시험을 하였다. 시험 결과 제안된 매칭방법은 다른 매칭방법보다 불량하게 매칭된 쌍들을 제거하는 데 더 효과적이었으며 , 따라서 이 방법을 상호표정 및 사진기준점측량에 사용할 경우 매우 매우 신뢰성이 높다.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1999년도 KOBA 방송기술 워크샵 KOBA Broadcasting Technology Workshop
• /
• pp.171-176
• /
• 1999

Template matching is one of the most often used techniques for machine vision applications to find a template of size M$\times$M or subimage in a scene image of size N$\times$N. Most template matching methods, however, require pixel operations between the template and the image under analysis resulting in high computational cost of O(M2N2). So in this thesis, we present a two stage template matching method. In the first stage, we use a novel low cost feature whose complexity is approaching O(N2) to select matching candidates. In the second stage, we use conventional template matching method to find out the exact matching point. We compare the result with other methods in terms of complexity, efficiency and performance. Proposed method was proved to have constant time complexity and to be quite invariant to noise.

• 대한의용생체공학회:의공학회지
• /
• 제12권2호
• /
• pp.131-138
• /
• 1991

This paper describes an algorithm of pattern analysis of ECG signals by significant points extraction method. The significant points can be extracted by modified zerocrossing method, which method determines the real significant point among the significant point candidates by zerocrossing method and slope rate of left side and right side. This modified zerocrossing method improves the accuracy of detection of real slgnficant polnt Position. This Paper also describes the pattern matching algorithm by a hierarchical AND/OR graph of ECG signals. The decomposition of ECG signals by a hierarchical AND/ OR graph can make the pattern matching process easy and fast, Furthermore the pattern matching to the significant points reduces the processing time of ECG analysis.

• 대한원격탐사학회지
• /
• 제26권3호
• /
• pp.325-333
• /
• 2010

Image registration involves overlapping images of an identical region and assigning the data into one coordinate system. Image registration has proved important in remote sensing, enabling registered satellite imagery to be used in various applications such as image fusion, change detection and the generation of digital maps. The image descriptor, which extracts matching points from each image, is necessary for automatic registration of remotely sensed data. Using contrast enhancement algorithms such as histogram equalization and image stretching, the normalized data are applied to the image descriptor. Drawing on the different spectral characteristics of high resolution satellite imagery based on sensor type and acquisition date, the applied normalization method can be used to change the results of matching interest point descriptors. In this paper, the matching points by scale invariant feature transformation (SIFT) are extracted using various contrast enhancement algorithms and injection of Gaussian noise. The results of the extracted matching points are compared with the number of correct matching points and matching rates for each point.

• 대한전기학회논문지
• /
• 제35권10호
• /
• pp.427-437
• /
• 1986

Identification of the plants is not easy task especially in the fields of process control. From this point of view, Kitamori developed a method of control system design based on partial knowledge about controlled processes. However, it is difficult to control the oscillatory plant by kitamori's method. In this paper, we develope a method of partial model matching control system design, which have desirable pole-placements in order to improve the above defects. Design examples are given to illustrate the effectiveness of the method.

• Journal of Mechanical Science and Technology
• /
• 제20권12호
• /
• pp.2034-2042
• /
• 2006

In this study, a complete 3D surface reconstruction method is proposed based on the concept that the vertices, of surface model can be completely matched to the unstructured point cloud. In order to generate the initial mesh model from the point cloud, the mesh subdivision of bounding box and shrink-wrapping algorithm are introduced. The control mesh model for well representing the topology of point cloud is derived from the initial mesh model by using the mesh simplification technique based on the original QEM algorithm, and the parametric surface model for approximately representing the geometry of point cloud is derived by applying the local subdivision surface fitting scheme on the control mesh model. And, to reconstruct the complete matching surface model, the insertion of isolated points on the parametric surface model and the mesh optimization are carried out. Especially, the fast 3D surface reconstruction is realized by introducing the voxel-based nearest-point search algorithm, and the simulation results reveal the availability of the proposed surface reconstruction method.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2002년도 추계종합학술대회
• /
• pp.226-230
• /
• 2002

본 논문은 영상 모자이킹을 위한 사영 변환 행렬의 정밀도를 개선하는 방법을 제안한다. Shift Theorem을 이용하여 영상간의 전역 이동 성분을 추출하고 구해진 이동 성분을 이용하여 영상간의 일치점을 찾음으로서 기존의 일치점 검출의 문제점을 해결하였다. 일치점 집합을 RANSAC 알고리즘을 적용하여 신뢰도가 높은 일치점을 추출함으로서 잡음의 영향에 강인하도록 하였으며 일치점의 좌표를 정규화 하여 사영변환 행렬의 정밀도를 개선하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.323-326
• /
• 1999

This paper describes a point matching method that is based on an expansion of the electromagnetic field in terms of a series of Bessel and modified Bessel functions multiplied by trigonometric functions. In this method, the electric and magnetic fields inside the waveguide core are matched to those outside the core at matching points on the boundary to yield matrix equations. As an example applying this method, the paper presents the results of the computation in the form of curves of the propagation constants in a semicircular optical waveguide, be formed by annealing for reduced insertion(radiation) loss when connected to optical fiber. The propagation curves are presented in a form of refractive index independent. Also, it presents relative energy distributions between inside the core and outside the core of various modes and presents field distributions.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국내학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.859-863
• /
• 1993

There are two methods to get 3-dimensional information by matching image pair feature-based matching and area-based matching. One of the problems in the area-based matching is how the optimal search region which gives accurate correlation between given point and its neighbors can be selected. In this paper, we proposed a new area-based matching algorithm which uses edge-features used in the conventional feature-based matching. It first selects matching candidates by feature-based and matches image pair with area-based method by taking these candidates as guidance to decision of search area. The results show that running time is reduced by optimizing search area(considering edge points and continuity of disparity), keeping on the precision as the conventional area-based matching method.