High-Dynamic-Range Imaging for Cloud Segmentation
With the spirit of reproducible research, this repository contains all the codes required to produce the results in the manuscript:
S. Dev, F. M. Savoy, Y. H. Lee and S. Winkler, High-Dynamic-Range Imaging for Cloud Segmentation, Atmospheric Measurement Techniques (AMT), 2018.
Please cite the above paper if you intend to use whole/part of the code. This code is only for academic and research purposes.
The codes are written in MATLAB.
The SHWIMSEG: Singapore HDR Whole Sky IMaging SEGmentation Database, associated with this manuscript can be accessed from this link. This will be helpful for public benchmarking and subsequent research.
The dataset should be copied in the folder
BRImage_func.mCalculates a ratio image from an RGB sky/cloud image.
color16_struct.mCalculates various color channels used in cloud segmentation.
error_withSat_s_c.mComputes the various error metrics by neglecting the saturated pixels in an image.
findSat_th.mEstimates the saturated map of an image.
maskSaturatedHDR.mEstimates the mask of saturated map for an HDR image.
maskSaturatedLDR.mEstimates the mask of saturated map for an LDR image.
MCE_func.mInternal function to compute Li et al. approach.
RGBPlane.mFinds the R- G- and B- plane of an image.
showasImage.mNormalizes a matrix into the range [0,255].
The codes related to HDR imaging are contained in the folder
./HDRimaging. These codes are adapted from:
Debevec, Paul E., and Jitendra Malik. "Recovering high dynamic range radiance maps from photographs." In Proceedings of the 24th annual conference on Computer graphics and interactive techniques, pp. 369-378. ACM Press/Addison-Wesley Publishing Co., 1997.
The codes related to graph cut are contained in the folder
./GraphCut. Please cite the following papers, in case you use this graph cut module.
Efficient Approximate Energy Minimization via Graph Cuts, Yuri Boykov, Olga Veksler, Ramin Zabih, IEEE transactions on PAMI, vol. 20, no. 12, p. 1222-1239, November 2001.
What Energy Functions can be Minimized via Graph Cuts?, Vladimir Kolmogorov and Ramin Zabih, IEEE Transactions on Pattern Analysis and Machine Intelligence, (PAMI), vol. 26, no. 2, February 2004, pp. 147-159.
An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision, Yuri Boykov and Vladimir Kolmogorov, In IEEE Transactions on Pattern Analysis and Machine Intelligence, (PAMI), vol. 26, no. 9, September 2004, pp. 1124-1137.
Matlab Wrapper for Graph Cut, Shai Bagon, in www.wisdom.weizmann.ac.il/~bagon, December 2006.
Please run the following to generate all the results and figures in the paper.
Figure3.mGenerates figure 3 of the manuscript.
Figure5.mGenerates figure 5 of the manuscript.
Figure6.mGenerates figure 6 of the manuscript.
Li_LDR.mComputes Li et al. approach for LDR images.
Li_tonemapped.mComputes Li et al. approach for tonemapped images.
Long_LDR.mComputes Long et al. approach for LDR images.
Long_tonemapped.mComputes Long et al. approach for tonemapped images.
Mantelli_LDR.mComputes the Mantelli et al. approach for LDR images.
Mantelli_tonemapped.mComputes the Mantelli et al. approach for tonemapped images.
Souza_LDR.mComputes the Souza et al. approach for LDR images.
Souza_tonemapped.mComputes the Souza et al. approach for tonemapped images.
proposed_LDR.mComputes the proposed approach for LDR images.
proposed_tonemapped.mComputes the proposed approach for tonemapped images.
proposed_HDR.mComputes the proposed approach for HDR images.
In addition to all the related codes, we have also shared the generated results. These files are contained in the folder