• Title/Summary/Keyword: Histogram-based Classification

Search Result 97, Processing Time 0.026 seconds

3D Film Image Inspection Based on the Width of Optimized Height of Histogram (히스토그램의 최적 높이의 폭에 기반한 3차원 필름 영상 검사)

  • Jae-Eun Lee;Jong-Nam Kim
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.23 no.2
    • /
    • pp.107-114
    • /
    • 2022
  • In order to classify 3D film images as right or wrong, it is necessary to detect the pattern in a 3D film image. However, if the contrast of the pixels in the 3D film image is low, it is not easy to classify as the right and wrong 3D film images because the pattern in the image might not be clear. In this paper, we propose a method of classifying 3D film images as right or wrong by comparing the width at a specific frequency of each histogram after obtaining the histogram. Since, it is classified using the width of the histogram, the analysis process is not complicated. From the experiment, the histograms of right and wrong 3D film images were distinctly different, and the proposed algorithm reflects these features, and showed that all 3D film images were accurately classified at a specific frequency of the histogram. The performance of the proposed algorithm was verified to be the best through the comparison test with the other methods such as image subtraction, otsu thresholding, canny edge detection, morphological geodesic active contour, and support vector machines, and it was shown that excellent classification accuracy could be obtained without detecting the patterns in 3D film images.

Automatic Extraction of Rescue Requests from Drone Images: Focused on Urban Area Images (드론영상에서 구조요청자 자동추출 방안: 도심지역 촬영영상을 중심으로)

  • Park, Changmin
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.15 no.3
    • /
    • pp.37-44
    • /
    • 2019
  • In this study, we propose the automatic extraction method of Rescue Requests from Drone Images. A central object is extracted from each image by using central object extraction method[7] before classification. A central object in an images are defined as a set of regions that is lined around center of the image and has significant texture distribution against its surrounding. In this case of artificial objects, edge of straight line is often found, and texture is regular and directive. However, natural object's case is not. Such characteristics are extracted using Edge direction histogram energy and texture Gabor energy. The Edge direction histogram energy calculated based on the direction of only non-circular edges. The texture Gabor energy is calculated based on the 24-dimension Gebor filter bank. Maximum and minimum energy along direction in Gabor filter dictionary is selected. Finally, the extracted rescue requestor object areas using the dominant features of the objects. Through experiments, we obtain accuracy of more than 75% for extraction method using each features.

Crosswalk Detection using Feature Vectors in Road Images (특징 벡터를 이용한 도로영상의 횡단보도 검출)

  • Lee, Geun-mo;Park, Soon-Yong
    • The Journal of Korea Robotics Society
    • /
    • v.12 no.2
    • /
    • pp.217-227
    • /
    • 2017
  • Crosswalk detection is an important part of the Pedestrian Protection System in autonomous vehicles. Different methods of crosswalk detection have been introduced so far using crosswalk edge features, the distance between crosswalk blocks, laser scanning, Hough Transformation, and Fourier Transformation. However, most of these methods failed to detect crosswalks accurately, when they are damaged, faded away or partly occluded. Furthermore, these methods face difficulties when applying on real road environment where there are lot of vehicles. In this paper, we solve this problem by first using a region based binarization technique and x-axis histogram to detect the candidate crosswalk areas. Then, we apply Support Vector Machine (SVM) based classification method to decide whether the candidate areas contain a crosswalk or not. Experiment results prove that our method can detect crosswalks in different environment conditions with higher recognition rate even they are faded away or partly occluded.

A Fast Method for Face Detection based on PCA and SVM

  • Xia, Chun-Lei;Shin, Hyeon-Gab;Ha, Seok-Wun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.06a
    • /
    • pp.153-156
    • /
    • 2007
  • In this paper, we propose a fast face detection approach using PCA and SVM. In our detection system, first we filter the face potential area using statistical feature which is generated by analyzing local histogram distribution. And then, we use SVM classifier to detect whether there are faces present in the test image. Support Vector Machine (SVM) has great performance in classification task. PCA is used for dimension reduction of sample data. After PCA transform, the feature vectors, which are used for training SVM classifier, are generated. Our tests in this paper are based on CMU face database.

  • PDF

Nearest-Neighbors Based Weighted Method for the BOVW Applied to Image Classification

  • Xu, Mengxi;Sun, Quansen;Lu, Yingshu;Shen, Chenming
    • Journal of Electrical Engineering and Technology
    • /
    • v.10 no.4
    • /
    • pp.1877-1885
    • /
    • 2015
  • This paper presents a new Nearest-Neighbors based weighted representation for images and weighted K-Nearest-Neighbors (WKNN) classifier to improve the precision of image classification using the Bag of Visual Words (BOVW) based models. Scale-invariant feature transform (SIFT) features are firstly extracted from images. Then, the K-means++ algorithm is adopted in place of the conventional K-means algorithm to generate a more effective visual dictionary. Furthermore, the histogram of visual words becomes more expressive by utilizing the proposed weighted vector quantization (WVQ). Finally, WKNN classifier is applied to enhance the properties of the classification task between images in which similar levels of background noise are present. Average precision and absolute change degree are calculated to assess the classification performance and the stability of K-means++ algorithm, respectively. Experimental results on three diverse datasets: Caltech-101, Caltech-256 and PASCAL VOC 2011 show that the proposed WVQ method and WKNN method further improve the performance of classification.

