Filters








6,166 Hits in 4.2 sec

Generating Classic Mosaics with Graph Cuts

Y. Liu, O. Veksler, O. Juan
2010 Computer graphics forum (Print)  
Classic mosaic is an old and durable art form. Generating artificial classic mosaics from digital images is an interesting problem that has attracted attention in recent years.  ...  Our optimization method is based on graph cuts, which proved to be a powerful optimization tool in graphics and computer vision.  ...  Energy Optimization with Graph Cuts We formulate the mosaic generation as a labelling problem, and address it in the energy minimization framework.  ... 
doi:10.1111/j.1467-8659.2010.01752.x fatcat:iuho7ogxrnht7cexa7j6s4jv34

Real-time Video Mosaicing using Non-rigid Registration

Rafael Henrique Castanheira de Souza, Masatoshi Okutomi, Akihiko Torii
2012 IPSJ Transactions on Computer Vision and Applications  
with natural appearance; (4) we propose a fast image stitching algorithm for real-time mosaic rendering modeled as an instance of the minimum graph cut problem, applied to mesh triangles instead of the  ...  This paper presents a real-time incremental mosaicing method that generates a large seamless 2D image by stitching video key-frames as soon as they are detected.  ...  Generally, image stitching with graph cut uses a formulation in which the vertices represent pixels of the images being stitched together.  ... 
doi:10.2197/ipsjtcva.4.170 fatcat:wwtzgko35zhevfna5cgbnvh3bu

Fast Image Blending using Watersheds and Graph Cuts

N. R. E. Gracias, A. C. R. Gleason, S. Negahdaripour, M. H. Mahoor
2006 Procedings of the British Machine Vision Conference 2006  
The use of graph cuts over image pairs guarantees the globally optimal solution for each intersection region.  ...  Pair-wise image blending is performed independently in each region by means of watershed segmentation and graph cut optimization.  ...  The classical use of graph cuts in computer vision is to solve pixel-labelling problems. The input is a set of pixels P and a set of labels L.  ... 
doi:10.5244/c.20.49 dblp:conf/bmvc/GraciasGNM06 fatcat:ofebcz5cdzcwpp37qasvo47zvm

Fast image blending using watersheds and graph cuts

Nuno Gracias, Mohammad Mahoor, Shahriar Negahdaripour, Arthur Gleason
2009 Image and Vision Computing  
The use of graph cuts over image pairs guarantees the globally optimal solution for each intersection region.  ...  Pair-wise image blending is performed independently in each region by means of watershed segmentation and graph cut optimization.  ...  The classical use of graph cuts in computer vision is to solve pixel-labelling problems. The input is a set of pixels P and a set of labels L.  ... 
doi:10.1016/j.imavis.2008.04.014 fatcat:ffhiegkokvei3exh7fa6zq2ilq

Minimal Aspect Distortion (MAD) Mosaicing of Long Scenes

Alex Rav-Acha, Giora Engel, Shmuel Peleg
2007 International Journal of Computer Vision  
An iterative graph-cuts approach, with planar labels and a flexible similarity measure, allows the computation of a dense depth for the entire sequence.  ...  Long scenes can be imaged by mosaicing multiple images from cameras scanning the scene.  ...  Note also that the MAD mosaic avoids cutting inside moving objects 6 Dynamic Image Based Rendering with X-Slits MAD mosaicing generates a single panoramic image with minimal distortions.  ... 
doi:10.1007/s11263-007-0101-9 fatcat:newf5ywb4reftnrzpc7ktolhvm

Automatic Seam-Line Detection in UAV Remote Sensing Image Mosaicking by Use of Graph Cuts

