|Doubly Sparse Structure In Image Super Resolution|
|Toshiyuki Kato, Waseda University|
Hideitsu Hino, University of Tsukuba
Noboru Murata, Waseda University
There are a large number of image super resolution algorithms based on the sparse coding, and some algorithms realize multi-frame super resolution. For utilizing multiple low resolution observations, both accurate image registration and sparse coding are required. Previous study on multi-frame super resolution based on sparse coding firstly apply block matching for image registration, followed by sparse coding to enhance the image resolution. In this paper, these two problems are solved by optimizing a single objective function. The proposed formulation not only has a mathematically interesting structure called the double sparsity, but also offers improved numerical performance.