Interactive digital photomontage

被引:589
作者
Agarwala, A [1 ]
Dontcheva, M
Agrawala, M
Drucker, S
Colburn, A
Curless, B
Salesin, D
Cohen, M
机构
[1] Univ Washington, Seattle, WA 98195 USA
[2] Microsoft Corp, Res, Redmond, WA 98052 USA
来源
ACM TRANSACTIONS ON GRAPHICS | 2004年 / 23卷 / 03期
关键词
interactive image editing; image compositing; user-guided optimization;
D O I
10.1145/1015706.1015718
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We describe an interactive, computer-assisted framework for combining parts of a set of photographs into a single composite picture, a process we call "digital photomontage." Our framework makes use of two techniques primarily: graph-cut optimization, to choose good seams within the constituent images so that they can be combined as seamlessly as possible; and gradient-domain fusion, a process based on Poisson equations, to further reduce any remaining visible artifacts in the composite. Also central to the framework is a suite of interactive tools that allow the user to specify a variety of high-level image objectives, either globally across the image, or locally through a painting-style interface. Image objectives are applied independently at each pixel location and generally involve a function of the pixel values (such as "maximum contrast") drawn from that same location in the set of source images. Typically, a user applies a series of image objectives iteratively in order to create a finished composite. The power of this framework lies in its generality; we show how it can be used for a wide variety of applications, including "selective composites" (for instance, group photos in which everyone looks their best), relighting, extended depth of field, panoramic stitching, clean-plate production, stroboscopic visualization of movement, and time-lapse mosaics.
引用
收藏
页码:294 / 302
页数:9
相关论文
共 28 条
[1]   Conveying shape and features with image-based relighting [J].
Akers, D ;
Losasso, F ;
Klingner, J ;
Agrawala, M ;
Rick, J ;
Hanrahan, P .
IEEE VISUALIZATION 2003, PROCEEDINGS, 2003, :349-354
[2]   Fast approximate energy minimization via graph cuts [J].
Boykov, Y ;
Veksler, O ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1222-1239
[3]  
Braun Marta., 1992, PICTURING TIME WORK
[4]  
Burt P. J., 1993, [1993] Proceedings Fourth International Conference on Computer Vision, P173, DOI 10.1109/ICCV.1993.378222
[5]   EUCLIDEAN DISTANCE MAPPING [J].
DANIELSSON, PE .
COMPUTER GRAPHICS AND IMAGE PROCESSING, 1980, 14 (03) :227-248
[6]   Mosaics of scenes with moving objects [J].
Davis, J .
1998 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, 1998, :354-360
[7]  
Fattal R, 2002, ACM T GRAPHIC, V21, P249
[8]  
Freeman WT, 2003, PROC CVPR IEEE, P151
[9]  
HAEBERLI P, 1994, GRAFICA OBSCURA WEB
[10]   Graphicut textures:: Image and video synthesis using graph cuts [J].
Kwatra, V ;
Schödl, A ;
Essa, I ;
Turk, G ;
Bobick, A .
ACM TRANSACTIONS ON GRAPHICS, 2003, 22 (03) :277-286