CSDL Home IEEE Transactions on Pattern Analysis & Machine Intelligence 2011 vol.33 Issue No.05 - May
Issue No.05 - May (2011 vol.33)
Uma Mudenagudi , BVB College of Engineering and Technology, Hubli
Subhashis Banerjee , IIT Delhi, New Delhi
Prem Kumar Kalra , IIT Delhi, New Delhi
We address the problem of super-resolution—obtaining high-resolution images and videos from multiple low-resolution inputs. The increased resolution can be in spatial or temporal dimensions, or even in both. We present a unified framework which uses a generative model of the imaging process and can address spatial super-resolution, space-time super-resolution, image deconvolution, single-image expansion, removal of noise, and image restoration. We model a high-resolution image or video as a Markov random field and use maximum a posteriori estimate as the final solution using graph-cut optimization technique. We derive insights into what super-resolution magnification factors are possible and the conditions necessary for super-resolution. We demonstrate spatial super-resolution reconstruction results with magnifications higher than predicted limits of magnification. We also formulate a scheme for selective super-resolution reconstruction of videos to obtain simultaneous increase of resolutions in both spatial and temporal directions. We show that it is possible to achieve space-time magnification factors beyond what has been suggested in the literature by selectively applying super-resolution constraints. We present results on both synthetic and real input sequences.
Super-resolution, Markov random field (MRF), maximum a posteriori (MAP), graph-cut, space-time, nonlinear, minimization.
Uma Mudenagudi, Subhashis Banerjee, Prem Kumar Kalra, "Space-Time Super-Resolution Using Graph-Cut Optimization", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.33, no. 5, pp. 995-1008, May 2011, doi:10.1109/TPAMI.2010.167