28-Issue 1Regular Issuehttps://diglib.eg.org:443/handle/10.2312/1432024-03-29T15:57:23Z2024-03-29T15:57:23ZExposure Fusion: A Simple and Practical Alternative to High Dynamic Range PhotographyMertens, T.Kautz, J.Van Reeth, F.https://diglib.eg.org:443/handle/10.2312/CGF.v28i1pp161-1712017-03-16T11:29:58Z2009-01-01T00:00:00ZExposure Fusion: A Simple and Practical Alternative to High Dynamic Range Photography
Mertens, T.; Kautz, J.; Van Reeth, F.
We propose a technique for fusing a bracketed exposure sequence into a high quality image, without converting to High dynamic range (HDR) first. Skipping the physically based HDR assembly step simplifies the acquisition pipeline. This avoids camera response curve calibration and is computationally efficient. It also allows for including flash images in the sequence. Our technique blends multiple exposures, guided by simple quality measures like saturation and contrast. This is done in a multiresolution fashion to account for the brightness variation in the sequence. The resulting image quality is comparable to existing tone mapping operators.
2009-01-01T00:00:00ZCGForum 2009 Cover ImageSpencer, BenJones, Mark W.https://diglib.eg.org:443/handle/10.2312/CGF.v28i1pp172-1722017-03-16T11:29:58Z2009-01-01T00:00:00ZCGForum 2009 Cover Image
Spencer, Ben; Jones, Mark W.
2009-01-01T00:00:00ZOut-of-Core and Dynamic Programming for Data Distribution on a Volume Visualization ClusterFrank, S.Kaufman, A.https://diglib.eg.org:443/handle/10.2312/CGF.v28i1pp141-1532017-03-16T11:29:58Z2009-01-01T00:00:00ZOut-of-Core and Dynamic Programming for Data Distribution on a Volume Visualization Cluster
Frank, S.; Kaufman, A.
Ray directed volume-rendering algorithms are well suited for parallel implementation in a distributed cluster environment. For distributed ray casting, the scene must be partitioned between nodes for good load balancing, and a strict view-dependent priority order is required for image composition. In this paper, we define the load balanced network distribution (LBND) problem and map it to the NP-complete precedence constrained job-shop scheduling problem. We introduce a kd-tree solution and a dynamic programming solution. To process a massive data set, either a parallel or an out-of-core approach is required. Parallel preprocessing is performed by render nodes on data, which are allocated using a static data structure. Volumetric data sets often contain a large portion of voxels that will never be rendered, or empty space. Parallel preprocessing fails to take advantage of this. OurA slab-projection slice, introduced in this paper, tracks empty space across consecutive slices of data to reduce the amount of data distributed and rendered. It is used to facilitate out-of-core bricking and kd-tree partitioning. Load balancing using each of our approaches is compared with traditional methods using several segmented regions of the Visible Korean data set.
2009-01-01T00:00:00ZVisual-Quality Optimizing Super ResolutionLiu, F.Wang, J.Zhu, S.Gleicher, M.Gong, Y.https://diglib.eg.org:443/handle/10.2312/CGF.v28i1pp127-1402017-03-16T11:29:58Z2009-01-01T00:00:00ZVisual-Quality Optimizing Super Resolution
Liu, F.; Wang, J.; Zhu, S.; Gleicher, M.; Gong, Y.
In this paper, we propose a robust image super-resolution (SR) algorithm that aims to maximize the overall visual quality of SR results. We consider a good SR algorithm to be fidelity preserving, image detail enhancing and smooth. Accordingly, we define perception-based measures for these visual qualities. Based on these quality measures, we formulate image SR as an optimization problem aiming to maximize the overall quality. Since the quality measures are quadratic, the optimization can be solved efficiently. Experiments on a large image set and subjective user study demonstrate the effectiveness of the perception-based quality measures and the robustness and efficiency of the presented method.
2009-01-01T00:00:00Z