

- #MICROSOFT RESEARCH AUTOCOLLAGE 2008 SOFTWARE#
- #MICROSOFT RESEARCH AUTOCOLLAGE 2008 TRIAL#
- #MICROSOFT RESEARCH AUTOCOLLAGE 2008 WINDOWS#
#MICROSOFT RESEARCH AUTOCOLLAGE 2008 WINDOWS#
Go to your Windows Start menu and choose All Programs | Microsoft Research AutoCollage 2008 | Microsoft Research AutoCollage 2008 (see Figure 1, above).You'll end up with a Microsoft Research AutoCollage 2008 program group in your Windows Start menu (see Figure 1 below).įigure 1: Microsoft Research AutoCollage 2008 Start menu Group Backįollow these steps to create your own collage using AutoCollage 2008:

Backĭownload the installer, run the setup routine and follow the instructions. The output can be printed, used in e-postcards, web pages or desktop backgrounds, or e-mailed to family and friends.
#MICROSOFT RESEARCH AUTOCOLLAGE 2008 TRIAL#
You can learn more about the product and download a free 30 day trial version of AutoCollage 2008 here.ĪutoCollage 2008 is a standalone application which allows users to compile a set of photographs into one seamless collage.
#MICROSOFT RESEARCH AUTOCOLLAGE 2008 SOFTWARE#
These labs conduct both basic and applied research in computer science and software engineering.ĪutoCollage 2008 evolved from their research.


BackĪutoCollage 2008 is from Microsoft Research, a part of Microsoft that has six worldwide labs. And when you want a quick collage, and don't really have the time to create it, then you'll really want to look at this new tool called AutoCollage 2008. To illustrate the power of AutoCollage, we have used it to create collages of many home photo sets we also conducted a user study in which AutoCollage outperformed competitive methods.It can often take hours to create the perfect collage using tools in programs like Adobe Photoshop, and even then, the collages created may not work all the time. Rather than attempt an expensive, integrated optimization procedure, we have developed a sequence of optimization steps, from static ranking of images, through region of interest optimization, optimal packing by constraint satisfaction, and lastly graph-cut alpha-expansion. Secondly the resulting optimization poses a search problem that, on the face of it, is computationally infeasible. Firstly, we show how energy terms can be included that: encourage the selection of a representative set of images that are sensitive to particular object classes that encourage a spatially efficient and seamless layout. This paper makes several new contributions. It is also assembled largely seamlessly, using graph-cut, Poisson blending of alpha-masks, to hide the joins between input images. The aim is that the resulting collage should be representative of the collection, summarising its main themes. The paper defines an automatic procedure for constructing a visually appealing collage from a collection of input images.
