• Journal of the Korea Society for Simulation
• /
• v.19 no.2
• /
• pp.157-164
• /
• 2010

While both functional verification and performance evaluation of a system are necessary for the development of effective and reliable communication systems, they have been usually performed individually through functional modeling with formal language tools and performance modeling with professional network performance evaluation tools, respectively. However, separate and duplicated modeling of a system may cause increase of the cost and inconsistency between the models. In order to overcome this problem, this paper proposes an integrated design technique that estimates the performance of a communication protocol designed in SDL with SDL-OPNET co-simulation. The proposed technique presents how to design a co-simulation system with the environment functions of Tau and the external system module of OPNET. InRes protocol was used as an example to show the applicability and usefulness of the proposed technique.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.4 no.2
• /
• pp.87-95
• /
• 2003

Dynamic Programming Matching (DPM) is a mathematical optimization technique for sequentially structured problems, which has, over the years, played a major role in providing primary algorithms in pattern recognition fields. Most practical applications of this method in signature verification have been based on the practical implementational version proposed by Sakoe and Chiba [9], and il usually applied as a case of slope constraint p = 0. We found, in this case, a modified version of DPM by applying a heuristic (forward seeking) implementation is more efficient, offering significantly reduced processing complexity as well as slightly improved verification performance.

• The KIPS Transactions:PartB
• /
• v.10B no.4
• /
• pp.451-458
• /
• 2003

Dynamic Programming Matching (DPM) is a mathematical optimization technique for sequentially structured problems, which has, over the years, played a major role in providing primary algorithms in pattern recognition fields. Most practical applications of this method in signature verification have been based on the practical implementational version proposed by Sakoe and Chiba [9], and is usually applied as a case of slope constraint p = 0. We found, in this case, a modified version of DPM by applying a heuristic (forward seeking) implementation is more efficient, offering significantly reduced processing complexity as well as slightly improved verification performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.4
• /
• pp.890-895
• /
• 2005

Dynamic (On-line) signature verification system consists of preprocessing, feature extraction, comparison and decision process for internal processing, and registration and verification windows for the user interface. We describe an implementation and design for an advanced dynamic signature verification system. Also, we suggest the method of feature extraction, matching algorithm, efficient user interface and an objective criteria for evaluating the performance.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.4E
• /
• pp.176-182
• /
• 2003

As the needs for wireless Internet service is increasing, the needs for secure m-commerce is also increasing. Conventional security techniques are reinforced by biometric security technique. This paper utilized the voice as biometric security techniques. We developed speaker verification system for m-commerce (mobile commerce) via wireless internet and wireless application protocol (WAP). We named this system the mVprotek. We implemented the system as client-server architecture. The clients are mobile phone simulator and personal digital assistant (PDA). The verification results are obtained by integrating the mVprotek system with SK Telecom's code dimension multiple access (CDMA) system. Utilizing f-ratio weighting and virtual cohort model normalization showed much better performance than conventional background model normalization technique.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.10a
• /
• pp.1045-1046
• /
• 2015

When using the Support Vector Machine in the online signature verification, SVM kernel function should be chosen to use non-linear SVM and the constant parameters in the kernel functions should be adjusted to appropriate values to reduce the error rate of signature verification. Non-linear SVM which is built on a strong mathematical basis shows better performance of classification with the higher discrimination power. However, choosing the kernel function and adjusting constant parameter values depend on the heuristics of the problem domain. In the signature verification, this paper deals with the problems of selecting the correct kernel function and constant parameters' values, and shows the kernel function and coefficient parameter's values with the minimum error rate. As a result of this research, we expect the average error rate to be less than 1%.

• Speech Sciences
• /
• v.9 no.2
• /
• pp.135-146
• /
• 2002

Generally a speaker verification system improves its system recognition ratio by regularizing log likelihood ratio, using a speaker model and its background speaker model that are required to be verified. The speaker-based cohort method is one of the methods that are widely used for selecting background speaker model. Recently, Gaussian-based cohort model has been suggested as a virtually synthesized cohort model, and unlike a speaker-based model, this is the method that chooses only the probability distributions close to basic speaker's probability distribution among the several neighboring speakers' probability distributions and thereby synthesizes a new virtual speaker model. It shows more excellent results than the existing speaker-based method. This study compared the existing speaker-based background speaker models and virtual speaker models and then constructed new virtual background speaker model groups which combined them in a certain ratio. For this, this study constructed a speaker verification system that uses GMM (Gaussin Mixture Model), and found that the suggested method of selecting virtual background speaker model shows more improved performance.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.2
• /
• pp.240-246
• /
• 2006

This paper proposes the intelligent immigration control system that authorizes the traveler through immigration and detects forged passports by using automatic recognition of passport codes, the passport photo and face verification. The proposed system extracts and deskewes the areas of passport codes from the passport image. This paper proposes the novel ART algorithm creating the adaptive clusters to the variations of input patterns and it is applied to the extracted code areas for the code recognition. After compensating heuristically the recognition result, the detection of forged passports is achieved by using the picture and face verification between the passport photo extracted from the passport image and the picture retrieved from the database based on the recognized codes. Due to the proposed ART algorithm and the heuristic refinement, the proposed system relatively shows better performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.9
• /
• pp.1781-1785
• /
• 2007

We propose a new enhanced graphical user interface and algorithm for dynamic signature verification using Smart-phone. Also, we describe the performance results of our dynamic signature verification system, which determine the authentication of signatures by comparing and analyzing various dynamic data shape of the signature, writing speed, slant of shape, and the order and number of strokes for personal signatures using an electronic pen, expecting the system to be understood and utilized widely in the industrial field.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.3
• /
• pp.938-957
• /
• 2023

The limited computing power of sensor nodes in wireless sensor networks (WSNs) and data tampering during wireless transmission are two important issues. In this paper, we propose a scheme for independent individual authentication of WSNs data based on digital watermarking technology. Digital watermarking suits well for WSNs, owing to its lower computational cost. The proposed scheme uses independent individual to generate a digital watermark and embeds the watermark in current data item. Moreover, a sink node extracts the watermark in single data and compares it with the generated watermark, thereby achieving integrity verification of data. Inherently, individual validation differs from the grouping-level validation, and avoids the lack of grouping robustness. The improved performance of individual integrity verification based on proposed scheme is validated through experimental analysis. Lastly, compared to other state-of-the-art schemes, our proposed scheme significantly reduces the false negative rate by an average of 5%, the false positive rate by an average of 80% of data verification, and increases the correct verification rate by 50% on average.