• Title/Summary/Keyword: Nearest neighbor algorithm

Search Result 338, Processing Time 0.024 seconds

Indoor 3D Dynamic Reconstruction Fingerprint Matching Algorithm in 5G Ultra-Dense Network

  • Zhang, Yuexia;Jin, Jiacheng;Liu, Chong;Jia, Pengfei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.1
    • /
    • pp.343-364
    • /
    • 2021
  • In the 5G era, the communication networks tend to be ultra-densified, which will improve the accuracy of indoor positioning and further improve the quality of positioning service. In this study, we propose an indoor three-dimensional (3D) dynamic reconstruction fingerprint matching algorithm (DSR-FP) in a 5G ultra-dense network. The first step of the algorithm is to construct a local fingerprint matrix having low-rank characteristics using partial fingerprint data, and then reconstruct the local matrix as a complete fingerprint library using the FPCA reconstruction algorithm. In the second step of the algorithm, a dynamic base station matching strategy is used to screen out the best quality service base stations and multiple sub-optimal service base stations. Then, the fingerprints of the other base station numbers are eliminated from the fingerprint database to simplify the fingerprint database. Finally, the 3D estimated coordinates of the point to be located are obtained through the K-nearest neighbor matching algorithm. The analysis of the simulation results demonstrates that the average relative error between the reconstructed fingerprint database by the DSR-FP algorithm and the original fingerprint database is 1.21%, indicating that the accuracy of the reconstruction fingerprint database is high, and the influence of the location error can be ignored. The positioning error of the DSR-FP algorithm is less than 0.31 m. Furthermore, at the same signal-to-noise ratio, the positioning error of the DSR-FP algorithm is lesser than that of the traditional fingerprint matching algorithm, while its positioning accuracy is higher.

Pattern Classification Algorithm for Wrist Movements based on EMG (근전도 신호 기반 손목 움직임 패턴 분류 알고리즘에 대한 연구)

  • Cui, H.D.;Kim, Y.H.;Shim, H.M.;Yoon, K.S.;Lee, S.M.
    • Journal of rehabilitation welfare engineering & assistive technology
    • /
    • v.7 no.2
    • /
    • pp.69-74
    • /
    • 2013
  • In this paper, we propose the pattern classification algorithm of recognizing wrist movements based on electromyogram(EMG) to raise the recognition rate. We consider 30 characteristics of EMG signals wirh the root mean square(RMS) and the difference absolute standard deviation value(DASDV) for the extraction of precise features from EMG signals. To get the groups of each wrist movement, we estimated 2-dimension features. On this basis, we divide each group into two parts with mean to compare and promote the recognition rate of pattern classification effectively. For the motion classification based on EMG, the k-nearest neighbor(k-NN) is used. In this paper, the recognition rate is 92.59% and 0.84% higher than the study before.

  • PDF

Hybrid Learning Architectures for Advanced Data Mining:An Application to Binary Classification for Fraud Management (개선된 데이터마이닝을 위한 혼합 학습구조의 제시)

  • Kim, Steven H.;Shin, Sung-Woo
    • Journal of Information Technology Application
    • /
    • v.1
    • /
    • pp.173-211
    • /
    • 1999
  • The task of classification permeates all walks of life, from business and economics to science and public policy. In this context, nonlinear techniques from artificial intelligence have often proven to be more effective than the methods of classical statistics. The objective of knowledge discovery and data mining is to support decision making through the effective use of information. The automated approach to knowledge discovery is especially useful when dealing with large data sets or complex relationships. For many applications, automated software may find subtle patterns which escape the notice of manual analysis, or whose complexity exceeds the cognitive capabilities of humans. This paper explores the utility of a collaborative learning approach involving integrated models in the preprocessing and postprocessing stages. For instance, a genetic algorithm effects feature-weight optimization in a preprocessing module. Moreover, an inductive tree, artificial neural network (ANN), and k-nearest neighbor (kNN) techniques serve as postprocessing modules. More specifically, the postprocessors act as second0order classifiers which determine the best first-order classifier on a case-by-case basis. In addition to the second-order models, a voting scheme is investigated as a simple, but efficient, postprocessing model. The first-order models consist of statistical and machine learning models such as logistic regression (logit), multivariate discriminant analysis (MDA), ANN, and kNN. The genetic algorithm, inductive decision tree, and voting scheme act as kernel modules for collaborative learning. These ideas are explored against the background of a practical application relating to financial fraud management which exemplifies a binary classification problem.

  • PDF

Performance Analysis of Face Recognition by Distance according to Image Normalization and Face Recognition Algorithm (영상 정규화 및 얼굴인식 알고리즘에 따른 거리별 얼굴인식 성능 분석)

  • Moon, Hae-Min;Pan, Sung Bum
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.23 no.4
    • /
    • pp.737-742
    • /
    • 2013
  • The surveillance system has been developed to be intelligent which can judge and cope by itself using human recognition technique. The existing face recognition is excellent at a short distance but recognition rate is reduced at a long distance. In this paper, we analyze the performance of face recognition according to interpolation and face recognition algorithm in face recognition using the multiple distance face images to training. we use the nearest neighbor, bilinear, bicubic, Lanczos3 interpolations to interpolate face image and PCA and LDA to face recognition. The experimental results show that LDA-based face recognition with bilinear interpolation provides performance in face recognition.

