Tree-structured Temporal Information for Fast Histogram Computation

Explore this paper's citation graph

Summary

This paper presents a new method for fast histogram computing based on the known tree-representation histogram of a region, also called reference histogram, and shows theoretically and with experimental results the superiority of this approach in many cases.

Type
preprint
Published
2010-01-01
Cited by
0
References
17
Access
Open access

Keywords

Histogram, Computer science, Histogram matching, Adaptive histogram equalization, Preprocessor

References

Cited by

No citing papers recorded for this paper.

Related papers