Pedestrian identification with distance transform and hierarchical search tree

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This work develops a novel and robust hierarchical search tree matching algorithm, in which the Distance Transform based pedestrian silhouette template database is constructed for efficient pedestrian identification. The proposed algorithm was implemented and its performance assessed. The proposed method achieved an accuracy of 89% true positive, 92% true negative and low false positive 8% rates when matching 1069 pedestrian objects and 568 non-pedestrian objects. The contributions of this work are twofold. First, a novel pedestrian silhouette database is presented based on the Chamfer Distance Transform. Second, the proposed hierarchical search tree matching strategy utilizing Fuzzy C-means clustering method can be adopted for mapping and locating pedestrian objects with robustness and efficiency. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Lin, D. T., & Liu, L. W. (2009). Pedestrian identification with distance transform and hierarchical search tree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5712 LNAI, pp. 431–438). https://doi.org/10.1007/978-3-642-04592-9_54

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free