Energy based video synthesis

Authors:
Ranga Rodrigo;Zhenhe Chen;Jagath Samarabandu
Affiliations:
The University of Western Ontario, Department of Electrical and Computer Engineering, London, Ontario, Canada;The University of Western Ontario, Department of Electrical and Computer Engineering, London, Ontario, Canada;The University of Western Ontario, Department of Electrical and Computer Engineering, London, Ontario, Canada
Venue:
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
Year:
2006

Citing 5
Cited 0

Fast Approximate Energy Minimization via Graph Cuts

IEEE Transactions on Pattern Analysis and Machine Intelligence
Graphcut textures: image and video synthesis using graph cuts

ACM SIGGRAPH 2003 Papers
Efficient graph-based energy minimization methods in computer vision

Efficient graph-based energy minimization methods in computer vision
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision

IEEE Transactions on Pattern Analysis and Machine Intelligence
MCMC for joint noise reduction and missing data treatment indegraded video

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes an optimal method of inserting new frames or recovering missing frames in a video sequence. The method is based on an optimization scheme using graph-cuts that finds the 'optimal' frames to be inserted in between two given frames. The core problem is a typical visual correspondence problem between pixels in two or more frames and having formulated the appropriate energy, graph-cuts can be used for optimization. The two frames are assumed to be 'close' and the motion of the objects is small. The motion is seen as a set of two dimensional disparities, and the graph-cuts based optimization is able to find these. Once the disparities are found, an intermediate frame can be trivially placed at an arbitrary position in between the two original frames. The advantage of using graph-cuts instead of the typical techniques used in calculating optical flow lies in the global nature of the graph-cuts optimization. The success of our method is shown with synthetic and real image sequences. We show how the method can be extended to insert multiple frames in between the given two frames. One of the immediate applications is generation of synthetic slow-motion sequences.