• 제목/요약/키워드: K-NN

검색결과 791건 처리시간 0.027초

Induction Machine Fault Detection Using Generalized Feed Forward Neural Network

  • Ghate, V.N.;Dudul, S.V.
    • Journal of Electrical Engineering and Technology
    • /
    • 제4권3호
    • /
    • pp.389-395
    • /
    • 2009
  • Industrial motors are subject to incipient faults which, if undetected, can lead to motor failure. The necessity of incipient fault detection can be justified by safety and economical reasons. The technology of artificial neural networks has been successfully used to solve the motor incipient fault detection problem. This paper develops inexpensive, reliable, and noninvasive NN based incipient fault detection scheme for small and medium sized induction motors. Detailed design procedure for achieving the optimal NN model and Principal Component Analysis for dimensionality reduction is proposed. Overall thirteen statistical parameters are used as feature space to achieve the desired classification. GFFD NN model is designed and verified for optimal performance in fault identification on experimental data set of custom designed 2 HP, three phase 50 Hz induction motor.

갈퀴꼭두선이의 Hairy Root 배양에 의한 Anthraquinone계 색소생산 연구(II) (Production of Anthraquinone Derivatives by Hairy Roots of Rubia cordifolia var. pratensis)

  • 김유선;신승원
    • 생약학회지
    • /
    • 제27권4호
    • /
    • pp.301-308
    • /
    • 1996
  • Hairy roots induced from stems of Rubia cordifolia var. pratensis were cultured in the liquid medium under a variety of auxins to find the optimal condition for the growth and production of pigments. Culture of the hairy roots on NN liquid medium containing NAA 0.5 mg/l was best for growth of hairy roots. Production of yellow anthraquinone derivatives and purpurin in hairy roots was enhanced by the culture on NN liquid medium without auxins. Effects of L-phenylalanine, L-tyrosine and juglone, synthesized via the shikimic acid pathway, on growth and production of pigments in hairy roots were studied in the present study. Concentration of exogeneous L-phenylalanine. L-tyrosine and juglone in liquid culture system of hairy root containing NAA 0.1 mg/l was decreased quickly in its early stages of the culture period. Addition of juglone to NN liquid medium containing NAA 0.1 mg/l enhanced the productivity of pigments in hairy roots.

  • PDF

Fuzzy Hint Acquisition for the Collision Avoidance Solution of Redundant Manipulators Using Neural Network

  • Assal Samy F. M.;Watanabe Keigo;Izumi Kiyotaka
    • International Journal of Control, Automation, and Systems
    • /
    • 제4권1호
    • /
    • pp.17-29
    • /
    • 2006
  • A novel inverse kinematics solution based on the back propagation neural network (NN) for redundant manipulators is developed for online obstacles avoidance. A laser transducer at the end-effctor is used for online planning the trajectory. Since the inverse kinematics in the present problem has infinite number of joint angle vectors, a fuzzy reasoning system is designed to generate an approximate value for that vector. This vector is fed into the NN as a hint input vector rather than as a training vector to guide the output of the NN. Simulations are implemented on both three- and four-link redundant planar manipulators to show the effectiveness of the proposed position control system.

An Improved Genetic Algorithm for Fast Face Detection Using Neural Network as Classifier

  • Sugisaka, Masanori;Fan, Xinjian
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2005년도 ICCAS
    • /
    • pp.1034-1038
    • /
    • 2005
  • This paper presents a novel method to speed up neural network (NN) based face detection systems. NN-based face detection can be viewed as a classification and search problem. The proposed method formulates the search problem as an integer nonlinear optimization problem (INLP) and develops an improved genetic algorithm (IGA) to solve it. Each individual in the IGA represents a subwindow in an input image. The subwindows are evaluated by how well they match a NN-based face filter. A face is indicated when the filter response of the best particle is above a given threshold. Experimental results show that the proposed method leads to a speedup of 83 on $320{\times}240$ images compared to the traditional exhaustive search method.

  • PDF

Client-Side Caching for Nearest Neighbor Queries

  • Park Kwangjin;Hwang Chong-Sun
    • Journal of Communications and Networks
    • /
    • 제7권4호
    • /
    • pp.417-428
    • /
    • 2005
  • The Voronoi diagram (VD) is the most suitable mechanism to find the nearest neighbor (NN) for mobile clients. In NN query processing, it is important to reduce the query response time, since a late query response may contain out-of-date information. In this paper, we study the issue of location dependent information services (LDISs) using a VD. To begin our study, we first introduce a broadcast-based spatial query processing methods designed to support NN query processing. In further sections, we introduce a generic method for location-dependent sequential prefetching and caching. The performance of this scheme is studied in different simulated environments. The core contribution of this research resides in our analytical proof and experimental results.

Adaptive Fuzzy Neuro Controller for Speed Control of Induction Motor

  • Ko, Jae-Sub;Chung, Dong-Hwa
    • 조명전기설비학회논문지
    • /
    • 제26권7호
    • /
    • pp.9-15
    • /
    • 2012
  • This paper is proposed the adaptive fuzzy neuro controller(AFNC) for high performance of induction motor drive. The design of this algorithm based on the AFNC that is implemented using fuzzy controller(FC) and neural network(NN). This controller uses fuzzy rule as training patterns of a NN. Also, this controller adjusts the weights between the neurons of NN to minimize the error between the command output and the actual output using the back-propagation method. The control performance of the AFNC is evaluated by analysis in various operating conditions. The results of analysis prove that the proposed control system has high performance and robustness to parameter variation, and steady-state accuracy and transient response.

