Parallel Gradient Domain Processing of Massive Images
dc.contributor.author | Philip, Sujin | en_US |
dc.contributor.author | Summa, Brian | en_US |
dc.contributor.author | Bremer, Peer-Timo | en_US |
dc.contributor.author | Pascucci, Valerio | en_US |
dc.contributor.editor | Torsten Kuhlen and Renato Pajarola and Kun Zhou | en_US |
dc.date.accessioned | 2014-01-26T16:57:04Z | |
dc.date.available | 2014-01-26T16:57:04Z | |
dc.date.issued | 2011 | en_US |
dc.description.abstract | Gradient domain processing remains a particularly computationally expensive technique even for relatively small images. When images become massive in size, giga or terapixel, these problems become particularly troublesome and the best serial techniques take on the order of hours or days to compute a solution. In this paper, we provide a simple framework for the parallel gradient domain processing. Specifically, we provide a parallel out-of-core method for the seamless stitching of gigapixel panoramas in a parallel MPI environment. Unlike existing techniques, the framework provides both a straightforward implementation, maintains strict control over the required/allocated resources, and makes no assumptions on the speed of convergence to an acceptable image. Furthermore, the approach shows good weak/strong scaling from several to hundreds of cores and runs on a variety of hardware. | en_US |
dc.description.seriesinformation | Eurographics Symposium on Parallel Graphics and Visualization | en_US |
dc.identifier.isbn | 978-3-905674-32-3 | en_US |
dc.identifier.issn | 1727-348X | en_US |
dc.identifier.uri | https://doi.org/10.2312/EGPGV/EGPGV11/011-019 | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.subject | Categories and Subject Descriptors (according to ACM CCS): I.3.2 [Computer Graphics]: Graphics Systems- Distributed/network graphics I.3.3 [Computer Graphics]: Picture/Image Generation | en_US |
dc.title | Parallel Gradient Domain Processing of Massive Images | en_US |
Files
Original bundle
1 - 1 of 1