• Title/Summary/Keyword: Gradient feature

Search Result 279, Processing Time 0.022 seconds

Front Classification using Back Propagation Algorithm (오류 역전파 알고리즘을 이용한 영문자의 폰트 분류 방법에 관한 연구)

  • Jung Minchul
    • Journal of Intelligence and Information Systems
    • /
    • v.10 no.2
    • /
    • pp.65-77
    • /
    • 2004
  • This paper presents a priori and the local font classification method. The font classification uses ascenders, descenders, and serifs extracted from a word image. The gradient features of those sub-images are extracted, and used as an input to a neural network classifier to produce font classification results. The font classification determines 2 font styles (upright or slant), 3 font groups (serif sans-serif or typewriter), and 7-font names (Postscript fonts such as Avant Garde, Helvetica, Bookman, New Century Schoolbook, Palatine, Times, and Courier). The proposed a priori and local font classification method allows an OCR system consisting of various font-specific character segmentation tools and various mono-font character recognizers. Experiments have shown font classification accuracies reach high performance levels of about 95.4 percent even with severely touching characters. The technique developed for tile selected 7 fonts in this paper can be applied to any other fonts.

  • PDF

Automatic Tracking of Retinal Vessels by Analyzing Local Feature Points in IndoCyanine Green Retinal Images (ICG 망막영상에서 국부적 특징점 분석에 의한 혈관의 자동 추적)

  • Lim, Moon-Chul;Kim, Woo-Saeng
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.3
    • /
    • pp.202-210
    • /
    • 2002
  • During the last few years, the extraction and reconstruction of the blood vessels in the medical image has been actively researched and the analysis for the retinal vessel structure has provided important information for diagnosis and remedy of the retinopathy patients. In this research, we propose the algorithm that tracks automatically the entire retinal vessel in retinal image acquired by the ICG(IndoCyanine Green) technology. This algorithm extracts contours and centers by estimating the local maxima and processing directions and detects bifurcations and junctions by comparing direction components of the local maxima from the gradient magnitude profile of each blood vessel. We present experimental results that the entire blood vessel is automatically reconstructed and is excellent in accuracy and connectivity after applying our algorithm to the ICG retinal images of patients.

Middle Ear Disease Automatic Decision Scheme using HoG Descriptor (HoG 기술자를 이용한 중이염 자동 판별 방법)

  • Jung, Na-ra;Song, Jae-wook;Choi, Ho-Hyoung;Kang, Hyun-soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.3
    • /
    • pp.621-629
    • /
    • 2016
  • This paper presents a decision method of middle ear disease which is developed in children and adults. In the proposed method, features are extracted from the middle ear disease images and normal images using HoG (histogram of oriented gradient) descriptor and the extracted features are learned by SVM (support vector machine) classifier. To obtain an input vector into SVM, an input image is resized to a predefined size and then the resized image is partitioned into 16 blocks each of which is partitioned into 4 sub-blocks (namely cell). Finally, the feature vector with 576 components is given by using HoG with 9 bins and it is used as SVM learning and classification. Input images are classified by SVM classifier based on the model of learning features. Experimental results show that the proposed method yields the precision of over 90% in decision.

Binary Visual Word Generation Techniques for A Fast Image Search (고속 이미지 검색을 위한 2진 시각 단어 생성 기법)

  • Lee, Suwon
    • Journal of KIISE
    • /
    • v.44 no.12
    • /
    • pp.1313-1318
    • /
    • 2017
  • Aggregating local features in a single vector is a fundamental problem in an image search. In this process, the image search process can be speeded up if binary features which are extracted almost two order of magnitude faster than gradient-based features are utilized. However, in order to utilize the binary features in an image search, it is necessary to study the techniques for clustering binary features to generate binary visual words. This investigation is necessary because traditional clustering techniques for gradient-based features are not compatible with binary features. To this end, this paper studies the techniques for clustering binary features for the purpose of generating binary visual words. Through experiments, we analyze the trade-off between the accuracy and computational efficiency of an image search using binary features, and we then compare the proposed techniques. This research is expected to be applied to mobile applications, real-time applications, and web scale applications that require a fast image search.

Real-time Traffic Sign Recognition using Rotation-invariant Fast Binary Patterns (회전에 강인한 고속 이진패턴을 이용한 실시간 교통 신호 표지판 인식)

  • Hwang, Min-Chul;Ko, Byoung Chul;Nam, Jae-Yeal
    • Journal of Broadcast Engineering
    • /
    • v.21 no.4
    • /
    • pp.562-568
    • /
    • 2016
  • In this paper, we focus on recognition of speed-limit signs among a few types of traffic signs because speed-limit sign is closely related to safe driving of drivers. Although histogram of oriented gradient (HOG) and local binary patterns (LBP) are representative features for object recognition, these features have a weakness with respect to rotation, in that it does not consider the rotation of the target object when generating patterns. Therefore, this paper propose the fast rotation-invariant binary patterns (FRIBP) algorithm to generate a binary pattern that is robust against rotation. The proposed FRIBP algorithm deletes an unused layer of the histogram, and eliminates the shift and comparison operations in order to quickly extract the desired feature. The proposed FRIBP algorithm is successfully applied to German Traffic Sign Recognition Benchmark (GTSRB) datasets, and the results show that the recognition capabilities of the proposed method are similar to those of other methods. Moreover, its recognition speed is considerably enhanced than related works as approximately 0.47second for 12,630 test data.

