Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
NPAR '02 Proceedings of the 2nd international symposium on Non-photorealistic animation and rendering
EP '98/RIDT '98 Proceedings of the 7th International Conference on Electronic Publishing, Held Jointly with the 4th International Conference on Raster Imaging and Digital Typography: Electronic Publishing, Artistic Imaging, and Digital Typography
ACM SIGGRAPH 2003 Papers
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
ACM SIGGRAPH 2006 Papers
Photo tourism: exploring photo collections in 3D
ACM SIGGRAPH 2006 Papers
ACM SIGGRAPH 2006 Papers
CVPR '06 Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1
Scene completion using millions of photographs
ACM SIGGRAPH 2007 papers
Seam carving for content-aware image resizing
ACM SIGGRAPH 2007 papers
Finding paths through the world's photos
ACM SIGGRAPH 2008 papers
Improved seam carving for video retargeting
ACM SIGGRAPH 2008 papers
ACM SIGGRAPH 2008 papers
Perception of complex aggregates
ACM SIGGRAPH 2008 papers
ACM SIGGRAPH Asia 2008 papers
PatchMatch: a randomized correspondence algorithm for structural image editing
ACM SIGGRAPH 2009 papers
Coordinates for instant image cloning
ACM SIGGRAPH 2009 papers
Sketch2Photo: internet image montage
ACM SIGGRAPH Asia 2009 papers
Hi-index | 0.00 |
We present a novel method for generating a slide show, which takes as input a collection of images, and outputs a video consisting of these images, switching between images smoothly in a continuous zoom-like process: as the sequence plays, a miniature of the next image is embedded in the current image and enlarges until eventually replaces the current image. Color differences, texture similarity, image complexity, etc. are taken into account to measure the distance between two images. Based on this distance, a dynamic programming algorithm is used to generate the best playing sequece which minimizes the sum of distances between successive images. The embedded image is naturally merged with the current one for smooth sequence through a graph-cut-guided blending strategy, and interframe coherence is maintained to avoid abrupt change. Experiments show that our approach is very effective on image collections of scenic spots.