Log In Sign Up

FlexHDR: Modelling Alignment and Exposure Uncertainties for Flexible HDR Imaging

by   Sibi Catley-Chandar, et al.

High dynamic range (HDR) imaging is of fundamental importance in modern digital photography pipelines and used to produce a high-quality photograph with well exposed regions despite varying illumination across the image. This is typically achieved by merging multiple low dynamic range (LDR) images taken at different exposures. However, over-exposed regions and misalignment errors due to poorly compensated motion result in artefacts such as ghosting. In this paper, we present a new HDR imaging technique that specifically models alignment and exposure uncertainties to produce high quality HDR results. We introduce a strategy that learns to jointly align and assess the alignment and exposure reliability using an HDR-aware, uncertainty-driven attention map that robustly merges the frames into a single high quality HDR image. Further, we introduce a progressive, multi-stage image fusion approach that can flexibly merge any number of LDR images in a permutation-invariant manner. Experimental results show our method can produce better quality HDR images with up to 0.8dB PSNR improvement to the state-of-the-art, and subjective improvements in terms of better detail, colours, and fewer artefacts.


page 1

page 2

page 6

page 7

page 8

page 9


Dual Illumination Estimation for Robust Exposure Correction

Exposure correction is one of the fundamental tasks in image processing ...

Merging-ISP: Multi-Exposure High Dynamic Range Image Signal Processing

The image signal processing pipeline (ISP) is a core element of digital ...

Multi-scale Sampling and Aggregation Network For High Dynamic Range Imaging

High dynamic range (HDR) imaging is a fundamental problem in image proce...

High Dynamic Range Imaging by Perceptual Logarithmic Exposure Merging

In this paper we emphasize a similarity between the Logarithmic-Type Ima...

LightFuse: Lightweight CNN based Dual-exposure Fusion

Deep convolutional neural networks (DCNN) aided high dynamic range (HDR)...

Deep Exposure Fusion with Deghosting via Homography Estimation and Attention Learning

Modern cameras have limited dynamic ranges and often produce images with...

ADNet: Attention-guided Deformable Convolutional Network for High Dynamic Range Imaging

In this paper, we present an attention-guided deformable convolutional n...

Code Repositories

I Introduction

Despite recent advances in imaging technology, capturing scenes with wide dynamic range still poses several challenges. Current camera sensors suffer from limited or Low Dynamic Range (LDR) due to inherent hardware limitations. The maximum dynamic range a camera can capture is closely related to (a) the sensor’s photosite full well electron capacity or saturation point, and (b) the black point, which is generally constrained by the uncertainty in the reading due to the dominant presence of noise.

Different solutions have been proposed to overcome these limitations. The principle behind most of them relies on capturing observations of the same scene with different exposure values. This enables a richer coverage of the scene’s original dynamic range, but also requires a mechanism to align and unify the different captured observations [1]. Some approaches make use of multi-sensor or multi-camera configurations, e.g. Tocci et al. [2], McGuire et al. [3], Froehlich et al. [4], where a beam splitter enables the light to be captured by multiple sensors. However, such setups are normally expensive, fragile, with bulky and cumbersome rigs, and they may suffer from double contours, light flares, or polarization artefacts [4].

Fig. 1: Our method, intermediate results, and comparisons. LDR input images are shown on the left and our tone mapped result is in the centre. The visualisations on the right are: I Input Image, II Exposure Map, III Attention Map. The bottom row compares to several state-of-the-art methods. Our uncertainty modelling more effectively handles regions of overexposure and motion between input frames.

More pragmatic solutions include only a single sensor and obtain multiple exposures by either spatial (i.e. per-pixel varying exposure) [5, 6] or temporal multiplexing (i.e. capturing differently exposed frames) [1]. This simpler hardware setup (and related algorithms) has recently seen widespread adoption, and is now found in cameras ranging from professional DSLR to low-cost smartphones.

Early multi-frame exposure fusion algorithms work remarkably well for almost-static scenes (e.g. tripod, reduced motion) but result in ghosting and other motion-related artefacts for dynamic scenes. In recent years, Convolutional Neural Networks (CNNs) have greatly advanced the state-of-the-art for HDR reconstruction, especially for complex dynamic scenes 


Most HDR CNNs rely on a rigid setup with a fixed, ordered set of LDR input images, which assumes the medium exposure to be the reference image. The most common mechanism for the merging step is image or feature concatenation, and thus for methods where the feature encoder is not shared among input frames [8], there is a dependency between reference frame choice, relative exposure and input image ordering. Optimal exposure parameters [9] or fast object motion might constrain the amount of relevant frames available, and in general, broader flexibility in terms of number of frames and choice of reference is necessary to extend applicability without the burden of model tweaking or retraining.

