• Title/Summary/Keyword: Decision templates

Search Result 8, Processing Time 0.055 seconds

Fingerprint Classification using Multiple Decision Templates with SVM (SVM의 다중결정템플릿을 이용한 지문분류)

  • Min Jun-Ki;Hong Jin-Hyuk;Cho Sung-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.11
    • /
    • pp.1136-1146
    • /
    • 2005
  • Fingerprint classification is useful in an automated fingerprint identification system (AFIS) to reduce the matching time by categorizing fingerprints. Based on Henry system that classifies fingerprints into S classes, various techniques such as neural networks and support vector machines (SVMs) have been widely used to classify fingerprints. Especially, SVMs of high classification performance have been actively investigated. Since the SVM is binary classifier, we propose a novel classifier-combination model, multiple decision templates (MuDTs), to classily fingerprints. The method extracts several clusters of different characteristics from samples of a class and constructs a suitable combination model to overcome the restriction of the single model, which may be subject to the ambiguous images. With the experimental results of the proposed on the FingerCodes extracted from NIST Database4 for the five-class and four-class problems, we have achieved a classification accuracy of $90.4\%\;and\;94.9\%\;with\;1.8\%$ rejection, respectively.

Fingerprint Classification Using SVM Combination Models based on Multiple Decision Templates (다중결정템플릿기반 SVM결합모델을 통한 지문분류)

  • Min Jun-Ki;Hong Jin-Hyuk;Cho Sung-Bae
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.07b
    • /
    • pp.751-753
    • /
    • 2005
  • 지문을 5가지 클래스로 나누는 헨리시스템을 기반으로 신경망이나 SVM(Support Vector Machines) 등과 같은 다양한 패턴분류 기법들이 지문분류에 많이 사용되고 있다. 특히 최근에는 높은 분류 성능을 보이는 SVM 분류기의 결합을 이용한 연구가 활발히 진행되고 있다. 지문은 클래스 구분이 모호한 영상이 많아서 단일결합모델로는 분류에 한계가 있다. 이를 위해 본 논문에서는 새로운 분류기 결합모델인 다중결정템플릿(Multiple Decision Templates, MuDTs)을 제안한다. 이 방법은 하나의 지문클래스로부터 서로 다른 특성을 갖는 클러스터들을 추출하여 각 클러스터에 적합한 결합모델을 생성한다. NIST-database4 데이터로부터 추출한 핑거코드에 대해 실험한 결과. 5클래스와 4클래스 분류문제에 대하여 각각 $90.4\%$$94.9\%$의 분류성능(거부율 $1.8\%$)을 획득하였다.

  • PDF

Scenarios for Manufacturing Process Data Analysis using Data Mining (데이터 마이닝을 이용한 생산공정 데이터 분석 시나리오)

  • Lee, Hyoung-wook;Bae, Sung-min
    • Journal of Institute of Convergence Technology
    • /
    • v.3 no.1
    • /
    • pp.41-44
    • /
    • 2013
  • Process and manufacturing data are numerously accumulated to the enterprise database in industries but little of those data are utilized. Data mining can support a decision to manager in process from the data. However, it is not easy to field managers because a proper adoption of various schemes is very difficult. In this paper, six scenarios are conducted using data mining schemes for the various situations of field claims such as yield problem, trend analysis and prediction of yield according to changes of operating conditions, etc. Scenarios, like templates, of various analysis situations are helpful to users.

  • PDF

A Systematic Process for Designing Core Asset in Product Line Engineering (프로덕트라인 공학에서의 체계적인 핵심 자산 설계 프로세스)

  • La, Hyun-Jung;Kim, Soo-Dong
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.10
    • /
    • pp.896-914
    • /
    • 2006
  • Product line engineering (PLE) is one of the most recent and emerging reuse approaches in software engineering. Core asset, which is a reusable unit of PLE, is shared by several members in a product line (PL). So, developing a well-defined core asset is a prerequisite to increase productivity and time-to-market. Existing PLE methodologies emphasize the importance of core asset but mainly focus on analyzing core asset. And, several processes for designing core asset do not fully cover all elements of core asset which is from product line architecture (PLA) to decision model and need to augment systematic process, detailed instructions, and templates of artifacts. These problems result in difficulty with designing core asset and applying PLE. In this paper, we present an overall process and templates of artifacts to design core assets. And, we apply proposed process to a case study in order to show its applicability. With the proposed process, detailed instructions, and templates of artifacts, we believe that we can more systematically and more easily design high-quality core assets and we fully cover product line architecture, component, and decision model when designing a core asset.

