Combining Strategies for White Balance
|
|
- Nigel Foster
- 5 years ago
- Views:
Transcription
1 Combining Strategies for White Balance Simone Bianco, Francesca Gasparini and Raimondo Schettini DISCo, Università degli Studi di Milano-Bicocca, Via Bicocca degli Arcimboldi 8, Milano, Italy ABSTRACT In this work we consider six methods for automatic white balance available in the literature. The idea investigated does not rely on a single method, but instead considers a consensus decision that takes into account the compendium of the responses of all the considered algorithms. Combining strategies are then proposed and tested both on synthetic and multispectral images, extracted from well known databases. The multispectral images are processed using a digital camera simulator developed by Stanford University. All the results are evaluated using the Wilcoxon Sign Test. Keywords: White balance, Gray World, White Point, Color by Correlation, Color in Perspective, Self Tunable Color Balancing, combining methods 1. INTRODUCTION White balance is the process of removing unrealistic color casts from digital images, mostly due to the acquisition condition (in particular lighting geometry and illuminant color). While the human visual system is able to render the perceived colors of objects almost independent of illumination, (phenomenon known as Color Constancy), digital cameras often have great difficulty with Auto-White Balance (AWB), which in the worst cases can introduce unrealistic damaging colors. Several strategies for AWB are proposed in the literature. In general these require some information about the camera being used, and/or are based on assumptions about the statistical properties of the expected illuminants and surface reflectances. In this work six methods of AWB were considered: Gray World (GW), 1 White Point (WP), 2, 3 an Iterative White Balance procedure (IWB), 4 Color by Correlation (CbC), 5, 6 Color in Perspective (CiP) 7 and our Self Tunable Color Balancing (STCB). 8 The idea investigated in this work does not rely on a single method, but instead considers a consensus decision that takes into account the compendium of the responses of all the considered algorithms. In this paper some combining strategies are then proposed to improve the results in terms of RMS error in the estimated illuminant chromaticity and are compared with the six considered algorithms. In Section 2 the analyzed white balance algorithms are briefly described. In the same section the suggested combining strategies are also reported and exemplified. Section 3 is then divided in two sub-sections considering respectively the experimental results performed on the synthetic data and on the multispectral images. We consider the SONY DXC-930 curves available on the web 9 for the filter transmittances. The synthetic data are processed ideally with the color formation equations, while the multispectral images are processed using a digital camera simulator 10 developed by Stanford University. This software simulates the whole acquisition pipeline of a digital camera, in particular taking into account the different kind of noise involved. All the results are evaluated using the Wilcoxon Sign Test, 11 that determines a score ranking of the considered white balance procedures. Further author information: (Send correspondence to R.S.) F.G.: gasparini@disco.unimib.it, Telephone: +39 (0) R.S.: schettini@disco.unimib.it, Telephone: +39 (0)
2 2. ALGORITHMS Automatic white balance is an under-determined problem and thus impossible to solve in the most general case. 2 Several strategies are proposed in the literature. In general these require some information about the camera being used, and are based on assumptions about the statistical properties of the expected illuminants and surface reflectances. From a computational perspective, white balance is a two-stage process: the illuminant is estimated, and the image colors are then corrected on the basis of this estimate. The correction generates a new image of the scene as if taken under a known standard illuminant. The color correction step is usually based on a diagonal model of illumination change, derived from the Von Kries hypothesis that white balance is an independent gain regulation of the three cone signals, through three different gain coefficients. 12 This diagonal model is generally a good approximation of change in illumination, as demonstrated by Finlayson and al. 13 Though the model lead to large errors, its performance can still be improved with sensor sharpening. 14, 15 In formula the Von Kries hypothesis can be written as: L M S = k L k M K S L M S (1) where L,M,S and L,M,S are the initial and post-adaptation cone signals and k L,k M,k S are the scaling coefficients. 12 The scaling coefficients can be expressed as the ratio between the cone responses to a white under the reference illuminant and those of the current one. A typical reference illuminant, which is also the one we have used here, is the D65 CIE standard illuminant. 16 In practical situations the L, M, S retinal wavebands are transformed into CIE XYZ tristimulus values by a linear transformation, or approximated by image RGB values. 17 Whatever the features used to describe the colors, we must have some criteria for estimating the illuminant and thus the scaling coefficients in Equation (1) Gray World The gray world algorithm assumes that given an image of sufficiently varied colors, the average surface color in a scene is gray. 1 This means that the shift from gray of the measured averages on the three channels corresponds to the color of the illuminant. Three scaling coefficients, one for each color channel, are therefore set to compensate this shift White Point Assuming that there is always some white in the scene, the white point algorithm looks for it in the image; its chromaticity will then be the chromaticity of the illuminant. The white point algorithm determines this white as the maximum R, maximum G and maximum B found in the image. 2, 3 The scaling coefficients are now obtained by comparing these maxima with the values of the white of the reference illuminant Iterative White Balance The Iterative White Balance algorithm proposed by Huo et al. 4 extracts gray color points in images for color temperature estimation. A gray color point is the point where R, G and B components are equivalent under the canonical light source. A slight color deviation of the gray color point from gray under different color temperature is used to estimate the color temperature of the light source and thus the scaling coefficients Color by Correlation Color by correlation has been introduced by Finlayson et al. 5, 6 The basic idea is to pre-compute a correlation matrix which describes the extent to which the proposed illuminants are compatible with the occurrence of image chromaticities. Each row in the matrix corresponds to a different training illuminant. The matrix columns correspond to possible chromaticity ranges resulting from a discretization of (r, g) space, ordered in any convenient manner. In a further refinement, the correlation matrix has been set up to compute the probability that the observed chromaticities are due to each of the training illuminants. The best illuminant can then be chosen, 18, 19 using a maximum likelihood estimate for example, or other methods described in the literature. There are different versions of Color by Correlation; in this paper we have implemented the one described by Finlayson et al. 5
3 2.5. Color in Perspective We have considered here the Color in Perspective algorithm, developed by Finlayson, 7 based on Forsyth s gamutmapping approach. 20 The gamut-mapping algorithm considers the set of all possible (R, G, B) due to surfaces in the world under the known, canonical illuminant. This set is convex and is represented by its convex hull. The set of all possible (R, G, B) under the unknown illuminant is similarly represented by its convex hull. Under the diagonal assumption of illumination change, these two hulls are a unique diagonal mapping (a simple 3D stretch) of each other. Because the observed set is normally a proper subset, the mapping to the canonical illuminant is not unique, and Forsyth 20 provides a method for effectively computing the set of possible diagonal maps which is convex set in the space of mapping coefficients. Finlayson s Color in Perspective algorithm adds two additional ideas. 7 First, the gamut-mapping method can be used in the chromaticity space (R/B, G/B). Second, the diagonal maps can be further constrained by restricting them to ones corresponding to expected illuminants Self Tunable Color Balancing Most methods of color balancing do not discriminate between true cast (i.e. a superimposed dominant color) and predominant colors, but are applied in the same way to all images. This may result in an undesirable distortion of the chromatic content with respect to the original scene. Self Tunable Color Balancing (STCB) 8 can be used to avoid this. Before removing the color cast, it classifies the image without requiring any a priori knowledge of its semantic content. The STCB method is a weighted mixture of the white patch and gray world procedures, and permits the solution of cases where one, or both of the two assumptions are not valid. First, a multi-step algorithm classifies the input images as i) no-cast images; ii) evident cast images; iii) ambiguous cast images (images with a feeble cast, or those where the fact that the cast exists or not is a subjective opinion), iv) images with a predominant color that must be preserved, v) unclassifiable images. This classification makes it possible to discriminate between images requiring color correction and those in which the chromaticity must, instead, be preserved. Color correction is then applied only to those images classified as having either an evident or an ambiguous cast. The gain coefficients are estimated by setting at white what we have identified as the white balance region on the basis of the type of cast detected Combining Methods In this paper we analyze different combining schemes of the white balance algorithms to improve the results in terms of RMS error in the estimated illuminant chromaticity. These schemes can be better understood with the aid of Figure 1, where six points simulate the possible different estimations of the illuminant chromaticity obtained from the six uncombined algorithms. The investigated combining methods are listed in the following, where the involved points are explicitly written for a better comprehension: A. Mean: mean value of the results given by the uncombined methods (e.g. points of Figure 1); B. Nearest2: mean value of the closest 2 results of the uncombined methods (e.g. points 5-6 of Figure 1); C. Nearest10pc: mean value of the results of the uncombined methods with relative distances below the 110% of the distance of the closest 2 (e.g. points 5-6 of Figure 1); D. Nearest30pc: mean value of the results of the uncombined methods with relative distances below the 130% of the distance of the closest 2 (e.g. points of Figure 1); E. NoMax: mean value of the results of the uncombined methods excluding the one with the highest distance from the others (e.g. points of Figure 1); F. No2Max: mean value of the results of the uncombined methods excluding the 2 with the highest distance from the others (e.g. points of Figure 1); G. No3Max: mean value of the results of the uncombined methods excluding the 3 with the highest distance from the others (e.g. points of Figure 1).
4 Note that, starting from the six points depicted in Figure 1, some combining schemes use the same points to evaluate the illuminant chromaticity, e.g. Nearest2 and Nearest10pc. Obviously, this is due to the particular distribution depicted and is not always the case G E A D, F 4 5 B, C 6 Figure 1. A typical distribution of illuminant cromaticity estimations obtained using the uncombined algorithms considered. Given these estimations the combined algorithms use the chromaticity points listed in the following. A: Mean ( ); B: Nearest2 (5-6); C: Nearest10pc (5-6); D: Nearest30pc ( ); E: NoMax ( ); F: No2Max ( ); G: No3Max (2-3-5). 3. COLOR CONSTANCY EXPERIMENTS We have analyzed the performance of the six uncombined algorithms and of the seven combined algorithms on a set of synthetic and real image experiments following Barnard et al.18, 19 The algorithms tested are Gray World (GW), White Point (WP), Iterative White Balance (IWB), a version of Color by Correlation (CbC), a version of the Color in Perspective (CiP) and Self Tunable Color Balancing (STCB). For comparison we have also added the Do Nothing (DN). Algorithm accuracy is measured using the RMS error in the chromaticity space. To establish a ranking score that compares all the 14 procedures (6 uncombined, 1 DN and 7 combined), the error distributions of the algorithms are compared.21 Since the underlying error distributions can not be well modeled by a standard distribution, a test that requires no assumptions about the distributions is needed. An appropriate test for this case is the Wilcoxon Sign Test.11, 21 Here is a brief description of the test already made by Hordley and Finlayson:21 let X and Y be random variables representing the RMS error of the illuminant chromaticity estimation of algorithms X and Y. The Wilcoxon Test is used to test the hypothesis that the random variables X and Y are such that p = P (X > Y ) = 0.5. That is, we hypothesize that algorithm X and Y have the same performance. To test the hypothesis H0 : p = 0.5 we consider independent pairs (X1, Y1 ),...,(Xn, Yn ) of errors for N different images. We denote by W the number of images for which Xi > Yi. When H0 is true W is binomially distributed (b(n, 0.5)) and the Wilcoxon test is based on this statistic. We can define an alternative hypothesis H1 : p < 0.5 which if true implies that errors for algorithm X are lower than those for algorithm Y. We accept or reject the null hypothesis at a given significance level α if the probability of observing the results
5 Figure 2. Sony DXC-930 filters transmittances we observe is less than or equal to α. The value of α we choose defines the error rate we accept when we reject the null hypothesis. For the experiments reported in this paper we choose α = 0.01, i.e. we accept an error rate of 1% (we wrongly reject the null hypothesis in 1% of cases) Synthetic images experiments We have computed the performance of the algorithms and of the combining strategies on a test set of 6000 synthetic images, composed of six collections of 1000 scenes, each of them composed respectively of 2, 4, 8, 16, 32 and 64 surfaces. The reflectances of these surfaces have been randomly selected from a database of more than measured reflectances representative of the world. 22 For each image that we have generated the illuminant has also been randomly chosen from a set of 287 measured illuminants. 9 To generate synthetic sensor responses we have adopted the spectral sensitivities of the SONY DXC-930 digital video camera (depicted in Figure 2). The tristimulus values corresponding to each surface can thus be evaluated using Equations 2: R = G = B = 700nm λ=400nm 700nm λ=400nm 700nm λ=400nm S 1 (λ)i(λ)r(λ) S 2 (λ)i(λ)r(λ) S 3 (λ)i(λ)r(λ) (2) where I(λ) is the spectral power distribution of the illuminant considered, R(λ) the reflectance considered and S 1 (λ), S 2 (λ), S 3 (λ) the spectral sensitivities of the sensor device. For the 6000 scenes, the RMS error in the estimated illuminant chromaticity is evaluated for each of the 14 strategies. The Wilcoxon Sign Test applied to the 14 RMS error distributions gives a 14-by-14 matrix, whose entries are +, - or 0. A plus sign in the ith row and jth column of the matrix means that algorithm i is statistically better than algorithm j when judged according to the Wilcoxon test. A minus implies that it is worse, while a zero implies that the two algorithms are statistically equivalent. Counting the number of plus sings for every row of the matrix gives us a score, representative of the number of the algorithms respect to which the algorithm considered results to be statistically better.
6 Scores for the algorithms on the whole set of synthetic images are reported in Table 1. Table 1. Scores using the Wilcoxon Sign Test of the algorithms tested on the set of synthetic images: the score represents the number of the algorithms respect to which the algorithm considered results to be statistically better Uncombined Methods Score Combined Methods Score DN 0 Mean 4 GW 3 Nearest2 8 WP 5 Nearest10pc 6 IWB 1 Nearest30pc 7 CbC 9 NoMax 11 CiP 9 No2Max 12 STCB 2 No3Max 13 From the analysis of Table 1, it can be noticed that the best algorithms are the last three combined proposals. While among the uncombined methods, CbC and CiP show the highest performance, according to the results reported by Hordley and Finlayson. 21 Finally, our STCB algorithm shows a very low performance, but this is not surprising because it was specifically designed to work with real images and not ideal data Real images experiments For the second experiment we used the 23 multispectral images acquired by the University of West Anglia. 23 Their RGB versions rendered under the uniform white illuminant are reported in Figure 3. The 11 illuminants adopted to generate the test images correspond to those used in other papers concerning color constancy, 24 i.e. D48, D55, D65, D75, D100, D200, A, B, C, 2000K planckian black body radiator and uniform white. Their spectral power distributions are shown in Figure 4. The test set has been generated acquiring the 23 multispectral images under the 11 illuminants with the Image Systems Evaluation Toolkit (ISET) 10 developed at Stanford University. This software makes it possible to simulate the entire image processing pipeline of a digital camera combining optical modeling and sensor technology simulation. In particular the ISET takes into account the different kinds of noise involved in the acquisition process. As sensor spectral sensitivities we have adopted the same ones from the experiment on synthetic images, i.e. the ones of SONY DXC-930 (Figure 2). The matrices for the CbC and CiP algorithms are the same ones used in the case of the synthetic images experiments. The data processed by the white balance algorithms are the RGB sensor values. All the 23 spectral images have been acquired twice: the first time with the ISET auto-exposure function on, in order to avoid saturation clipping, and the second time with an exposure time set manually at the 120% of the auto-exposure time, in order to have clipping. Thus experiments have been conducted on a set of 506 real images. Results have been handled in the same way as the synthetic experiment, using the Wilcoxon Sign Test. The final results can be reported in three different score tables: Table 2 for the unclipped images, Table 3 for the clipped images and Table 4 for the summary of the results for unclipped and clipped images together. From the analysis of Table 2, it can be noticed that the best algorithm oft all is the white point. This is due to the particular set of images considered. In fact, looking at Figure 3, it is easy to find a white area in each image and thus a white point that in the unclipped situation will be considered by the white point algorithm. When the images are clipped, as probably occurs in the most of the amateur photographs, the best algorithm of all is a combined one (Table 3), while among the uncombined methods our STCB shows the best performance. 4. CONCLUSIONS In this paper we have proposed combining strategies of white balance algorithms available in the literature to improve the illuminant chromaticity estimation and correction for digital images. We have tested and compared
7 Figure 3. The database of multispectral images used for the real images experiments rendered under the uniform white illuminant Figure 4. Spectral power distributions of the 11 illuminants used (normalized to 1): D48, D55, D65, D75, D100, D200, A, B, C, 2000K planckian black body radiator and uniform white
8 Table 2. Scores using the Wilcoxon Sign Test of the algorithms tested on the set of real images without clipping: the score represents the number of the algorithms, respect to which the algorithm considered results to be statistically better Uncombined Methods Score Combined Methods Score DN 1 Mean 3 GW 3 Nearest2 7 WP 13 Nearest10pc 6 IWB 0 Nearest30pc 8 CbC 2 NoMax 11 CiP 5 No2Max 12 STCB 8 No3Max 10 Table 3. Scores using the Wilcoxon Sign Test of the algorithms tested on the set of real images with clipping: the score represents the number of the algorithms, respect to which the algorithm considered results to be statistically better Uncombined Methods Score Combined Methods Score DN 1 Mean 3 GW 3 Nearest2 6 WP 3 Nearest10pc 9 IWB 0 Nearest30pc 8 CbC 2 NoMax 12 CiP 6 No2Max 13 STCB 11 No3Max 10 the original algorithms and the combining strategies using both synthetic and real images. In all the situations combined strategies perform globally better. While the best method among the uncombined algorithms changes, depending on the experiment. REFERENCES 1. G. Buchsbaum, A spacial processor model for object color perception, in Journal of Franklin Institute, 310, pp. 1 26, B. Funt, K. Barnard, and L. Martin, Is machine colour constancy good enough?, in Proc. 5th European Conference on Computer Vision, Freiburg, Germany, pp , V. Cardei, B. Funt, and K. Barndard, White point estimation for uncalibrated images, in Proceedings of the IS&T/SID seventh color umaging conference, Scottsdale, USA, pp , J. Huo, Y. Chang, J. Wang, and X. Wei, Robust automatic white balance algorithm using gray color points in images, in IEEE Transactions on Consumer Electronics, 52, pp , G. Finlayson, S. Hordley, and P. Hubel, Color by correlation: A simple, unifying framework for color constancy, in IEEE Transactions on Pattern Analysis and Machine Intelligence, 23, pp , G. Finlayson, P. Hubel, and S. Hordley, Color by correlation, in Proc. IS&T/SID 5th Color Imaging COnf.: Color Science, Systems and Applications, pp. 6 11, G. Finlayson, Color in perspective, in IEEE Transactions on Pattern Analysis and Machine Intelligence, 18, pp , F. Gasparini and R. Schettini, Color balancing of digital photos using simple image statistics, in Pattern Recognition, 37(6), pp , 2004.
9 Table 4. Scores using the Wilcoxon Sign Test of the algorithms tested on the whole set of real images, i.e. both with and without clipping. The score represents the number of the algorithms, respect to which the algorithm considered results to be statistically better Uncombined Methods Score Combined Methods Score DN 1 Mean 3 GW 3 Nearest2 6 WP 8 Nearest10pc 7 IWB 0 Nearest30pc 8 CbC 2 NoMax 12 CiP 5 No2Max 13 STCB 10 No3Max Simon Fraser University, Computational Vision Lab Data, J. Farrell, F. Xiao, P. Catrysse, and B. Wandell, A simulation tool for evaluating digital camera image quality, in Image Quality and System Performance, 5294, pp , R. Hogg and E. Tanis, Probability and Statistical Inference, Prentice Hall. 12. M. Fairchild, Color Appearance Models, Addison Wesley. 13. G. Finlayson, M. Drew, and B. Funt, Diagonal transform suffice for color constancy, in Proc. IEEE international conference on computer vision, Berlin, pp , G. Finlayson, M. Drew, and B. Funt, Spectral sharpening: Sensor transformations for improved color constancy, in J. Opt. Soc. Amer. A, 11, pp , K. Barnard, F. Ciurea, and B. Funt, Sensor sharpening for computational color constancy, in J. Opt. Soc. Amer. A, 18, pp , E. Land and J. McCann, Lightness and retinex theory, in J. Opt. Soc. Amer, 61(1), pp. 1 11, K. Barnard, V. Cardei, and B. Funt, A comparison of computational color constancy algorithms; part one: Methodology and experiments with synthetic images, in IEEE Tansactions on Image Processing, 11(9), pp , K. Barnard, V. Cardei, and B. Funt, A comparison of computational color constancy algorithms; part two: Experiments with image data, in IEEE Tansactions on Image Processing, 11(9), pp , D. Forsyth, A novel algorithm for color constancy, in Int. J. Comput. Vis., 5, pp. 5 36, S. Hordley and G. Finlayson, Re-evaluating color constancy algorithms, in Proceedings of the 17th International Conference on Pattern Recognition, pp , Graphic technology - Standard object colour spectra database for colour reproduction evaluation (SOCS), Technical Report ISO/TR 16066:2003(E). 23. University of West Anglia, pm/chromagenic/msdb2/. 24. G. Finlayson, Color constancy in diagonal chromaticity space, in IEEE Proc. Fifth Intl. Conf. on Comp. Vision, 1995.
Improvements to Gamut Mapping Colour Constancy Algorithms
Improvements to Gamut Mapping Colour Constancy Algorithms Kobus Barnard Department of Computing Science, Simon Fraser University, 888 University Drive, Burnaby, BC, Canada, V5A 1S6 email: kobus@cs.sfu.ca
More informationIntroduction to color science
Introduction to color science Trichromacy Spectral matching functions CIE XYZ color system xy-chromaticity diagram Color gamut Color temperature Color balancing algorithms Digital Image Processing: Bernd
More informationColor Constancy from Illumination Changes
(MIRU2004) 2004 7 153-8505 4-6-1 E E-mail: {rei,robby,ki}@cvl.iis.u-tokyo.ac.jp Finlayson [10] Color Constancy from Illumination Changes Rei KAWAKAMI,RobbyT.TAN, and Katsushi IKEUCHI Institute of Industrial
More informationColor space transformations for digital photography exploiting information about the illuminant estimation process
374 J. Opt. Soc. Am. A / Vol. 29, No. 3 / March 2012 Bianco et al. Color space transformations for digital photography exploiting information about the illuminant estimation process Simone Bianco, 1, *
More informationCOLOR FIDELITY OF CHROMATIC DISTRIBUTIONS BY TRIAD ILLUMINANT COMPARISON. Marcel P. Lucassen, Theo Gevers, Arjan Gijsenij
COLOR FIDELITY OF CHROMATIC DISTRIBUTIONS BY TRIAD ILLUMINANT COMPARISON Marcel P. Lucassen, Theo Gevers, Arjan Gijsenij Intelligent Systems Lab Amsterdam, University of Amsterdam ABSTRACT Performance
More informationA Comparison of Computational Color Constancy Algorithms; Part Two: Experiments with Image Data
This work has been accepted for publication in IEEE Transactions in Image Processing. 1 (See http://www.ieee.org/about/documentation/copyright/policies.htm for copyright issue details). A Comparison of
More informationAn Algorithm to Determine the Chromaticity Under Non-uniform Illuminant
An Algorithm to Determine the Chromaticity Under Non-uniform Illuminant Sivalogeswaran Ratnasingam and Steve Collins Department of Engineering Science, University of Oxford, OX1 3PJ, Oxford, United Kingdom
More informationVideo-Based Illumination Estimation
Video-Based Illumination Estimation Ning Wang 1,2, Brian Funt 2, Congyan Lang 1, and De Xu 1 1 School of Computer Science and Infromation Technology, Beijing Jiaotong University, Beijing, China 2 School
More informationGray-World assumption on perceptual color spaces. Universidad de Guanajuato División de Ingenierías Campus Irapuato-Salamanca
Gray-World assumption on perceptual color spaces Jonathan Cepeda-Negrete jonathancn@laviria.org Raul E. Sanchez-Yanez sanchezy@ugto.mx Universidad de Guanajuato División de Ingenierías Campus Irapuato-Salamanca
More informationA Colour Constancy Algorithm Based on the Histogram of Feasible Colour Mappings
A Colour Constancy Algorithm Based on the Histogram of Feasible Colour Mappings Jaume Vergés-Llahí and Alberto Sanfeliu Institut de Robòtica i Informàtica Industrial Technological Park of Barcelona, U
More informationEstimating the wavelength composition of scene illumination from image data is an
Chapter 3 The Principle and Improvement for AWB in DSC 3.1 Introduction Estimating the wavelength composition of scene illumination from image data is an important topics in color engineering. Solutions
More informationHOW USEFUL ARE COLOUR INVARIANTS FOR IMAGE RETRIEVAL?
HOW USEFUL ARE COLOUR INVARIANTS FOR IMAGE RETRIEVAL? Gerald Schaefer School of Computing and Technology Nottingham Trent University Nottingham, U.K. Gerald.Schaefer@ntu.ac.uk Abstract Keywords: The images
More informationLocal Linear Models for Improved von Kries Adaptation
Appeared in Proc. of 10th Colour Imaging Conf., Scottsdale AZ, 2002 1 Local Linear Models for Improved von Kries Adaptation G. D. Finlayson, A. Alsam, and S. D. Hordley School of Information Systems University
More informationIllumination Estimation Using a Multilinear Constraint on Dichromatic Planes
Illumination Estimation Using a Multilinear Constraint on Dichromatic Planes Javier Toro 1 and Brian Funt 2 LBMU 1, Centre Hospitalier de l Université de Montréal Montréal, QC, Canada H2L 2W5 School of
More informationSpectral Images and the Retinex Model
Spectral Images and the Retine Model Anahit Pogosova 1, Tuija Jetsu 1, Ville Heikkinen 2, Markku Hauta-Kasari 1, Timo Jääskeläinen 2 and Jussi Parkkinen 1 1 Department of Computer Science and Statistics,
More informationA Comparison of Computational Color. Constancy Algorithms; Part One: Methodology and Experiments with. Synthesized Data
This work has been accepted for publication in IEEE Transactions in Image Processing. 1 (See http://www.ieee.org/about/documentation/copyright/policies.htm for copyright issue details). A Comparison of
More informationA New Method for RGB to XYZ Transformation Based on Pattern Search Optimization
1020 A New Method for RGB to XYZ Transformation Based on Pattern Search Optimization Simone Bianco, Francesca Gasparini, Alessandro Russo, and Raimondo Schettini Abstract In this paper we present an RGB
More informationLight, Color, and Surface Reflectance. Shida Beigpour
Light, Color, and Surface Reflectance Shida Beigpour Overview Introduction Multi-illuminant Intrinsic Image Estimation Multi-illuminant Scene Datasets Multi-illuminant Color Constancy Conclusions 2 Introduction
More informationAngular Error /Degrees. Angular Error /Degrees Number of Surfaces
A Theory of Selection for Gamut Mapping Colour Constancy Graham Finlayson University of Derby Colour & Imaging Institute Britannia Mill Mackworth Road Derby DE22 3BL Steven Hordley University of Derby
More informationTHE human visual system perceives the color of an
3612 IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 21, NO. 8, AUGUST 2012 Chromaticity Space for Illuminant Invariant Recognition Sivalogeswaran Ratnasingam, Member, IEEE, and T. Martin McGinnity, Member,
More informationColor Correction between Gray World and White Patch
Color Correction between Gray World and White Patch Alessandro Rizzi, Carlo Gatta, Daniele Marini a Dept. of Information Technology - University of Milano Via Bramante, 65-26013 Crema (CR) - Italy - E-mail:
More informationLecture 1 Image Formation.
Lecture 1 Image Formation peimt@bit.edu.cn 1 Part 3 Color 2 Color v The light coming out of sources or reflected from surfaces has more or less energy at different wavelengths v The visual system responds
More informationColour Reading: Chapter 6. Black body radiators
Colour Reading: Chapter 6 Light is produced in different amounts at different wavelengths by each light source Light is differentially reflected at each wavelength, which gives objects their natural colours
More informationdependent intensity function - the spectral distribution function (SPD) E( ). The surface reflectance is the proportion of incident light which is ref
Object-Based Illumination Classification H. Z. Hel-Or B. A. Wandell Dept. of Computer Science Haifa University Haifa 395, Israel Dept. Of Psychology Stanford University Stanford, CA 9435, USA Abstract
More informationAssessing Colour Rendering Properties of Daylight Sources Part II: A New Colour Rendering Index: CRI-CAM02UCS
Assessing Colour Rendering Properties of Daylight Sources Part II: A New Colour Rendering Index: CRI-CAM02UCS Cheng Li, Ming Ronnier Luo and Changjun Li Department of Colour Science, University of Leeds,
More informationHigh Information Rate and Efficient Color Barcode Decoding
High Information Rate and Efficient Color Barcode Decoding Homayoun Bagherinia and Roberto Manduchi University of California, Santa Cruz, Santa Cruz, CA 95064, USA {hbagheri,manduchi}@soe.ucsc.edu http://www.ucsc.edu
More informationIlluminant retrieval for fixed location cameras
Illuminant retrieval for fixed location cameras Joanna Marguier and Sabine Süsstrunk School of Computer and Communication Sciences, Ecole Polytechnique Fédérale de Lausanne (EPFL), Switzerland Abstract
More informationSpectral Estimation and Reconstruction.
Characterization of Digital Camera Based on Spectral Estimation and Reconstruction. Mei-Chun Lo +, Ruey-Kuen Perng, and Xin-Yan Shen + + Department of Information Management, Shih Hsin University, Taipei,
More informationSensor Sharpening for Computational Color Constancy
1 Manuscript accepted for publication in the Journal of the Optical Society of America A. Optical Society of America Sensor Sharpening for Computational Color Constancy Kobus Barnard*, Florian Ciurea,
More informationEstimating basis functions for spectral sensitivity of digital cameras
(MIRU2009) 2009 7 Estimating basis functions for spectral sensitivity of digital cameras Abstract Hongxun ZHAO, Rei KAWAKAMI, Robby T.TAN, and Katsushi IKEUCHI Institute of Industrial Science, The University
More informationIlluminant Estimation for Object Recognition
Illuminant Estimation for Object Recognition Graham D. Finlayson and Steven Hordley School of Information Systems University of East Anglia Norwich, NR4 7TJ UK Paul M. Hubel H-P Laboratories Hewlett-Packard
More informationDiagonal versus affine transformations for color correction
2108 J. Opt. oc. Am. A/ Vol. 17, No. 11/ November 2000 JOA Communications Diagonal versus affine transformations for color correction Brian V. Funt and Benjamin C. ewis chool of Computing cience, imon
More informationColor Constancy Beyond Bags of Pixels
Color Constancy Beyond Bags of Pixels Ayan Chakrabarti Keigo Hirakawa odd Zickler Harvard School of Engineering and Applied Sciences ayanc@eecs.harvard.edu hirakawa@stat.harvard.edu zickler@seas.harvard.edu
More informationEfficient illuminant correction in the Local, Linear, Learned (L 3 ) method
Efficient illuminant correction in the Local, Linear, Learned (L 3 ) method Francois G. Germain a, Iretiayo A. Akinola b, Qiyuan Tian b, Steven Lansel c, and Brian A. Wandell b,d a Center for Computer
More informationExploiting Spatial and Spectral Image Regularities for Color Constancy
Exploiting Spatial and Spectral Image Regularities for Color Constancy Barun Singh and William T. Freeman MIT Computer Science and Artificial Intelligence Laboratory David H. Brainard University of Pennsylvania
More informationA Curious Problem with Using the Colour Checker Dataset for Illuminant Estimation
A Curious Problem with Using the Colour Checker Dataset for Illuminant Estimation Graham D. Finlayson 1, Ghalia Hemrit 1, Arjan Gijsenij 2, Peter Gehler 3 1 School of Computing Sciences, University of
More informationComputer Graphics. Bing-Yu Chen National Taiwan University The University of Tokyo
Computer Graphics Bing-Yu Chen National Taiwan University The University of Tokyo Introduction The Graphics Process Color Models Triangle Meshes The Rendering Pipeline 1 What is Computer Graphics? modeling
More informationA New Color Constancy Algorithm Based on the Histogram of Feasible Mappings
A New Color Constancy Algorithm Based on the Histogram of Feasible Mappings Jaume Vergés Llahí and Alberto Sanfeliu Institut de Robòtica i Informàtica Industrial, Technological Park of Barcelona, U Building
More informationMultispectral Image Invariant to Illumination Colour, Strength, and Shading
Digital Photography VII, San Francisco, 23-27 January 2011. http://www.cs.sfu.ca/~mark/ftp/ei2011/ei2011.pdf Multispectral Image Invariant to Illumination Colour, Strength, and Shading Mark S. Drew and
More informationUsing Trichromatic and Multi-channel Imaging
Reconstructing Spectral and Colorimetric Data Using Trichromatic and Multi-channel Imaging Daniel Nyström Dept. of Science and Technology (ITN), Linköping University SE-674, Norrköping, Sweden danny@itn.liu.se
More informationColor Appearance in Image Displays. O Canada!
Color Appearance in Image Displays Mark D. Fairchild RIT Munsell Color Science Laboratory ISCC/CIE Expert Symposium 75 Years of the CIE Standard Colorimetric Observer Ottawa 26 O Canada Image Colorimetry
More informationGeodesic Based Ink Separation for Spectral Printing
Geodesic Based Ink Separation for Spectral Printing Behnam Bastani*, Brian Funt**, *Hewlett-Packard Company, San Diego, CA, USA **Simon Fraser University, Vancouver, BC, Canada Abstract An ink separation
More informationInvestigating von Kries-like Adaptation Using Local Linear Models
Investigating von Kries-like Adaptation Using Local Linear Models G. D. Finlayson, 1 S. D. Hordley, 1 * A. Alsam 2 1 School of Computing Sciences, University of East Anglia, Norwich, NR4 7TJ, United Kingdom
More informationGame Programming. Bing-Yu Chen National Taiwan University
Game Programming Bing-Yu Chen National Taiwan University What is Computer Graphics? Definition the pictorial synthesis of real or imaginary objects from their computer-based models descriptions OUTPUT
More informationColor Constancy for Multiple Light Sources Arjan Gijsenij, Member, IEEE, Rui Lu, and Theo Gevers, Member, IEEE
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 21, NO. 2, FEBRUARY 2012 697 Color Constancy for Multiple Light Sources Arjan Gijsenij, Member, IEEE, Rui Lu, and Theo Gevers, Member, IEEE Abstract Color constancy
More informationRemoving Shadows from Images
Removing Shadows from Images Zeinab Sadeghipour Kermani School of Computing Science Simon Fraser University Burnaby, BC, V5A 1S6 Mark S. Drew School of Computing Science Simon Fraser University Burnaby,
More information[2006] IEEE. Reprinted, with permission, from [Wenjing Jia, Huaifeng Zhang, Xiangjian He, and Qiang Wu, A Comparison on Histogram Based Image
[6] IEEE. Reprinted, with permission, from [Wenjing Jia, Huaifeng Zhang, Xiangjian He, and Qiang Wu, A Comparison on Histogram Based Image Matching Methods, Video and Signal Based Surveillance, 6. AVSS
More informationA New Time-Dependent Tone Mapping Model
A New Time-Dependent Tone Mapping Model Alessandro Artusi Christian Faisstnauer Alexander Wilkie Institute of Computer Graphics and Algorithms Vienna University of Technology Abstract In this article we
More informationComputational Color Constancy: Survey and Experiments
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. X, NO. X, MONTH 2010 1 Computational Color Constancy: Survey and Experiments Arjan Gijsenij, Member, IEEE, Theo Gevers, Member, IEEE, Joost van de Weijer, Member,
More informationSimilarity Image Retrieval System Using Hierarchical Classification
Similarity Image Retrieval System Using Hierarchical Classification Experimental System on Mobile Internet with Cellular Phone Masahiro Tada 1, Toshikazu Kato 1, and Isao Shinohara 2 1 Department of Industrial
More informationColor can be an important cue for computer vision or
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. 20, NO. 9, SEPTEMBER 2011 2475 Computational Color Constancy: Survey and Experiments Arjan Gijsenij, Member, IEEE, Theo Gevers, Member, IEEE, and Joost van de
More informationLecture #2: Color and Linear Algebra pt.1
Lecture #2: Color and Linear Algebra pt.1 John McNelly, Alexander Haigh, Madeline Saviano, Scott Kazmierowicz, Cameron Van de Graaf Department of Computer Science Stanford University Stanford, CA 94305
More informationAutomatic Multi-light White Balance Using Illumination Gradients and Color Space Projection
Automatic Multi-light White Balance Using Illumination Gradients and Color Space Projection Clifford Lindsay and Emmanuel Agu Worcester Polytechnic Institute, Worcester, MA Abstract. White balance algorithms
More informationQuantitative Analysis of Metamerism for. Multispectral Image Capture
Quantitative Analysis of Metamerism for Multispectral Image Capture Peter Morovic 1,2 and Hideaki Haneishi 2 1 Hewlett Packard Espanola, Sant Cugat del Valles, Spain 2 Research Center for Frontier Medical
More informationMinimizing Worst-case Errors for Illumination Estimation
Minimizing Worst-case Errors for Illumination Estimation by Milan Mosny M.Sc., Simon Fraser University, 1996 Ing., Slovak Technical University, 1996 Thesis Submitted In Partial Fulfillment of the Requirements
More informationColor by Correlation: A Simple, Unifying Framework for Color Constancy
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 23, NO. 11, NOVEMBER 2001 1209 Color by Correlation: A Simple, Unifying Framework for Color Constancy Graham D. Finlayson, Steven D.
More informationMinimalist surface-colour matching
Perception, 2005, volume 34, pages 1007 ^ 1011 DOI:10.1068/p5185 Minimalist surface-colour matching Kinjiro Amano, David H Foster Computational Neuroscience Group, Faculty of Life Sciences, University
More informationGeneralized Gamut Mapping using Image Derivative Structures for Color Constancy
DOI 10.1007/s11263-008-0171-3 Generalized Gamut Mapping using Image Derivative Structures for Color Constancy Arjan Gijsenij Theo Gevers Joost van de Weijer Received: 11 February 2008 / Accepted: 6 August
More informationMetamer Constrained Colour Correction
In Proc. 7th Color Imaging Conference, Copyright IS & T 1999 1 Metamer Constrained Colour Correction G. D. Finlayson, P. M. Morovič School of Information Systems University of East Anglia, Norwich, UK
More informationEnhancement of Sharpness and Contrast Using Adaptive Parameters
International Journal of Computational Engineering Research Vol, 03 Issue, 10 Enhancement of Sharpness and Contrast Using Adaptive Parameters 1, Allabaksh Shaik, 2, Nandyala Ramanjulu, 1, Department of
More informationCHAPTER 3 COLOR MEASUREMENT USING CHROMATICITY DIAGRAM - SOFTWARE
49 CHAPTER 3 COLOR MEASUREMENT USING CHROMATICITY DIAGRAM - SOFTWARE 3.1 PREAMBLE Software has been developed following the CIE 1931 standard of Chromaticity Coordinates to convert the RGB data into its
More informationA Novel Approach for Shadow Removal Based on Intensity Surface Approximation
A Novel Approach for Shadow Removal Based on Intensity Surface Approximation Eli Arbel THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE MASTER DEGREE University of Haifa Faculty of Social
More informationA Statistical Consistency Check for the Space Carving Algorithm.
A Statistical Consistency Check for the Space Carving Algorithm. A. Broadhurst and R. Cipolla Dept. of Engineering, Univ. of Cambridge, Cambridge, CB2 1PZ aeb29 cipolla @eng.cam.ac.uk Abstract This paper
More informationSpectral Adaptation. Chromatic Adaptation
Spectral Adaptation Mark D. Fairchild RIT Munsell Color Science Laboratory IS&T/SID 14th Color Imaging Conference Scottsdale 2006 Chromatic Adaptation Spectra-to-XYZ-to-LMS Chromatic adaptation models
More informationJournal of Asian Scientific Research FEATURES COMPOSITION FOR PROFICIENT AND REAL TIME RETRIEVAL IN CBIR SYSTEM. Tohid Sedghi
Journal of Asian Scientific Research, 013, 3(1):68-74 Journal of Asian Scientific Research journal homepage: http://aessweb.com/journal-detail.php?id=5003 FEATURES COMPOSTON FOR PROFCENT AND REAL TME RETREVAL
More informationLocal Image Registration: An Adaptive Filtering Framework
Local Image Registration: An Adaptive Filtering Framework Gulcin Caner a,a.murattekalp a,b, Gaurav Sharma a and Wendi Heinzelman a a Electrical and Computer Engineering Dept.,University of Rochester, Rochester,
More informationColor Constancy by Derivative-based Gamut Mapping
Color Constancy by Derivative-based Gamut Mapping Arjan Gijsenij, Theo Gevers, Joost Van de Weijer To cite this version: Arjan Gijsenij, Theo Gevers, Joost Van de Weijer. Color Constancy by Derivative-based
More informationSupplementary Material: Specular Highlight Removal in Facial Images
Supplementary Material: Specular Highlight Removal in Facial Images Chen Li 1 Stephen Lin 2 Kun Zhou 1 Katsushi Ikeuchi 2 1 State Key Lab of CAD&CG, Zhejiang University 2 Microsoft Research 1. Computation
More informationComputational Photography and Video: Intrinsic Images. Prof. Marc Pollefeys Dr. Gabriel Brostow
Computational Photography and Video: Intrinsic Images Prof. Marc Pollefeys Dr. Gabriel Brostow Last Week Schedule Computational Photography and Video Exercises 18 Feb Introduction to Computational Photography
More informationHerding CATs: A Comparison of Linear Chromatic-Adaptation Transforms for CIECAM97s
Herding CATs: A Comparison of inear Chromatic-Adaptation Transforms for CICAM97s Anthony J. Calabria and Mark D. Munsell Color Science aboratory, Rochester Institute of Technology Rochester, NY Abstract
More informationColor Constancy from Hyper-Spectral Data
Color Constancy from Hyper-Spectral Data Th. Gevers, H. M. G. Stokman, J. van de Weijer Faculty of Science, University of Amsterdam, The Netherlands fgevers, stokman, joostwg@wins.uva.nl Abstract This
More informationIlluminant Estimation from Projections on the Planckian Locus
Illuminant Estimation from Projections on the Planckian Locus Baptiste Mazin, Julie Delon, and Yann Gousseau LTCI, Télécom-ParisTech, CNRS, 46 rue Barault, Paris 75013, France {baptiste.mazin,julie.delon,yann.gousseau}@telecom-paristech.fr
More informationLinear Approximation of Sensitivity Curve Calibration
Linear Approximation of Sensitivity Curve Calibration Dietrich Paulus 1 Joachim Hornegger 2 László Csink 3 Universität Koblenz-Landau Computational Visualistics Universitätsstr. 1 567 Koblenz paulus@uni-koblenz.de
More informationTowards Autonomous Vision Self-Calibration for Soccer Robots
Towards Autonomous Vision Self-Calibration for Soccer Robots Gerd Mayer Hans Utz Gerhard Kraetzschmar University of Ulm, James-Franck-Ring, 89069 Ulm, Germany Abstract The ability to autonomously adapt
More informationCamera Characterization for Color Research
Camera Characterization for Color Research Kobus Barnard, 1 * Brian Funt 2 1 Computer Division, University of California Berkeley, Berkeley, CA 94720-1776 2 Department of Computing Science, Simon Fraser
More informationSpectral Compression: Weighted Principal Component Analysis versus Weighted Least Squares
Spectral Compression: Weighted Principal Component Analysis versus Weighted Least Squares Farnaz Agahian a*, Brian Funt a, Seyed Hossein Amirshahi b a Simon Fraser University, 8888 University Dr. V5A 1S6,
More informationNearest Clustering Algorithm for Satellite Image Classification in Remote Sensing Applications
Nearest Clustering Algorithm for Satellite Image Classification in Remote Sensing Applications Anil K Goswami 1, Swati Sharma 2, Praveen Kumar 3 1 DRDO, New Delhi, India 2 PDM College of Engineering for
More informationMotion. 1 Introduction. 2 Optical Flow. Sohaib A Khan. 2.1 Brightness Constancy Equation
Motion Sohaib A Khan 1 Introduction So far, we have dealing with single images of a static scene taken by a fixed camera. Here we will deal with sequence of images taken at different time intervals. Motion
More informationA Survey of Light Source Detection Methods
A Survey of Light Source Detection Methods Nathan Funk University of Alberta Mini-Project for CMPUT 603 November 30, 2003 Abstract This paper provides an overview of the most prominent techniques for light
More informationUvA-DARE (Digital Academic Repository) Edge-driven color constancy Gijsenij, A. Link to publication
UvA-DARE (Digital Academic Repository) Edge-driven color constancy Gijsenij, A. Link to publication Citation for published version (APA): Gijsenij, A. (2010). Edge-driven color constancy General rights
More informationImage retrieval based on region shape similarity
Image retrieval based on region shape similarity Cheng Chang Liu Wenyin Hongjiang Zhang Microsoft Research China, 49 Zhichun Road, Beijing 8, China {wyliu, hjzhang}@microsoft.com ABSTRACT This paper presents
More informationTHE color of objects may be communicated in many forms.
518 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 56, NO. 2, FEBRUARY 2008 From Color Sensor Space to Feasible Reflectance Spectra Silvia Zuffi, Member, IEEE, Simone Santini, Member, IEEE, and Raimondo
More informationVision par ordinateur
Epipolar geometry π Vision par ordinateur Underlying structure in set of matches for rigid scenes l T 1 l 2 C1 m1 l1 e1 M L2 L1 e2 Géométrie épipolaire Fundamental matrix (x rank 2 matrix) m2 C2 l2 Frédéric
More informationSeeing and Reading Red: Hue and Color-word Correlation in Images and Attendant Text on the WWW
Seeing and Reading Red: Hue and Color-word Correlation in Images and Attendant Text on the WWW Shawn Newsam School of Engineering University of California at Merced Merced, CA 9534 snewsam@ucmerced.edu
More informationAbstract. 1. Introduction
Recovery of Chromaticity Image Free from Shadows via Illumination Invariance Mark S. Drew School of Computing Science Simon Fraser University Vancouver, British Columbia Canada V5A 1S6 mark@cs.sfu.ca Graham
More informationAn ICA based Approach for Complex Color Scene Text Binarization
An ICA based Approach for Complex Color Scene Text Binarization Siddharth Kherada IIIT-Hyderabad, India siddharth.kherada@research.iiit.ac.in Anoop M. Namboodiri IIIT-Hyderabad, India anoop@iiit.ac.in
More informationReconstruction of Surface Spectral Reflectances Using Characteristic Vectors of Munsell Colors
Reconstruction of Surface Spectral Reflectances Using Characteristic Vectors of Munsell Colors Jae Kwon Eem and Hyun Duk Shin Dept. of Electronic Eng., Kum Oh ational Univ. of Tech., Kumi, Korea Seung
More informationVisual Evaluation and Evolution of the RLAB Color Space
Visual Evaluation and Evolution of the RLAB Color Space Mark D. Fairchild Munsell Color Science Laboratory, Center for Imaging Science Rochester Institute of Technology, Rochester, New York Abstract The
More informationRemoving Shadows From Images using Retinex
Removing Shadows From Images using Retinex G. D. Finlayson, S. D. Hordley M.S. Drew School of Information Systems School of Computing Science University of East Anglia Simon Fraser University Norwich NR4
More informationthis is processed giving us: perceived color that we actually experience and base judgments upon.
color we have been using r, g, b.. why what is a color? can we get all colors this way? how does wavelength fit in here, what part is physics, what part is physiology can i use r, g, b for simulation of
More informationThank you for choosing NCS Colour Services, annually we help hundreds of companies to manage their colours. We hope this Colour Definition Report
Thank you for choosing NCS Colour Services, annually we help hundreds of companies to manage their colours. We hope this Colour Definition Report will support you in your colour management process and
More informationCOMPUTER AND ROBOT VISION
VOLUME COMPUTER AND ROBOT VISION Robert M. Haralick University of Washington Linda G. Shapiro University of Washington T V ADDISON-WESLEY PUBLISHING COMPANY Reading, Massachusetts Menlo Park, California
More informationA Novel Criterion Function in Feature Evaluation. Application to the Classification of Corks.
A Novel Criterion Function in Feature Evaluation. Application to the Classification of Corks. X. Lladó, J. Martí, J. Freixenet, Ll. Pacheco Computer Vision and Robotics Group Institute of Informatics and
More informationTo appear in Pattern Recognition Letters Copyright Elsevier Science 22 2 an example the chromaticity[26] function, used extensively in colour science
Illuminant and Gamma Comprehensive ormalisation in Log RGB Space Graham Finlayson and Ruixia Xu School of Information Systems University of East Anglia orwich R4 7TJ United Kingdom graham@sysueaacuk September,
More informationAn Efficient Need-Based Vision System in Variable Illumination Environment of Middle Size RoboCup
An Efficient Need-Based Vision System in Variable Illumination Environment of Middle Size RoboCup Mansour Jamzad and Abolfazal Keighobadi Lamjiri Sharif University of Technology Department of Computer
More informationModel-based Enhancement of Lighting Conditions in Image Sequences
Model-based Enhancement of Lighting Conditions in Image Sequences Peter Eisert and Bernd Girod Information Systems Laboratory Stanford University {eisert,bgirod}@stanford.edu http://www.stanford.edu/ eisert
More informationSegmentation and Tracking of Partial Planar Templates
Segmentation and Tracking of Partial Planar Templates Abdelsalam Masoud William Hoff Colorado School of Mines Colorado School of Mines Golden, CO 800 Golden, CO 800 amasoud@mines.edu whoff@mines.edu Abstract
More informationReading. 2. Color. Emission spectra. The radiant energy spectrum. Watt, Chapter 15.
Reading Watt, Chapter 15. Brian Wandell. Foundations of Vision. Chapter 4. Sinauer Associates, Sunderland, MA, pp. 69-97, 1995. 2. Color 1 2 The radiant energy spectrum We can think of light as waves,
More informationColor and Color Constancy in a Translation Model for Object Recognition
Color and Color Constancy in a Translation Model for Object Recognition Kobus Barnard 1 and Prasad Gabbur 2 1 Department of Computer Science, University of Arizona Email: kobus@cs.arizona.edu 2 Department
More informationIllumination-Robust Face Recognition based on Gabor Feature Face Intrinsic Identity PCA Model
Illumination-Robust Face Recognition based on Gabor Feature Face Intrinsic Identity PCA Model TAE IN SEOL*, SUN-TAE CHUNG*, SUNHO KI**, SEONGWON CHO**, YUN-KWANG HONG*** *School of Electronic Engineering
More information