• Title/Summary/Keyword: Feature point.

Search Result 1,347, Processing Time 0.027 seconds

Korean Character Recognition by the Extraction of Feature Points and Neural Chip Design for its Preprocessing (특징점 추출에 의한 한글 문자 인식 및 전처리용 신경 칩의 설계)

  • 김종렬;정호선;이우일
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.6
    • /
    • pp.929-936
    • /
    • 1990
  • This paper describes the method of the Korean character recognition by means of feature points extraction. Also, the preprocessing neural chip for noise elimination, smoothing, thinning and feature point extraction has been designs. The subpatterns were separated by means of advanced index algorithm using mask, and recognized by means of feature points classification. The separation of the Korean character subpatterns was abtained about 97%, and the recognition of the Korean characters was abtained about 95%. The preprocessing neural chip was simulated on SPICE and layouted by double CMOS 2\ulcorner design rule.

  • PDF

Impact of Feature Positions on Focal Length Estimation of Self-Calibration (Self-calibration의 초점 거리 추정에서 특징점 위치의 영향)

  • Hong Yoo-Jung;Lee Byung-Uk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4C
    • /
    • pp.400-406
    • /
    • 2006
  • Knowledge of camera parameters, such as position, orientation and focal length, is essential to 3D information recovery or virtual object insertion. This paper analyzes the error sensitivity of focal length due to position error of feature points which are employed for self-calibration. We verify the dependency of the focal length on the distance from the principal point to feature points with simulations, and propose a criterion for feature selection to reduce the error sensitivity.

A Novel Visual Servoing Method involving Disturbance Observer (외란 관측기를 이용한 새로운 시각구동 방법)

  • Lee, Joon-Soo;Suh, Il-Hong
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.3
    • /
    • pp.294-303
    • /
    • 1999
  • To improve the visual servoing performance, several strategies were proposed in the past such as redundant feature points, using a point with different height and weighted selection of image features. The performance of these visual servoing methods depends on the configuration between the camera and object. And redundant feature points require much computation efforts. This paper proposes the visual servoing method based on the disturbance obsever, which compensates the upper off-diagonal component of image feature jacobian to be the null. The performance indices such as sensitivity for a measure of richness, sensitivity of the control to noise, and comtrollability are shown to be improved when the image feature Jacobian is given as a block diagonal matrix. Computer simulations are carried out for a UUMA560 robot and show some results to verify the effectiveness of the proposed method.

  • PDF

Fingerprint Matching Based on Dimension Reduced DCT Feature Vectors

  • Bharkad, Sangita;Kokare, Manesh
    • Journal of Information Processing Systems
    • /
    • v.13 no.4
    • /
    • pp.852-862
    • /
    • 2017
  • In this work a Discrete Cosine Transform (DCT)-based feature dimensionality reduced approach for fingerprint matching is proposed. The DCT is applied on a small region around the core point of fingerprint image. The performance of our proposed method is evaluated on a small database of Bologna University and two large databases of FVC2000. A dimensionally reduced feature vector is formed using only approximately 19%, 7%, and 6% DCT coefficients for the three databases from Bologna University and FVC2000, respectively. We compared the results of our proposed method with the discrete wavelet transform (DWT) method, the rotated wavelet filters (RWFs) method, and a combination of DWT+RWF and DWT+(HL+LH) subbands of RWF. The proposed method reduces the false acceptance rate from approximately 18% to 4% on DB1 (Database of Bologna University), approximately 29% to 16% on DB2 (FVC2000), and approximately 26% to 17% on DB3 (FVC2000) over the DWT based feature extraction method.

A study on automatic data conversion from electronic drawings to make feature database for GIS system (CAD도면과 GIS구조화 자동변환 방안에 관한연구)

  • Park, Dong-Heui;Kim, Young-Guk;Kang, Yu-Shin;Oh, Ju-Hwan;Choo, Jun-Sup
    • Proceedings of the KSR Conference
    • /
    • 2008.11b
    • /
    • pp.2121-2124
    • /
    • 2008
  • The total length of Korean railway network is about 3,300km. Since it is of great scale in system view point, the systemization of GIS-based information system requires so much cost and time. One of the difficulties is due to the fact that GIS-based information system requires the feature database for GIS, which is generally built manually from many as-built drawing files. In order to build-up the feature database for GIS with ease, this study suggests the automatic data conversion from electronic drawings to make feature database for GIS. The proposed method can be applied to build large-scale railway facility management system at lower cost.

  • PDF

