Poisson Compositing (sap 0066) Shanmuganathan Raman and Subhasis Chaudhuri Indian Institute of Technology Bombay, India {shanmuga,sc}@ee.iitb.ac.in

1

Introduction

Most of the real world scenes have a very high dynamic range. However the common capture and display devices can handle only a limited dynamic range. General approach to solve this problem is to use multi-exposure images and composite them in the irradiance domain to get a High Dynamic Range (HDR) image [Reinhard et al. 2005]. The generated image will be able to represent the real world scene faithfully. However, it needs to be tone-mapped to a Low Dynamic Range (LDR) image for visualization in common displays and printers. Generation of the high-quality LDR image of the scene directly from multi-exposure images even in the absence of any knowledge of camera response function and the exposure settings of the camera is of interest to graphics community. We propose a gradient domain compositing technique to solve the above problem and call it Poisson Compositing. We compare the proposed methodology with similar existing techniques and show that the proposed method is very fast and accurate.

2

to that of the corresponding HDR image. However, since our approach performs compositing in the gradient domain, there is lesser loss of contrast and we obtain seam-less blending. The results of our approach along with that of the exisiting methods are as shown in Figure 1.

(a)

(b)

(c)

(d)

Proposed Approach

We propose to solve the HDR imaging problem in the gradient domain. We composite gradients of the multi-exposure images to achieve seam-less blending. Given a set of multi-exposure images, we subject their gradients to an illumination change function specified in [Perez et al. 2003]. This operation is performed to brighten the less exposed images and darken the more exposed images as a pre-processing operation. We modify the gradient using ”β i “ ′ 0.2×αi Gi (x, y), where αi is the mean gradient Gi (x, y) = |▽f (x,y)| i magnitude, Gi (x, y) is the gradient vector of the ith image fi (x, y), and βi is a real number signifying the relative exposure time corresponding to each image. As exposure times are not known, we uniformly sample the range [−0.2, 0.2] equalling the number of multi-exposure images and assign them as values for βi from high to low exposures. After the pre-processing step, we composite the modified “ gradients ′ Gi (x, y) using the weighting function wi (x, y) = γ bi (x, y) + ” “ ” ci (x, y) + (1 − γ) bi (x, y)ci (x, y) , where 0 ≤ γ ≤ 1, −(fi (x,y)−µ)2

2σ2 bi (x, y) = e is the brightness term used to provide less weight to over-exposed and under-exposed regions, and ci (x, y) is the normalized contrast term which equals the local mean of the gradient magnitude. The parameters µ and σ are assigned values 128 and 50 respectively. Having obtained the composited gradient field, we solve the resultant Poisson equation to obtain the scalar field (LDR image) using Neumann boundary conditions. We employ direct Poisson solver for our task as it is the fastest solver available.

There are many recent approaches which can composite multiexposure images and produce a LDR image: variational compositing ([Raman and Chaudhuri 2007]), exposure fusion ([Mertens et al. 2009]), and bilateral compositing ([Raman and Chaudhuri 2009]). These methods assume no knowledge of camera response function and exposure times. However, these methods tend to produce a final image which does not preserve the contrast compared

Figure 1: Results of (a) [Raman and Chaudhuri 2007], (b) [Mertens et al. 2009], (c) [Raman and Chaudhuri 2009], and (d) the proposed approach. Images Courtesy: Erik Reinhard, University of Bristol. For compositing 9 images of size 2464 X 1632 in an Intel Xeon machine with 4 GB RAM, variational compositing took more than 15 minutes, exposure fusion took 107 seconds, bilateral compositing took 160 seconds, while the proposed approach took 113 seconds.

3 Conclusion We have proposed an effective compositing technique for multiexposure images, which are obtained by a digital camera utility such as auto-exposure bracketting (AEB), in the gradient domain. Obtained results show that our approach is very fast, apart from producing high quality LDR images.