A Study on the Development of Tracking Algorithm for Shipborne Automatic Tracking Aids (선박자동추적장치(ATA)의 목표물 추적 알고리즘 개발에 관한 연구)

  • Kim Seok Jae;Koo Ja Yun;Yoon Su Weon
    • Proceedings of KOSOMES biannual meeting
    • /
    • 2003.11a
    • /
    • pp.13-21
    • /
    • 2003
  • Ships if 500 gross tonnage and upwards constructed on or after 1 July 2002 shall have an automatic tracking aids according to SOLAS V /19 but existing ships less than 10,000 gross tonnage constructed before 1 July 2002 have potential collision risks due to the lack of automatic plotting devices like as an ATA This paper aims to provide a homemade ATA by developing the tracking algorithm for ATA and to prevent collision incidents by distributing ATA system to coasters.

  • PDF

A Study on the Development of Tracking Algorithm for Shipborne Automatic Tracking Aids (선박자동추적장치의 목표물 추적 알고리즘 개발에 관한 연구)

  • 김석재;구자윤;윤수원
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.9 no.2
    • /
    • pp.5-13
    • /
    • 2003
  • Ships of 500 gross tonnage and upwards constructed an or after 1 July 2002 shall have an automatic tracking aids according to SOLAS V/19 but existing ships less than 10,000 gross tonnage constructed before 1 July 2002 have potential collision risks due to the lack of automatic plotting devices like as an ATA. This paper aims to provide a homemade ATA by developing the tracking algorithm for ATA and to prevent collision incidents by distributing ATA system to coasters.

  • PDF

Region-Segmental Scheme in Local Normalization Process of Digital Image (디지털영상 국부정규화처리의 영역분할 구도)

  • Hwang, Jung-Won;Hwang, Jae-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.44 no.4 s.316
    • /
    • pp.78-85
    • /
    • 2007
  • This paper presents a segmental scheme for regions-composed images in local normalization process. The scheme is based on local statistics computed through a moving window. The normalization algorithm uses linear or nonlinear functions to transfer the pixel distribution and the homogeneous affine of regions which is corrupted by additive noise. It adjusts the mean and standard deviation for nearest-neighbor interpoint distance between current and the normalized image signals and changes the segmentation performance according to local statistics and parameter variation adaptively. The performance of newly advanced local normalization algorithm is evaluated and compared to the performance of conventional normalization methods. Experimental results are presented to show the region segmentation properties of these approaches.

Robust Object Tracking based on Kernelized Correlation Filter with multiple scale scheme (다중 스케일 커널화 상관 필터를 이용한 견실한 객체 추적)

  • Yoon, Jun Han;Kim, Jin Heon
    • Journal of IKEEE
    • /
    • v.22 no.3
    • /
    • pp.810-815
    • /
    • 2018
  • The kernelized correlation filter algorithm yielded meaningful results in accuracy for object tracking. However, because of the use of a fixed size template, we could not cope with the scale change of the tracking object. In this paper, we propose a method to track objects by finding the best scale for each frame using correlation filtering response values in multi-scale using nearest neighbor interpolation and Gaussian normalization. The scale values of the next frame are updated using the optimal scale value of the previous frame and the optimal scale value of the next frame is found again. For the accuracy comparison, the validity of the proposed method is verified by using the VOT2014 data used in the existing kernelized correlation filter algorithm.

Classification of Korean Traditional Musical Instruments Using Feature Functions and k-nearest Neighbor Algorithm (특성함수 및 k-최근접이웃 알고리즘을 이용한 국악기 분류)

  • Kim Seok-Ho;Kwak Kyung-Sup;Kim Jae-Chun
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.3
    • /
    • pp.279-286
    • /
    • 2006
  • Classification method used in this paper is applied for the first time to Korean traditional music. Among the frequency distribution vectors, average peak value is suggested and proved effective comparing to previous classification success rate. Mean, variance, spectral centroid, average peak value and ZCR are used to classify Korean traditional musical instruments. To achieve Korean traditional instruments automatic classification, Spectral analysis is used. For the spectral domain, Various functions are introduced to extract features from the data files. k-NN classification algorithm is applied to experiments. Taegum, gayagum and violin are classified in accuracy of 94.44% which is higher than previous success rate 87%.

  • PDF

Technology of Location-Based Service for Mobile Tourism (모바일 관광을 위한 위치 기반 서비스 기술)

  • Lee, Geun-Sang;Kim, Ki-Jeong;Kim, Hyoung-Jun
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.16 no.3
    • /
    • pp.1-11
    • /
    • 2013
  • This study developed the algorithm of location-based service for supplying the efficient tourism service to traveller using mobile device and applied it to the Jeonju HANOK village. First, the location service was advanced using algorithm coupling with GPS error range and travel speed in single line, and with GPS location and nearest neighbor method to line in multiple one. Also this study developed a program using DuraMap-Xr spatial engine for establishing topology to Node and Link in line automatically. And the foundation was prepared for improving travel convenience by programming location-based service technology to single and multiple lines based on Blackpoint-Xr mobile application engine.