2011 IEEE International Symposium on Broadband Multimedia Systems and Broadcasting (BMSB) 2011
DOI: 10.1109/bmsb.2011.5954965
|View full text |Cite
|
Sign up to set email alerts
|

Spatio-temporal regularization featuring novel temporal priors and multiple reference motion estimation

Abstract: Handling input content ranging from low resolution and highly compressed internet streams up to high definition video is a challenging task for modern flat panel TVs. Considering that the consumer is accustomed to HD content, superior processing is mandatory especially for low bit-rate video with very low quality. In this paper, we describe a novel spatio-temporal and image content adaptive regularization algorithm, which can deal with this entire content well. This algorithm can significantly improve the vide… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…Most works in single-frame or video SRR seek robustness by considering cost functions including non-quadratic (e.g. L 1 ) error norms [4], [7], [25] or signal dependent regularizations [9], [36], which result in non-linear algorithms. Although these techniques achieve good reconstruction results, their increased computational cost makes real-time operation unfeasible even for the fastest algorithms.…”
Section: Improving the Robustness To Innovationsmentioning
confidence: 99%
“…Most works in single-frame or video SRR seek robustness by considering cost functions including non-quadratic (e.g. L 1 ) error norms [4], [7], [25] or signal dependent regularizations [9], [36], which result in non-linear algorithms. Although these techniques achieve good reconstruction results, their increased computational cost makes real-time operation unfeasible even for the fastest algorithms.…”
Section: Improving the Robustness To Innovationsmentioning
confidence: 99%