Secure Face Authentication Framework in Open Networks

  • Lee, Yong-Jin;Lee, Yong-Ki;Chung, Yun-Su;Moon, Ki-Young
    • ETRI Journal
    • /
    • v.32 no.6
    • /
    • pp.950-960
    • /
    • 2010
  • In response to increased security concerns, biometrics is becoming more focused on overcoming or complementing conventional knowledge and possession-based authentication. However, biometric authentication requires special care since the loss of biometric data is irrecoverable. In this paper, we present a biometric authentication framework, where several novel techniques are applied to provide security and privacy. First, a biometric template is saved in a transformed form. This makes it possible for a template to be canceled upon its loss while the original biometric information is not revealed. Second, when a user is registered with a server, a biometric template is stored in a special form, named a 'soft vault'. This technique prevents impersonation attacks even if data in a server is disclosed to an attacker. Finally, a one-time template technique is applied in order to prevent replay attacks against templates transmitted over networks. In addition, the whole scheme keeps decision equivalence with conventional face authentication, and thus it does not decrease biometric recognition performance. As a result, the proposed techniques construct a secure face authentication framework in open networks.

A Covariance-matching-based Model for Musical Symbol Recognition

  • Do, Luu-Ngoc;Yang, Hyung-Jeong;Kim, Soo-Hyung;Lee, Guee-Sang;Dinh, Cong Minh
    • Smart Media Journal
    • /
    • v.7 no.2
    • /
    • pp.23-33
    • /
    • 2018
  • A musical sheet is read by optical music recognition (OMR) systems that automatically recognize and reconstruct the read data to convert them into a machine-readable format such as XML so that the music can be played. This process, however, is very challenging due to the large variety of musical styles, symbol notation, and other distortions. In this paper, we present a model for the recognition of musical symbols through the use of a mobile application, whereby a camera is used to capture the input image; therefore, additional difficulties arise due to variations of the illumination and distortions. For our proposed model, we first generate a line adjacency graph (LAG) to remove the staff lines and to perform primitive detection. After symbol segmentation using the primitive information, we use a covariance-matching method to estimate the similarity between every symbol and pre-defined templates. This method generates the three hypotheses with the highest scores for likelihood measurement. We also add a global consistency (time measurements) to verify the three hypotheses in accordance with the structure of the musical sheets; one of the three hypotheses is chosen through a final decision. The results of the experiment show that our proposed method leads to promising results.

The Recognition and Segmentation of the Road Surface State using Wavelet Image Processing (웨이블릿 영상처리에 의한 도로표면상태 인식 및 분류)

  • Han, Tae-Hwan;Ryu, Seung-Ki;Song, Wonseok;Lee, Seung-Rae
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.22 no.4
    • /
    • pp.26-34
    • /
    • 2008
  • This study focus on segmentation process that classifies road surfaces into 5 different categories, dry, wet water, icy, and snowy surfaces by analyzing asphalt-paved road images taken in daylight. By using the polarization coefficients, the proportions of horizontally polarized components to vertically polarized components, regions with over 1.3 polarization coefficients are classified as wet surfaces. Except for wet surfaces, the decision process a lies time-frequency analysis to other parts by using the third order wavelet packet transform. In addition, by using the average frequency characteristics of dry and icy surfaces from image templates, decide which is closer to a test image, and finally identify dry and icy surfaces. It is confirmed that the reposed estimation and segmentation of recognition on various images. This can be interpreted as an indication that image-only mad surface condition supervision is probable.

Detection of Onset and Offset Time of Muscle Activity in Surface EMG using the Kalman Smoother

  • Lee Jung-Hoon;Lee Hyun-Sook;Lee Young-Hee;Yoon Young-Ro
    • Journal of Biomedical Engineering Research
    • /
    • v.27 no.3
    • /
    • pp.131-141
    • /
    • 2006
  • A visual decision by clinical experts like physical therapists is a best way to detect onset and offset time of muscle activation. The current computer-based algorithms are being researched toward similar results of clinical experts. The new algorithm in this paper has an ability to extract a trend from noisy input data. Kalman smoother is used to recognize the trend to be revealed from disorderly signals. Histogram of smoothed signals by Kalman smoother has a clear boundary to separate muscle contractions from relaxations. To verify that the Kalman smoother algorithm is reliable way to detect onset and offset time of muscle contractions, the algorithm of Robert P. Di Fabio (published in 1987) is compared with Kalman smoother. For 31 templates of subjects, an average and a standard deviation are compared. The average of errors between Di Fabio's algorithm and experts is 109 milliseconds in onset detection and 142 milliseconds in offset detection. But the average between Kalman smoother and experts is 90 and 137 milliseconds in each case. Moreover, the standard deviations of errors are 133 (onset) and 210 (offset) milliseconds in Di Fabio's one, but 48 (onset) and 55 (offset) milliseconds in Kalman smoother. As a result, the Kalman smoother is much closer to determinations of clinical experts and more reliable than Di Fabio's one.