• The Korean Journal of Applied Statistics
• /
• v.25 no.6
• /
• pp.1027-1036
• /
• 2012

Among various biometrics recognition systems, statistical fingerprint recognition matching methods are considered using minutiae on fingerprints. We define similarity distance measures based on the coordinate and angle of the minutiae, and suggest a fingerprint recognition model following statistical distributions. We could obtain confidence intervals of similarity distance for the same and different persons, and optimal thresholds to minimize two kinds of error rates for distance distributions. It is found that the two confidence intervals of the same and different persons are not overlapped and that the optimal threshold locates between two confidence intervals. Hence an alternative statistical matching method can be suggested by using nonoverlapped confidence intervals and optimal thresholds obtained from the distributions of similarity distances.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.143-146
• /
• 1996

In this paper, we propose a hopfield model for solving the part-matching which is the number of parts and positions are changed. The goal of this paper is to minimize part-connection in pairs and net total path of part-connection. Therefore, this kind of problem is referred to as a combinatorial optimization problem. First of all, we review the theoretical basis for hopfield model to optimization and present two method of part-matching; Traveling Salesman Problem (TSP) and Weighted Matching Problem (WMP). Finally, we show demonstration through computer simulation and analyzes the stability and feasibility of the generated solutions for the proposed connection methods.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.8
• /
• pp.122-129
• /
• 1997

In this paper, we propose a Hopfield model for solving the part-matching in case that is the number of parts and positions are changed. The goal of this paper is to minimize part-connection in pairs and total path of part-connections. Therefore, this kind of problem is referred to as a combinatiorial optimization problem. First of all, we review the theoretical basis for Hopfield model and present two optimal algorithms of part-matching. The first algorithm is Traveling Salesman Problem(TSP) which improved the original and the second algorithm is Wdighted Matching Problem (WMP). Finally, we show demonstration through com- puter simulation and analyze the stability and feasibility of the generated solutions for the proposed con- nection methods. Therefore, we prove that the second algorithm is better than the first algorithm.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.12
• /
• pp.659-666
• /
• 2000

A stereo matching has been an important tool for reconstructing three dimensional terrain. By using stereo matching technique, DEM(Digital Elevaton Map) can be generated by the disparity from a reference image to a target image. Generally disparity map can be evaluated by matching the reference image to the target image and if the role of the reference and the target are interchanged, a different DEM can be obtained. In this paper, we propose a new fusion technique to estimate the optimal DEM by eliminating the false DEM due to occlusion. To detect the false DEM, we utilize two measure of accuracy: self-consistency and cross-correlation score. We test the effectiveness of the proposed methods with a quantitative analysis using simulated images. Experimental result indicate that the proposed methods show 24.4% and 33.1% improvement over either DEM.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• 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.

• Journal of information and communication convergence engineering
• /
• v.7 no.4
• /
• pp.453-458
• /
• 2009

This paper presents two methods of designing a Broadband Impedance Matching (BIM) circuit for maximizing a power line communication (PLC) equipment (or Modem) signal injection into its load at any power line connection port. This optimal (BIM) circuit design is achieved in two phases: Butterworth gain function and Tchebycheff gain function. According to the comparison of simulation and practical results, the performances of two gain functions on BIM are discussed.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.47-51
• /
• 2005

Using satellite images, an optimal solution to water motion has been presented in this study. Since temperature patterns are suitable tracers in water motion, Sea Surface Temperature (SST) images of Caspian Sea taken by MODIS sensor on board Terra satellite have been used in this study. Two daily SST images with 24 hours time interval are used as input data. Computation of templates correspondence between pairs of images is crucial within motion algorithms using non-rigid body objects. Image matching methods have been applied to estimate water body motion within the two SST images. The least squares matching technique, as a flexible technique for most data matching problems, offers an optimal spatial solution for the motion estimation. The algorithm allows for simultaneous local radiometric correction and local geometrical image orientation estimation. Actually, the correspondence between the two image templates is modeled both geometrically and radiometrically. Geometric component of the model includes six geometric transformation parameters and radiometric component of the model includes two radiometric transformation parameters. Using the algorithm, the parameters are automatically corrected, optimized and assessed iteratively by the least squares algorithm. The method used in this study, has presented more efficient and robust solution compared to the traditional motion estimation schemes.

• Journal of Computing Science and Engineering
• /
• v.10 no.2
• /
• pp.68-73
• /
• 2016

An efficient texture compression method is proposed based on a block matching process between the current block and the previously encoded blocks. Texture mapping is widely used to improve the quality of rendering results in real-time applications. For fast texture mapping, it is important to find an optimal trade-off between compression efficiency and computational complexity. Low-complexity methods (e.g., ETC1 and DXT1) have often been adopted in real-time rendering applications because conventional compression methods (e.g., JPEG) achieve a high compression ratio at the cost of high complexity. We propose a block matching-based compression method that can achieve a higher compression ratio than ETC1 and DXT1 while maintaining computational complexity lower than that of JPEG. Through a comparison between the proposed method and existing compression methods, we confirm our expectations on the performance of the proposed method.

• Journal of Korea Multimedia Society
• /
• v.7 no.11
• /
• pp.1505-1514
• /
• 2004

Sequence matching in time-series databases is an operation that finds the data sequences whose changing patterns are similar to that of a query sequence. Typically, sequence matching hires a multi-dimensional index for its efficient processing. In order to alleviate the dimensionality curse problem of the multi-dimensional index in high-dimensional cases, the previous methods for sequence matching apply the Discrete Fourier Transform(DFT) to data sequences, and take only the first two or three DFT coefficients as organizing attributes of the multi-dimensional index. This paper first points out the problems in such simple methods taking the firs two or three coefficients, and proposes a novel solution to construct the optimal multi -dimensional index. The proposed method analyzes the characteristics of a target database, and identifies the organizing attributes having the best discrimination power based on the analysis. It also determines the optimal number of organizing attributes for efficient sequence matching by using a cost model. To show the effectiveness of the proposed method, we perform a series of experiments. The results show that the Proposed method outperforms the previous ones significantly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7A
• /
• pp.646-653
• /
• 2010

This paper provides a unified framework for the joint optimal subchannel and power allocation in multi-hop relay network, where each node in the network has multiple parallel subchannels such as in OFDM or MIMO system. When there are multiple parallel subchannels between nodes, the relay node decides how to match the subchannel at the first hop with the one at the second hop aside from determining the power allocation. Joint optimal design of subchannel matching and power allocation is, in general, known to be very difficult to solve due to the combinatorial nature involved in subchannel matching. Despite this difficulty, we use a simple rearrangement inequality and show that seemingly difficult problems can be efficiently solved. This includes several existing solution methods as special cases. We also provide various design examples to show the effectiveness of the proposed framework.