Content-aware photo collage using circle packing

In this paper, we present a novel approach for automatically creating the photo collage that assembles the interest regions of a given group of images naturally. Previous methods on photo collage are generally built upon a well-defined optimization framework, which computes all the geometric paramet...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 20(2014), 2 vom: 19. Feb., Seite 182-95
1. Verfasser: Yu, Zongqiao (VerfasserIn)
Weitere Verfasser: Lu, Lin, Guo, Yanwen, Fan, Rongfei, Liu, Mingming, Wang, Wenping
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2014
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article Research Support, Non-U.S. Gov't
LEADER 01000naa a22002652 4500
001 NLM233834176
003 DE-627
005 20231224095944.0
007 cr uuu---uuuuu
008 231224s2014 xx |||||o 00| ||eng c
024 7 |a 10.1109/TVCG.2013.106  |2 doi 
028 5 2 |a pubmed24n0779.xml 
035 |a (DE-627)NLM233834176 
035 |a (NLM)24356362 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Yu, Zongqiao  |e verfasserin  |4 aut 
245 1 0 |a Content-aware photo collage using circle packing 
264 1 |c 2014 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 13.08.2014 
500 |a Date Revised 20.12.2013 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a In this paper, we present a novel approach for automatically creating the photo collage that assembles the interest regions of a given group of images naturally. Previous methods on photo collage are generally built upon a well-defined optimization framework, which computes all the geometric parameters and layer indices for input photos on the given canvas by optimizing a unified objective function. The complex nonlinear form of optimization function limits their scalability and efficiency. From the geometric point of view, we recast the generation of collage as a region partition problem such that each image is displayed in its corresponding region partitioned from the canvas. The core of this is an efficient power-diagram-based circle packing algorithm that arranges a series of circles assigned to input photos compactly in the given canvas. To favor important photos, the circles are associated with image importances determined by an image ranking process. A heuristic search process is developed to ensure that salient information of each photo is displayed in the polygonal area resulting from circle packing. With our new formulation, each factor influencing the state of a photo is optimized in an independent stage, and computation of the optimal states for neighboring photos are completely decoupled. This improves the scalability of collage results and ensures their diversity. We also devise a saliency-based image fusion scheme to generate seamless compositive collage. Our approach can generate the collages on nonrectangular canvases and supports interactive collage that allows the user to refine collage results according to his/her personal preferences. We conduct extensive experiments and show the superiority of our algorithm by comparing against previous methods 
650 4 |a Journal Article 
650 4 |a Research Support, Non-U.S. Gov't 
700 1 |a Lu, Lin  |e verfasserin  |4 aut 
700 1 |a Guo, Yanwen  |e verfasserin  |4 aut 
700 1 |a Fan, Rongfei  |e verfasserin  |4 aut 
700 1 |a Liu, Mingming  |e verfasserin  |4 aut 
700 1 |a Wang, Wenping  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 20(2014), 2 vom: 19. Feb., Seite 182-95  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g volume:20  |g year:2014  |g number:2  |g day:19  |g month:02  |g pages:182-95 
856 4 0 |u http://dx.doi.org/10.1109/TVCG.2013.106  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 20  |j 2014  |e 2  |b 19  |c 02  |h 182-95