As for frame registration, previous models largely rely on pre-trained or classical off-the-shelf optical flow methods that are rarely designed or optimized for the characteristics of exposure-bracketed LDR images. Recent pixel rejection or attention strategies are disconnected from the alignment stage and mostly ignore uncertainty in exposure or motion.

In this paper, we propose a novel algorithm that addresses these limitations in a holistic and unified way. First, we design a HDR-specific optical flow network which can predict accurate optical flow estimates even when the input and target frames are under- or over-exposed. We do this by using symmetric pooling operations to share information between all

input frames, so any missing information in one frame can be borrowed from other frames. Further, we propose models of exposure and alignment uncertainties which are used by our flow and attention networks to regulate contributions from unreliable and misaligned pixels. Finally we propose a flexible architecture that can process any number of input frames provided in any order.

The contributions of this paper are threefold:

  1. A lightweight, iterative and self-supervised HDR-specific optical flow network which can estimate accurate pixel correspondences between LDR frames, even when improperly exposed, by sharing information between all input frames with symmetric pooling operations.

  2. Models of exposure and alignment uncertainty which we use to regulate contributions from unreliable and misaligned pixels and greatly reduce ghosting artefacts.

  3. A flexible architecture with a multi-stage fusion mechanism which can estimate an HDR image from an arbitrary set of LDR input images.

Fig. 2: Model Architecture. Our model accepts any number of LDR images as input and aligns them with a HDR flow network which shares information between frames with pooling operations. We then model exposure and alignment uncertainties which are used by our attention network to suppress untrustworthy regions. Finally, the merging network

consists of a grouped residual dense block with multi-stage max-pooling operations for gradual merging of input frames.

Ii Related Work

In this section we review the HDR literature with a focus on relevant deep-learning multi-frame exposure fusion methods. For a broader overview we refer the reader to 

[10, 11].

The seminal work of [7] was the first to introduce a training and testing dataset with dynamic scene content. Their proposed method for learning-based HDR fusion is composed of two stages: first, input LDR images are aligned using a classical optical flow algorithm [12] and then a CNN is trained to both merge images and potentially correct any errors in the alignment. Shortly after, [8] proposed a similar approach that does not perform a dense optical flow estimation, but rather uses an image-wide homography to perform background alignment, leaving the more complex non-rigid foreground motions to be handled by the CNN. However, this method is highly dependent on the structure of the reference image, and the magnitude and complexity of the motion. Thus, if certain regions are saturated in the reference image, it fails to accurately reconstruct them in the final result. Both [7] and [8] rely on the optimisation of the HDR reconstruction loss to implicitly learn how to correct ghosting and handle the information coming from different frames. However, neither provides an explicit mechanism to prevent incorrect information (e.g. overexposed regions) from influencing the final HDR estimation. Despite the noteworthy performance improvement over existing methods at the time, these approaches still suffer from ghosting, especially for fast moving objects and saturated or near-saturated regions.

Yan et al. [13] address some limitations of its predecessors by establishing an attention mechanism to suppress undesired information before the merging stage, e.g. misalignments, overexposed regions, and focus instead on desirable details of non-reference frames that might be missing in the reference frame. In the work of Prabhakar et al. [14] parts of the computation, including the optical flow estimation, are performed in a lower resolution and later upscaled back to full resolution using a guide image generated with a simple weight map, thus saving some computation.

More recently, the state of the art in HDR imaging has been pushed to new highs. [15] propose the first GAN-based approach to HDR reconstruction which is able to synthesize missing details in areas with disocclusions. Liu et al. [16] introduce a method which uses deformable convolutions as an alignment mechanism instead of optical flow and was the winning submission to the 2021 NTIRE HDR Challenge [17]. Contemporary work has explored and pioneered new training paradigms, such as the weakly supervised training strategy proposed by [18].

Extending these methods to an arbitrary number of images requires changes to the model definition and re-training. Set-processing neural networks

[19] can naturally handle those requirements. In [20], a permutation invariant CNN is used to deblur a burst of frames which present only rigid, 0-mean translations with no explicit motion registration. For the HDR task, [21] proposed a method that uses symmetric pooling aggregation to fuse any number of images, but requires pre-alignment [22] and artefact correction by networks which only work on image pairs.

Iii Proposed Method

Given a set of LDR images with different exposure values our aim is to reconstruct a single HDR image which is aligned to a reference frame . To simplify notation, we denote , but any input frame can be chosen as the reference frame. To generate the inputs to our model, we follow the work of [13, 8, 7] and form a linearized image for each as follows:


where is the exposure time of image with power-law non-linearity . Setting approximates the inverse of gamma correction, while dividing by the exposure time adjusts all the images to have consistent brightness. We concatenate and in the channel dimension to form a 6 channel input image . Given a set of inputs our proposed network estimates the HDR image by:


