Integral histogram: a fast way to extract histograms in Cartesian spaces Export

@inproceedings{Porikli:2005:IntegralHistogram, abstract = {We present a novel method, which we refer as an integral histogram, to compute the histograms of all possible target regions in a Cartesian data space. Our method has three distinct advantages: 1) It is computationally superior to the conventional approach. The integral histogram method makes it possible to employ even an exhaustive search process in real-time, which was impractical before. 2) It can be extended to higher data dimensions, uniform and nonuniform bin formations, and multiple target scales without sacrificing its computational advantages. 3) It enables the description of higher level histogram features. We exploit the spatial arrangement of data points, and recursively propagate an aggregated histogram by starting from the origin and traversing through the remaining points along either a scan-line or a wave-front. At each step, we update a single bin using the values of integral histogram at the previously visited neighboring data points. After the integral histogram is propagated, histogram of any target region can be computed easily by using simple arithmetic operations.}, author = {Porikli, F.}, booktitle = {Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on}, citeulike-article-id = {2158311}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/CVPR.2005.188}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1467353}, doi = {10.1109/CVPR.2005.188}, journal = {Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on}, keywords = {histogram, integral, thesis}, pages = {829--836 vol. 1}, posted-at = {2007-12-22 03:24:15}, priority = {2}, title = {Integral histogram: a fast way to extract histograms in Cartesian spaces}, url = {http://dx.doi.org/10.1109/CVPR.2005.188}, volume = {1}, year = {2005} }

TY - CONF ID - Porikli:2005:IntegralHistogram L3 - citeulike-article-id:2158311 N2 - We present a novel method, which we refer as an integral histogram, to compute the histograms of all possible target regions in a Cartesian data space. Our method has three distinct advantages: 1) It is computationally superior to the conventional approach. The integral histogram method makes it possible to employ even an exhaustive search process in real-time, which was impractical before. 2) It can be extended to higher data dimensions, uniform and nonuniform bin formations, and multiple target scales without sacrificing its computational advantages. 3) It enables the description of higher level histogram features. We exploit the spatial arrangement of data points, and recursively propagate an aggregated histogram by starting from the origin and traversing through the remaining points along either a scan-line or a wave-front. At each step, we update a single bin using the values of integral histogram at the previously visited neighboring data points. After the integral histogram is propagated, histogram of any target region can be computed easily by using simple arithmetic operations. JF - Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on EP - 836 vol. 1 TI - Integral histogram: a fast way to extract histograms in Cartesian spaces VL - 1 T2 - Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on SP - 829 KW - histogram KW - integral KW - thesis AU - Porikli, F PY - 2005/// UR - http://dx.doi.org/10.1109/CVPR.2005.188 ER -