• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.283-293
• /
• 2010

In this paper, inverse constrained minimum spanning tree problem under Hamming distance. Such an inverse problem is to modify the weights with bound constrains so that a given feasible solution becomes an optimal solution, and the deviation of the weights, measured by the weighted Hamming distance, is minimum. We present a strongly polynomial time algorithm to solve the inverse constrained minimum spanning tree problem under Hamming distance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.3
• /
• pp.554-559
• /
• 2009

This paper proposes a new method of weighted template matching fur machine-printed numeral recognition. The proposed weighted template matching, which emphasizes the feature of a pattern using adaptive Hamming distance on local feature areas, improves the recognition rate while template matching processes an input image as one global feature. The experiment compares confusion matrices of the template matching, error back propagation neural network classifier, and the proposed weighted template matching respectively. The result shows that the proposed method improves fairly the recognition rate of the machine-printed numerals.

• Journal of Intelligence and Information Systems
• /
• v.13 no.4
• /
• pp.35-44
• /
• 2007

This paper proposes a new method of weighted template matching for machine-printed numeral recognition. The proposed weighted template matching, which emphasizes the feature of a pattern using adaptive Hamming distance on local feature areas, improves the recognition rate while template matching processes an input image as one global feature. Template matching is vulnerable to random noises that generate ragged outlines of a pattern when it is binarized. This paper offers a method of chain code trimming in order to remove ragged outlines. The method corrects specific chain codes within the chain codes of the inner and the outer contour of a pattern. The experiment compares confusion matrices of both the template matching and the proposed weighted template matching with chain code trimming. The result shows that the proposed method improves fairly the recognition rate of the machine-printed numerals.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.2
• /
• pp.1-8
• /
• 1992

This paper is proposed a Modified WLD (Weighted Levenshtein Distance) algorithm for processor desihn of code-string matching. A proposed MWLD (Modified Weighted Levenshtein Distance) algorithm is consist of 1-dimension bit-serial array processor to pattern matching using a Hamming Distance. The proposed processor is applied to recognition of character with real time input. The recognition rate of Hangul strokes is resulted to 98.65$\%$

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.9
• /
• pp.29-37
• /
• 1998

In weighted random pattern testing it is an important issue to find the optimal weight sets for achieving a high fault coverage using a small number of weighted random patterns. In this paper, a new weight set optimization algorithm is developed, which can generate the optimal weight sets in an efficient way using the sampling probabilities of deterministic tests patterns. In addition, the simulation based method of finding the proper maximum Hamming distance is presented. Experimental results for ISCAS 85 benchmark circuits prove the effectiveness of the new weight set optimization algorithm and the method of finding the proper maximum Hamming distance.

• Journal of Intelligence and Information Systems
• /
• v.13 no.4
• /
• pp.65-78
• /
• 2007

This paper proposes a new method of weighted template matching for machine-printed numeral recognition. The proposed weighted template matching, which emphasizes the feature of a pattern using adaptive Hamming distance on local feature areas, improves the recognition rate while template matching processes an input image as one global feature. Template matching is vulnerable to random noises that generate ragged outlines of a pattern when it is binarized. This paper offers a method of chain code trimming in order to remove ragged outlines. The method corrects specific chain codes within the chain codes of the inner and the outer contour of a pattern. The experiment compares confusion matrices of both the template matching and the proposed weighted template matching with chain code trimming. The result shows that the proposed method improves fairly the recognition rate of the machine-printed numerals.

• Proceedings of the KAIS Fall Conference
• /
• 2005.05a
• /
• pp.180-183
• /
• 2005

본 논문에서는 인쇄체 아라비아 숫자를 인식하기 위해 가중 템플릿 정합 방법을 제안한다. 가중 템플릿 정합은 패턴의 특징이 나타나는 영역에 해밍거리(Hamming Distance) 의 가중치를 두어 패턴 특징을 강조하여 숫자 패턴의 인식률을 높이는 것이다. 또한 패턴의 표면을 울퉁불퉁한 영상으로 만드는 한 두 픽셀의 랜덤 노이즈를 제거하기 위하여 본 연구에서는 트리밍(trimming) 기법을 적용하였다. 실험에서는 트리밍을 하지 않고 단순 템플릿 정합을 사용했을 때의 혼돈 행렬(confusion matrix)과 트리밍을 한 후 가중 템플릿 정합을 사용했을 때 혼돈 행렬을 서로 비교해 인식률이 크게 향상된 것을 보인다.

• Journal of Korea Multimedia Society
• /
• v.23 no.1
• /
• pp.8-14
• /
• 2020

For a reliable fingerprinting system, improving fingerprint matching accuracy is crucial. In this paper, we try to improve a binary image fingerprint matching performance by utilizing auxiliary information, power mask, which is obtained while constructing fingerprint DB. The power mask is an expected robustness of each fingerprint bit. A caveat of the power mask is the increased storage cost of the fingerprint DB. This paper mitigates the problem by reducing the size of the power mask utilizing spatial correlation of an image. Experiments on a publicly-available image dataset confirmed that the power mask is effective in improving fingerprint matching accuracy.

• KIPS Transactions on Software and Data Engineering
• /
• v.2 no.2
• /
• pp.119-122
• /
• 2013

Repetitive strings such as periods have been studied vigorously in so diverse fields as data compression, computer-assisted music analysis, bioinformatics, and etc. In bioinformatics, periods are highly related to repetitive patterns in DNA sequences so called tandem repeats. In some cases, quite similar but not the same patterns are repeated and thus we need approximate string matching algorithms to study tandem repeats in DNA sequences. In this paper, we propose a new definition of approximate periods of strings based on distance sum. Given two strings $p({\mid}p{\mid}=m)$ and $x({\mid}x{\mid}=n)$, we propose an algorithm that computes the minimum approximate period distance based on distance sum. Our algorithm runs in $O(mn^2)$ time for the weighted edit distance, and runs in O(mn) time for the edit distance, and runs in O(n) time for the Hamming distance.

• The Journal of the Acoustical Society of Korea
• /
• v.38 no.6
• /
• pp.716-723
• /
• 2019

Fingerprint matching accuracy is essential in deploying a music search service. This paper deals with a method to improve fingerprint matching accuracy by utilizing an auxiliary information which is called power weight. Power weight is an expected robustness of each hash bit. While the previous power mask binarizes the expected robustness into strong and weak bits, the proposed method utilizes a real-valued function of the expected robustness as weights for fingerprint matching. As a countermeasure to the increased storage cost, we propose a compression method for the power weight which has strong temporal correlation. Experiments on the publicly-available music datasets confirmed that the proposed power weight is effective in improving fingerprint matching performance.