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

• Journal of IKEEE
• /
• v.18 no.3
• /
• pp.398-402
• /
• 2014

In this paper, we propose a parallel processing method of pedestrian detection algorithm based on ROI-CENTRIST. There is a difficulty in the real-time processing of pedestrian detection in the embedded environment, using the conventional pedestrian detection method. This problem can be solved by a parallel processing method of applying the ROI to the conventional algorithm. The proposed parallel processing method of pedestrian detection using ROI-CENTRIST show the result of 5.2 frames per second, which is about 10% improvement over the conventional pedestrian detection method based on CENTRIST.

• Journal of Broadcast Engineering
• /
• v.25 no.5
• /
• pp.734-741
• /
• 2020

This article proposes a new pedestrian avoidance algorithm for social robots that coexist and communicate with humans and do not induce stress caused by invasion of psychological safety distance(Social Distance). To redefine the pedestrian model, pedestrians are clustered according to the pedestrian's gait characteristics(straightness, speed) and a social distance is defined for each pedestrian cluster. After modeling pedestrians(obstacles) with the social distances, integrated navigation algorithm is completed by applying the newly defined pedestrian model to commercial obstacle avoidance and path planning algorithms. To show the effectiveness of the proposed algorithm, two commercial obstacle avoidance & path planning algorithms(the Dynamic Window Approach (DWA) algorithm and the Timed Elastic Bands (TEB) algorithm) are used. Four cases were experimented in applying and non-applying the new pedestrian model, respectively. Simulation results show that the proposed algorithm can significantly reduce the stress index of pedestrians without loss of traveling time.

• Journal of Auto-vehicle Safety Association
• /
• v.11 no.3
• /
• pp.37-42
• /
• 2019

This paper presents an autonomous acceleration planning algorithm for pedestrian collision avoidance at urban. Various scenarios between pedestrians and a vehicle are designed to maneuver the planning algorithm. To simulate the scenarios, we analyze pedestrian's behavior and identify limitations of fusion sensors, lidar and vision camera. Acceleration is optimally determined by considering TTC (Time To Collision) and pedestrian's intention. Pedestrian's crossing intention is estimated for quick control decision to minimize full-braking situation, based on their velocity and position change. Feasibility of the proposed algorithm is verified by simulations using Carsim and Simulink, and comparisons with actual driving data.

• Journal of Multimedia Information System
• /
• v.6 no.1
• /
• pp.1-6
• /
• 2019

In the field of industrial applications, the real-time performance of the target detection problem is very important. The most serious time consumption in the pedestrian detection process is the extraction phase of the candidate window. To accelerate the speed, in this paper, a fast extraction of pedestrian candidate window based on the BING (Binarized Normed Gradients) algorithm replaces the traditional sliding window scanning. The BING features are extracted with the positive and negative samples and input into the two-stage SVM (Support Vector Machine) classifier for training. The obtained BING template may include a pedestrian candidate window. The trained template is loaded during detection, and the extracted candidate windows are input into the classifier. The experimental results show that the proposed method can extract fewer candidate window and has a higher recall rate with more rapid speed than the traditional sliding window detection method, so the method improves the detection speed while maintaining the detection accuracy. In addition, the real-time requirement is satisfied.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.8
• /
• pp.385-392
• /
• 2016

Market analysis for a business plain is required for the success in the modern world. Most important part in this analysis is pedestrian traffic counting. A traditional way for this is counting it in person. However, it causes high labor costs and mistakes. This paper proposes an automatic algorithm to measure the pedestrian traffic count using images with webcam. The proposed algorithm is composed of two parts: pedestrian area detection and movement tracking. In pedestrian area detection, moving blobs are extracted and pedestrian areas are detected using HoG features and Adaboost algorithm. In movement tracking, multi-level matching and false positive removal are applied to track pedestrian areas and count the pedestrian traffic. Multi-level matching is composed of 3 steps: (1) the similarity calculation between HoG area, (2) the similarity calculation of the estimated position with Kalman filtering, and (3) the similarity calculation of moving blobs in the pedestrian area detection. False positive removal is to remove invalid pedestrian area. To analyze the performance of the proposed algorithm, a comparison is performed with the previous human area detection and tracking algorithm. The proposed algorithm achieves 83.6% accuracy in the pedestrian traffic counting, which is better than the previous algorithm over 11%.

