Accelerating integral histograms using an adaptive approach

4Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Many approaches in computer vision require multiple retrievals of histograms for rectangular patches of an input image. In 2005 an algorithm to accelerate these retrievals was presented. The data structure utilized is called Integral Histogram, which was based on the well known Integral Image. In this paper we propose a novel approximating method to obtain these integral histograms that outperforms the original algorithm and reduces computational cost to more than a tenth. Alongside we will show that our adaptive approach still provides reasonable accuracy - which allows dramatic performance improvements for real-time applications while still being well suited for numerous computer vision tasks. © 2008 Springer-Verlag.

Cite

CITATION STYLE

APA

Müller, T., Lenz, C., Barner, S., & Knoll, A. (2008). Accelerating integral histograms using an adaptive approach. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5099 LNCS, pp. 209–217). https://doi.org/10.1007/978-3-540-69905-7_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free