Abstract
The field of high dynamic range imaging addresses the problem of capturing and displaying the large range of luminance levels found in the world, using devices with limited dynamic range. In this paper we present a novel tone mapping algorithm that is based on \(K\)-means clustering. Using dynamic programming we are able to, not only solve the clustering problem efficiently, but also find the global optimum. Our algorithm runs in \(O(N^2K)\) for an image with \(N\) luminance levels and \(K\) output levels. We show that our algorithm gives comparable result to state-of-the-art tone mapping algorithms, but with the additional large benefit of a total lack of parameters. We test our algorithm on a number of standard high dynamic range images, and give qualitative comparisons to a number of state-of-the-art tone mapping algorithms.
Chapter PDF
Similar content being viewed by others
References
Aloise, D., Deshpande, A., Hansen, P., Popat, P.: Np-hardness of euclidean sum-of-squares clustering. Machine Learning 75(2), 245–248 (2009)
Bellman, R.: A note on cluster analysis and dynamic programming. Mathematical Biosciences 18(3), 311–312 (1973)
Celenk, M.: A color clustering technique for image segmentation. Computer Vision, Graphics, and Image Processing 52(2), 145–170 (1990)
Dasgupta, S., Freund, Y.: Random projection trees for vector quantization. IEEE Transactions on Information Theory 55(7), 3229–3242 (2009)
Debevec, P.E., Malik, J.: Recovering high dynamic range radiance maps from photographs. In: Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1997, pp. 369–378. ACM (2007)
Drago, F., Myszkowski, K., Annen, T., Chiba, N.: Adaptive logarithmic mapping for displaying high contrast scenes. Computer Graphics Forum 22(3), 419–426 (2003)
Durand, F., Dorsey, J.: Fast bilateral filtering for the display of high-dynamic-range images. ACM Transactions on Graphics (TOG) 21(3), 257–266 (2002)
Grossberg, M.D., Nayar, S.K.: High dynamic range from multiple images: Which exposures to combine. In: Proc. ICCV Workshop on Color and Photometric Methods in Computer Vision (CPMCV), Nice, France (2003)
http://pfstools.sourceforge.net/hdr_gallery.html (Accessed 2014–09-01)
Kleinberg, J., Tardos, É.: Algorithm design. Addison-Wesley (2005)
Larson, G.W., Rushmeier, H., Piatko, C.: A visibility matching tone reproduction operator for high dynamic range scenes. IEEE Transactions on Visualization and Computer Graphics 3(4), 291–306 (1997)
Lee, J.W., Park, R.H., Chang, S.: Local tone mapping using the k-means algorithm and automatic gamma setting. IEEE Transactions on Consumer Electronics 57(1), 209–217 (2011)
Lloyd, S.: Least squares quantization in pcm. IEEE Transactions on Information Theory 28(2), 129–137 (1982)
http://qtpfsgui.sourceforge.net (Accessed: 2014–09-01)
Mahajan, M., Nimbhorkar, P., Varadarajan, K.: The planar k-means problem is NP-hard. In: Das, S., Uehara, R. (eds.) WALCOM 2009. LNCS, vol. 5431, pp. 274–285. Springer, Heidelberg (2009)
Malm, H., Oskarsson, M., Warrant, E., Clarberg, P., Hasselgren, J., Lejdfors, C.: Adaptive enhancement and noise reduction in very low light-level video. In: IEEE 11th International Conference on Computer Vision, 2007. ICCV 2007, pp. 1–8. IEEE (2007)
Mantiuk, R., Daly, S., Kerofsky, L.: Display adaptive tone mapping. ACM Transactions on Graphics (TOG) 27(3), 68:1–68:10 (2008)
Mantiuk, R., Myszkowski, K., Seidel, H.P.: A perceptual framework for contrast processing of high dynamic range images. ACM Transactions on Applied Perception (TAP) 3(3), 286–308 (2006)
http://www.pauldebevec.com/Research/HDR (Accessed: 2014–10-01)
Reinhard, E., Stark, M., Shirley, P., Ferwerda, J.: Photographic tone reproduction for digital images. ACM Transactions on Graphics (TOG) 21(3), 267–276 (2002)
Robertson, M.A., Borman, S., Stevenson, R.L.: Dynamic range improvement through multiple exposures. In: Proceedings International Conference on Image Processing, ICIP 99, Kobe, Japan. vol. 3, pp. 159–163. IEEE (1999)
Scheunders, P.: A comparison of clustering algorithms applied to color image quantization. Pattern Recognition Letters 18(11), 1379–1384 (1997)
Scheunders, P.: A genetic c-means clustering algorithm applied to color image quantization. Pattern Recognition 30(6), 859–866 (1997)
Steinley, D.: K-means clustering: a half-century synthesis. British Journal of Mathematical and Statistical Psychology 59(1), 1–34 (2006)
Tumblin, J., Rushmeier, H.: Tone reproduction for realistic images. Computer Graphics and Applications, IEEE 13(6), 42–48 (1993)
Wang, H., Song, M.: Ckmeans. 1d. dp: optimal k-means clustering in one dimension by dynamic programming. The R Journal 3(2), 29–33 (2011)
Ward, G.: A contrast-based scalefactor for luminance display. Graphics gems IV, pp. 415–421 (1994)
Warrant, E., Oskarsson, M., Malm, H.: The remarkable visual abilities of nocturnal insects: Neural principles and bioinspired night-vision algorithms. Proceedings of the IEEE 102(10), 1411–1426 (2014)
Wilkie, K., Devlin, A., Chalmers, A., Purgathofer, W.: Tone reproduction and physically based spectral rendering. Eurographics 2002: State of the Art Reports, pp. 101–123 (2002)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Oskarsson, M. (2015). Democratic Tone Mapping Using Optimal K-means Clustering. In: Paulsen, R., Pedersen, K. (eds) Image Analysis. SCIA 2015. Lecture Notes in Computer Science(), vol 9127. Springer, Cham. https://doi.org/10.1007/978-3-319-19665-7_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-19665-7_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-19664-0
Online ISBN: 978-3-319-19665-7
eBook Packages: Computer ScienceComputer Science (R0)