English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Efficient Approximations for Support Vector Machines in Object Detection

Kienzle, W., BakIr, G., Franz, M., & Schölkopf, B. (2004). Efficient Approximations for Support Vector Machines in Object Detection. In C. Rasmussen, H. Bülthoff, B. Schölkopf, & M. Giese (Eds.), Pattern Recognition: 26th DAGM Symposium, Tübingen, Germany, August 30 - September 1, 2004 (pp. 54-61). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0013-F39F-A Version Permalink: https://hdl.handle.net/21.11116/0000-0005-512A-1
Genre: Conference Paper

Files

show Files

Locators

show
hide
Locator:
https://link.springer.com/content/pdf/10.1007%2F978-3-540-28649-3_7.pdf (Publisher version)
Description:
-
OA-Status:

Creators

show
hide
 Creators:
Kienzle, W1, 2, Author           
BakIr, G1, 2, Author           
Franz, M1, 2, Author           
Schölkopf, B1, 2, Author           
Affiliations:
1Department Empirical Inference, Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497795              
2Max Planck Institute for Biological Cybernetics, Max Planck Society, Spemannstrasse 38, 72076 Tübingen, DE, ou_1497794              

Content

show
hide
Free keywords: -
 Abstract: We present a new approximation scheme for support vector decision functions in object detection. In the present approach we are
building on an existing algorithm where the set of support vectors
is replaced by a smaller so-called reduced set of synthetic
points. Instead of finding the reduced set via unconstrained
optimization, we impose a structural constraint on the synthetic
vectors such that the resulting approximation can be evaluated via
separable filters. Applications that require scanning an entire
image can benefit from this representation: when using separable
filters, the average computational complexity for evaluating a
reduced set vector on a test patch of size (h x w) drops from
O(hw) to O(h+w). We show experimental results on
handwritten digits and face detection.

Details

show
hide
Language(s):
 Dates: 2004-09
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: 2844
DOI: 10.1007/978-3-540-28649-3_7
 Degree: -

Event

show
hide
Title: 26th Annual Symposium of the German Association for Pattern Recognition (DAGM 2004)
Place of Event: Tübingen, Germany
Start-/End Date: 2003-08-30 - 2001-09-01

Legal Case

show

Project information

show

Source 1

show
hide
Title: Pattern Recognition: 26th DAGM Symposium, Tübingen, Germany, August 30 - September 1, 2004
Source Genre: Proceedings
 Creator(s):
Rasmussen, CE1, Editor           
Bülthoff, HH1, Editor           
Schölkopf, B1, Editor           
Giese, MA, Editor           
Affiliations:
1 Max Planck Institute for Biological Cybernetics, Max Planck Society, ou_1497794            
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 54 - 61 Identifier: ISBN: 978-3-540-22945-2

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 3175 Sequence Number: - Start / End Page: - Identifier: -