• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2010.11a
• /
• pp.519-520
• /
• 2010

• Journal of Information Processing Systems
• /
• v.15 no.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.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.28 no.4
• /
• pp.475-480
• /
• 2004

Function approximation is one of the most important and active research fields in design optimization. Accurate function approximations can reduce the repetitive computational effort fur system analysis. So this study presents an enhanced two-point diagonal quadratic approximation method. The proposed method is based on the Two-point Diagonal Quadratic Approximation method. But unlike TDQA, the suggested method has two quadratic terms, the diagonal term and the correction term. Therefore this method overcomes the disadvantage of TDQA when the derivatives of two design points are same signed values. And in the proposed method, both the approximate function and derivative values at two design points are equal to the exact counterparts whether the signs of derivatives at two design points are the same or not. Several numerical examples are presented to show the merits of the proposed method compared to the other forms used in the literature.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.639-642
• /
• 1999

There exist geometrically invariant relations in single-view images under a specific geometrical structure. This invariance may be utilized for 3D object recognition. Two types of invariants are compared in terms of the robustness to the variation of the feature points. Deviation of the invariant relations are measured by adding random noise to the feature point location. Zhu’s invariant requires six points on adjacent planes having two sets of four coplanar points, whereas the Kaist method requires four coplanar points and two non-coplanar points. Experimental results show that the latter method has the advantage in choosing feature points while suffering from weak robustness to the noise.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.11 no.6
• /
• pp.361-367
• /
• 2016

In this paper, we propose an improved single view metrology (SVM) algorithm to accurately measure the height of objects. In order to accurately measure the size of objects, vanishing points have to be correctly estimated. There are two methods to estimate vanishing points. First, the user has to choose some horizontal and vertical lines in real world. Then, the user finds the cross points of the lines. Second, the user can obtain the vanishing points by using software algorithm such as [6-9]. In the former method, the user has to choose the lines manually to obtain accurate vanishing points. On the other hand, the latter method uses software algorithm to automatically obtain vanishing points. In this paper, we apply image resizing and edge sharpening as a pre-processing to the algorithm in order to improve performance. The estimated vanishing points algorithm create four vanishing point candidates: two points are horizontal candidates and the other two points are vertical candidates. However, a common image has two horizontal vanishing points and one vertical vanishing point. Thus, we eliminate a vertical vanishing point candidate by analyzing the histogram of angle distribution of vanishing point candidates. Experimental results show that the proposed algorithm outperforms conventional methods, [6] and [7]. In addition, the algorithm obtains similar performance with manual method with less than 5% of the measurement error.

• International Journal of CAD/CAM
• /
• v.13 no.1
• /
• pp.1-11
• /
• 2013

Just by adjusting the control points iteratively, progressive iterative approximation (PIA) presents an intuitive and straightforward scheme such that the resulting limit curve (surface) can interpolate the original data points. In order to obtain more flexibility, adjusting only a subset of the control points, a new method called local progressive iterative approximation (LPIA) has also been proposed. But to this day, there are two problems about PIA and LPIA: (1) Only an approximation process is discussed, but the accurate convergence curves (surfaces) are not given. (2) In order to obtain an interpolating curve (surface) with high accuracy, recursion computations are needed time after time, which result in a large workload. To overcome these limitations, this paper gives an explicit matrix expression of the control points of the limit curve (surface) by the PIA or LPIA method, and proves that the column vector consisting of the control points of the PIA's limit curve (or surface) can be obtained by multiplying the column vector consisting of the original data points on the left by the inverse matrix of the collocation matrix (or the Kronecker product of the collocation matrices in two direction) of the blending basis at the parametric values chosen by the original data points. Analogously, the control points of the LPIA's limit curve (or surface) can also be calculated by one-step. Furthermore, the $G^1$ joining conditions between two adjacent limit curves obtained from two neighboring data points sets are derived. Finally, a simple LPIA method is given to make the given tangential conditions at the endpoints can be satisfied by the limit curve.

• 한국전산유체공학회:학술대회논문집
• /
• 2000.10a
• /
• pp.46-53
• /
• 2000

To improve the performance at all design points, multi-point optimization method is implemented for the nose fairing shape design of space launcher. The response surface method is used to effectively reduce the huge computational loads during the optimization process. The drag is selected as the objective function, and the surface heat transfer characteristics, and the internal volume of the nose fairing ate considered as design constraints. Full Wavier-Stokes equations are selected as governing equations. Two points drag minimization, and two points drag / heat flux optimization were successfully performed and configurations which have good performance for the wide operation range were derived. By considering three design points, the space launcher shape which undergoes the least drag during whole flight mission was designed. For all the design cases, the constructed response surfaces show good confidence level with only 23 design points with the proper stretching of the design space.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.3140-3149
• /
• 1999

Skew correction for document images can be using a rotational transformation of pixel coordinates. In this paper we propose a method which corrects the document skew, by an amount of $\theta$ degrees, using block information, where the block is defined as a rectangular area containing adjacent black pixels. Processing speed of the proposed method is faster than that of the method using pixel transformation, since the number of floating-point operations can be reduced significantly. In the proposed method, we rotate only the four corner points of each block, and then identify the pixels inside the block. Two methods for inside pixel identification are proposed; the first method finds two points intersecting the boundary of the rotated block in each row, and determines the pixels between the two intersection points as the inside pixel. The second method finds boundary points based on Bresenham's line drawing algorithm, using fixed-point operation, and fills the region surrounded by these boundaries as black pixels. We have measured the performance of the proposed method by experimenting it with 2,016 images of various English and Korean documents. We have also proven the superiority of our algorithm through performance comparison with respect to existing methods based on pixel transformation.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.1192-1197
• /
• 1991

This paper describes a method of extracting the 3-D coordinates of feature points of an object from two images taken by one camera. The first image is from a CCD camera before approaching the object and the second image is from same camera after approaching the object along the optical axis. In the two images, the feature points appear at different position on the screen due to image enlargement. From the change of positions of feature points their world coordinates are calculated. In this paper, the correspondence problem is solved by image shrinking and correlation.

• Industrial Engineering and Management Systems
• /
• v.9 no.4
• /
• pp.323-338
• /
• 2010

In this paper, we introduce the implied volatility from Black-Scholes model and suggest a model for constructing implied volatility surfaces by using the two-dimensional cubic (bi-cubic) spline. In order to utilize a spline method, we acquire grid (knot) points. To this end, we first extract implied volatility curves weighted by trading contracts from market option data and calculate grid points from the extracted curves. At this time, we consider several conditions to avoid arbitrage opportunity. Then, we establish an implied volatility surface, making use of the two-dimensional cubic spline method with previously estimated grid points. The method is shown to satisfy several properties of the implied volatility surface (smile, skew, and flattening) as well as avoid the arbitrage opportunity caused by simple match with market data. To show the merits of our proposed method, we conduct simulations on market data of S&P500 index European options with reasonable and acceptable results.