2011
DOI: 10.1109/tce.2011.5955206
|View full text |Cite
|
Sign up to set email alerts
|

Efficient FPGA implementation of a high-quality super-resolution algorithm with real-time performance

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0
1

Year Published

2012
2012
2020
2020

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 22 publications
(13 citation statements)
references
References 10 publications
0
11
0
1
Order By: Relevance
“…The proposed 11-pipeline implementation on xc6vlx240t consumes a similar number of LUTs with that of the 4-core UHDTV case of [20] to achieve one order of magnitude faster execution than [20] running on Altera Aria II FPGA. Finally, when comparing to more demanding motion-estimation based SR implementations, the proposed FPGA design proves to be significantly faster and considerably cheaper: for QCIF image upsampling, a single-pipeline on Virtex5 provides up to 400x more fps with around 3x less LUTs than [49] (note however that, in general, motion-estimation based SR provides higher quality results).…”
Section: Design Exploration and Implementation Resultsmentioning
confidence: 99%
“…The proposed 11-pipeline implementation on xc6vlx240t consumes a similar number of LUTs with that of the 4-core UHDTV case of [20] to achieve one order of magnitude faster execution than [20] running on Altera Aria II FPGA. Finally, when comparing to more demanding motion-estimation based SR implementations, the proposed FPGA design proves to be significantly faster and considerably cheaper: for QCIF image upsampling, a single-pipeline on Virtex5 provides up to 400x more fps with around 3x less LUTs than [49] (note however that, in general, motion-estimation based SR provides higher quality results).…”
Section: Design Exploration and Implementation Resultsmentioning
confidence: 99%
“…For fusing the scaled LR images, different filters can be used, such as mean and median filters [125], [156], [157], [190], [216], [299], [479], adaptive normalized averaging [167], Adaboost classifier [364], and SVD-based filters [582]. These algorithms have been shown to be much faster than the IBP algorithms [ [58], [74], [115], [116], [124], [125], [156], [157], [226] (the last five are known as shift and add), [167], [176], [190], [299], [319], [364], [397], [479], [544], [546], [582] Non-parametric [418], [419], [426], [439], [514], [560], [563], [617] In [125], [156], [157], [216] it was shown that the median fusion of the LR images when they are registered, is equivalent to the ML estimation of the residual of the imaging model of Eq. (4) and results in a robust SR algorithm if the motion be...…”
Section: Direct Methodsmentioning
confidence: 99%
“…Beside increasing the speed of the algorithm it has been shown that this increases the robustness of the algorithm against the outliers which can be generated by different sources of errors, such as errors in the motion estimation [124]. Table 5 Reported IBP works [5], [6], [8], [13], [14] [124], [125], [128], [138], [147], [172], [177], [242], [249], [264], [270], [279], [280] [284], [325], [369], [392], [406], [446], [492], [501], [539], [546], [552] …”
Section: Iterative Back Projectionmentioning
confidence: 99%
“…A wide variety of such methods have been proposed in the literature [2][3][4][5][6]. Most of these methods begin with registration of LR frames to a common HR reference grid.…”
Section: Introductionmentioning
confidence: 99%