Temporally Consistent Tone Mapping of Images and Video Using Optimal K-means Clustering

详细信息    查看全文

• 作者：Magnus Oskarsson
• 关键词：High dynamic range images ; High dynamic range video ; Clustering ; Dynamic programming
• 刊名：Journal of Mathematical Imaging and Vision
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：57
• 期：2
• 页码：225-238
• 全文大小：2781KB
• 刊物类别：Computer Science
• 刊物主题：Image Processing and Computer Vision; Applications of Mathematics; Signal,Image and Speech Processing; Mathematical Methods in Physics;
• 出版者：Springer US
• ISSN：1573-7683
• 卷排序：57

文摘

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 \(\hbox {O}(N^2K)\) 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.