where denotes our network and are the learned weights of the network. Our network accepts any number of frames and is invariant to the order of the non-reference inputs. This is different from the work of [13, 8, 7] where the value of is fixed to 3 and the order of inputs is fixed, and the work of [21] where only the fusion stage is performed on inputs, but frame alignment and attention are performed on image pairs only. Our method performs alignment, regulates the contribution of each frame based on related alignment and exposure uncertainties and flexibly fuses any number of input frames in a permutation-invariant manner. Our network is also trained end-to-end and is learned entirely during the HDR training.

Iii-a Architecture Overview

Our architecture is composed of: Learnable Exposure Uncertainty (Sec. III-C), HDR Iterative Optical Flow (Sec. III-D), Alignment Uncertainty and Attention (Sec. III-E), and Merging Network (Sec.III-F). An overview of the architecture can be seen in Figure 2. Our architecture makes use of max-pooling operations to share information between frames and to fuse frames together (Sec. III-B). This improves the accuracy of our flow and attention networks and gives us the advantage of an architecture that is flexible enough to accept an arbitrary number of images. The flow network and the attention network work together to align non-reference frames to the reference frame and suppress artefacts from misaligned and over-exposed regions. The merging network then combines the aligned features to predict a single HDR image. By explicitly modelling the two most common sources of error, motion and exposure, we create a network that is aware of uncertainty and is able to greatly reduce artefacts compared to state-of-the-art methods, as shown in Figure 1.

Iii-B Flexible Set Processing

Many state-of-the-art CNN HDR reconstruction methods require a fixed number of inputs in fixed order of exposure [13, 8, 7]. To overcome this limitation, we design a set-processing network that can naturally deal with any number of input images. Related concepts have previously shown strong benefits for problems such as deblurring [20] and we here propose to leverage set-processing and permutation invariance tools for HDR fusion.

Given input images, our network uses identical copies of itself with shared weights to process each image separately in its own stream. We use a multi-stage fusion mechanism, where features of each individual stream at an arbitrary point within the network can share information with each other as follows:


where denotes a max-pooling operation, denotes concatenation and denotes a convolutional layer (see Fig. 5). This operation is repeated at multiple points in the network. Finally, the outputs of each stream are then pooled together into a single stream with a global max-pooling operation . This result is processed further in the final layers of our network to obtain the HDR prediction. This allows the network to process any number of frames in a permutation invariant manner while still being informed by the other frames.

Fig. 3: Architecture of our HDR Iterative Optical Flow Network. The feature encoder first downsamples the input features by 8x before the recurrent convolutions iteratively refine the estimated optical flow field.
Fig. 4: We model exposure uncertainty as a piecewise linear function where and are predicted by the network. Given the mean pixel values of an image, , our model predicts an image specific response of exposure confidence, .

Iii-C Modelling Exposure Uncertainty

A key limitation of LDR images is that any pixel values above the sensor saturation point results in information loss. Values approaching the saturation level are also unreliable due to negative post-saturation noise [9]

. When reconstructing an HDR image from multiple LDR images, values at or close to the saturation point can produce artefacts in the final output. Furthermore, underexposed values close to zero are also unreliable due to dark current and low signal-to-noise ratio. We seek to regulate the contribution of such values by modelling our confidence in a given pixel value being correct. For a given input image

, we propose the following piecewise linear function where and are predicted by the network for each image:


Here denotes the mean value across the three RGB channels and is the predicted exposure map which represents our estimated confidence in a given pixel. This function is plotted in Figure 4. We learn from data how to predict and by means of a shallow network, i.e. a convolution acting on the concatenation of followed by a spatial average pooling. We constrain and such that . As approaches 0 or 1, the pixel becomes increasingly unreliable and the value of the exposure mask approaches zero. The slope with which approaches zero is determined by and . As shown in Figure 1 this allows us to regulate the contribution that improperly exposed regions in an image can have on our result.

Iii-D HDR Specific Efficient Iterative Optical Flow Network

Recent learning based optical flow methods [23] typically do not work well for HDR. Successive frames can have large amounts of missing information due to overexposure, which makes aligning frames difficult. This is especially true if the reference and non-reference frames are both overexposed. We solve this issue by using max-pooling operations to share information between all input frames in our flow network’s encoder, as described in Eq. (3). This lets the network fill in missing information from any of the available input frames and predict more accurate flows.

The architecture of our proposed flow network is inspired by RAFT [23]

, however we design the network to be lightweight and efficient. We do not use a context encoder, a correlation layer or a convolutional gated recurrent unit, instead using only simple convolutional layers to predict our optical flow field.

