Fast multiple histogram computation using Kruskal's algorithm

Raoul Berger 1 Séverine Dubuisson 1 Christophe Gonzales 2
1 PEQUAN - Performance et Qualité des Algorithmes Numériques
LIP6 - Laboratoire d'Informatique de Paris 6
2 DECISION
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : In this paper, we propose a novel approach to speed-up the computation of the histograms of multiple overlapping non rotating regions of a single image. The idea is to exploit the overlaps between regions to minimize the number of redundant computations. More precisely, once the histogram of a region has been computed, this one can be used to compute part of the histogram of another overlapping region. For this purpose, an optimal computation order of the regions needs to be determined and we show how this can be obtained as the solution of a minimum spanning tree of a graph modeling the overlaps between regions. This tree is computed using Kruskal's algorithm and parsing it in a depth-first search manner determines precisely how the histogram of a region can be computed efficiently from that of its parent in the tree. We show that, in practical situations, this approach can outperform the well-known integral histogram both in terms of computation times and in terms of memory consumption.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01269933
Contributor : Lip6 Publications <>
Submitted on : Friday, February 5, 2016 - 2:22:49 PM
Last modification on : Thursday, March 21, 2019 - 2:42:10 PM

Identifiers

Citation

Raoul Berger, Séverine Dubuisson, Christophe Gonzales. Fast multiple histogram computation using Kruskal's algorithm. International Conference on Image Processing (ICIP'12), Sep 2012, Orlando, United States. pp.2373-2376, ⟨10.1109/ICIP.2012.6467374⟩. ⟨hal-01269933⟩

Share

Metrics

Record views

75