• Title/Summary/Keyword: Histogram of Gradient

Search Result 116, Processing Time 0.022 seconds

Lower Tail Light Learning-based Forward Vehicle Detection System Irrelevant to the Vehicle Types (후미등 하단 학습기반의 차종에 무관한 전방 차량 검출 시스템)

  • Ki, Minsong;Kwak, Sooyeong;Byun, Hyeran
    • Journal of Broadcast Engineering
    • /
    • v.21 no.4
    • /
    • pp.609-620
    • /
    • 2016
  • Recently, there are active studies on a forward collision warning system to prevent the accidents and improve convenience of drivers. For collision evasion, the vehicle detection system is required. In general, existing learning-based vehicle detection methods use the entire appearance of the vehicles from rear-view images, so that each vehicle types should be learned separately since they have distinct rear-view appearance regarding the types. To overcome such shortcoming, we learn Haar-like features from the lower part of the vehicles which contain tail lights to detect vehicles leveraging the fact that the lower part is consistent regardless of vehicle types. As a verification procedure, we detect tail lights to distinguish actual vehicles and non-vehicles. If candidates are too small to detect the tail lights, we use HOG(Histogram Of Gradient) feature and SVM(Support Vector Machine) classifier to reduce false alarms. The proposed forward vehicle detection method shows accuracy of 95% even in the complicated images with many buildings by the road, regardless of vehicle types.

Plant leaf Classification Using Orientation Feature Descriptions (방향성 특징 기술자를 이용한 식물 잎 인식)

  • Gang, Su Myung;Yoon, Sang Min;Lee, Joon Jae
    • 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.

Method for Road Vanishing Point Detection Using DNN and Hog Feature (DNN과 HoG Feature를 이용한 도로 소실점 검출 방법)

  • Yoon, Dae-Eun;Choi, Hyung-Il
    • 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.

Using Mean Shift Algorithm and Self-adaptive Canny Algorithm for I mprovement of Edge Detection (경계선 검출의 향상을 위한 Mean Shift 알고리즘과 자기 적응적 Canny 알고리즘의 활용)

  • Shin, Seong-Yoon;Pyo, Seong-Bae
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.7
    • /
    • pp.33-40
    • /
    • 2009
  • Edge detection is very significant in low level image processing. However, majority edge detection methods are not only effective enough cause of the noise points' influence, even not flexible enough to different input images. In order to sort these problems, in this paper an algorithm is presented that has an extra noise reduction stage at first, and then automatically selects the both thresholds depending on gradient amplitude histogram and intra class minimum variance. Using this algorithm, can fade out almost all of the sensitive noise points, and calculate the propose thresholds for different images without setting up the practical parameters artificially, and then choose edge pixels by fuzzy algorithm. In finally, get the better result than the former Canny algorithm.

A Real-Time Head Tracking Algorithm Using Mean-Shift Color Convergence and Shape Based Refinement (Mean-Shift의 색 수렴성과 모양 기반의 재조정을 이용한 실시간 머리 추적 알고리즘)

  • Jeong Dong-Gil;Kang Dong-Goo;Yang Yu Kyung;Ra Jong Beom
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.42 no.6
    • /
    • pp.1-8
    • /
    • 2005
  • In this paper, we propose a two-stage head tracking algorithm adequate for real-time active camera system having pan-tilt-zoom functions. In the color convergence stage, we first assume that the shape of a head is an ellipse and its model color histogram is acquired in advance. Then, the min-shift method is applied to roughly estimate a target position by examining the histogram similarity of the model and a candidate ellipse. To reflect the temporal change of object color and enhance the reliability of mean-shift based tracking, the target histogram obtained in the previous frame is considered to update the model histogram. In the updating process, to alleviate error-accumulation due to outliers in the target ellipse of the previous frame, the target histogram in the previous frame is obtained within an ellipse adaptively shrunken on the basis of the model histogram. In addition, to enhance tracking reliability further, we set the initial position closer to the true position by compensating the global motion, which is rapidly estimated on the basis of two 1-D projection datasets. In the subsequent stage, we refine the position and size of the ellipse obtained in the first stage by using shape information. Here, we define a robust shape-similarity function based on the gradient direction. Extensive experimental results proved that the proposed algorithm performs head hacking well, even when a person moves fast, the head size changes drastically, or the background has many clusters and distracting colors. Also, the propose algorithm can perform tracking with the processing speed of about 30 fps on a standard PC.

Pedestrian Detection Algorithm using a Gabor Filter Bank (Gabor Filter Bank를 이용한 보행자 검출 알고리즘)

  • Lee, Sewon;Jang, Jin-Won;Baek, Kwang-Ryul
    • 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.