• Journal of Biomedical Engineering Research
• /
• v.31 no.6
• /
• pp.481-486
• /
• 2010

In this paper, we suggest an advanced algorithm, to recognize pedestrian/non-pedestrian using differential haar-like feature, which applies Adaboost algorithm to make a strong classification from weak classifications. First, we extract two feature vectors: horizontal haar-like feature and vertical haar-like feature. For the next, we calculate the proposed feature vector using differential haar-like method. And then, a strong classification needs to be obtained from weak classifications for composite recognition method using the differential area of horizontal and vertical haar-like. In the proposed method, we use one feature vector and one strong classification for the first stage of recognition. Based on our experiment, the proposed algorithm shows higher recognition rate compared to the traditional method for the pedestrian and non-pedestrian.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.11
• /
• pp.1189-1195
• /
• 2008

We introduce a MEMS-based pedestrian dead reckoning (PDR) system. A walking navigation algorithm for pedestrians is presented and map-matching algorithm for the navigation system based on dead reckoning (DR) is proposed. The PDR is equipped on the human body and provides the position information of pedestrians. And this is able to be used in ubiquitous sensor network (USN), U-hearth monitoring system, virtual reality (VR) and etc. The PDR detects a step using a novel technique and simultaneously estimates step length. Also an azimuth of the pedestrian is calculated using a fluxgate which is the one of magnetometers. Map-matching algorithm can be formulated to integrate the positioning data with the digital road network data. Map-matching algorithm not only enables the physical location to be identified from navigation system but also improves the positioning accuracy. However most of map-matching algorithms which are developed previously are for the car navigation system (CNS). Therefore they are not appropriate to implement to pedestrian navigation system based on DR system. In this paper, we propose walking navigation system and map-matching algorithm for PDR.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2310-2325
• /
• 2016

In this paper, we provide a trajectory-generation algorithm that can identify pedestrians in real time. Typically, the contours for the extraction of pedestrians from the foreground of images are not clear due to factors including brightness and shade; furthermore, pedestrians move in different directions and interact with each other. These issues mean that the identification of pedestrians and the generation of trajectories are somewhat difficult. We propose a new method for trajectory generation regarding multiple pedestrians. The first stage of the method distinguishes between those pedestrian-blob situations that need to be merged and those that require splitting, followed by the use of trained decision trees to separate the pedestrians. The second stage generates the trajectories of each pedestrian by using the point-correspondence method; however, we introduce a new point-correspondence algorithm for which the A* search method has been modified. By using fuzzy membership functions, a heuristic evaluation of the correspondence between the blobs was also conducted. The proposed method was implemented and tested with the PETS 2009 dataset to show an effective multiple-pedestrian-tracking capability in a pedestrian-interaction environment.

• ETRI Journal
• /
• v.32 no.6
• /
• pp.891-900
• /
• 2010

In this paper, a map-matching (MM) algorithm which combines an estimated position with digital road data is proposed. The presented algorithm using a virtual track is appropriate for a MEMS-based pedestrian dead reckoning (PDR) system, which can be used in mobile devices. Most of the previous MM algorithms are for car navigation systems and GPS-based navigation system, so existing MM algorithms are not appropriate for the pure DR-based pedestrian navigation system. The biggest problem of previous MM algorithms is that they cannot determine the correct road segment (link) due to the DR characteristics. In DR-based navigation system, the current position is propagated from the previous estimated position. This means that the MM result can be placed on a wrong link when MM algorithm fails to decide the correct link at once. It is a critical problem. Previous algorithms never overcome this problem because they did not consider pure DR characteristics. The MM algorithm using the virtual track is proposed to overcome this problem with improved accuracy. Performance of the proposed MM algorithm was verified by experiments.