• Title/Summary/Keyword: Feature extraction algorithm

Search Result 877, Processing Time 0.03 seconds

Decision Tree Learning Algorithms for Learning Model Classification in the Vocabulary Recognition System (어휘 인식 시스템에서 학습 모델 분류를 위한 결정 트리 학습 알고리즘)

  • Oh, Sang-Yeob
    • Journal of Digital Convergence
    • /
    • v.11 no.9
    • /
    • pp.153-158
    • /
    • 2013
  • Target learning model is not recognized in this category or not classified clearly failed to determine if the vocabulary recognition is reduced. Form of classification learning model is changed or a new learning model is added to the recognition decision tree structure of the model should be changed to a structural problem. In order to solve these problems, a decision tree learning model for classification learning algorithm is proposed. Phonological phenomenon reflected sound enough to configure the database to ensure learning a decision tree learning model for classifying method was used. In this study, the indoor environment-dependent recognition and vocabulary words for the experimental results independent recognition vocabulary of the indoor environment-dependent recognition performance of 98.3% in the experiment showed, vocabulary independent recognition performance of 98.4% in the experiment shown.

Fault Diagnosis of 3 Phase Induction Motor Drive System Using Clustering (클러스터링 기법을 이용한 3상 유도전동기 구동시스템의 고장진단)

  • Park, Jang-Hwan;Kim, Sung-Suk;Lee, Dae-Jong;Chun, Myung-Geun
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.18 no.6
    • /
    • pp.70-77
    • /
    • 2004
  • In many industrial applications, an unexpected fault of induction motor drive systems can cause serious troubles such as downtime of the overall system heavy loss, and etc. As one of methods to solve such problems, this paper investigates the fault diagnosis for open-switch damages in a voltage-fed PWM inverter for induction motor drive. For the feature extraction of a fault we transform the current signals to the d-q axis and calculate mean current vectors. And then, for diagnosis of different fault patterns, we propose a clustering based diagnosis algorithm The proposed diagnostic technique is a modified ANFIS(Adaptive Neuro-Fuzzy Inference System) which uses a clustering method on the premise of general ANFIS's. Therefore, it has a small calculation and good performance. Finally, we implement the method for the diagnosis module of the inverter with MATLAB and show its usefulness.

Development of Statistical/Probabilistic-Based Adaptive Thresholding Algorithm for Monitoring the Safety of the Structure (구조물의 안전성 모니터링을 위한 통계/확률기반 적응형 임계치 설정 알고리즘 개발)

  • Kim, Tae-Heon;Park, Ki-Tae
    • Journal of the Korea institute for structural maintenance and inspection
    • /
    • v.20 no.4
    • /
    • pp.1-8
    • /
    • 2016
  • Recently, buildings tend to be large size, complex shape and functional. As the size of buildings is becoming massive, the need for structural health monitoring(SHM) technique is ever-increasing. Various SHM techniques have been studied for buildings which have different dynamic characteristics and are influenced by various external loads. Generally, the visual inspection and non-destructive test for an accessible point of structures are performed by experts. But nowadays, the system is required which is online measurement and detect risk elements automatically without blind spots on structures. In this study, in order to consider the response of non-linear structures, proposed a signal feature extraction and the adaptive threshold setting algorithm utilized to determine the abnormal behavior by using statistical methods such as control chart, root mean square deviation, generalized extremely distribution. And the performance of that was validated by using the acceleration response of structures during earthquakes measuring system of forced vibration tests and actual operation.

3D Face Recognition using Projection Vectors for the Area in Contour Lines (등고선 영역의 투영 벡터를 이용한 3차원 얼굴 인식)

  • 이영학;심재창;이태홍
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.2
    • /
    • pp.230-239
    • /
    • 2003
  • This paper presents face recognition algorithm using projection vector reflecting local feature for the area in contour lines. The outline shape of a face has many difficulties to distinguish people because human has similar face shape. For 3 dimensional(3D) face images include depth information, we can extract different face shapes from the nose tip using some depth values for a face image. In this thesis deals with 3D face image, because the extraction of contour lines from 2 dimensional face images is hard work. After finding nose tip, we extract two areas in the contour lilies from some depth values from 3D face image which is obtained by 3D laser scanner. And we propose a method of projection vector to localize the characteristics of image and reduce the number of index data in database. Euclidean distance is used to compare of similarity between two images. Proposed algorithm can be made recognition rate of 94.3% for face shapes using depth information.

  • PDF