Extraction of Car License Plate Region Using Histogram Features of Edge Direction (에지 영상의 방향성분 히스토그램 특징을 이용한 자동차 번호판 영역 추출)

  • Kim, Woo-Tae;Lim, Kil-Taek
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.14 no.3
    • /
    • pp.1-14
    • /
    • 2009
  • In this paper, we propose a feature vector and its applying method which can be utilized for the extraction of the car license plate region. The proposed feature vector is extracted from direction code histogram of edge direction of gradient vector of image. The feature vector extracted is forwarded to the MLP classifier which identifies character and garbage and then the recognition of the numeral and the location of the license plate region are performed. The experimental results show that the proposed methods are properly applied to the identification of character and garbage, the rough location of license plate, and the recognition of numeral in license plate region.

Bar Code Location Algorithm Using Pixel Gradient and Labeling (화소의 기울기와 레이블링을 이용한 효율적인 바코드 검출 알고리즘)

  • Kim, Seung-Jin;Jung, Yoon-Su;Kim, Bong-Seok;Won, Jong-Un;Won, Chul-Ho;Cho, Jin-Ho;Lee, Kuhn-Il
    • The KIPS Transactions:PartD
    • /
    • v.10D no.7
    • /
    • pp.1171-1176
    • /
    • 2003
  • In this paper, we propose an effective bar code detection algorithm using the feature analysis and the labeling. After computing the direction of pixels using four line operators, we obtain the histogram about the direction of pixels by a block unit. We calculate the difference between the maximum value and the minimum value of the histogram and consider the block that have the largest difference value as the block of the bar code region. We get the line passing by the bar code region with the selected block but detect blocks of interest to get the more accurate line. The largest difference value is used to decide the threshold value to obtain the binary image. After obtaining a binary image, we do the labeling about the binary image. Therefore, we find blocks of interest in the bar code region. We calculate the gradient and the center of the bar code with blocks of interest, and then get the line passing by the bar code and detect the bar code. As we obtain the gray level of the line passing by the bar code, we grasp the information of the bar code.

Local Prominent Directional Pattern for Gender Recognition of Facial Photographs and Sketches (Local Prominent Directional Pattern을 이용한 얼굴 사진과 스케치 영상 성별인식 방법)

  • Makhmudkhujaev, Farkhod;Chae, Oksam
    • Convergence Security Journal
    • /
    • v.19 no.2
    • /
    • pp.91-104
    • /
    • 2019
  • In this paper, we present a novel local descriptor, Local Prominent Directional Pattern (LPDP), to represent the description of facial images for gender recognition purpose. To achieve a clearly discriminative representation of local shape, presented method encodes a target pixel with the prominent directional variations in local structure from an analysis of statistics encompassed in the histogram of such directional variations. Use of the statistical information comes from the observation that a local neighboring region, having an edge going through it, demonstrate similar gradient directions, and hence, the prominent accumulations, accumulated from such gradient directions provide a solid base to represent the shape of that local structure. Unlike the sole use of gradient direction of a target pixel in existing methods, our coding scheme selects prominent edge directions accumulated from more samples (e.g., surrounding neighboring pixels), which, in turn, minimizes the effect of noise by suppressing the noisy accumulations of single or fewer samples. In this way, the presented encoding strategy provides the more discriminative shape of local structures while ensuring robustness to subtle changes such as local noise. We conduct extensive experiments on gender recognition datasets containing a wide range of challenges such as illumination, expression, age, and pose variations as well as sketch images, and observe the better performance of LPDP descriptor against existing local descriptors.

Improved Feature Selection Techniques for Image Retrieval based on Metaheuristic Optimization

  • Johari, Punit Kumar;Gupta, Rajendra Kumar
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.1
    • /
    • pp.40-48
    • /
    • 2021
  • Content-Based Image Retrieval (CBIR) system plays a vital role to retrieve the relevant images as per the user perception from the huge database is a challenging task. Images are represented is to employ a combination of low-level features as per their visual content to form a feature vector. To reduce the search time of a large database while retrieving images, a novel image retrieval technique based on feature dimensionality reduction is being proposed with the exploit of metaheuristic optimization techniques based on Genetic Algorithm (GA), Extended Binary Cuckoo Search (EBCS) and Whale Optimization Algorithm (WOA). Each image in the database is indexed using a feature vector comprising of fuzzified based color histogram descriptor for color and Median binary pattern were derived in the color space from HSI for texture feature variants respectively. Finally, results are being compared in terms of Precision, Recall, F-measure, Accuracy, and error rate with benchmark classification algorithms (Linear discriminant analysis, CatBoost, Extra Trees, Random Forest, Naive Bayes, light gradient boosting, Extreme gradient boosting, k-NN, and Ridge) to validate the efficiency of the proposed approach. Finally, a ranking of the techniques using TOPSIS has been considered choosing the best feature selection technique based on different model parameters.