Fast image blending using watersheds and graph cuts

Nuno Gracias, Art Gleason, Shahriar Negahdaripour, Mohammad Mahoor

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Scopus citations


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 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. 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 frees the need for a weighting parameter. Finally, it allows the efficient creation of large mosaics, without user intervention. We illustrate the performance of the approach on image sequences with prominent 3D content and moving objects.

Original languageEnglish
Title of host publicationBMVC 2006 - Proceedings of the British Machine Vision Conference 2006
PublisherBritish Machine Vision Association, BMVA
Number of pages10
StatePublished - Jan 1 2006
Event2006 17th British Machine Vision Conference, BMVC 2006 - Edinburgh, United Kingdom
Duration: Sep 4 2006Sep 7 2006


Other2006 17th British Machine Vision Conference, BMVC 2006
Country/TerritoryUnited Kingdom

ASJC Scopus subject areas

  • Computer Vision and Pattern Recognition


Dive into the research topics of 'Fast image blending using watersheds and graph cuts'. Together they form a unique fingerprint.

Cite this