An Efficient Indoor-Outdoor Scene Classification Method (효율적인 실내의 영상 분류 기법)

  • Kim, Won-Jun;Kim, Chang-Ick
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.46 no.5
    • /
    • pp.48-55
    • /
    • 2009
  • Prior research works in indoor-outdoor classification have been conducted based on a simple combination of low-level features. However, since there are many challenging problems due to the extreme variability of the scene contents, most methods proposed recently tend to combine the low-level features with high-level information such as the presence of trees and sky. To extract these regions from videos, we need to conduct additional tasks, which may yield the increasing number of feature dimensions or computational burden. Therefore, an efficient indoor-outdoor scene classification method is proposed in this paper. First, the video is divided into the five same-sized blocks. Then we define and use the edge and color orientation histogram (ECOH) descriptors to represent each sub-block efficiently. Finally, all ECOH values are simply concatenated to generated the feature vector. To justify the efficiency and robustness of the proposed method, a diverse database of over 1200 videos is evaluated. Moreover, we improve the classification performance by using different weight values determined through the learning process.

Multi-granular Angle Description for Plant Leaf Classification and Retrieval Based on Quotient Space

  • Xu, Guoqing;Wu, Ran;Wang, Qi
    • Journal of Information Processing Systems
    • /
    • v.16 no.3
    • /
    • pp.663-676
    • /
    • 2020
  • Plant leaf classification is a significant application of image processing techniques in modern agriculture. In this paper, a multi-granular angle description method is proposed for plant leaf classification and retrieval. The proposed method can describe leaf information from coarse to fine using multi-granular angle features. In the proposed method, each leaf contour is partitioned first with equal arc length under different granularities. And then three kinds of angle features are derived under each granular partition of leaf contour: angle value, angle histogram, and angular ternary pattern. These multi-granular angle features can capture both local and globe information of the leaf contour, and make a comprehensive description. In leaf matching stage, the simple city block metric is used to compute the dissimilarity of each pair of leaf under different granularities. And the matching scores at different granularities are fused based on quotient space theory to obtain the final leaf similarity measurement. Plant leaf classification and retrieval experiments are conducted on two challenging leaf image databases: Swedish leaf database and Flavia leaf database. The experimental results and the comparison with state-of-the-art methods indicate that proposed method has promising classification and retrieval performance.

Discretization Method Based on Quantiles for Variable Selection Using Mutual Information

  • CHa, Woon-Ock;Huh, Moon-Yul
    • Communications for Statistical Applications and Methods
    • /
    • v.12 no.3
    • /
    • pp.659-672
    • /
    • 2005
  • This paper evaluates discretization of continuous variables to select relevant variables for supervised learning using mutual information. Three discretization methods, MDL, Histogram and 4-Intervals are considered. The process of discretization and variable subset selection is evaluated according to the classification accuracies with the 6 real data sets of UCI databases. Results show that 4-Interval discretization method based on quantiles, is robust and efficient for variable selection process. We also visually evaluate the appropriateness of the selected subset of variables.

Illumination Mismatch Compensation Algorithm based on Layered Histogram Matching by Using Depth Information (깊이 정보에 따른 레이어별 히스토그램 매칭을 이용한 조명 불일치 보상 기법)

  • Lee, Dong-Seok;Yoo, Ji-Sang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.8C
    • /
    • pp.651-660
    • /
    • 2010
  • In this paper, we implement an efficient histogram-based prefiltering to compensate the illumination mismatches in regions between neighboring views. In multi-view video, such illumination disharmony can primarily occur on account of different camera location and orientation and an imperfect camera calibration. This discrepancy can cause the performance decrease of multi-view video coding(MVC) algorithm. A histogram matching algorithm can be exploited to make up for these differences in a prefiltering step. Once all camera frames of a multi-view sequence are adjusted to a predefined reference through the histogram matching, the coding efficiency of MVC is improved. However general frames of multi-view video sequence are composed of several regions with different color composition and their histogram distribution which are mutually independent of each other. In addition, the location and depth of these objects from sequeuces captured from different cameras can be different with different frames. Thus we propose a new algorithm which classify a image into several subpartitions by its depth information first and then histogram matching is performed for each region individually. Experimental results show that the compression ratio for the proposed algorithm is improved comparing with the conventional image-based algorithms.

Active Sonar Classification Algorithm based on HOG Feature (HOG 특징 기반 능동 소나 식별 기법)

  • Shin, Hyunhak;Park, Jaihyun;Ku, Bonhwa;Seo, Iksu;Kim, Taehwan;Lim, Junseok;Ko, Hanseok;Hong, Wooyoung
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.20 no.1
    • /
    • pp.33-39
    • /
    • 2017
  • In this paper, an effective feature which is capable of classifying targets among the detections obtained from 2D range-bearing maps generated in active sonar environments is proposed. Most conventional approaches for target classification with the 2D maps have considered magnitude of peak and statistical features of the area surrounding the peak. To improve the classification performance, HOG(Histogram of Gradient) feature, which is popular for their robustness in the image textures analysis is applied. In order to classify the target signal, SVM(Support Vector Machine) method with reduced HOG feature by the PCA(Principal Component Analysis) algorithm is incorporated. The various simulations are conducted with the real clutter signal data and the synthesized target signal data. According to the simulated results, the proposed method considering HOG feature is claimed to be effective when classifying the active sonar target compared to the conventional methods.