Filters








2,582 Hits in 5.5 sec

Simulating Classic Mosaics with Graph Cuts [chapter]

Yu Liu, Olga Veksler, Olivier Juan
Lecture Notes in Computer Science  
Classic mosaic is one of the oldest and most durable art forms. There has been a growing interest in simulating classic mosaics from digital images recently.  ...  For the second step of tightly packing the tiles, we develop a novel graph cuts based algorithm.  ...  Simulating Classic Mosaics with Graph Cuts In this section, we give a detailed description of our algorithm.  ... 
doi:10.1007/978-3-540-74198-5_5 fatcat:th4sjmo2znht3fah5kdmnyt434

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  ...  The performance of the proposed method is validated by experiments in non-controlled conditions and by comparison with a state-of-the-art method.  ...  Introduction Mosaicing is a classical application of image registration. Typically, a set of images is stitched together to simulate a camera with a larger field of view.  ... 
doi:10.2197/ipsjtcva.4.170 fatcat:wwtzgko35zhevfna5cgbnvh3bu

Generating Classic Mosaics with Graph Cuts

Y. Liu, O. Veksler, O. Juan
2010 Computer graphics forum (Print)  
Our optimization method is based on graph cuts, which proved to be a powerful optimization tool in graphics and computer vision.  ...  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.  ...  There are mosaic types other than classic. Crystallization mosaic [DHJN02, FDF05, Hae90] is a simulation of a glassstone mosaic.  ... 
doi:10.1111/j.1467-8659.2010.01752.x fatcat:iuho7ogxrnht7cexa7j6s4jv34

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.  ...  Computing stereo with constant disparities can be done with the regular graph-cuts (Boykov et al. 2001) .  ... 
doi:10.1007/s11263-007-0101-9 fatcat:newf5ywb4reftnrzpc7ktolhvm

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

Study of CCD mosaic configurations for the ILMT: Astrometry and photometry of point sources in the absence of a TDI corrector

