 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
 |
Basic idea:
|
|
|
|
• |
define a
destination (dst) image of desired resolution
|
|
|
|
• |
assume mapping
from dst to each input image is known
|
|
|
|
– |
usually a
combination of a 2D motion/warp and an average
|
|
|
(point-spread
function)
|
|
|
|
– |
can be expressed
as a set of linear constraints
|
|
|
|
– |
sometimes the
mapping is solved for as well
|
|
|
|
• |
add some form of
regularization (e.g., “smoothness
|
|
|
assumption”)
|
|
|
|
– |
can also be
expressed using linear constraints
|
|
|
|
– |
but L1, other
nonlinear methods work better
|
|