Performance Analysis of Optimization Method and Filtering Method for Feature-based Monocular Visual SLAM (특징점 기반 단안 영상 SLAM의 최적화 기법 및 필터링 기법 성능 분석)

  • Jeon, Jin-Seok;Kim, Hyo-Joong;Shim, Duk-Sun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.68 no.1
    • /
    • pp.182-188
    • /
    • 2019
  • Autonomous mobile robots need SLAM (simultaneous localization and mapping) to look for the location and simultaneously to make the map around the location. In order to achieve visual SLAM, it is necessary to form an algorithm that detects and extracts feature points from camera images, and gets the camera pose and 3D points of the features. In this paper, we propose MPROSAC algorithm which combines MSAC and PROSAC, and compare the performance of optimization method and the filtering method for feature-based monocular visual SLAM. Sparse Bundle Adjustment (SBA) is used for the optimization method and the extended Kalman filter is used for the filtering method.

Term Frequency-Inverse Document Frequency (TF-IDF) Technique Using Principal Component Analysis (PCA) with Naive Bayes Classification

  • J.Uma;K.Prabha
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.4
    • /
    • pp.113-118
    • /
    • 2024
  • Pursuance Sentiment Analysis on Twitter is difficult then performance it's used for great review. The present be for the reason to the tweet is extremely small with mostly contain slang, emoticon, and hash tag with other tweet words. A feature extraction stands every technique concerning structure and aspect point beginning particular tweets. The subdivision in a aspect vector is an integer that has a commitment on ascribing a supposition class to a tweet. The cycle of feature extraction is to eradicate the exact quality to get better the accurateness of the classifications models. In this manuscript we proposed Term Frequency-Inverse Document Frequency (TF-IDF) method is to secure Principal Component Analysis (PCA) with Naïve Bayes Classifiers. As the classifications process, the work proposed can produce different aspects from wildly valued feature commencing a Twitter dataset.

Optimal R Wave Detection and Advanced PVC Classification Method through Extracting Minimal Feature in IoT Environments (IoT 환경에서 최적 R파 검출 및 최소 특징점 추출을 통한 향상된 PVC 분류방법)

  • Cho, Iksung;Woo, Dongsik
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.13 no.4
    • /
    • pp.91-98
    • /
    • 2017
  • Previous works for detecting arrhythmia have mostly used nonlinear method such as artificial neural network, fuzzy theory, support vector machine to increase classification accuracy. Most methods require higher computational cost and larger processing time. Therefore it is necessary to design efficient algorithm that classifies PVC(premature ventricular contraction) and decreases computational cost by accurately detecting minimal feature point based on only R peak through optimal R wave. We propose an optimal R wave detection and PVC classification method through extracting minimal feature point in IoT environment. For this purpose, we detected R wave through optimal threshold value and extracted RR interval and R peak pattern from noise-free ECG signal through the preprocessing method. Also, we classified PVC in realtime through RR interval and R peak pattern. The performance of R wave detection and PVC classification is evaluated by using record of MIT-BIH arrhythmia database. The achieved scores indicate the average of 99.758% in R wave detection and the rate of 93.94% in PVC classification.

Precision Evaluation of Three-dimensional Feature Points Measurement by Binocular Vision

  • Xu, Guan;Li, Xiaotao;Su, Jian;Pan, Hongda;Tian, Guangdong
    • Journal of the Optical Society of Korea
    • /
    • v.15 no.1
    • /
    • pp.30-37
    • /
    • 2011
  • Binocular-pair images obtained from two cameras can be used to calculate the three-dimensional (3D) world coordinate of a feature point. However, to apply this method, measurement accuracy of binocular vision depends on some structure factors. This paper presents an experimental study of measurement distance, baseline distance, and baseline direction. Their effects on camera reconstruction accuracy are investigated. The testing set for the binocular model consists of a series of feature points in stereo-pair images and corresponding 3D world coordinates. This paper discusses a method to increase the baseline distance of two cameras for enhancing the accuracy of a binocular vision system. Moreover, there is an inflexion point of the value and distribution of measurement errors when the baseline distance is increased. The accuracy benefit from increasing the baseline distance is not obvious, since the baseline distance exceeds 1000 mm in this experiment. Furthermore, it is observed that the direction errors deduced from the set-up are lower when the main measurement direction is similar to the baseline direction.

Analyzing performance of time series classification using STFT and time series imaging algorithms

  • Sung-Kyu Hong;Sang-Chul Kim
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.4
    • /
    • pp.1-11
    • /
    • 2023
  • In this paper, instead of using recurrent neural network, we compare a classification performance of time series imaging algorithms using convolution neural network. There are traditional algorithms that imaging time series data (e.g. GAF(Gramian Angular Field), MTF(Markov Transition Field), RP(Recurrence Plot)) in TSC(Time Series Classification) community. Furthermore, we compare STFT(Short Time Fourier Transform) algorithm that can acquire spectrogram that visualize feature of voice data. We experiment CNN's performance by adjusting hyper parameters of imaging algorithms. When evaluate with GunPoint dataset in UCR archive, STFT(Short-Time Fourier transform) has higher accuracy than other algorithms. GAF has 98~99% accuracy either, but there is a disadvantage that size of image is massive.