A KD-Tree-Based Nearest Neighbor Search for Large Quantities of Data

  • Yen, Shwu-Huey;Hsieh, Ya-Ju
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권3호
    • /
    • pp.459-470
    • /
    • 2013
  • The discovery of nearest neighbors, without training in advance, has many applications, such as the formation of mosaic images, image matching, image retrieval and image stitching. When the quantity of data is huge and the number of dimensions is high, the efficient identification of a nearest neighbor (NN) is very important. This study proposes a variation of the KD-tree - the arbitrary KD-tree (KDA) - which is constructed without the need to evaluate variances. Multiple KDAs can be constructed efficiently and possess independent tree structures, when the amount of data is large. Upon testing, using extended synthetic databases and real-world SIFT data, this study concludes that the KDA method increases computational efficiency and produces satisfactory accuracy, when solving NN problems.

바이올린과 첼로 연주 데이터를 이용한 분류 알고리즘의 성능 비교 (Performance Comparison of Classification Algorithms in Music Recognition using Violin and Cello Sound Files)

  • 김재천;곽경섭
    • 한국통신학회논문지
    • /
    • 제30권5C호
    • /
    • pp.305-312
    • /
    • 2005
  • 음악인식에 주로 사용되는 세 가지 알고리즘의 성능을 비교하였다. 다양한 분류알고리즘을 소개하고 그 중 베이지안법, 최근접이웃법과 k-최근접이웃법을 이용하여 악기를 분류하였다. 악기 샘플파일에서 영교차율, 평균, 분산, 평균피크레벨의 4가지 특성값을 추출하여 분류시스템의 데이터로 사용하였다. 사용된 악기 샘플은 바이올린, 바로크 바이올린, 바로크 첼로이다. 실험결과 최근접이웃 알고리즘이 악기 분류에 있어서 가장 좋은 성능을 보여 주었다. 최근접이웃 알고리즘은 단순하면서도 빠른 계산결과를 보여 악기 분류에 적절한 알고리즘으로 판단되었다.

한국 전통음악 (국악)에 대한 자동 장르 분류 시스템 구현 (An Implementation of Automatic Genre Classification System for Korean Traditional Music)

  • 이강규;윤원중;박규식
    • 한국음향학회지
    • /
    • 제24권1호
    • /
    • pp.29-37
    • /
    • 2005
  • 본 논문은 한국의 전통 음악, 즉 국악 장르를 자동으로 분류하는 시스템을 제안한다. 제안된 시스템은 입력 음악의 내용기반 분석을 통하여 궁중음악, 풍류방음악, 민속성악, 민속기악, 불교음악, 무속음악 등 6가지 장르중 하나로 자동분류하여 해당 음악의 장르 결과를 보여준다. 국악 장르 분류에 사용된 내용기반 알고리즘은 크게 음악의 특징 벡터 추출 그리고 장르 분류를 위한 패턴인식 과정 2가지로 구성된다. 음악의 특징 벡터 추출은 디지탈 신호 처리기술을 이용하여 해당 음악의 spectral centroid, rolloff, flux 등 STFT (Short Time Fourier Transform) 기반의 특징 계수들과 MFCC (Mel frequency cepstral coefficient), LPC (Linear predictive coding) 등의 계수들을 구한 후 SFS (Sequential Forward Selection) 최적 특징 벡터 열을 선별하여 사용하였으며 패틴 분류 알고리즘으로는 k-NN (k -Nearest Neighbor), Gaussian, GMM (Gaussian Mixture Model), SVM (Support Vector Machine) 분류기를 사용하였다. 특히 본 연구에서는 입력 질의의 패턴 (혹은 구간) 변화에 따른 시스템의 불확실성을 개선하기 위하여 MFC (Multi Feature Clustring) 방법을 이용하여 DB를 구축하였다. 모의실험 결과 k-NN 과 SVM 분류기 모두 $97{\%}$ 이상의 장르 분류 성공률을 보였으나, SVM 이 k-NN에 비해 약 3배 이상의 빠른 분류 성능을 가지고 있음을 확인하였다.

보로노이 다이어그램의 경계지점 최소거리 행렬 기반 k-최근접점 탐색 알고리즘 (k-NN Query Processing Algorithm based on the Matrix of Shortest Distances between Border-point of Voronoi Diagram)

  • 엄정호;장재우
    • 한국공간정보시스템학회 논문지
    • /
    • 제11권1호
    • /
    • pp.105-114
    • /
    • 2009
  • 최근 사용자에게 자신과 가장 가까운 k 개의 주유소, 레스토랑, 은행 등의 POI(Point Of Interest) 정보를 추천해주는 위치 기반 서비스가 텔레매틱스, ITS(Intelligent Transport Systems), 키오스크(kiosk)등의 어플리케이션에서 필요로 하고 있다. 이를 위해, 보로노이 다이어그램 k-최근접점 탐색 알고리즘이 제안되었다. 이는 보로노이 다이어그램에서 각 POI의 네트워크의 거리를 미리 계산한 파일을 이용하여 k-최근접점 탐색을 수행한다. 그러나 이 알고리즘은 보로노이 다이어그램 확장에 따른 비용 문제를 야기한다. 따라서 본 논문에서는 보로노이 다이어그램의 경계지점마다 각각에 대하여 최소거리 행렬을 생성하는 알고리즘을 제안한다. 또한 k 개의 POI를 탐색하기 위해, 최소거리 행렬을 이용한 k-최근접점 탐색 알고리즘을 제안한다. 제안하는 알고리즘은 미리 계산된 경계 지점 간 최소거리 행렬을 통해 탐색하므로, k-최근 접점 탐색 시 보로노이 다이어그램의 확장비용을 최소화한다. 아울러 기존 연구와의 성능비교를 통해 제안하는 알고리즘이 기존 알고리즘에 비해 검색시간 측면에서 성능이 우수함을 보인다.

  • PDF