An Adaptive Method For Face Recognition Based Filters and Selection of Features (필터 및 특징 선택 기반의 적응형 얼굴 인식 방법)

  • Cho, Byoung-Mo;Kim, Gi-Han;Rhee, Phill-Kyu
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.6
    • /
    • pp.1-8
    • /
    • 2009
  • There are a lot of influences, such as location of camera, luminosity, brightness, and direction of light, which affect the performance of 2-dimensional image recognition. This paper suggests an adaptive method for face-image recognition in noisy environments using evolvable filtering and feature extraction which uses one sample image from camera. This suggested method consists of two main parts. One is the environmental-adjustment module which determines optimum sets of filters, filter parameters, and dimensions of features by using "steady state genetic algorithm". The other another part is for face recognition module which performs recognition of face-image using the previous results. In the processing, we used Gabor wavelet for extracting features in the images and k-Nearest Neighbor method for the classification. For testing of the adaptive face recognition method, we tested the adaptive method in the brightness noise, in the impulse noise and in the composite noise and verified that the adaptive method protects face recognition-rate's rapidly decrease which can be occurred generally in the noisy environments.

FRS-OCC: Face Recognition System for Surveillance Based on Occlusion Invariant Technique

  • Abbas, Qaisar
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.8
    • /
    • pp.288-296
    • /
    • 2021
  • Automated face recognition in a runtime environment is gaining more and more important in the fields of surveillance and urban security. This is a difficult task keeping in mind the constantly volatile image landscape with varying features and attributes. For a system to be beneficial in industrial settings, it is pertinent that its efficiency isn't compromised when running on roads, intersections, and busy streets. However, recognition in such uncontrolled circumstances is a major problem in real-life applications. In this paper, the main problem of face recognition in which full face is not visible (Occlusion). This is a common occurrence as any person can change his features by wearing a scarf, sunglass or by merely growing a mustache or beard. Such types of discrepancies in facial appearance are frequently stumbled upon in an uncontrolled circumstance and possibly will be a reason to the security systems which are based upon face recognition. These types of variations are very common in a real-life environment. It has been analyzed that it has been studied less in literature but now researchers have a major focus on this type of variation. Existing state-of-the-art techniques suffer from several limitations. Most significant amongst them are low level of usability and poor response time in case of any calamity. In this paper, an improved face recognition system is developed to solve the problem of occlusion known as FRS-OCC. To build the FRS-OCC system, the color and texture features are used and then an incremental learning algorithm (Learn++) to select more informative features. Afterward, the trained stack-based autoencoder (SAE) deep learning algorithm is used to recognize a human face. Overall, the FRS-OCC system is used to introduce such algorithms which enhance the response time to guarantee a benchmark quality of service in any situation. To test and evaluate the performance of the proposed FRS-OCC system, the AR face dataset is utilized. On average, the FRS-OCC system is outperformed and achieved SE of 98.82%, SP of 98.49%, AC of 98.76% and AUC of 0.9995 compared to other state-of-the-art methods. The obtained results indicate that the FRS-OCC system can be used in any surveillance application.

Robust Estimation of Hand Poses Based on Learning (학습을 이용한 손 자세의 강인한 추정)

  • Kim, Sul-Ho;Jang, Seok-Woo;Kim, Gye-Young
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.12
    • /
    • pp.1528-1534
    • /
    • 2019
  • Recently, due to the popularization of 3D depth cameras, new researches and opportunities have been made in research conducted on RGB images, but estimation of human hand pose is still classified as one of the difficult topics. In this paper, we propose a robust estimation method of human hand pose from various input 3D depth images using a learning algorithm. The proposed approach first generates a skeleton-based hand model and then aligns the generated hand model with three-dimensional point cloud data. Then, using a random forest-based learning algorithm, the hand pose is strongly estimated from the aligned hand model. Experimental results in this paper show that the proposed hierarchical approach makes robust and fast estimation of human hand posture from input depth images captured in various indoor and outdoor environments.

