A survey of image registration techniques
ACM Computing Surveys (CSUR)
MLESAC: a new robust estimator with application to estimating image geometry
Computer Vision and Image Understanding - Special issue on robusst statistical techniques in image understanding
Mosaicing on Adaptive Manifolds
IEEE Transactions on Pattern Analysis and Machine Intelligence
Omnistereo: Panoramic Stereo Imaging
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
International Journal of Computer Vision
Texture Mixing and Texture Movie Synthesis Using Statistical Learning
IEEE Transactions on Visualization and Computer Graphics
Automated Mosaics via Topology Inference
IEEE Computer Graphics and Applications
Hierarchical Model-Based Motion Estimation
ECCV '92 Proceedings of the Second European Conference on Computer Vision
What Energy Functions Can Be Minimized via Graph Cuts?
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
Texture Synthesis by Non-Parametric Sampling
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Graphcut textures: image and video synthesis using graph cuts
ACM SIGGRAPH 2003 Papers
Robust Multi-Sensor Image Alignment
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Interactive digital photomontage
ACM SIGGRAPH 2004 Papers
Dynamosaics: Video Mosaics with Non-Chronological Time
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01
Optical Flow Estimation and Segmentation of Multiple Moving Dynamic Textures
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
ACM SIGGRAPH 2005 Papers
A Multilevel Banded Graph Cuts Method for Fast Image Segmentation
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 - Volume 01
On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
IEEE Transactions on Information Theory
Mosaicing new views: the Crossed-Slits projection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Improved seam carving for video retargeting
ACM SIGGRAPH 2008 papers
FGIT '09 Proceedings of the 1st International Conference on Future Generation Information Technology
Video condensation by ribbon carving
IEEE Transactions on Image Processing
ACM SIGGRAPH 2010 papers
Dynamic color flow: a motion-adaptive color model for object segmentation in video
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
Perception of blending in stereo motion panoramas
ACM Transactions on Applied Perception (TAP)
Cliplets: juxtaposing still and dynamic imagery
Proceedings of the 25th annual ACM symposium on User interface software and technology
State of the Art Report on Video-Based Graphics and Video Visualization
Computer Graphics Forum
Automated video looping with progressive dynamism
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
| Hi-index | 0.14 |
This paper explores the manipulation of time in video editing, enabling to control the chronological time of events. These time manipulations include slowing down (or postponing) some dynamic events while speeding up (or advancing) others. When a video camera scans a scene, aligning all the events to a single time interval will result in a panoramic movie. Time manipulations are obtained by first constructing an aligned space-time volume from the input video, and then sweeping a continuous 2D slice (time front) through that volume, generating a new sequence of images. For dynamic scenes, aligning the input video frames poses an important challenge. We propose to align dynamic scenes using a new notion of "dynamics constancy", which is more appropriate for this task than the traditional assumption of "brightness constancy".Another challenge is to avoid visual seams inside moving objects and other visual artifacts resulting from sweeping the space-time volumes with time fronts of arbitrary geometry. To avoid such artifacts, we formulate the problem of finding optimal time front geometry as one of finding a minimal cut in a 4D graph, and solve it using max-flow methods.