Given an input and an exposure mask , we use a convolutional layer to extract features from . The inputs into the flow network are then concatenated as follows: , where

corresponds to the features extracted from the reference image. The flow network is informed by

so that our predictions are aware of the exposure uncertainty in the image. As recurrent convolutions can be computationally expensive at full resolution, the flow network first downsamples the input features by 8

using strided convolutions. It then iteratively refines the predicted flow over 16 iterations, with a flow initialized to zero, to obtain the optical flow field



where denotes our optical flow network. The optical flow field is resized to the original resolution with bilinear upsampling and used to warp our features :


where are the warped features and denotes the function of warping an image with an optical flow field. The architecture of our flow network can be seen in Figure 3.

Unlike other methods which use fixed alignment [8, 21], our flow network is trained in a fully self-supervised manner. As ground truth optical flows for our datasets are unavailable, we use the self-supervised photometric loss between the reference features and the warped features as supervision to guide the learning of the flow network. We multiply the loss by so that the reference frame is only used as supervision in regions where it is well exposed. We also apply the optical flow field to the exposure mask, so it remains spatially aligned with the warped features:


where is the warped exposure mask.

Fig. 5: An overview of our multi-stage fusion mechanism. The green arrows show the direction of information flow between the different streams. By sharing information between streams at multiple points, the network is able to produce clear, detailed images.

Iii-E Alignment Uncertainty and Attention

Our attention network is informed by two measures of uncertainty: exposure and alignment. To model the alignment uncertainty we compute an uncertainty map as:


where denotes the elementwise absolute value and denotes element-wise multiplication. This map captures the difference in motion between the reference frame and the warped frame and helps inform our attention network of any inconsistencies in the alignment. We multiply by so that only the well exposed regions of the reference frame are used to calculate misalignments. By regulating the contributions from misaligned areas of the image, our network can significantly reduce ghosting in the final output. The exposure uncertainty is given by the warped exposure map . The inputs to the attention network are then concatenated as follows []. The attention network predicts a 64 channel attention map as follows:


where denotes our attention network. As in our flow network, we use max-pooling to share information between all input frames. We then obtain our regulated features by multiplying the warped features by the attention map and the exposure map:


where denotes element-wise multiplication and denotes the regulated features. Multiplication by the exposure map enforces a strict constraint on our network and prevents unreliable information leaking into our output. Our HDR-aware attention effectively regulates the contribution of each frame, taking into account both alignment and exposure uncertainty.

Iii-F Merging Network

Our merging network takes the regulated features obtained from Equation 10 and merges them into a single HDR image. The merging network is based on a Grouped Residual Dense Block (GRDB) [24], which consists of three Residual Dense Blocks (RDBs) [25]. We modify the GRDB so that each stream can share information with the other streams for a multi-stage fusion of features. An overview of the fusion mechanism can be seen in Figure 5. Specifically we add a max-pooling operation after each RDB which follow the formulation described in Equation 3. This allows the network to progressively merge features from different streams, instead of merging them together in a single concatenation step where information might be lost. This is followed by a final global max-pooling operation which collapses the

streams into one. The merging network then processes this result further with a global residual connection and refinement convolutions.

Iii-G Loss Function

As HDR images are not viewed in the linear domain, we follow previous work and use the -law to map from the linear HDR image to the tonemapped image:


where is the linear HDR image, is the tonemapped image and . We then estimate the -norm between the prediction and the ground truth to construct a tone mapped loss as follows:


To improve the quality of reconstructed textures we also use the perceptual loss as in [26]. We pass the tonemapped images through a pre-trained VGG-19 [27] and extract features from three intermediate layers. We reduce the -norm between the features of the ground truth and our prediction:


where is a pre-trained VGG-19 network. Finally, to provide supervision for our optical flow network, we calculate a simple photometric loss between the warped features and the reference features and multiply by to limit supervision to well exposed regions in the reference frame:


Our total loss function can be expressed as:


Iii-H Implementation details

During training, we take a random crop of size from the input image. We perform random horizontal and vertical flipping and random rotation by 0°, 90°, 180° or 270° degrees to further augment the training data. We train using a batch size of and a learning rate of

with the Adam optimizer. We implement the model in PyTorch.

Iv Results

width=0.47 Model PSNR- PSNR-L Baseline Model 43.91 41.39 + Multi Stage Max-pooling (MSM) 44.18 41.78 + MSM + Flow 44.23 42.49 + MSM + Flow + Fixed Exposure 44.21 42.20 + MSM + Flow + Exposure Uncertainty 44.28 42.28 + MSM + Flow + Fixed Exposure + Alignment Uncertainty 44.28 42.51 + MSM + Flow + Exposure Uncertainty + Alignment Uncertainty 44.35 42.60

