• Title/Summary/Keyword: Neighborhood-Classifier

Search Result 17, Processing Time 0.01 seconds

Optimal k-Nearest Neighborhood Classifier Using Genetic Algorithm (유전알고리즘을 이용한 최적 k-최근접이웃 분류기)

  • Park, Chong-Sun;Huh, Kyun
    • Communications for Statistical Applications and Methods
    • /
    • v.17 no.1
    • /
    • pp.17-27
    • /
    • 2010
  • Feature selection and feature weighting are useful techniques for improving the classification accuracy of k-Nearest Neighbor (k-NN) classifier. The main propose of feature selection and feature weighting is to reduce the number of features, by eliminating irrelevant and redundant features, while simultaneously maintaining or enhancing classification accuracy. In this paper, a novel hybrid approach is proposed for simultaneous feature selection, feature weighting and choice of k in k-NN classifier based on Genetic Algorithm. The results have indicated that the proposed algorithm is quite comparable with and superior to existing classifiers with or without feature selection and feature weighting capability.

Design of Nearest Prototype Classifier by using Differential Evolutionary Algorithm (차분진화 알고리즘을 이용한 Nearest Prototype Classifier 설계)

  • Roh, Seok-Beom;Ahn, Tae-Chon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.4
    • /
    • pp.487-492
    • /
    • 2011
  • In this paper, we proposed a new design methodology to improve the classification performance of the Nearest Prototype Classifier which is one of the simplest classification algorithm. To optimize the position vectors of the prototypes in the nearest prototype classifier, we use the differential evolutionary algorithm. The optimized position vectors of the prototypes result in the improvement of the classification performance. The new method to determine the class labels of the prototypes, which are defined by the differential evolutionary algorithm, is proposed. In addition, the experimental application covers a comparative analysis including several previously commonly encountered methods.

Hand Gesture Interface Using Mobile Camera Devices (모바일 카메라 기기를 이용한 손 제스처 인터페이스)

  • Lee, Chan-Su;Chun, Sung-Yong;Sohn, Myoung-Gyu;Lee, Sang-Heon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.5
    • /
    • pp.621-625
    • /
    • 2010
  • This paper presents a hand motion tracking method for hand gesture interface using a camera in mobile devices such as a smart phone and PDA. When a camera moves according to the hand gesture of the user, global optical flows are generated. Therefore, robust hand movement estimation is possible by considering dominant optical flow based on histogram analysis of the motion direction. A continuous hand gesture is segmented into unit gestures by motion state estimation using motion phase, which is determined by velocity and acceleration of the estimated hand motion. Feature vectors are extracted during movement states and hand gestures are recognized at the end state of each gesture. Support vector machine (SVM), k-nearest neighborhood classifier, and normal Bayes classifier are used for classification. SVM shows 82% recognition rate for 14 hand gestures.

Nonlinear Feature Transformation and Genetic Feature Selection: Improving System Security and Decreasing Computational Cost

  • Taghanaki, Saeid Asgari;Ansari, Mohammad Reza;Dehkordi, Behzad Zamani;Mousavi, Sayed Ali
    • ETRI Journal
    • /
    • v.34 no.6
    • /
    • pp.847-857
    • /
    • 2012
  • Intrusion detection systems (IDSs) have an important effect on system defense and security. Recently, most IDS methods have used transformed features, selected features, or original features. Both feature transformation and feature selection have their advantages. Neighborhood component analysis feature transformation and genetic feature selection (NCAGAFS) is proposed in this research. NCAGAFS is based on soft computing and data mining and uses the advantages of both transformation and selection. This method transforms features via neighborhood component analysis and chooses the best features with a classifier based on a genetic feature selection method. This novel approach is verified using the KDD Cup99 dataset, demonstrating higher performances than other well-known methods under various classifiers have demonstrated.

CRF-Based Figure/Ground Segmentation with Pixel-Level Sparse Coding and Neighborhood Interactions

  • Zhang, Lihe;Piao, Yongri
    • Journal of information and communication convergence engineering
    • /
    • v.13 no.3
    • /
    • pp.205-214
    • /
    • 2015
  • In this paper, we propose a new approach to learning a discriminative model for figure/ground segmentation by incorporating the bag-of-features and conditional random field (CRF) techniques. We advocate the use of image patches instead of superpixels as the basic processing unit. The latter has a homogeneous appearance and adheres to object boundaries, while an image patch often contains more discriminative information (e.g., local image structure) to distinguish its categories. We use pixel-level sparse coding to represent an image patch. With the proposed feature representation, the unary classifier achieves a considerable binary segmentation performance. Further, we integrate unary and pairwise potentials into the CRF model to refine the segmentation results. The pairwise potentials include color and texture potentials with neighborhood interactions, and an edge potential. High segmentation accuracy is demonstrated on three benchmark datasets: the Weizmann horse dataset, the VOC2006 cow dataset, and the MSRC multiclass dataset. Extensive experiments show that the proposed approach performs favorably against the state-of-the-art approaches.

Classification of a Volumetric MRI Using Gibbs Distributions and a Line Model (깁스분포와 라인모델을 이용한 3차원 자기공명영상의 분류)

  • Junchul Chun
    • Investigative Magnetic Resonance Imaging
    • /
    • v.2 no.1
    • /
    • pp.58-66
    • /
    • 1998
  • Purpose : This paper introduces a new three dimensional magnetic Resonance Image classification which is based on Mar kov Random Field-Gibbs Random Field with a line model. Material and Methods : The performance of the Gibbs Classifier over a statistically heterogeneous image can be improved if the local stationary regions in the image are disassociated from each other through the mechanism of the interaction parameters defined at the local neighborhood level. This usually involves the construction of a line model for the image. In this paper we construct a line model for multisignature images based on the differential of the image which can provide an a priori estimate of the unobservable line field, which may lie in regions with significantly different statistics. the line model estimated from the original image data can in turn be used to alter the values of the interaction parameters of the Gibbs Classifier. Results : MRF-Gibbs classifier for volumetric MR images is developed under the condition that the domain of the image classification is $E^{3}$ space rather thatn the conventional $E^{2}$ space. Compared to context free classification, MRF-Gibbs classifier performed better in homogeneous and along boundaries since contextual information is used during the classification. Conclusion : We construct a line model for multisignature, multidimensional image and derive the interaction parameter for determining the energy function of MRF-Gibbs classifier.

  • PDF