B. Vangeyte, J. Manfroid, J. Surdej
2002 Astronomy and Astrophysics  
By simulating star fields with the same synthetic PSF and taking into account realistic sources of noise (cf.  ...  In a first step, we have simulated the point spread function (PSF) deformation due to the TDI mode only, for different selected mosaic configurations.  ...  On each graph, the error curve and the chosen cut limit are shown. simulations being independent of the star-trail position) and N = 56 times those simulations with no TDI correction (i.e. 43 008 error  ... 
doi:10.1051/0004-6361:20020516 fatcat:4pffmghe4rfgbb7byoudeicrqa

Mosaics for Visualizing Knowledge Structures

Ali Unl¨u, Anatol Sargin, Martin Viehrig
2021 Journal of Data Science  
In simulation trials and with empirical data, the scope of this graphing method in knowledge space theory is investigated.  ...  Mosaic plots are state-of-the-art graphics for multivariate categorical data in statistical visualization.  ...  Experimentation with the mosaic plot for visually detecting knowledge states from data has shown that the classical form of the mosaic plot is not as appropriate as the other two variants.  ... 
doi:10.6339/jds.201307_11(3).0005 fatcat:2mfxrlsbmzdhllgijxy6bi72cy

Laue diffraction lenses for astrophysics: From theory to experiments [chapter]

Hubert Halloin
2006 Focusing Telescopes in Nuclear Astrophysics  
These theoretical predictions are then compared with Monte-Carlo simulations and experimental results (ground and stratospheric observations from the CLAIRE project).  ...  Fig. 7 represents the recorded spectra for these experiments (lower graph), compared with the theoretical relationship given by eq.3 (upper graph).  ...  In this case, concentric Laue rings would require small crystal tiles, with the accompanying difficulties in terms of cutting process and positioning.  ... 
doi:10.1007/978-1-4020-5304-7_18 fatcat:fdqeccmhineadlsjfc7hdehpgq

Multiple Birth and Cut Algorithm for Point Process Optimization

A Gamal-Eldin, X Descombes, J Zerubia
2010 2010 Sixth International Conference on Signal-Image Technology and Internet Based Systems  
It combines the recently developed Multiple Birth and Death (MBD) algorithm and the Graph-Cut algorithm.  ...  In this paper, we describe a new optimization method which we call Multiple Birth and Cut (MBC).  ...  In [27] , the authors presented an interesting graph modeling for a mosaic problem. The main goal of their work was to simulate classic mosaics from digital images.  ... 
doi:10.1109/sitis.2010.17 dblp:conf/sitis/Gamal-EldinDZ10 fatcat:3fdxa4qmwvhi5bx2rtmeg7srdq

Laue diffraction lenses for astrophysics: From theory to experiments

Hubert Halloin
2006 Experimental astronomy (Print)  
These theoretical predictions are then compared with Monte-Carlo simulations and experimental results (ground and stratospheric observations from the CLAIRE project).  ...  Fig. 7 represents the recorded spectra for these experiments (lower graph), compared with the theoretical relationship given by eq.3 (upper graph).  ...  In this case, concentric Laue rings would require small crystal tiles, with the accompanying difficulties in terms of cutting process and positioning.  ... 
doi:10.1007/s10686-006-9063-0 fatcat:qcytvqgilzdj7bc7godouvis7q

Plato's cube and the natural geometry of fragmentation [article]

Gábor Domokos, Douglas J. Jerolmack, Ferenc Kun, János Török
2020 arXiv   pre-print
Simulations show that generic binary breakup drives all mosaics toward the Platonic attractor, explaining the ubiquity of cuboid averages.  ...  The solar system is littered, however, with distorted polyhedra -- shards of rock and ice produced by ubiquitous fragmentation.  ...  Acknowledgements The authors thank Zsolt Lángi for mathematical comments and Krisztián Halmos for his invaluable help with field data measurements. The authors are grateful to David J.  ... 
arXiv:1912.04628v2 fatcat:7r2l3or7rbh4flhxak4hcmu3ay

Landscape Connectivity: A Graph-Theoretic Perspective

Dean Urban, Timothy Keitt
2001 Ecology  
A connected graph that can be disconnected by the removal of a key node has a cut-node at that point.  ...  Finding the shortest path between two nodes is a central task in graph theory (Dijkstra's [I9591 algorithm is the classic solution).  ... 
doi:10.2307/2679983 fatcat:k2ofwp6xcbgvxou7h3gwdc6w3u

LANDSCAPE CONNECTIVITY: A GRAPH-THEORETIC PERSPECTIVE

Dean Urban, Timothy Keitt
2001 Ecology  
A connected graph that can be disconnected by the removal of a key node has a cut-node at that point.  ...  Finding the shortest path between two nodes is a central task in graph theory (Dijkstra's [I9591 algorithm is the classic solution).  ... 
doi:10.1890/0012-9658(2001)082[1205:lcagtp]2.0.co;2 fatcat:rvel6eyxxvfppmf3s2isoojbim

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.  ...  This last point makes us reject classical simulated re-annealing [13] optimization which updates only one state variable.  ... 
doi:10.1109/dasc.2008.4702803 fatcat:eol4wzwm5bc3hbstjkh4l5a5g4

Computational Parquetry: Fabricated Style Transfer with Wood Pixels [article]

Julian Iseringhausen and Michael Weinmann and Weizhen Huang and Matthias B. Hullin
2019 arXiv   pre-print
It further addresses challenges like gamut mapping, feature characterization and the search for fabricable cuts.  ...  Parquetry is the art and craft of decorating a surface with a pattern of differently colored veneers of wood, stone or other materials.  ...  Generating Classic Mosaics with Graph Cuts. 31, 4 (2012), 82:1–82:10. Computer Graphics Forum 29, 8 (2010), 2387–2399.  ... 
arXiv:1904.04769v2 fatcat:elpfrworrrdw7f5mihoyjpuznm
« Previous Showing results 1 — 15 out of 2,582 results