TABLE I: An ablation study showing the contributions of our proposed fusion mechanism, HDR iterative flow, learnable exposure modelling and alignment uncertainty.

We conduct several experiments both comparing against well-known state-of-the-art algorithms and also individually validating the contributions in an extensive ablation study. The experimental setup is described below.

Datasets: We use the dynamic training and testing datasets provided by Kalantari and Ramamoorthi [7] which includes 89 scenes in total. Each of these scenes include three differently exposed input LDR images (with EV of -2.00, 0.00, +2.00 or -3.00, 0.00, +3.00) which contain dynamic elements (e.g. camera motion, non-rigid movements) and a ground-truth image aligned with the medium frame captured via static exposure fusion. Additionally we use the dynamic testing dataset provided by Chen et al. [28] for further evaluation. As this dataset does not have a corresponding training set, all methods are trained on the Kalantari dataset and evaluated on the Chen dataset. We test on the 3-Exposure setting which has the ground truth aligned to the middle exposure. To keep it consistent with training, we restrict the number of input frames to three with EVs of -2.00, 0.00, +2.00.

Metrics: We include three different objective metrics in our quantitative evaluation, reproducing the same benchmark setup as recent publications [8, 13, 15]. First, we compute the PSNR-L, which is a fidelity metric computed directly on the linear HDR estimations. HDR linear images are normally tonemapped for visualization, and thus we include too the PSNR-, which evaluates PSNR on images tonemapped using the -law, as defined in Eq. (11), which is a simple canonical tonemapper. Lastly, we also compute the HDR-VDP2 [29], which estimates both visibility and quality differences between image pairs.

Fig. 6: Qualitative evaluation of our method for an image from the Kalantari test set. Our method obtains images with noticeably less ghosting artefacts, together with sharper and finer details. Best viewed zoomed-in.
Fig. 7: Qualitative evaluation of our method for an image from the Kalantari test set. Our method obtains images with noticeably less ghosting artefacts, together with sharper and finer details. Best viewed zoomed-in.
Fig. 8: Qualitative evaluation of our method for an image from the Chen test set. Our method performs well even in low light conditions while other deep learning methods suffer from ghosting and artefacts. Best viewed zoomed in.

Iv-a Ablation Studies

We evaluate the contribution of the different parts of our model architecture on the Kalantari dataset.

In Table I, we evaluate the quantitative impact of using our multi-stage fusion mechanism as well as the performance gain from our proposed flow network and our uncertainty modelling. Our baseline model uses the same architecture as our proposed method, but with the flow network, uncertainty modelling and multi-stage max-pooling removed, instead using concatenation as the fusion mechanism, and the attention mechanism from [13].

Fusion Mechanism. We show in Table I that using our multi-stage fusion mechanism outperforms concatenation by 0.39dB PSNR-L and 0.27dB PSNR-. The progressive sharing of information between streams allows the network to retain more information and produce sharper, more detailed images.

Motion Alignment and Modelling Uncertainty. We look at the performance of our proposed flow network and uncertainty modelling in Table I. Our flow network improves PSNR-L by a large 0.7dB, and PSNR- by 0.05dB. We validate the contribution of our learnable model of exposure uncertainty by comparing it to the fixed, non-learnable exposure model used by [7]. Our learnable exposure modelling shows an improvement in PSNR- of 0.07dB and PSNR-L of 0.08dB compared to the fixed exposure model. We also validate the contribution of our alignment uncertainty, which gives an improvement in PSNR- of 0.07dB and PSNR-L of 0.32dB when compared to using only exposure uncertainty.

Fig. 9: Qualitative comparison of our model trained on all permutations with different input frames. When the medium frame is well exposed, our model can attain a high quality prediction with just one frame. There is no noticeable increase in image quality when more inputs are provided.

Iv-B Performance Evaluation

width=0.47 Method PSNR- PSNR-L HDR-VDP-2 Sen [30] 40.98 38.38 60.54 Kalantari [7] 42.70 41.23 64.63 Wu [8] 42.01 41.62 65.78 AHDR [13] 43.57 41.16 64.83 Prabhakar19 [21] 42.79 40.31 62.95 Pu [31] 43.85 41.65 - Prabhakar20 [14] 43.08 41.68 - NHDRR [32] 42.41 - - Prabhakar21 [18] 41.94 41.80 65.30 ADNet [16] 43.87 41.69 65.56 HDR-GAN [15] 43.96 41.76 65.07 Ours 44.35 42.60 66.56

TABLE II: Quantitative results on the Kalantari et al. [7] dataset. Best performer denoted in bold and runner-up in underscored text. Values as reported by authors.

We evaluate the performance of our proposed method for the HDR estimation task and compare it to other state-of-the-art methods both quantitatively and qualitatively. The methods included in our benchmark cover a broad range of approaches, namely: the patch-based method of Sen et al. [30], methods which use traditional alignment followed by CNNs to correct dense and global alignment, [7, 18, 8], the flexible aggregation approach of [21]

that also uses dense alignment, methods which rely on attention or feature selection followed by a CNN to deghost and merge images

[13, 32], a GAN-based approach which can synthesize missing details in areas with disocclusions [16] and a method which uses deformable convolutions as an alignment mechanism [16]. We show in Table II the quantitative evaluation on the Kalantari test set. The improvement in terms of PSNR- when compared with the runner-up HDR-GAN[15] is large (i.e. dB), and we observe an even a higher improvement in terms of PSNR-L (i.e. dB) when compared against the runner-up in this metric Prabhakar21 [18]. Similarly, the HDR-VDP-2 score obtained by our method outperforms all others by a wide margin (i.e. 0.8).

We observe similar performance on the Chet et al. dynamic test set, demonstrating good generalization and out of domain performance. We show in Table III that the improvement in PSNR- when compared with the runner-up Prabhakar21 [18] is large (i.e. dB), and we observe a good improvement in terms of PSNR-L (i.e. dB) when compared against the runner-up in this metric ADNet [16]. We obtain the second best HDR-VDP-2 score on this test set, with ADNet outperforming our method by 0.58.

In Figures 6, 7, and 8 we show some visualizations of our algorithm compared with the benchmarked methods for qualitative, subjective evaluation. All other methods present traces of ghosting artefact around the edges near a moving object, especially where disocclusions happen and one or more frames have overexposed values in those locations (e.g. moving head, moving arm). Our method tackles such challenges effectively thanks to the exposure confidence awareness, and strongly suppresses the ghosting artefact. Additionally, our method also demonstrates better performance when it comes to edges and textures (e.g. building facade), as well as out of domain low-light performance.

width=0.47 Method PSNR- PSNR-L HDR-VDP-2 Sen [30] 40.79 39.58 68.83 AHDR [13] 39.56 35.09 63.78 Prabhakar21 [18] 40.89 38.19 65.48 ADNet [16] 38.14 40.97 70.00 HDR-GAN [15] 40.80 36.19 66.33 Ours 41.98 41.32 69.42

TABLE III: Quantitative results on the Chen et al. [28] dynamic dataset. Best performer denoted in bold and runner-up in underscored text.
Fig. 10: Qualitative comparison of our model trained on all permutations with different input frames. When the medium frame is overexposed, our model is not able to completely hallucinate details in large overexposed regions. The short frame is essential to reconstruct the missing details. There is no noticeable improvement in image quality from including the extremely overexposed long frame.

width=0.47 Training Frames Test Frames PSNR- PSNR-L S + M + L S + M + L 44.35 42.60 S + M / M + L* S + M + L 43.44 40.58 M S + M + L 20.86 24.66 All Permutations ** S + M + L 44.24 42.30 S + M + L S + M 40.24 41.15 S + M / M + L* S + M 44.11 42.17 M S + M 22.68 25.38 All Permutations ** S + M 44.18 42.29 S + M + L M + L 41.85 37.60 S + M / M + L* M + L 42.58 38.32 M M + L 22.03 25.00 All Permutations ** M + L 42.74 38.38 S + M + L M 33.10 32.84 S + M / M + L* M 28.26 22.44 M M 42.86 38.79 All Permutations ** M 42.67 38.40

TABLE IV: Comparison of different training regimes on the Kalantari test set using our proposed model. * Batches sampled uniformly from the two options. ** Batches sampled uniformly from all four options. The four options are: S + M + L, S + M, M + L, M.

Iv-C Flexible Imaging

We show that our model is flexible enough to accept an arbitrary number of images without the need for re-training. In Table IV we evaluate the performance of our proposed model when trained and tested on different numbers of images with different exposures. We use the following input frame configurations for training and testing: Short + Medium + Long, Short + Medium, Medium + Long, Medium. As expected, performance is best when the testing configuration is seen during training. Our model trained on all permutations achieves very good cross-setting performance, obtaining the best results for the S + M and M + L settings. It is also competitive with our best model for the M and S + M + L settings, without needing any extra training time, and is capable of accepting a range of different input configurations without the need for re-training. In fact, we show that our model using only two frames (S + M) can obtain results outperforming current state-of-the-art methods using all three frames in PSNR- [15] and PSNR-L [18]. In Figure 9 we show that our model is capable of producing high quality HDR outputs for a range of different input configurations. Furthermore we show in Figure 11 that our method can use any frame as the reference frame without re-training, providing superior flexibility and choice when compared to state-of-the-art methods. However a limitation of our method is that it is not able to hallucinate details in large over-exposed regions, as seen in Figure 10.

