• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.375-377
• /
• 2003

In this study, we employ the control patches, which have been created in previous photogrammetric projects, serving for the candidates of the control points that are likely to be found in the newly taken photos by utilizing image matching technique. Among others, the successful implementation of the above idea lies in the underlying factors: (1). Predicting the control patches and projecting them onto new photos; (2). Alignment of control patches with respect to the new photos; (3). Generating the equivalent ground elements of control patches versus the new photos for the purpose of correlation; (4). Developing effective matching methods and matching strategy; (5). Refining the exterior orientation parameters. What may show significance in this work comparing to traditional aerial-triangulation chain is that whenever at least three matched control patches succeed in a single photo, it follows that single photo orientation is applicable. The experiments suggest the potential efficiency of automatic control point measurement from control patch database and photo orientation by the proposed workflow.

• Journal of Information Processing Systems
• /
• 제12권1호
• /
• pp.83-99
• /
• 2016

The latest research on the image-based fingerprint matching approaches indicates that they are less complex than the minutiae-based approaches when it comes to dealing with low quality images. Most of the approaches in the literature are not robust to fingerprint rotation and translation. In this paper, we develop a robust fingerprint matching system by extracting the circular region of interest (ROI) of a radius of 50 pixels centered at the core point. Maximizing their orientation correlation aligns two fingerprints that are to be matched. The modified Euclidean distance computed between the extracted orientation features of the sample and query images is used for matching. Extensive experiments were conducted over four benchmark fingerprint datasets of FVC2002 and two other proprietary databases of RFVC 2002 and the AITDB. The experimental results show the superiority of our proposed method over the well-known image-based approaches in the literature.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2002년도 Proceedings of International Symposium on Remote Sensing
• /
• pp.74-74
• /
• 2002

This paper describes a corner matching technique for automatic relative orientation. Automatically matched corner points from stereo aerial images are used to a data set and help to improve automation of relative orientation process. A general corner matching process of overall image to image has very heavy operation and repetitive computation, so very time-consuming. But aerial stereo images are approximately seventy percent overlapped and little rotated. Based this hypothesis, we designed a sectional corner matching technique calculating correlation section by section between stereo images. Although the overlap information is not accurate, if we know it approximately, the matching process can be lighter. Since the size of aerial image is very large, corner extraction process is performed hierarchically by creating image pyramid, and corners extracted are refined at the higher level image. Extracted corners at the final step are matched section by section. Matched corners are filtered using positional information and their relation and distribution. Filtering process is applied over several steps because the thing affecting to get good result-good relative orientation parameter- is not the number of matched corner points but the accuracy of them. Filtered data is filtered one more during the process calculating relative orientation parameters. When the process is finished, we can get the well matched corner points and the refined Von-Gruber areas besides relative orientation parameters. This sectional corner matching technique is efficient by decreasing unnecessarily repetitive operations and contributes to improve automation for relative orientation.

• 한국HCI학회:학술대회논문집
• /
• 한국HCI학회 2008년도 학술대회 1부
• /
• pp.517-521
• /
• 2008

Hand motion classification problem is considered as basis for sign or gesture recognition. We promote optical flow as main feature extracted from images sequences to simultaneously segment the motion's area by its magnitude and characterize the motion' s directions by its orientation. We manage the flow orientation histogram as motion descriptor. A motion is encoded by concatenating the flow orientation histogram from several frames. We utilize simple histogram matching to classify the motion sequences. Attempted experiments show the feasibility of our method for hand motion localization and classification.

• 대한원격탐사학회지
• /
• 제32권6호
• /
• pp.647-656
• /
• 2016

UAV의 발전에 따라 UAV영상의 활용도 늘어나고 있다. 다양한 UAV영상 기반의 어플리케이션에 점진적 번들 조정방법이 널리 사용된다. 그러나, 점진적 번들조정 방법은 중복이 없는 영상 쌍에서도 대응점을 추출해 긴 시간을 소요하게 된다. 이 과정을 효율적으로 처리하기 위해서는 중복지역에서만 대응점 추출연산을 진행해야한다. 만약 영상의 외부표정요소가 있을 경우 이를 기준으로 영상의 중복도를 계산하여 중복지역에서만 대응점 추출이 일어나도록 제한할 수 있다. 그러나 외부표정요소가 없는 영상을 활용하는 경우, 기하학적인 중복지역을 계산할 수 없으므로 다른 후보군 구성 방법의 적용이 필요하다. 본 논문에서는 외부표정 요소가 없는 경우의 대응점 추출 후보군 구성 방법들을 비교해 가장 효율적인 방법을 찾는다. 비교 방법은 일부 특징점, 특징점 군집화, 영상의 밝기를 활용한 후보군 구성방식이며 외부표정요소를 통해 구한 대응점 후보군 구성결과를 기준으로 각 방식을 비교한다. 비교 결과 일부 특징점을 활용하는 것이 가장 효율적으로 나타났다.

• 정보보호학회논문지
• /
• 제16권4호
• /
• pp.91-103
• /
• 2006

