• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.489-491
• /
• 2012

본 논문은 교육용 서비스로 이용 가능한 카드 인식 시스템을 제안한다. 사용자는 자유자재로 카드 등록 및 삭제가 가능하며 카드의 회전 및 크기 변화에도 강건한 인식을 보인다. 본 논문에서는 카드 템플릿의 형태 정보와 Histogram of Oriented Gradients를 특징점으로 이용한다. 또한 최종 분류기에서 계층적인 구조를 적용하여 보다 정확한 카드 검출 및 인식을 제안한다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.11
• /
• pp.66-72
• /
• 2014

Histogram of oriented gradient (HOG) feature is widely used in vision-based pedestrian detection. The interpolation is the most important technique in HOG feature calculation to provide high detection rate. In interpolation technique of HOG feature calculation, two nearest orientation bins to gradient orientation for each pixel and the corresponding weights are required. In this paper, therefore, an efficient gradient orientation bin and weight calculation circuit for HOG feature is proposed. In the proposed circuit, pre-calculated values are defined in tables to avoid the operations of tangent function and division, and the size of tables is minimized by utilizing the characteristics of tangent function and weights for each gradient orientation. Pipeline architecture is adopted to the proposed circuit to accelerate the processing speed, and orientation bins and the corresponding weights for each pixel are calculated in two clock cycles by applying efficient coarse and fine search schemes. Since the proposed circuit calculates gradient orientation for each pixel with the interval of $1^{\circ}$ and determines both orientation bins and weights required in interpolation technique, it can be utilized in HOG feature calculation to support interpolation technique to provide high detection rate.

• 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.

• 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.

• 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.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.37 no.12
• /
• pp.1445-1452
• /
• 2013

In this paper, we propose a real-time algorithm for estimating the relative position of a person with respect to a robot (camera) using a monocular camera. The algorithm detects the head and shoulder regions of a person using HOG (Histogram of Oriented Gradient) feature vectors and an SVM (Support Vector Machine) classifier. The size and location of the detected area are used for calculating the relative distance and angle between the person and the camera on a robot. To increase the speed of the algorithm, we use a GPU and NVIDIA's CUDA library; the resulting algorithm speed is ~ 15 Hz. The accuracy of the algorithm is compared with the output of a SICK laser scanner.

• Journal of Korea Multimedia Society
• /
• v.17 no.3
• /
• pp.300-311
• /
• 2014

According to fast change of the environment, the structured study of the ecosystem by analyzing the plant leaves are needed. Expecially, the methodology that searches and classifies the leaves from captured from the smart device have received numerous concerns in the field of computer science and ecology. In this paper, we propose a plant leaf classification technique using shape descriptor by combining Scale Invarinat Feature Transform (SIFT) and Histogram of Oriented Gradient (HOG) from the image segmented from the background via Graphcut algorithm. The shape descriptor is coded in the field of Locality-constrained Linear Coding to optimize the meaningful features from a high degree of freedom. It is connected to Support Vector Machines (SVM) for efficient classification. The experimental results show that our proposed approach is very efficient to classify the leaves which have similar color, and shape.

• The Journal of the Korea Contents Association
• /
• v.19 no.1
• /
• pp.125-131
• /
• 2019

A vanishing point is a point on an image to which parallel lines projected from a real space gather. A vanishing point in a road space provides important spatial information. It is possible to improve the position of an extracted lane or generate a depth map image using a vanishing point in the road space. In this paper, we propose a method of detecting vanishing points on images taken from a vehicle's point of view using Deep Neural Network (DNN) and Histogram of Oriented Gradient (HoG). The proposed algorithm is divided into a HoG feature extraction step, in which the edge direction is extracted by dividing an image into blocks, a DNN learning step, and a test step. In the learning stage, learning is performed using 2,300 road images taken from a vehicle's point of views. In the test phase, the efficiency of the proposed algorithm using the Normalized Euclidean Distance (NormDist) method is measured.

• 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.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.9
• /
• pp.930-935
• /
• 2014

A Gabor filter is a linear filter used for edge detectionas frequency and orientation representations of Gabor filters are similar to those of the human visual system. In this thesis, we propose a pedestrian detection algorithm using a Gabor filter bank. In order to extract the features of the pedestrian, we use various image processing algorithms and data structure algorithms. First, color image segmentation is performed to consider the information of the RGB color space. Second, histogram equalization is performed to enhance the brightness of the input images. Third, convolution is performed between a Gabor filter bank and the enhanced images. Fourth, statistical values are calculated by using the integral image (summed area table) method. The calculated statistical values are used for the feature matrix of the pedestrian area. To evaluate the proposed algorithm, the INRIA pedestrian database and SVM (Support Vector Machine) are used, and we compare the proposed algorithm and the HOG (Histogram of Oriented Gradient) pedestrian detector, presentlyreferred to as the methodology of pedestrian detection algorithm. The experimental results show that the proposed algorithm is more accurate compared to the HOG pedestrian detector.