• Journal of Information Processing Systems
• /
• 제15권1호
• /
• pp.22-33
• /
• 2019

This paper introduces an efficient fingerprint matching method based on multiple reference minutiae points. First, we attempt to effectively align two fingerprints by employing multiple reference minutiae points. However, the corresponding minutiae points between two fingerprints are ambiguous since a minutia of one fingerprint can be a match to any minutia of the other fingerprint. Therefore, we introduce a novel method based on linear classification concept to establish minutiae correspondences between two fingerprints. Each minutiae correspondence represents a possible alignment. For each possible alignment, a matching score is computed using minutiae and ridge orientation features and the maximum score is then selected to represent the similarity of the two fingerprints. The proposed method is evaluated using fingerprint databases, FVC2002 and FVC2004. In addition, we compare our approach with two existing methods and find that our approach outperforms them in term of matching accuracy, especially in the case of non-linear distorted fingerprints. Furthermore, the experiments show that our method provides additional advantages in low quality fingerprint images such as inaccurate position, missing minutiae, and spurious extracted minutiae.

• 정보과학회 논문지
• /
• 제43권5호
• /
• pp.509-515
• /
• 2016

순위패턴매칭문제는 텍스트 T와 패턴 P가 주어질 때, P와 각 문자들의 순위가 동일한 순서로 나타나는 T의 모든 부분문자열을 찾는 문제이다. 순위패턴매칭문제는 주가지수분석과 음악의 유사성분석과 같이 문자 자체를 비교하는 것보다 값의 변화순서가 중요한 분야에서 연구가 진행되었다. 순위다중패턴매칭문제는 텍스트 T와 여러 개의 패턴들로 이루어진 패턴집합 $\mathbb{P}$가 주어질 때, $\mathbb{P}$에 속한 패턴과 각 문자들의 순위가 동일한 순서로 나타나는 T의 모든 부분문자열을 찾는 문제이다. 본 논문에서는 순위다중패턴매칭문제를 해결하는 해싱기반 알고리즘을 제시한다.

• Journal of Information Processing Systems
• /
• 제13권2호
• /
• pp.256-267
• /
• 2017

An active research area in computer vision, stereo matching is aimed at obtaining three-dimensional (3D) information from a stereo image pair captured by a stereo camera. To extract accurate 3D information, a number of studies have examined stereo matching algorithms that employ adaptive support weight. Among them, the adaptive census transform (ACT) algorithm has yielded a relatively strong matching capability. The drawbacks of the ACT, however, are that it produces low matching accuracy at the border of an object and is vulnerable to noise. To mitigate these drawbacks, this paper proposes and analyzes the features of an improved stereo matching algorithm that not only enhances matching accuracy but also is also robust to noise. The proposed algorithm, based on the ACT, adopts the truncated absolute difference and the multiple sparse windows method. The experimental results show that compared to the ACT, the proposed algorithm reduces the average error rate of depth maps on Middlebury dataset images by as much as 2% and that is has a strong robustness to noise.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제51권8호
• /
• pp.335-343
• /
• 2002

A segment matching algorithm in stereo vision via the fusion of multiple features on long edge segments is proposed. One problem of the previous segment matching algorithm is the similarity among the segments caused from its short length. In the proposed algorithm, edges are composed of longer segments which are obtained by breaking the edges only at the locations with distinguished changes of the shape. Such long segments can contain extra features such as curvature ratio and length of segments which could not be included in shorter ones. Use of such additional features enhances the matching accuracy significantly To fuse multiple features for matching, weighting value determination algorithm which is computed according to the degree of the contribution of each factor is proposed. The stereo matching simulations with the proposed algorithm are done about various images and their results are included.

• ETRI Journal
• /
• 제34권1호
• /
• pp.87-97
• /
• 2012

This study presents an automatic matching method for generating a dense, accurate, and discontinuity-preserved digital surface model (DSM) using multiple images acquired by an aerial digital frame camera. The proposed method consists of two main procedures: area-based multi-image matching (AMIM) and stereo-pair epipolar line matching (SELM). AMIM evaluates the sum of the normalized cross correlation of corresponding image points from multiple images to determine the optimal height of an object point. A novel method is introduced for determining the search height range and incremental height, which are necessary for the vertical line locus used in the AMIM. This procedure also includes the means to select the best reference and target images for each strip so that multi-image matching can resolve the common problem over occlusion areas. The SELM extracts densely positioned distinct points along epipolar lines from the multiple images and generates a discontinuity-preserved DSM using geometric and radiometric constraints. The matched points derived by the AMIM are used as anchor points between overlapped images to find conjugate distinct points using epipolar geometry. The performance of the proposed method was evaluated for several different test areas, including urban areas.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권6호
• /
• pp.2811-2830
• /
• 2017

