• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.5
• /
• pp.62-70
• /
• 2016

Ensuring walkability in a city where pedestrians and vehicles coexist is an issue of critical importance. The relative relationship between vehicle transit and walkability improvements complicates the evaluation of walkability, which thus necessitates the formation of a quantitative standard by which a methodological measurement of walkability can be achieved inside the pedestrian network. Therefore, a model is determined whereby quantitative indices such as, but not limited to, experiences of accessibility, mobility, and convenience within the network are estimated. This research proposes the integration of space syntax theory and the logit path choice model in the evaluation of walkability. Space syntax theory assesses adequacy of the constructed pedestrian network through calculation of the link integration value, while the logit model estimates its safety, mobility, and accessibility using probability. The advantage of the integrated model hence lies in its ability to sufficiently reflect such evaluation measures as the integration value, mobility convenience, accessibility potential, and safety experienced by the demand in a quantitative manner through probability computation. In this research, the Dial Algorithm is used to arrive at a solution to the logit model. This process requires that the physical distance of the pedestrian network and the perceptive distance of space syntax theory be made equivalent. In this, the research makes use of network expansion to reflect wait times. The evaluation index calculated through the integrated model is reviewed and using the results of this sample network, the applicability of the model is assessed.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.2
• /
• pp.166-171
• /
• 2013

The method proposed in this paper can improve the performance of the Boosting algorithm in machine learning. The proposed Boundary AdaBoost algorithm can make up for the weak points of Normal binary classifier using threshold boundary concepts. The new proposed boundary can be located near the threshold of the binary classifier. The proposed algorithm improves classification in areas where Normal binary classifier is weak. Thus, the optimal boundary final classifier can decrease error rates classified with more reasonable features. Finally, this paper derives the new algorithm's optimal solution, and it demonstrates how classifier accuracy can be improved using the proposed Boundary AdaBoost in a simulation experiment of pedestrian detection using 10-fold cross validation.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.38 no.6
• /
• pp.941-947
• /
• 2018

Station transfers for smart card based railway networks refer to transfer pedestrian movements that occur at the origin and destination nodes rather than at a middle station. To calculate the optimum path for the railway network, a penalty for transfer pedestrian movement must be included in addition to the cost of within-car transit time. However, the existing link label-based path searching method is constructed so that the station transfer penalty between two links is detected. As such, station transfer penalties that appear at the origin and destination stations are not adequately reflected, limiting the effectiveness of the model. A ghost node may be introduced to expand the network, to make up for the station transfer penalty, but has a pitfall in that the link label-based path algorithm will not hold up effectively. This research proposes an optimal path search algorithm to reflect station transfer penalties without resorting to enlargement of the existing network. To achieve this, a method for applying a directline transfer penalty by comparing Ticket Gate ID and the line of the link is proposed.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.269-275
• /
• 2013

Recently, importance of pedestrian road network is getting emphasized as it is possible to provide mobile device users with both route guidance services and surrounding spatial information. However, it costs a tremendous amount of budget for generating and renovating pedestrian road network nationally, which hinder further advances of these services. Hence, algorithms extracting pedestrian road network automatically based on raster data are needed. On the other hand, road dataset generated from raster data usually has unnecessary vertices which lead to maintenance disutility such as excessive turns and increase in data memory. Therefore, this study proposed a method of selecting a proper threshold automatically for separate road entity using not only Douglas-Peucker algorithm but also road attribute data of digital map in order to remove redundant vertices, which maximizes line simplification efficiency and minimizes distortion of shape of roads simultaneously. As a result of the test, proposed method was suitable for automatic line simplification in terms of reduction ratio of vertices and accuracy of position.

• ETRI Journal
• /
• v.35 no.6
• /
• pp.1084-1093
• /
• 2013

problem of pedestrian localization using mobile nodes containing impulse radio ultra wideband (IR-UWB) is considered. IEEE 802.15.4a-based IR-UWB can achieve accurate ranging. However, the coverage is as short as 30 m, owing to the restricted transmit power. This factor may cause a poor geometric relationship among the mobile nodes and anchor nodes in certain environments. To localize a group of pedestrians accurately, an enhanced cooperative localization method is proposed. We describe a sequential algorithm and define problems that may occur in the implementation of the algorithm. To solve these problems, a batch algorithm is proposed. The batch algorithm can be carried out after performing the sequential algorithm to linearize the nonlinear range equation. When a sequential algorithm cannot be performed due to a poor geometric relationship among nodes, a batch algorithm can be carried out directly. Herein, Monte Carlo simulations are presented to illustrate the proposed method and verify its performance.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.65 no.2
• /
• pp.130-135
• /
• 2016

