Illuminant estimation plays a key role in digital camera pipeline system, it aims at reducing color casting effect due to the influence of non-white illuminant. Recent researches handle this task by using Convolution Neural Network (CNN) as a mapping function from input image to a single illumination vector. However, global mapping approaches are difficult to deal with scenes under multi-light-sources. In this paper, we proposed a self-adaptive single and multi-illuminant estimation framework, which includes the following novelties: (1) Learning local self-adaptive kernels from the entire image for illuminant estimation with encoder-decoder CNN structure; (2) Providing confidence measurement for the prediction; (3) Clustering-based iterative fitting for computing single and multi-illumination vectors. The proposed global-to-local aggregation is able to predict multi-illuminant regionally by utilizing global information instead of training in patches, as well as brings significant improvement for single illuminant estimation. We outperform the state-of-the-art methods on standard benchmarks with the largest relative improvement of 16 . In addition, we collect a dataset contains over 13k images for illuminant estimation and evaluation. The code and dataset is available on this https URL
A comprehensive mathematical model to account for colour constancy is formulated. Since the visual system is able to measure true object colour in complex scenes under a broad range of spectral compositions, for the illumination; it is assumed that the visual system must implicitly estimate and illuminant. The basic hypothesis is that the estimate of the illuminant is made on the basis of spatial information from the entire visual field. This estimate is then used by the visual system to arrive at an estimate of the (object) reflectance of the various subfields in the complex visual scene. The estimates are made by matching the inputs to the system to linear combinations of fixed bases and standards in the colour space. The model provides a general unified mathematical framework for related psychophysical phenomenology.  If color appearance is to be a useful feature in identifying an object, then color appearance must remain roughly constant when the object is viewed in different contexts. People maintain approximate color constancy despite variation in the color of nearby objects and despite variation in the spectral power distribution of the ambient light. Land's retinex algorithm is a model of human color constancy. We analyze the retinex algorithm and discuss its general properties. We show that the algorithm is too sensitive to changes in the color of nearby objects to serve as an adequate model of human color constancy. Scene recognition is extremely useful to improve different tasks involved in the Image Generation Pipeline of single sensor mobile devices (e.g., white balancing, autoexposure, etc). This demo showcases our scene recognition engine implemented on a Nokia N900 smartphone. The engine exploits an image representation directly obtainable in the IGP of mobile devices. The demo works in realtime and it is able to discriminate among different classes of scenes. The framework is built by employing the FCam API to have an easy and precise control of the mobile digital camera. Each acquired image (or frame of a video) is holistically represented starting from the statistics collected on DCT domain. This allow instant and "free of charge" feature extraction process since the DCT is always computed into the IGP of a mobile for storage purposes (i.e., JPEG or MPEG format). A SVM classifier is used to perform the final inference about the context of the scene. Colour constancy is a central problem for any visual system performing a task which requires stable perception of the colour world. To solve the colour constancy problem we estimate the colour of the prevailing light and then, at the second stage, remove it. Two of the most commonly used simple techniques for estimating the colour of the light are the Grey-World and Max-RGB algorithms. In this paper we begin by observing that this two colour constancy computations will respectively return the right answer if the average scene colour is grey or the maximum is white (and conversely, the degree of failure is proportional to the extent that these assumptions hold). We go on to ask the following question: “ Would we perform better colour constancy by assuming the scene average is some shade of grey?”. We give a mathematical answer to this question. Firstly, we show that Max-RGB and Grey-World are two instantia-tions of Minkowski norm. Secondly, that for a large cali-brated dataset L6 norm colour constancy works best over-all (we have improved the performance achieved by a sim-ple normalization based approach). Surprisingly we found performance to be similar to more elaborated algorithm. 