• Title/Summary/Keyword: Orientation histogram

Search Result 51, Processing Time 0.025 seconds

Edge Orientation Histogram Hand Shape Recognition for Window Player (윈도우 플레이어 제어를 위한 에지 방향성 히스토그램 손 형상 인식)

  • 김종민;이칠우
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10b
    • /
    • pp.628-630
    • /
    • 2003
  • 본 연구는 손의 형상을 복잡한 배경환경에서 손 영역을 안정적으로 검출, 인식하여 윈도우 플레이어의 기능을 제어하는 시스템을 제안하였다. 손은 형상이 매우 복잡하기 때문에 2차원 형상의 불변량에 해당하는 에지의 방향성 히스토그램을 이용하여 인식을 행한다. 이 방법은 복잡한 배경에서 피부색을 지닌 손 영역이 정확히 추출되며 손 형상을 인식하는데 있어서 수행속도가 빠르고 조명변화에 덜 민감하기 때문에 실시간 손 형상 인식에 적합하다. 본 논문에서 제안한 방법을 윈도우 플레이어 제어에 적용한 결과 안정적으로 제어 할 수 있었다.

  • PDF

Line Segments Map Building Using Sonar for Mobile Robot (초음파 센서를 이용한 이동 로봇의 직선선분 지도 작성)

  • Hong, Hyeon-Ju;Gwon, Seok-Geun;No, Yeong-Sik
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.7 no.9
    • /
    • pp.783-789
    • /
    • 2001
  • The purpose of this study is to build and to manage environment models with line segments from the sonar range data on obstacles in unknown and varied environments. The proposed method subsequently employs a two-stage data-transform process in order to extract environmental line segments from the range data on obstacles. In the first stage, the occupancy grid extracted from the range data is accumulated to a two-dimensional local histogram grid. In the second stage, a line histogram extracted from an local histogram gird is based on a Hough transform, and matching is a process of comparing each of the segments in the global line segments map against the line segments to detect similarity in overlap, orientation, and arrangement. Each of these tests is made by comparing one of the parameters in the segment representation. After the tests, new line segments are composed to the global line segments map. The proposed technique is illustrated by experiments in an indoor environment.

  • PDF

Extraction of Lane-Reined Information Based on an EDF and Hough Transform (EDF와 하프변환 기반의 차선관련 정보 검출)

  • Lee Joonwoong;Lee Kiyong
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.13 no.3
    • /
    • pp.48-57
    • /
    • 2005
  • This paper presents a novel algorithm in order to extract lane-related information based on machine vision techniques. The algorithm makes up for the weak points of the former method, the Edge Distribution Function(EDF)-based approach, by introducing a Lane Boundary Pixel Extractor (LBPE) and the well-known Hough Transform(HT). The LBPE that serves as a filter to extract pixels expected to be on lane boundaries enhances the robustness of machine vision, and provides its results to the HT implementation and EDF construction. The HT forms the accumulator arrays and extracts the lane-related parameters composed of orientation and distance. Furthermore, as the histogram of edge magnitude with respect to edge orientation angle, the EDF has peaks at the orientations corresponding to lane slopes on the perspective image domain. Therefore, by fusing the results from the EDF and the HT the proposed algorithm improves the confidence of the extracted lane-related information. The system shows successful results under various degrees of illumination.

Study on Robustness of Communication Service : By the Cloning SIM Card in Chinese GSM (통신서비스의 건전성 연구 : 중국 GSM 카드복제를 통한 보안 취약성에 대하여)

  • Kim, Shik
    • The Journal of Information Technology
    • /
    • v.12 no.4
    • /
    • pp.1-10
    • /
    • 2009
  • The robustness of communication service should be guaranteed to validate its security of the whole service not just high performance. One kind of practical test-beds is the chinese communication service based on SIM Card and GSM. In paper, we try to experiment the possibility of SIM cards clone in various mobile communications using 2G in china, and hence discovered the security vulnerabilities such as the incoming outgoing, SMS service and additional services on the mobile phones using clone SIM cards. The experiments show that chinese communication service should be prepared the Fraud Management System against the cloning SIM card. and furthermore, regulations related to the communication service should be tuned the realistic security environments.

  • PDF

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.

Improving Matching Performance of SURF Using Color and Relative Position (위치와 색상 정보를 사용한 SURF 정합 성능 향상 기법)

  • Lee, KyungSeung;Kim, Daehoon;Rho, Seungmin;Hwang, Eenjun
    • Journal of Advanced Navigation Technology
    • /
    • v.16 no.2
    • /
    • pp.394-400
    • /
    • 2012
  • SURF is a robust local invariant feature descriptor and has been used in many applications such as object recognition. Even though this algorithm has similar matching accuracy compared to the SIFT, which is another popular feature extraction algorithm, it has advantage in matching time. However, these descriptors do not consider relative location information of extracted interesting points to guarantee rotation invariance. Also, since they use gray image of original color image, they do not use the color information of images, either. In this paper, we propose a method for improving matching performance of SURF descriptor using the color and relative location information of interest points. The location information is built from the angles between the line connecting the centers of interest points and the orientation line constructed for the center of each interest points. For the color information, color histogram is constructed for the region of each interest point. We show the performance of our scheme through experiments.

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.

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.

Face Detection using Orientation(In-Plane Rotation) Invariant Facial Region Segmentation and Local Binary Patterns(LBP) (방향 회전에 불변한 얼굴 영역 분할과 LBP를 이용한 얼굴 검출)

  • Lee, Hee-Jae;Kim, Ha-Young;Lee, David;Lee, Sang-Goog
    • Journal of KIISE
    • /
    • v.44 no.7
    • /
    • pp.692-702
    • /
    • 2017
  • Face detection using the LBP based feature descriptor has issues in that it can not represent spatial information between facial shape and facial components such as eyes, nose and mouth. To address these issues, in previous research, a facial image was divided into a number of square sub-regions. However, since the sub-regions are divided into different numbers and sizes, the division criteria of the sub-region suitable for the database used in the experiment is ambiguous, the dimension of the LBP histogram increases in proportion to the number of sub-regions and as the number of sub-regions increases, the sensitivity to facial orientation rotation increases significantly. In this paper, we present a novel facial region segmentation method that can solve in-plane rotation issues associated with LBP based feature descriptors and the number of dimensions of feature descriptors. As a result, the proposed method showed detection accuracy of 99.0278% from a single facial image rotated in orientation.

Crowd Activity Recognition using Optical Flow Orientation Distribution

  • Kim, Jinpyung;Jang, Gyujin;Kim, Gyujin;Kim, Moon-Hyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.8
    • /
    • pp.2948-2963
    • /
    • 2015
  • In the field of computer vision, visual surveillance systems have recently become an important research topic. Growth in this area is being driven by both the increase in the availability of inexpensive computing devices and image sensors as well as the general inefficiency of manual surveillance and monitoring. In particular, the ultimate goal for many visual surveillance systems is to provide automatic activity recognition for events at a given site. A higher level of understanding of these activities requires certain lower-level computer vision tasks to be performed. So in this paper, we propose an intelligent activity recognition model that uses a structure learning method and a classification method. The structure learning method is provided as a K2-learning algorithm that generates Bayesian networks of causal relationships between sensors for a given activity. The statistical characteristics of the sensor values and the topological characteristics of the generated graphs are learned for each activity, and then a neural network is designed to classify the current activity according to the features extracted from the multiple sensor values that have been collected. Finally, the proposed method is implemented and tested by using PETS2013 benchmark data.