A multiresolution spline with application to image mosaics
ACM Transactions on Graphics (TOG)
Watersheds in Digital Spaces: An Efficient Algorithm Based on Immersion Simulations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Geodesic Saliency of Watershed Contours and Hierarchical Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Stereo Without Epipolar Lines: A Maximum-Flow Formulation
International Journal of Computer Vision - Special issue on computer vision research at NEC Research Institute
The watershed transform: definitions, algorithms and parallelization strategies
Fundamenta Informaticae - Special issue on mathematical morphology
Image quilting for texture synthesis and transfer
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Watersnakes: Energy-Driven Watershed Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Occlusions, Discontinuities, and Epipolar Lines in Stereo
ECCV '98 Proceedings of the 5th European Conference on Computer Vision-Volume I - Volume I
Markov Random Fields with Efficient Approximations
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Mosaics of Scenes with Moving Objects
CVPR '98 Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition
Graphcut textures: image and video synthesis using graph cuts
ACM SIGGRAPH 2003 Papers
A Maximum-Flow Formulation of the N-Camera Stereo Correspondence Problem
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
ICCV '03 Proceedings of the Ninth IEEE International Conference on Computer Vision - Volume 2
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
Interactive digital photomontage
ACM SIGGRAPH 2004 Papers
ACM SIGGRAPH 2004 Papers
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Morphological Image Compositing
IEEE Transactions on Pattern Analysis and Machine Intelligence
Creating entirely textured 3D models of real objects using surface flattening
Machine Graphics & Vision International Journal
A comparative study of energy minimization methods for markov random fields
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part II
Analysis on multiresolution mosaic images
IEEE Transactions on Image Processing
Sequential image stitching for mobile panoramas
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Fast and high-quality image blending on mobile phones
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Reconfigurable AUV for intervention missions: a case study on underwater object recovery
Intelligent Service Robotics
Panorama weaving: fast and flexible seam processing
ACM Transactions on Graphics (TOG) - SIGGRAPH 2012 Conference Proceedings
Fast topology estimation for image mosaicing using adaptive information thresholding
Robotics and Autonomous Systems
Seamless stitching of stereo images for generating infinite panoramas
Proceedings of the 19th ACM Symposium on Virtual Reality Software and Technology
Hi-index | 0.00 |
This paper presents a novel approach for combining a set of registered images into a composite mosaic with no visible seams and minimal texture distortion. To promote execution speed in building large area mosaics, the mosaic space is divided into disjoint regions of image intersection based on a geometric criterion. Pair-wise image blending is performed independently in each region by means of watershed segmentation and graph cut optimization. A contribution of this work - use of watershed segmentation on image differences to find possible cuts over areas of low photometric difference - allows for searching over a much smaller set of watershed segments, instead of over the entire set of pixels in the intersection zone. Watershed transform seeks areas of low difference when creating boundaries of each segment. Constraining the overall cutting lines to be a sequence of watershed segment boundaries results in significant reduction of search space. The solution is found efficiently via graph cut, using a photometric criterion. The proposed method presents several advantages. The use of graph cuts over image pairs guarantees the globally optimal solution for each intersection region. The independence of such regions makes the algorithm suitable for parallel implementation. The separated use of the geometric and photometric criteria leads to reduced memory requirements and a compact storage of the input data. Finally, it allows the efficient creation of large mosaics, without user intervention. We illustrate the performance of the approach on image sequences with prominent 3-D content and moving objects.