liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Incremental computation of feature hierarchies
Linköping University, Department of Electrical Engineering, Computer Vision. Linköping University, The Institute of Technology.ORCID iD: 0000-0002-6096-3648
2010 (English)In: Pattern Recognition: 32nd DAGM Symposium, Darmstadt, Germany, September 22-24, 2010. Proceedings / [ed] Michael Goesele, Stefan Roth, Arjan Kuijper, Bernt Schiele and Konrad Schindler, Springer Berlin/Heidelberg, 2010, 523-532 p.Conference paper, Published paper (Refereed)
Abstract [en]

Feature hierarchies are essential to many visual object recognition systems and are well motivated by observations in biological systems. The present paper proposes an algorithm to incrementally compute feature hierarchies. The features are represented as estimated densities, using a variant of local soft histograms. The kernel functions used for this estimation in conjunction with their unitary extension establish a tight frame and results from framelet theory apply. Traversing the feature hierarchy requires resampling of the spatial and the feature bins. For the resampling, we derive a multi-resolution scheme for quadratic spline kernels and we derive an optimization algorithm for the upsampling. We complement the theoretic results by some illustrative experiments, consideration of convergence rate and computational efficiency.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2010. 523-532 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 6376
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-60596DOI: 10.1007/978-3-642-15986-2_53ISI: 000288936400053ISBN: 978-3-642-15985-5 (print)ISBN: 978-3-642-15986-2 (print)OAI: oai:DiVA.org:liu-60596DiVA: diva2:358047
Conference
32nd DAGM Symposium, Darmstadt, Germany, September 22-24, 2010
Projects
DIPLECSGARNICSELLIIT
Available from: 2010-10-20 Created: 2010-10-20 Last updated: 2016-05-04Bibliographically approved

Open Access in DiVA

fulltext(420 kB)322 downloads
File information
File name FULLTEXT01.pdfFile size 420 kBChecksum SHA-512
da3bd90b5db72306912ebb9261649a0a071bc97d2a161bdb1d3df295525d2a537de3cbfe4b0548760a2093519e0a92657f04ab4cc278e92180008856dd58cc34
Type fulltextMimetype application/pdf

Other links

Publisher's full textfind book at a swedish library/hitta boken i ett svenskt bibliotek

Authority records BETA

Felsberg, Michael

Search in DiVA

By author/editor
Felsberg, Michael
By organisation
Computer VisionThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 322 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 565 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf