On features ordering for rapid object detection

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Consider a real time classification problem which requires testing the value of a large number of features. Let Tj be the average computation time of the jth feature, and let Rj be its average rejection probability. In many real-world problems, such as defect detection on printed circuits or plasma screens, minimizing classifier execution time is of paramount importance because of its effect on the entire productions and QA process. We show that if features are independent, the best way to arrange them is according to the ratio Rj/Tj. This yields a minimal-time algorithm for features ordering in object detection framework when feature values are independent of each other, and motivates a simple algorithm for ordering features that are not independent. The algorithm obtains comparable classification results to [15], but is twice as fast.

Original languageEnglish
Title of host publication2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008
Pages509-513
Number of pages5
DOIs
StatePublished - 1 Dec 2008
Event2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008 - Eilat, Israel
Duration: 3 Dec 20085 Dec 2008

Publication series

NameIEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings

Conference

Conference2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, IEEEI 2008
Country/TerritoryIsrael
CityEilat
Period3/12/085/12/08

Keywords

  • Feature ordering
  • Processing time
  • Rejection probability

Fingerprint

Dive into the research topics of 'On features ordering for rapid object detection'. Together they form a unique fingerprint.

Cite this