Railway Object Recognition Using Mobile Laser Scanning Data (모바일 레이저 스캐닝 데이터로부터 철도 시설물 인식에 관한 연구)

  • Luo, Chao;Jwa, Yoon Seok;Sohn, Gun Ho;Won, Jong Un;Lee, Suk
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.19 no.2
    • /
    • pp.85-91
    • /
    • 2014
  • The objective of the research is to automatically recognize railway objects from MLS data in which 9 key objects including terrain, track, bed, vegetation, platform, barrier, posts, attachments, powerlines are targeted. The proposed method can be divided into two main sub-steps. First, multi-scale contextual features are extracted to take the advantage of characterizing objects of interest from different geometric levels such as point, line, volumetric and vertical profile. Second, by considering contextual interactions amongst object labels, a contextual classifier is utilized to make a prediction with local coherence. In here, the Conditional Random Field (CRF) is used to incorporate the object context. By maximizing the object label agreement in the local neighborhood, CRF model could compensate the local inconsistency prediction resulting from other local classifiers. The performance of proposed method was evaluated based on the analysis of commission and omission error and shows promising results for the practical use.

Learning of Rules for Edge Detection of Image using Fuzzy Classifier System (퍼지 분류가 시스템을 이용한 영상의 에지 검출 규칙 학습)

  • 정치선;반창봉;심귀보
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.10 no.3
    • /
    • pp.252-259
    • /
    • 2000
  • In this paper, we propose a Fuzzy Classifier System(FCS) to find a set of fuzzy rules which can carry out the edge detection of a image. The FCS is based on the fuzzy logic system combined with machine learning. Therefore the antecedent and consequent of a classifier in FCS are the same as those of a fuzzy rule. There are two different approaches, Michigan and Pittsburgh approaches, to acquire appropriate fuzzy rules by evolutionary computation. In this paper, we use the Michigan style in which a single fuzzy if-then rule is coded as an individual. Also the FCS employs the Genetic Algorithms to generate new rules and modify rules when performance of the system needs to be improved. The proposed method is evaluated by applying it to the edge detection of a gray-level image that is a pre-processing step of the computer vision. the differences of average gray-level of the each vertical/horizontal arrays of neighborhood pixels are represented into fuzzy sets, and then the center pixel is decided whether it is edge pixel or not using fuzzy if-then rules. We compare the resulting image with a conventional edge image obtained by the other edge detection method such as Sobel edge detection.

  • PDF

Performance Improvement of Collaborative Filtering System Using Associative User′s Clustering Analysis for the Recalculation of Preference and Representative Attribute-Neighborhood (선호도 재계산을 위한 연관 사용자 군집 분석과 Representative Attribute -Neighborhood를 이용한 협력적 필터링 시스템의 성능향상)

  • Jung, Kyung-Yong;Kim, Jin-Su;Kim, Tae-Yong;Lee, Jung-Hyun
    • The KIPS Transactions:PartB
    • /
    • v.10B no.3
    • /
    • pp.287-296
    • /
    • 2003
  • There has been much research focused on collaborative filtering technique in Recommender System. However, these studies have shown the First-Rater Problem and the Sparsity Problem. The main purpose of this Paper is to solve these Problems. In this Paper, we suggest the user's predicting preference method using Bayesian estimated value and the associative user clustering for the recalculation of preference. In addition to this method, to complement a shortcoming, which doesn't regard the attribution of item, we use Representative Attribute-Neighborhood method that is used for the prediction when we find the similar neighborhood through extracting the representative attribution, which most affect the preference. We improved the efficiency by using the associative user's clustering analysis in order to calculate the preference of specific item within the cluster item vector to the collaborative filtering algorithm. Besides, for the problem of the Sparsity and First-Rater, through using Association Rule Hypergraph Partitioning algorithm associative users are clustered according to the genre. New users are classified into one of these genres by Naive Bayes classifier. In addition, in order to get the similarity value between users belonged to the classified genre and new users, and this paper allows the different estimated value to item which user evaluated through Naive Bayes learning. As applying the preference granted the estimated value to Pearson correlation coefficient, it can make the higher accuracy because the errors that cause the missing value come less. We evaluate our method on a large collaborative filtering database of user rating and it significantly outperforms previous proposed method.

A Development of Ship-Block Dividing CAD Module Connected to WWW (WWW와 연계된 선박 조립 구조물의 분할 CAD모듈 개발)

  • 최해진;이수홍
    • Korean Journal of Computational Design and Engineering
    • /
    • v.2 no.4
    • /
    • pp.267-275
    • /
    • 1997
  • A ship-block cutting module is being developed as part of a computational system for a ship design. The module supports product-information to other modules in design process and displays ship-blocks in cutting-operation. Welding-information is essential to process-planning and scheduling. In the module, ship-blocks are modeled by Plate-Objects and then divided into several cutting pieces. The module automatically creates Welding-Objects containing welding-information in the process. Since the module is connected to WWW(World Wide Web), users in various platforms can access the models simultaneously In addition, users can check manufacturing constraints by inspecting a virtual model.

  • PDF