Gait recognition has advantage of non-contact type recognition. But It has disadvantage of low recognition rate when the pedestrian silhouette is changed due to bag or coat. In this paper, we proposed new method using combination of gait energy image feature and thermal face image feature. First, we extracted a face image which has optimal focusing value using human body rate and Tenengrad algorithm. Second step, we extracted features from gait energy image and thermal face image using linear discriminant analysis. Third, calculate euclidean distance between train data and test data, and optimize weights using genetic algorithm. Finally, we compute classification using nearest neighbor classification algorithm. So the proposed method shows a better result than the conventional method.

• Archives of design research
• /
• v.20 no.3 s.71
• /
• pp.203-214
• /
• 2007

This study proposes an information retrieval method reflecting the user's preferences based on the fuzzy set theory to develop information contents which support pedestrian's navigation. Firstly, the research evaluated subjects' preferences on commercial spaces set to a hypothetical destination. Also it surveyed the causal relationship between the visual characteristics and the emotional characteristics to propose methods of Navigation Knowledge Base (NKB). The NKB was composed of three elements; 1. the correlation model between emotional characteristics, 2. the causal relationship between visual characteristics and emotional characteristics, 3. the transformation model between visual characteristics and the physical characteristics. Secondly, this study classified the pedestrian's destination search into 4 types with his or her preferences and the time conditions limited during navigation. For each type it presented the Destination Search Algorithm (DSA). Finally, the research simulated the destination search in 4 navigation types using NKB and DSA and verified the availability of the information retrieval method reflecting pedestrian's preferences. In conclusion, the proposed information search method will be applied to reflect the user's preferences to develop information appliances.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.13 no.12
• /
• pp.6040-6045
• /
• 2012

In this study, by utilizing the information fusion of multi sensor data and time within the crosswalk safety Assistive gait secondary to the safety of pedestrians on the system design and system performance verification through support to. Environmental awareness, and time information in addition to leveraging the default behavior for pedestrian safety design of the secondary system performed a study on the scenario and the behavior of a system for fuzzy control was performed for each sensor data processing, median filtering, including filters processing leveraging, and was attached by the time we complete the final algorithm, the system behavior. In addition, taking advantage of the sensor measurements, so basically uncertainties and sensor results, and you want to give at least the reliability of the data fusion experiment equipment using this simple verification.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.10
• /
• pp.190-196
• /
• 2014

This paper proposes a mobile-optimized pedestrian detection method using Cascade of HOG(Histograms of Oriented Gradients) for ADAS(Advanced Driver Assistance System) on smartphones. In order to use the limited resource of mobile platforms efficiently, the method is implemented by the OpenCL(Open Computing Language) library, and its processing time is reduced in the following two aspects. Firstly, the method sets a program build option specifically and adjusts work group sizes as variety of kernels in the host code. Secondly, it utilizes local memory and a LUT(Look-Up Table) in the kernel code to accelerate the program. For performance evaluation, the developed algorithm is compared with the mobile CPU-based OpenCV(Open Computer Vision) for Android function. The experimental results show that the processing speed is 25% faster than the OpenCV hogcascade.

• Journal of Korea Spatial Information System Society
• /
• v.12 no.1
• /
• pp.76-84
• /
• 2010

Many pedestrian simulation models for micro-scale spaces as building indoor areas have been proposed for the last decade and two models - social force model and floor field model - are getting attention. Among these, CA-based floor field model is viewed more favourable for computer simulations than computationally complex social force model. However, Kirchner's floor field model has limitations in capturing the differences in dynamic values of different agents and this study proposes an enhanced algorithm. This study improved the floor field model in order for an agent to be able to exclude the influences of its own dynamic values by changing the data structure, and, also modified the initial dynamic value problem in order to fit more realistic environment. In the simulations, real 3D building data stored in a spatial DBMS were used considering future integration with indoor localization sensors and real time applications.