A Study on the Seamline Estimation for Mosaicking of KOMPSAT-3 Images (KOMPSAT-3 영상 모자이킹을 위한 경계선 추정 방법에 대한 연구)

  • Kim, Hyun-ho;Jung, Jaehun;Lee, Donghan;Seo, Doochun
    • Korean Journal of Remote Sensing
    • /
    • v.36 no.6_2
    • /
    • pp.1537-1549
    • /
    • 2020
  • The ground sample distance of KOMPSAT-3 is 0.7 m for panchromatic band, 2.8 m for multi-spectral band, and the swath width of KOMPSAT-3 is 16 km. Therefore, an image of an area wider than the swath width (16 km) cannot be acquired with a single scanning. Thus, after scanning multiple areas in units of swath width, the acquired images should be made into one image. At this time, the necessary algorithm is called image mosaicking or image stitching, and is used for cartography. Mosaic algorithm generally consists of the following 4 steps: (1) Feature extraction and matching, (2) Radiometric balancing, (3) Seamline estimation, and (4) Image blending. In this paper, we have studied an effective seamline estimation method for satellite images. As a result, we can estimate the seamline more accurately than the existing method, and the heterogeneity of the mosaiced images was minimized.

2D-MELPP: A two dimensional matrix exponential based extension of locality preserving projections for dimensional reduction

  • Xiong, Zixun;Wan, Minghua;Xue, Rui;Yang, Guowei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.9
    • /
    • pp.2991-3007
    • /
    • 2022
  • Two dimensional locality preserving projections (2D-LPP) is an improved algorithm of 2D image to solve the small sample size (SSS) problems which locality preserving projections (LPP) meets. It's able to find the low dimension manifold mapping that not only preserves local information but also detects manifold embedded in original data spaces. However, 2D-LPP is simple and elegant. So, inspired by the comparison experiments between two dimensional linear discriminant analysis (2D-LDA) and linear discriminant analysis (LDA) which indicated that matrix based methods don't always perform better even when training samples are limited, we surmise 2D-LPP may meet the same limitation as 2D-LDA and propose a novel matrix exponential method to enhance the performance of 2D-LPP. 2D-MELPP is equivalent to employing distance diffusion mapping to transform original images into a new space, and margins between labels are broadened, which is beneficial for solving classification problems. Nonetheless, the computational time complexity of 2D-MELPP is extremely high. In this paper, we replace some of matrix multiplications with multiple multiplications to save the memory cost and provide an efficient way for solving 2D-MELPP. We test it on public databases: random 3D data set, ORL, AR face database and Polyu Palmprint database and compare it with other 2D methods like 2D-LDA, 2D-LPP and 1D methods like LPP and exponential locality preserving projections (ELPP), finding it outperforms than others in recognition accuracy. We also compare different dimensions of projection vector and record the cost time on the ORL, AR face database and Polyu Palmprint database. The experiment results above proves that our advanced algorithm has a better performance on 3 independent public databases.

A Review on Advanced Methodologies to Identify the Breast Cancer Classification using the Deep Learning Techniques

  • Bandaru, Satish Babu;Babu, G. Rama Mohan
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.4
    • /
    • pp.420-426
    • /
    • 2022
  • Breast cancer is among the cancers that may be healed as the disease diagnosed at early times before it is distributed through all the areas of the body. The Automatic Analysis of Diagnostic Tests (AAT) is an automated assistance for physicians that can deliver reliable findings to analyze the critically endangered diseases. Deep learning, a family of machine learning methods, has grown at an astonishing pace in recent years. It is used to search and render diagnoses in fields from banking to medicine to machine learning. We attempt to create a deep learning algorithm that can reliably diagnose the breast cancer in the mammogram. We want the algorithm to identify it as cancer, or this image is not cancer, allowing use of a full testing dataset of either strong clinical annotations in training data or the cancer status only, in which a few images of either cancers or noncancer were annotated. Even with this technique, the photographs would be annotated with the condition; an optional portion of the annotated image will then act as the mark. The final stage of the suggested system doesn't need any based labels to be accessible during model training. Furthermore, the results of the review process suggest that deep learning approaches have surpassed the extent of the level of state-of-of-the-the-the-art in tumor identification, feature extraction, and classification. in these three ways, the paper explains why learning algorithms were applied: train the network from scratch, transplanting certain deep learning concepts and constraints into a network, and (another way) reducing the amount of parameters in the trained nets, are two functions that help expand the scope of the networks. Researchers in economically developing countries have applied deep learning imaging devices to cancer detection; on the other hand, cancer chances have gone through the roof in Africa. Convolutional Neural Network (CNN) is a sort of deep learning that can aid you with a variety of other activities, such as speech recognition, image recognition, and classification. To accomplish this goal in this article, we will use CNN to categorize and identify breast cancer photographs from the available databases from the US Centers for Disease Control and Prevention.