References M ERTENS , T., K AUTZ , J., AND R EETH , F. V. 2009. Exposure fusion: A simple and practical alternative to high dynamic range photography. Computer Graphics Forum 28, 1, 161–171. P EREZ , P., G ANGNET, M., AND B LAKE , A. 2003. Poisson image editing. ACM Transactions on Graphics 22, 3, 313–318. R AMAN , S., AND C HAUDHURI , S. 2007. A matte-less, variational approach to automatic scene compositing. In ICCV, IEEE, 1–6. R AMAN , S., AND C HAUDHURI , S. 2009. Bilateral filter based compositing for variable exposure photography. In Short Papers, Eurographics, 1–4. R EINHARD , E., WARD , G., PATTANAIK , S., AND D EBEVEC , P. 2005. High Dynamic Range Imaging: Acquisition, Display and Image-Based Lighting. Morgan Kaufmann Publishers.

Poisson Compositing (sap 0066)

Indian Institute of Technology Bombay, India. {shanmuga,sc}@ee.iitb.ac.in. 1 Introduction. Most of the real world scenes have a very high dynamic range. ... and Chaudhuri 2007], (b) [Mertens et al. 2009], (c) [Raman and Chaudhuri 2009], and (d) the proposed approach. Images Courtesy: Erik Reinhard, University of Bristol.

157KB Sizes 1 Downloads 127 Views

Recommend Documents

Poisson 1827.pdf
Page 1 of 4. ANNALES_. DE. CHIMIE ET DE PHYSIQUE,. Par MM. GAY-LUSSAC et AHAGO. TOME TRENTE-CINQULEME. A PARIS_. Chez CROCIJ:ARD. Libra ire, cloitre Saint-Benoit. D0 I(>' . pres Ia rue des Mathnrins. 18 2 7·. Page 1 of 4 ...

Information Aggregation in Poisson-Elections
Nov 28, 2016 - The modern Condorcet jury theorem states that under weak conditions, elections will aggregate information when the population is large, ...

The Failure of Poisson Modeling -
The Failure of Poisson Modeling. John Blesswin. Page 2. Outline. • Introduction. • Traces data. • TCP connection interarrivals. • TELNET packet interarrivals.

Hierarchical Poisson Registration of Longitudinal ...
Hirschi and Gottfredson (1983) injected controversy in criminology when they ... multiple latent classes, specifies individual trajectories to be polynomial in age, ...

RealPigment: Paint Compositing by Example - Princeton Graphics
Jun 4, 2014 - simple ad-hoc methods like alpha-blending using various blend modes, or to resort to .... One reason is that g cannot express the behavior of ...... Morgan Kaufmann Publishers Inc., San Francisco, CA, USA. GOSSETT, N.

Remarks on Poisson actions - Kirill Mackenzie
Jan 29, 2010 - Abstract. This talk sketches an overview of Poisson actions, developing my paper 'A ... And there is an infinitesimal action of g∗ on G. Namely, any ξ ∈ g∗ ..... That is, it is T∗M pulled back to P over f . As a Lie algebroid

poisson distribution tables pdf
There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. poisson distribution tables pdf. poisson distribution tables pdf. Open. Extract. Open with. Sign In. Main me

TERP02 - SAP ERP - INTRODUCTION TO SAP NETWEAVER.pdf ...
Page 2 of 2. TERP02 - SAP ERP - INTRODUCTION TO SAP NETWEAVER.pdf. TERP02 - SAP ERP - INTRODUCTION TO SAP NETWEAVER.pdf. Open. Extract.

Distributed learning in a Congestion Poisson Game
An adaptive energy efficient link layer protocol for bursty transmissions over wireless data networks. In Proceedings of ICC 2003, 2003. [7] P. Maille and B. Tuffin.

professional digital compositing essential tools and techniques pdf ...
professional digital compositing essential tools and techniques pdf. professional digital compositing essential tools and techniques pdf. Open. Extract. Open with.