2012 IEEE Southwest Symposium on Image Analysis and Interpretation 2012
DOI: 10.1109/ssiai.2012.6202458
|View full text |Cite
|
Sign up to set email alerts
|

Performance-analysis-based acceleration of image quality assessment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
6
1

Relationship

3
4

Authors

Journals

citations
Cited by 9 publications
(11 citation statements)
references
References 36 publications
0
11
0
Order By: Relevance
“…Thereafter, the sum of values within any block of the matrix can be rapidly computed via addition/subtraction of three values in the table. A similar technique can be used to compute higher-order moments such as the variance, skewness, and kurtosis (see, e.g., [362,363]).…”
Section: Acceleration Of Image Transforms and Local Statisticsmentioning
confidence: 99%
“…Thereafter, the sum of values within any block of the matrix can be rapidly computed via addition/subtraction of three values in the table. A similar technique can be used to compute higher-order moments such as the variance, skewness, and kurtosis (see, e.g., [362,363]).…”
Section: Acceleration Of Image Transforms and Local Statisticsmentioning
confidence: 99%
“…Another contribution of this work is a unique implementation of BLIINDS-II's statistical operations designed specifically for use on the GPU. As a result, we are able to present to a version of BLIINDS-II that is capable of real-time performance, significantly improving upon the previously reported runtime after CPU optimizations in C++ [3]. A high speed of execution is critical in application of IQA to video delivery systems, where minimizing the lag is very important.…”
Section: Discussionmentioning
confidence: 81%
“…Metrics related to compute utilization, achieved memory bandwidth and latency were analyzed to achieve better runtime performance across various images of natural scenes with various distortions and varying levels of each. For all time comparisons, between the C++ implementation and the CUDA implementation of the algorithm, we have used the results reported in [3] for C++ and our own observations for CUDA. Table 1 provides technical specifications of our test system.…”
Section: Experimental Methodologymentioning
confidence: 99%
“…In [28], Phan et al proposed four techniques to accelerate the MAD IQA algorithm: (1) using integral images for the local statistical computation; (2) using procedural expansion and strength reduction; (3) using a GPGPU implementation of the log-Gabor decomposition; and (4) precomputation and caching of the log-Gabor filters. As reported in [22], the first two modifications yielded an approximate 17× speedup over the original MAD implementation, and the latter two yield an approximately 47× speedup.…”
Section: Acceleration Of Qa Algorithmsmentioning
confidence: 99%
“…In our previous related work [28], we compared the timings of naive vs. optimized C++ ports of MAD, and vs. using a Matlab-based GPU implementation of only the log-Gabor decomposition. Although significant speedups were obtained relative to the naive implementation, the use of the GPU contributed only a 1.6×-1.8× speedup over the CPU-based optimizations, which is reasonable considering only the log-Gabor decomposition was deployed on the GPU, and considering the fact that it was a Matlab-based GPU port.…”
Section: Introductionmentioning
confidence: 99%