By Topic

RelCom: Relational combinatorics features for rapid object detection

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Venkataraman, V. ; Oklahoma State Univ., Stillwater, OK, USA ; Porikli, F.

We present a simple yet elegant feature, RelCom, and a boosted selection method to achieve a very low complexity object detector. We generate combinations of low-level feature coefficients and apply relational operators such as margin based similarity rule over each possible pair of these combinations to construct a proposition space. From this space we define combinatorial functions of Boolean operators to form complex hypotheses that model any logical proposition. In case these coefficients are associated with the pixel coordinates, they encapsulate higher order spatial structure within the object window. Our results on benchmark datasets prove that the boosted RelCom features can match the performance of HOG features on SVM-RBF while providing 5× speed up and significantly outperform SVM-linear while reducing the false alarm rate 5×~20×. In case of intensity features the improvement in false alarm rate over SVM-RBF is 14× with a 128× speed up. We also demonstrate that RelCom based on pixel features is very suitable and efficient for small object detection tasks.

Published in:

Computer Vision and Pattern Recognition Workshops (CVPRW), 2010 IEEE Computer Society Conference on

Date of Conference:

13-18 June 2010