Ming Li, Deren Li, Bingxuan Guo, Lin Li, Teng Wu, Weilong Zhang
2018 ISPRS International Journal of Geo-Information  
For the existing problems of seam, pixel aliasing, and ghosting in mosaic images, this paper proposes and implements an optimal seam-line search method based on graph cuts for unmanned aerial vehicle (  ...  Finally, the optimal seam-line can be obtained by solving the minimum value of target energy function based on graph cuts.  ...  Classic Graph Cuts-Based Optimal Seam-Line Search Method from OpenCV Library If the reference image and the image to be registered have been completely registered, any mosaic method based on graph cuts  ... 
doi:10.3390/ijgi7090361 fatcat:bkeakjzyofek7jq6fnkojje534

Artificial Mosaic Generation with Gradient Vector Flow and Tile Cutting

Sebastiano Battiato, Alfredo Milone, Giovanni Puglisi
2013 Journal of Electrical and Computer Engineering  
In this paper, we propose a mosaic generation technique based on gradient vector flow (GVF) together with a set of tile cutting heuristics evaluated according to aesthetic criteria.  ...  The effectiveness of the proposed approach has been confirmed by a series of tests and comparisons with state-of-the-art techniques.  ...  Several mosaics have been generated from each image of the dataset with various tile cutting parameter values.  ... 
doi:10.1155/2013/908905 fatcat:3wlvjjbdtfdmdman63awmstmmy

Dynamic Scene Stitching Driven by Visual Cognition Model

Li-hui Zou, Dezheng Zhang, Aziguli Wulamu
2014 The Scientific World Journal  
Combined with the manifold-based mosaicing framework, dynamic scene stitching is formulated as a cut path optimization problem in a constructed space-time graph.  ...  The optimum cut path can minimize the cognitive saliency difference throughout the whole video volume.  ...  And then the strips are selected from the middle of video frames according to the classical manifold mosaicing technique.  ... 
doi:10.1155/2014/981724 pmid:24688451 pmcid:PMC3932260 fatcat:xhbpsrbaqregbktu4cthkf7xwm

3D airspace design by evolutionary computation

Daniel Delahaye, Stephane Puechmorel
2008 2008 IEEE/AIAA 27th Digital Avionics Systems Conference  
This paper presents a new method for 3D cutting of geometrical space with application to airspace sectoring.  ...  This problem consists in nding a cutting of a 3D volume into sectors in order to balance the weights of sectors and which minimizes the ow cut on sector boundaries.  ...  The rst criterion is a classical classi cation problem with a connectivity constraint.  ... 
doi:10.1109/dasc.2008.4702803 fatcat:eol4wzwm5bc3hbstjkh4l5a5g4

Complexity Measures for Mosaic Drawings [chapter]

Quirijn W. Bouts, Bettina Speckmann, Kevin Verbeek
2017 Lecture Notes in Computer Science  
Also this bound is tight: we show how to draw outerplanar graphs with k ears in O(nk) area with L-shaped vertex configurations and straight channels.  ...  If we use only straight channels, then every outerplanar graph with k ears requires at least Ω(nk) area.  ...  Fig. 1 : 1 A mosaic drawing with complex channels (left) of an outerplanar graph (middle). The same graph drawn with straight channels (right).  ... 
doi:10.1007/978-3-319-53925-6_12 fatcat:5mfo4dlyevca3hvzeyjddy744y

Optical flow with structure information for epithelial image mosaicing

Sharib Ali, Khuram Faraz, Christian Daul, Walter Blondel
2015 2015 37th Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)  
The algorithm accuracy is first assessed with simulated sequences and then used for mosaicing standard clinical endoscopic data.  ...  Mosaicing of biological tissue surfaces is challenging due to the weak image textures. This contribution presents a mosaicing algorithm based on a robust and accurate variational optical flow scheme.  ...  Fig. 1 : 1 Human skin data-I mosaic with the proposed method. 900× 1400 pixels mosaic was obtained with I 0 being the first image.  ... 
doi:10.1109/embc.2015.7318773 pmid:26736673 dblp:conf/embc/AliFDB15 fatcat:5q6tivmljzbvfarw3ldn2bhige

Graph-based Analysis of Textured Images for Hierarchical Segmentation

Raffaele Gaetano, Giuseppe Scarpa, Tamas Sziranyi
2010 Procedings of the British Machine Vision Conference 2010  
technique aimed at cutting the graphs and correspondingly segment groups of connected components with a similar spatial context.  ...  A procedure based on mathematical morphology will be introduced that allows for the construction of a color-wise image representation by means of multiple graph structures, along with a simple clustering  ...  Graph cuts, obtained by removing links below an automatically determined threshold, carry out the texture patterns.  ... 
doi:10.5244/c.24.74 dblp:conf/bmvc/GaetanoSS10 fatcat:j2ws5nsumzg4ljpep5knf6uutu

SEAMLESS IMAGE MOSAICKING VIA SYNCHRONIZATION

E. Santellani, E. Maset, A. Fusiello
2018 ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences  
To better conceal the mosaic seamlines, images are cut along specific paths, computed using a Voronoi decomposition of the mosaic area and a shortest path algorithm.  ...  This paper proposes an innovative method to create high-quality seamless planar mosaics.  ...  Best path identification: Dijkstra's algorithm (Dijkstra, 1959) is used over the generated graph to find the path of minimum cost.  ... 
doi:10.5194/isprs-annals-iv-2-247-2018 fatcat:lfdwbb5qf5ea7f4potozxrrnau

Unsupervised texture segmentation using monogenic curvelets and the Potts model

Martin Storath, Andreas Weinmann, Michael Unser
2014 2014 IEEE International Conference on Image Processing (ICIP)  
In particular, our algorithm has more favorable computational costs for high-dimensional data than graph cuts. Our feature vectors are based on monogenic curvelets.  ...  The advantage over classical curvelets is that they yield smoother amplitudes due to the envelope effect of the monogenic signal.  ...  A state-of-the-art minimization strategy is based on graph cuts [14] . This type of algorithm has also been deployed for texture segmentation [15] .  ... 
doi:10.1109/icip.2014.7025883 dblp:conf/icip/StorathWU14 fatcat:xnbi7woscrhddbea3v3txuyez4

Stipple Placement using Distance in a Weighted Graph [article]

David Mould
2007 Computational Aesthetics in Graphics  
Our algorithm transforms an image into a regular graph, with edge weights given by the local gradient magnitude of the input image.  ...  We also show how irregular mosaics can be organized and the mosaic tiles shaped using the same underlying mechanism.  ...  We would like to investigate methods for generating a more coherent depiction of high-frequency texture structure.  ... 
doi:10.2312/compaesth/compaesth07/045-052 fatcat:cj6xyf2y55frhdngjjgndqui6e
« Previous Showing results 1 — 15 out of 6,166 results