In this paper, we study the problem of mobile data offloading for a network that contains multiple mobile network operators (MNOs), multiple WiFi or femtocell access points (APs) and multiple mobile users (MUs). MNOs offload their subscribed MUs' data traffic by leasing the unused Internet connection bandwidth of third party APs. We propose a combinatorial auction-based two-stage matching mechanism comprised of MU-AP matching and AP-MNO matching. The MU-AP matching is designed to match the MUs to APs in order to maximize the total offloading data traffic and achieve better MU satisfaction. Conversely, for AP-MNO matching, MNOs compete for APs' service using the Nash bargaining solution (NBS) and the Vickrey auction theories and, in turn, APs will receive monetary compensation. We demonstrated that the proposed mechanism converges to a distributed stable matching result. Numerical results demonstrate that the proposed algorithm well capture the tradeoff among the total data traffic, social welfare and the QoS of MUs compared to other schemes. Moreover, the proposed mechanism can considerably offload the total data traffic and improve the network social welfare with less computation complexity and communication overhead.

• Communications for Statistical Applications and Methods
• /
• 제30권1호
• /
• pp.1-19
• /
• 2023

Observational data with missing or incomplete data are common in biomedical research. Multiple imputation is an effective approach to handle missing data with the ability to decrease bias while increasing statistical power and efficiency. In recent years propensity score (PS) matching has been increasingly used in observational studies to estimate treatment effect as it can reduce confounding due to measured baseline covariates. In this paper, we describe in detail approaches to competing risk analysis in the setting of incomplete observational data when using PS matching. First, we used multiple imputation to impute several missing variables simultaneously, then conducted propensity-score matching to match statin-exposed patients with those unexposed. Afterwards, we assessed the effect of statin exposure on the risk of heart failure-related hospitalizations or emergency visits by estimating both relative and absolute effects. Collectively, we provided a general methodological framework to assess treatment effect in incomplete observational data. In addition, we presented a practical approach to produce overall cumulative incidence function (CIF) based on estimates from multiple imputed and PS-matched samples.

• 제어로봇시스템학회논문지
• /
• 제15권5호
• /
• pp.548-554
• /
• 2009

We propose an automatic inspection system for hologram with multiple patterns. The system hardware consists of illuminations, camera, and vision processor. Multiple illuminations using LEDs are arranged in different directions to acquire each image of patterns. The system software consists of pre-processing, pattern generation, and pattern matching. The acquired images of input hologram are compared with their reference patterns by developed matching algorithm. To compensate for the positioning error of input hologram, reference patterns of hologram for different position should be generated in on-line. We apply a frequency transformation based CGH(computer-generated hologram) method to generate reference images. For the fast pattern matching, we also apply the matching method in the frequency domain. Experimental results for hologram of Korean currency are then presented to verify the usefulness of proposed system.

• 한국측량학회지
• /
• 제29권1호
• /
• pp.101-109
• /
• 2011

본 논문에서는 다중 항공영상을 이용한 영상정합기법과, 그 성능을 향상시키기 위한 시도들에 대해 기술한다. 일반적으로 영상간의 정합은 하나의 기준영상을 기준으로 다른 영상과의 밝기값 상관계수를 이용한 유사도 분석으로 진행된다. 제안된 다중 영상 정합기법 알고리즘은 처리할 지역을 일정크기의 구역으로 나누고 각 구역에서 가장 정사영상에 가까운 영상을 기준으로 하여 Object space상에서 처리할 수 있는 방식이다. 이 방식을 통해 영상의 위치에 상관없이 균등한 품질의 DEM이 생성 가능함을 확인할 수 있었다. 또한 차폐탐지 및 생성된 차폐지도를 통한 성능 향상 실험을 하였으며 그 결과 더욱 정확한 3차원 정보의 표현이 가능함을 확인할 수 있었다.

• Journal of the Korean Data and Information Science Society
• /
• 제18권2호
• /
• pp.279-287
• /
• 2007

Data fusion is the process of combining multiple data in order to produce information of tactical value to the user. Data fusion is generally defined as the use of techniques that combine data from multiple sources and gather that information in order to achieve inferences. Data fusion is also called data combination or data matching. Data fusion is divided in five branch types which are exact matching, judgemental matching, probability matching, statistical matching, and data linking. In this paper, we develop was macro program for statistical matching which is one of five branch types for data fusion. And then we apply data fusion and association rule techniques to environmental data.