Fig. 11: Our method is flexible enough to accept any frame as the reference frame without re-training, providing superior choice to the user.

V Conclusion

In this paper we explored modelling exposure and alignment uncertainties to improve HDR imaging performance. We presented (1) an HDR-specific optical flow network which is capable of accurate flow estimations, even with improperly exposed input frames, by sharing information between input images with a symmetric pooling operation. (2) We also presented models of exposure and alignment uncertainty which we use to regulate contributions from unreliable and misaligned pixels and greatly reduce ghosting artefacts. (3) Lastly a flexible architecture which uses a multi-stage fusion to estimate an HDR image from an arbitrary set of LDR input images. We conducted extensive ablation studies where we validate individually each of our contributions. We compared our method to other state-of-the-art algorithms obtaining significant improvements for all the measured metrics and noticeably improved visual results.


  • [1] P. E. Debevec and J. Malik, “Recovering high dynamic range radiance maps from photographs,” in ACM SIGGRAPH 2008 Classes, 2008.
  • [2] M. D. Tocci, C. Kiser, N. Tocci, and P. Sen, “A versatile hdr video production system,” in SIGGRAPH, 2011.
  • [3] M. McGuire, W. Matusik, H. Pfister, B. Chen, J. F. Hughes, and S. K. Nayar, “Optical splitting trees for high-precision monocular imaging,” IEEE Computer Graphics and Applications, vol. 27, no. 2, 2007.
  • [4] J. Froehlich, S. Grandinetti, B. Eberhardt, S. Walter, A. Schilling, and H. Brendel, “Creating cinematic wide gamut hdr-video for the evaluation of tone mapping operators and hdr-displays,” in Proc. of SPIE Electronic Imaging, 2014.
  • [5] F. Heide, M. Steinberger, Y.-T. Tsai, M. Rouf, D. Pajak, D. Reddy, O. Gallo, J. Liu, W. Heidrich, K. Egiazarian, J. Kautz, and K. Pulli, “FlexISP: A flexible camera image processing framework,” ACM Trans. Graph., vol. 33, no. 6, 2014.
  • [6] S. Hajisharif and J. Kronander, J.and Unger, “Adaptive dualiso hdr reconstruction,” EURASIP Journal on Image and Video Processing, no. 41, 2015.
  • [7] N. K. Kalantari and R. Ramamoorthi, “Deep high dynamic range imaging of dynamic scenes,” ACM Transactions on Graphics (Proceedings of SIGGRAPH 2017), vol. 36, no. 4, 2017.
  • [8] S. Wu, J. Xu, Y. Tai, and C. Tang, “End-to-end deep HDR imaging with large foreground motions,” in

    European Conference on Computer Vision

    , 2018.
  • [9] S. W. Hasinoff, F. Durand, and W. T. Freeman, “Noise-optimal capture for high dynamic range photography,” in

    IEEE Conference on Computer Vision and Pattern Recognition

    , 2010.
  • [10] T. E. Alessandro Artusi, Thomas Richter and R. K. Mantiuk, “High dynamic range imaging technology,” IEEE Signal Processing Magazine, vol. 34, no. 5, 2017.
  • [11] E. Reinhard, W. Heidrich, P. Debevec, S. Pattanaik, G. Ward, and K. Myszkowski, High Dynamic Range Imaging, 2nd ed.   Morgan Kaufmann, 2010.
  • [12] C. Liu, “Beyond pixels: Exploring new representations and applications for motion analysis,” Ph.D. dissertation, Massachusetts Institute of Technology, 2009.
  • [13] Q. Yan, D. Gong, Q. Shi, A. van den Hengel, C. Shen, I. D. Reid, and Y. Zhang, “Attention-guided network for ghost-free high dynamic range imaging,” in Computer Vision and Pattern Recognition, 2019.
  • [14] K. R. Prabhakar, S. Agrawal, D. K. Singh, B. Ashwath, and R. V. Babu, “Towards practical and efficient high-resolution HDR deghosting with CNN,” in European Conference Computer Vision, ser. Lecture Notes in Computer Science, vol. 12366.   Springer, 2020, pp. 497–513. [Online]. Available:
  • [15] Y. Niu, J. Wu, W. Liu, W. Guo, and R. W. H. Lau, “Hdr-gan: Hdr image reconstruction from multi-exposed ldr images with large motions,” IEEE Transactions on Image Processing, vol. 30, pp. 3885–3896, 2021.
  • [16] Z. Liu, W. Lin, X. Li, Q. Rao, T. Jiang, M. Han, H. Fan, J. Sun, and S. Liu, “Adnet: Attention-guided deformable convolutional network for high dynamic range imaging,” in 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), 2021, pp. 463–470.
  • [17] E. Pérez-Pellitero, S. Catley-Chandar, A. Leonardis, R. Timofte, X. Wang, Y. Li, T. Wang, F. Song, Z. Liu, W. Lin, X. Li, Q. Rao, T. Jiang, M. Han, H. Fan, J. Sun, S. Liu, X. Chen, Y. Liu, Z. Zhang, Y. Qiao, C. Dong, E. Y. Lyn Chee, S. Shen, Y. Duan, G. Chen, M. Sun, Y. Gao, L. Zhang, A. K. A, J. C. V, S. M. A. Sharif, R. A. Naqvi, M. Biswas, S. Kim, C. Xia, B. Zhao, Z. Ye, X. Lu, Y. Cao, J. Yang, Y. Cao, G. R. K. S, S. Deepak Lomte, N. Krishnan, and B. H. Pawan Prasad, “Ntire 2021 challenge on high dynamic range imaging: Dataset, methods and results,” in 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), 2021, pp. 691–700.
  • [18] K. R. Prabhakar, G. Senthil, S. Agrawal, R. V. Babu, and R. K. S. S. Gorthi, “Labeled from unlabeled: Exploiting unlabeled data for few-shot deep hdr deghosting,” in 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2021, pp. 4873–4883.
  • [19] M. Zaheer, S. Kottur, S. Ravanbakhsh, B. Poczos, R. R. Salakhutdinov, and A. J. Smola, “Deep sets,” in Advances in Neural Information Processing Systems, vol. 30, 2017.
  • [20] M. Aittala and F. Durand, “Burst image deblurring using permutation invariant convolutional neural networks,” in European Conference Computer Vision, ser. Lecture Notes in Computer Science, vol. 11212.   Springer, 2018, pp. 748–764. [Online]. Available:
  • [21] K. R. Prabhakar, R. Arora, A. Swaminathan, K. P. Singh, and R. V. Babu, “A fast, scalable, and reliable deghosting method for extreme exposure fusion,” in IEEE International Conference on Computational Photography, ICCP 2019, Tokyo, Japan, May 15-17, 2019.   IEEE, 2019, pp. 1–8. [Online]. Available:
  • [22] D. Sun, X. Yang, M. Liu, and J. Kautz, “Pwc-net: Cnns for optical flow using pyramid, warping, and cost volume,” in IEEE Conference on Computer Vision and Pattern Recognition, 2018.
  • [23] Z. Teed and J. Deng, “Raft: Recurrent all-pairs field transforms for optical flow,” in European Conference on Computer Vision, 2020.
  • [24] D.-W. Kim, J. R. Chung, and S.-W. Jung, “Grdn:grouped residual dense network for real image denoising and gan-based real-world noise modeling,” in Computer Vision and Pattern Recognition Workshops, 2019.
  • [25]

    Y. Zhang, Y. Tian, Y. Kong, B. Zhong, and Y. Fu, “Residual dense network for image super-resolution,” in

    Computer Vision and Pattern Recognition, 2018.
  • [26] J. Johnson, A. Alahi, and L. Fei-Fei, “Perceptual losses for real-time style transfer and super-resolution,” in European Conference on Computer Vision, 2016.
  • [27] K. Simonyan and A. Zisserman, “Very deep convolutional networks for large-scale image recognition,” in International Conference on Learning Representations, 2015.
  • [28] J. Chen, Z. Yang, T. N. Chan, H. Li, J. Hou, and L.-P. Chau, “Attention-guided progressive neural texture fusion for high dynamic range image restoration,” 2021.
  • [29] R. Mantiuk, K. Kim, A. Rempel, and W. Heidrich, “Hdr-vdp-2: A calibrated visual metric for visibility and quality predictions in all luminance conditions,” ACM Trans. Graph., vol. 30, no. 4, 2011. [Online]. Available:
  • [30] P. Sen, N. K. Kalantari, M. Yaesoubi, S. Darabi, D. B. Goldman, and E. Shechtman, “Robust patch-based hdr reconstruction of dynamic scenes.” ACM Trans. Graph., vol. 31, no. 6, pp. 203–1, 2012.
  • [31] Z. Pu, P. Guo, M. S. Asif, and Z. Ma, “Robust high dynamic range (hdr) imaging with complex motion and parallax,” in Proceedings of the Asian Conference on Computer Vision (ACCV), November 2020.
  • [32] Q. Yan, L. Zhang, Y. Liu, Y. Zhu, J. Sun, Q. Shi, and Y. Zhang, “Deep hdr imaging via a non-local network,” IEEE Transactions on Image Processing, vol. 29, pp. 4308–4322, 2020.