Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
Fast triangular binning kernel approximations for weighted gradient histogram creation
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Signal Processing. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
2014 (English)In: 2014 IEEE International Conference on Electronics, Computing and Communication Technologies (IEEE CONECCT), 2014, 6740351- p.Conference paper, Published paper (Refereed)
Abstract [en]

The implementation of weighted gradient histograms are studied. Such histograms are commonly used in computer vision methods, and their creation can make up a significant portion of the computational cost. Further, due to potentially severe aliasing, non-uniform binning kernels are desirable. We show that previously presented fast methods for uniform binning kernels can be extended to non-uniform binning, and that the triangular kernel can be well approximated for common weighting strategies. The approximation is implemented with sums and products of projections of the gradient samples on specially chosen vectors. Consequently, only a few standard arithmetic operations are required, and therefore, the suggested implementation has a significantly lower computational cost when compared with an implementation in which the gradient argument and magnitude are explicitly evaluated. Finally, the frequency components of the different kernels are studied to quantify the fundamental gain achieved by using triangular kernels instead of uniform kernels.

Place, publisher, year, edition, pages
2014. 6740351- p.
Keyword [en]
Arithmetic operations, Computational costs, Fast methods, Frequency components, Gradient histograms, Kernel approximation, Non-uniform, Weighting strategies, Communication systems, Computer vision, Statistical methods
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-136275DOI: 10.1109/CONECCT.2014.6740351ISI: 000349779700066Scopus ID: 2-s2.0-84900674987ISBN: 978-1-4799-2318-2 (print)OAI: oai:DiVA.org:kth-136275DiVA: diva2:675685
Conference
2014 IEEE International Conference on Electronics, Computing and Communication Technologies, IEEE CONECCT 2014; Bangalore; India; 6 January 2014 through 7 January 2014
Note

QC 20140225

Available from: 2013-12-04 Created: 2013-12-04 Last updated: 2015-03-27Bibliographically approved

Open Access in DiVA

fulltext(469 kB)110 downloads
File information
File name FULLTEXT01.pdfFile size 469 kBChecksum SHA-512
1f8e2dd977c1aa2b5ec4a2b4284a81c838e64d4e97ad2a36a85a0516881a058b1504c499ae8b04a0ae6d6c54580639857ada05ba43b76d9428b2fbd01b922d2f
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusConference web

Search in DiVA

By author/editor
Kristensen, JohanNilsson, John-Olof
By organisation
Signal ProcessingACCESS Linnaeus Centre
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar
Total: 110 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: 96 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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