By Topic

Local linear LUT method for spatial colour-correction algorithm speed-up

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Gatta, C. ; Dept. of Inf. Technol., Univ. of Milano, Crema, Italy ; Rizzi, A. ; Marini, D.

There is a class of nonlinear filtering algorithms for digital colour enhancement, characterised by data-driven local effects and high computational cost. A new method called LLL (local linear look-up table (LUT)) is presented, which speeds up these filters without losing their local effect. Usually, classic LUT-based methods are global whereas the approach presented here uses the principles of LUT transformation in a local way. The main idea of this method is to apply the colour-enhancement algorithm to a small sub-sampled version of the input image and to use a modified look-up table technique to maintain the local filtering effect of the colour-enhancement algorithm. The method increases the speed of colour-filtering algorithms, reducing the number of pixels involved in the computation by sub-sampling the input image. To overcome possible loss of detail due to sub-sampling, an optional, additional stage to maintain high-frequency content is shown. LLL with two of these filters, the Brownian Retinex implementation and the automatic colour equalisation algorithm, are tested. Results, comparison and conclusions are presented.

Published in:

Vision, Image and Signal Processing, IEE Proceedings -  (Volume:153 ,  Issue: 3 )