Crowd Density Estimation with Multi-class Adaboost in elevator (다중 클래스 아다부스트를 이용한 엘리베이터 내 군집 밀도 추정)

  • Kim, Dae-Hun;Lee, Young-Hyun;Ku, Bon-Hwa;Ko, Han-Seok
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.7
    • /
    • pp.45-52
    • /
    • 2012
  • In this paper, an crowd density in elevator estimation method based on multi-class Adaboost classifier is proposed. The SOM (Self-Organizing Map) based conventional methods have shown insufficient performance in practical scenarios and have weakness for low reproducibility. The proposed method estimates the crowd density using multi-class Adaboost classifier with texture features, namely, GLDM(Grey-Level Dependency Matrix) or GGDM(Grey-Gradient Dependency Matrix). In order to classify into multi-label, weak classifier which have better performance is generated by modifying a weight update equation of general Adaboost algorithm. The crowd density is classified into four categories depending on the number of persons in the crowd, which can be 0 person, 1-2 people, 3-4 people, and 5 or more people. The experimental results under indoor environment show the proposed method improves detection rate by about 20% compared to that of the conventional method.

Three Dimensional Layering Algorithm for 3-D Metal Printing Using 5-axis (3 차원 금속 프린팅을 위한 다중 3 차원 적층 알고리듬(3DL))

  • Ryu, Sua;Jee, Haeseong
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.38 no.8
    • /
    • pp.881-886
    • /
    • 2014
  • The purpose of three-dimensional (3-D) metal printing using 5-axis is to deposit metal powder by changing the orientation of the deposited structure to be built for the overhang or undercut feature on part geometry. This requires a complicated preprocess functionality of providing three dimensionally sliced layers to cover the required part geometry. This study addresses the overhang/undercut problem in 3-D metal printing and discusses a possible solution of providing 3-D layers to be built using the DMT(R) machine.

Development of The Irregular Radial Pulse Detection Algorithm Based on Statistical Learning Model (통계적 학습 모형에 기반한 불규칙 맥파 검출 알고리즘 개발)

  • Bae, Jang-Han;Jang, Jun-Su;Ku, Boncho
    • Journal of Biomedical Engineering Research
    • /
    • v.41 no.5
    • /
    • pp.185-194
    • /
    • 2020
  • Arrhythmia is basically diagnosed with the electrocardiogram (ECG) signal, however, ECG is difficult to measure and it requires expert help in analyzing the signal. On the other hand, the radial pulse can be measured with easy and uncomplicated way in daily life, and could be suitable bio-signal for the recent untact paradigm and extensible signal for diagnosis of Korean medicine based on pulse pattern. In this study, we developed an irregular radial pulse detection algorithm based on a learning model and considered its applicability as arrhythmia screening. A total of 1432 pulse waves including irregular pulse data were used in the experiment. Three data sets were prepared with minimal preprocessing to avoid the heuristic feature extraction. As classification algorithms, elastic net logistic regression, random forest, and extreme gradient boosting were applied to each data set and the irregular pulse detection performances were estimated using area under the receiver operating characteristic curve based on a 10-fold cross-validation. The extreme gradient boosting method showed the superior performance than others and found that the classification accuracy reached 99.7%. The results confirmed that the proposed algorithm could be used for arrhythmia screening. To make a fusion technology integrating western and Korean medicine, arrhythmia subtype classification from the perspective of Korean medicine will be needed for future research.

Sub Oriented Histograms of Local Binary Patterns for Smoke Detection and Texture Classification

  • Yuan, Feiniu;Shi, Jinting;Xia, Xue;Yang, Yong;Fang, Yuming;Wang, Rui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.4
    • /
    • pp.1807-1823
    • /
    • 2016
  • Local Binary Pattern (LBP) and its variants have powerful discriminative capabilities but most of them just consider each LBP code independently. In this paper, we propose sub oriented histograms of LBP for smoke detection and image classification. We first extract LBP codes from an image, compute the gradient of LBP codes, and then calculate sub oriented histograms to capture spatial relations of LBP codes. Since an LBP code is just a label without any numerical meaning, we use Hamming distance to estimate the gradient of LBP codes instead of Euclidean distance. We propose to use two coordinates systems to compute two orientations, which are quantized into discrete bins. For each pair of the two discrete orientations, we generate a sub LBP code map from the original LBP code map, and compute sub oriented histograms for all sub LBP code maps. Finally, all the sub oriented histograms are concatenated together to form a robust feature vector, which is input into SVM for training and classifying. Experiments show that our approach not only has better performance than existing methods in smoke detection, but also has good performance in texture classification.

Design of Digits Recognition System Based on RBFNNs : A Comparative Study of Pre-processing Algorithms (방사형 기저함수 신경회로망 기반 숫자 인식 시스템의 설계 : 전처리 알고리즘을 이용한 인식성능의 비교연구)

  • Kim, Eun-Hu;Kim, Bong-Youn;Oh, Sung-Kwun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.2
    • /
    • pp.416-424
    • /
    • 2017
  • In this study, we propose a design of digits recognition system based on RBFNNs through a comparative study of pre-processing algorithms in order to recognize digits in handwritten. Histogram of Oriented Gradient(HOG) is used to get the features of digits in the proposed digits recognition system. In the pre-processing part, a dimensional reduction is executed by using Principal Component Analysis(PCA) and (2D)2PCA which are widely adopted methods in order to minimize a loss of the information during the reduction process of feature space. Also, The architecture of radial basis function neural networks consists of three functional modules such as condition, conclusion, and inference part. In the condition part, the input space is partitioned with the use of fuzzy clustering realized by means of the Fuzzy C-Means algorithm. Also, it is used instead of gaussian function to consider the characteristic of input data. In the conclusion part, the connection weights are used as the extended type of polynomial expression such as constant, linear, quadratic and modified quadratic. By using MNIST handwritten digit benchmarking database, experimental results show the effectiveness and efficiency of proposed digit recognition system when compared with other studies.