2010
DOI: 10.1007/978-3-642-15986-2_32
|View full text |Cite
|
Sign up to set email alerts
|

A Convex Approach for Variational Super-Resolution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
52
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
4
4
1

Relationship

1
8

Authors

Journals

citations
Cited by 35 publications
(52 citation statements)
references
References 16 publications
0
52
0
Order By: Relevance
“…To highlight these results in this paper, we show log intensity and velocity field estimates at certain time-stamps to highlight how they resemble images and optical flow fields from standard cameras. However, we believe that these results are best viewed in the accompanying video on our project webpage 1 , where also show that we can estimate super-resolution log-intensity and velocity, via a simple extension to our formulation based on the work of Unger et al for standard cameras [22]. Although we do not discuss the super-resolution method in detail here, it is important to highlight that event camera data allows us to perform intensity and velocity estimation at sub-pixel resolution.…”
Section: Methodsmentioning
confidence: 71%
“…To highlight these results in this paper, we show log intensity and velocity field estimates at certain time-stamps to highlight how they resemble images and optical flow fields from standard cameras. However, we believe that these results are best viewed in the accompanying video on our project webpage 1 , where also show that we can estimate super-resolution log-intensity and velocity, via a simple extension to our formulation based on the work of Unger et al for standard cameras [22]. Although we do not discuss the super-resolution method in detail here, it is important to highlight that event camera data allows us to perform intensity and velocity estimation at sub-pixel resolution.…”
Section: Methodsmentioning
confidence: 71%
“…The energy combines discrete and continuous components: a sum over the n discrete pixel samples, and a continuous integral over spatial locations x, and it is our claim that optimization of this discrete/continuous energy has previously been proposed only in strictly special cases. Work that comes close to minimizing (6) includes [20], who compute an integral over a piecewise-continuous grid representation of u, and [13], who compute the integral over a quadrilateral. Similarly, discrete superresolution techniques [3, §5.4], describe an area-sampling approximation to the integral, but none refine the underlying grid, or allow arbitrary boundary positions.…”
Section: The New Modelmentioning
confidence: 99%
“…Again given V, the integral becomes a sum over triangles κ1(x)u t φ(x)dx, computed as the sum over all triangles t which intersect Qi. The integral is easily computed by convex polygon clipping, then applying Green's theorem on the returned boundary (20). Note that the pixels at the image edge need not be specially treated: triangles which intersect any pixel contribute to the integral, and those which intersect no pixel will be filled by the prior.…”
Section: Computing the Regularizer Termmentioning
confidence: 99%
“…It is inherently ill-posed, as several different HR images can map to the very same LR image. The field can be mainly divided into methods where an edge-preserving smoothness term is utilized [38], co-occurrences of patches within the same image are exploited [14], or, currently most successful, a mapping from LR to HR image patches is learned [8,32,37,42].…”
Section: Related Workmentioning
confidence: 99%