본 논문은 지문 인식 알고리즘의 신빙성 있는 성능 평가를 위해 실험에 사용되는 지문 영상 데이터베이스의 특성을 정량화하는 방법과 지문 영상 데이터베이스들의 난이도를 측정하는 방법을 제안하는 것을 목적으로 한다. 이를 위해 지문 영상 정합 시에 영향을 미치는 요소들을 정의하였으며, 두 지문 영상의 정합을 minutiae 기반이 아닌 orientation field을 사용하여 요소들을 평가한다. Orientation filed는 기존의 orientation 방법을 이용하되 계층적으로 측정함으로써 정합시의 속도와 정확성을 개선하였다. 실험 결과, 두 영상을 정합하여 얻어진 각각의 요소들의 측정수치는 데이터베이스들의 특성을 보여준다. 데이터베이스 난이도의 측정은 지문 인식 알고리즘들의 성능을 객관적이고 정량적으로 비교할 수 있게 해준다.

• 대한원격탐사학회지
• /
• 제12권1호
• /
• pp.43-59
• /
• 1996

이 연구는 수치사진측량의 기본과정 중의 하나인 입체영상 표정에서 관계영상정합 (relational matching)을 이용한 초기 근사값 결정에 관한 연구를 목적으로 한다. 수치입체영상에 대한 상호표정(relative orientation)을 자동화하기 위한 연구가 수치사진측량(Digital Photogrammetry) 및 컴퓨터 비젼(Computer Vision) 분야에서 많이 이루어져 왔다. 그러나 현재 까지의 자동화된 상호표정에 있어서는 초기 근사값 산정에 의한 문제가 제약조건이 되어 왔으므 로, 보다 일반적인 적용을 목적으로 관계영상정합이 제안되고 이에 대해 연구가 시작되었다. 이 연구에서는 특수한 관계설정(relational description)을 사용하여, 초기 근사값을 결정하는 보다 유연한 방법이 제시되고 적용되었으며, Cost 함수를 평가함수(evaluation fuction)로 적용하였다. 본 연구에서 제시된 관계정합방법에 일부로서 매칭오류(mismatch) 탐색과정을 부가하였다. 또 한, 반복적인 형태, 파단선, 사각지역 등이 다수 포함되어 있는 도심지의 영상에 대해 적용하므르 서 본 연구에서 제시된 관계영상정합이 실제 적용가능하다는 것을 입증하였다. 영상정합의 분야에서의 관계영상정합에 대한 이 연구는 기존의 영상정합법에 대한 장단점을 도 출하였으며, 수치사진측량 분야에서의 관계영상정합의 응용과 개발에 대한 향후의 연구방향을 제 시하였다.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2002년도 Proceedings of International Symposium on Remote Sensing
• /
• pp.34-39
• /
• 2002

Road information is very important for topographic mapping, transportation application, urban planning and other related application fields. Therefore, automatic detection of road networks from spatial imagery, such as aerial photos and satellite imagery can play a central role in road information acquisition. In this paper, we use least squares correlation matching alone for road center tracking and show that it works. We assumed that (bright) road centerlines would be visible in the image. We further assumed that within a same road segment, there would be only small differences in brightness values. This algorithm works by defining a template around a user-given input point, which shall lie on a road centerline, and then by matching the template against the image along the orientation of the road under consideration. Once matching succeeds, new match proceeds by shifting a matched target window further along road orientation at the target window. By repeating the process above, we obtain a series of points, which lie on a road centerline successively. A 1m resolution IKONOS images over Seoul and Daejeon were used for tests. The results showed that this algorithm could extract road centerlines in any orientation and help in fast and exact he ad-up digitization/vectorization of cartographic images.

• Journal of Information Processing Systems
• /
• 제8권3호
• /
• pp.389-398
• /
• 2012

Texture is an important visual feature for image analysis. Many approaches have been proposed to model and analyze texture features. Although these approaches significantly contribute to various image-based applications, most of these methods are sensitive to the changes in the scale and orientation of the texture pattern. Because textures vary in scale and orientations frequently, this easily leads to pattern mismatching if the features are compared to each other without considering the scale and/or orientation of textures. This paper suggests an Orientation Matching Scheme (OMS) to ease the problem of mismatching rotated patterns. In OMS, a pair of texture features will be compared to each other at various orientations to identify the best matched direction for comparison. A database including rotated texture images was generated for experiments. A synthetic retrieving experiment was conducted on the generated database to examine the performance of the proposed scheme. We also applied OMS to the similarity computation in a K-means clustering algorithm. The purpose of using K-means is to examine the scheme exhaustively in unpromising conditions, where initialized seeds are randomly selected and algorithms work heuristically. Results from both types of experiments show that the proposed OMS can help improve the performance when dealing with rotated patterns.

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

We proposes a new fingerprint minutia matching algorithm which matches the fingerprint minutiae by using local alignment. In general, fingerprint is deformed by Pressure and orientation when a user presses his fingerprint to the sensor. These nonlinear deformations change the position and the orientation of minutiae which decrease reliability of minutiae. Matching by using global alignment uses one alignment point. But, the problem with this method is that, due to the deformation, matching reliability of a minutia decreases as the distance from the alignment minutia increases. Matching by using local alignment overcomes this problem by considering minutiae which are located in a short distance boundary. Experimental results show that the performance of the proposed algorithm is superior to that of using global alignment.