2011
DOI: 10.1007/978-3-642-23687-7_53
|View full text |Cite
|
Sign up to set email alerts
|

Parallel Implementation of the Integral Histogram

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
5
4
1

Relationship

3
7

Authors

Journals

citations
Cited by 20 publications
(13 citation statements)
references
References 15 publications
0
13
0
Order By: Relevance
“…These strips are compute in a pipeline way. For an mn  image, if the width of each strip is w (Usually m could be exactly divided by w ), there would be / mw strips, each strip requires 2 log w steps to compute the integral image [10]. In experiments, we find that when =32 w , the architecture achieves the highest power efficiency and area efficiency.…”
Section: Advances In Intelligent Systems Research Volume 130mentioning
confidence: 97%
“…These strips are compute in a pipeline way. For an mn  image, if the width of each strip is w (Usually m could be exactly divided by w ), there would be / mw strips, each strip requires 2 log w steps to compute the integral image [10]. In experiments, we find that when =32 w , the architecture achieves the highest power efficiency and area efficiency.…”
Section: Advances In Intelligent Systems Research Volume 130mentioning
confidence: 97%
“…The integral histogram is a method to compute a cumulative histogram for each pixel of an image [7]. The OmpSs implementation performs a blocked cross-weave scan for each block of the image.…”
Section: Integral Histogrammentioning
confidence: 99%
“…Two scan orders, cross-weave and wavefront, are explored in [Bellens 2011]. The cross-weave scan processes the image in the first dimension (horizontal scan) followed by a scan in the second dimension (vertical scan).…”
Section: Integral Histogram Computationmentioning
confidence: 99%