Temporally Consistent Tone Mapping of Images and Video Using Optimal K-means Clustering
Oskarsson, Magnus LU
(2017)
In Journal of Mathematical Imaging and Vision
57(2).
p.225-238
- 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 (Formula presented.) for an image with N input luminance levels and K output levels. We show that our algorithm gives comparable results to state-of-the-art tone mapping algorithms, but with the additional large benefit of a minimum of parameters. We show how to extend the method to handle video input. We test our... (More)
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 (Formula presented.) for an image with N input luminance levels and K output levels. We show that our algorithm gives comparable results to state-of-the-art tone mapping algorithms, but with the additional large benefit of a minimum of parameters. We show how to extend the method to handle video input. We test our algorithm on a number of standard high dynamic range images and video sequences and give qualitative and quantitative comparisons to a number of state-of-the-art tone mapping algorithms.
(Less)
- author
- Oskarsson, Magnus
LU
- organization
- publishing date
- 2017-02
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- Clustering, Dynamic programming, High dynamic range images, High dynamic range video
- in
- Journal of Mathematical Imaging and Vision
- volume
- 57
- issue
- 2
- pages
- 225 - 238
- publisher
- Springer
- external identifiers
-
- wos:000394150100005
- scopus:84979220588
- ISSN
- 0924-9907
- DOI
- 10.1007/s10851-016-0677-1
- language
- English
- LU publication?
- yes
- id
- 41b11310-7106-4f92-bdc0-a767cd5365b2
- date added to LUP
- 2016-09-05 09:51:43
- date last changed
- 2024-05-03 09:13:55
@article{41b11310-7106-4f92-bdc0-a767cd5365b2,
abstract = {{<p>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 (Formula presented.) for an image with N input luminance levels and K output levels. We show that our algorithm gives comparable results to state-of-the-art tone mapping algorithms, but with the additional large benefit of a minimum of parameters. We show how to extend the method to handle video input. We test our algorithm on a number of standard high dynamic range images and video sequences and give qualitative and quantitative comparisons to a number of state-of-the-art tone mapping algorithms.</p>}},
author = {{Oskarsson, Magnus}},
issn = {{0924-9907}},
keywords = {{Clustering; Dynamic programming; High dynamic range images; High dynamic range video}},
language = {{eng}},
number = {{2}},
pages = {{225--238}},
publisher = {{Springer}},
series = {{Journal of Mathematical Imaging and Vision}},
title = {{Temporally Consistent Tone Mapping of Images and Video Using Optimal K-means Clustering}},
url = {{http://dx.doi.org/10.1007/s10851-016-0677-1}},
doi = {{10.1007/s10851-016-0677-1}},
volume = {{57}},
year = {{2017}},
}