Exploiting Spatial and Spectral Image Regularities for Color Constancy
|
|
- Oscar Sharp
- 5 years ago
- Views:
Transcription
1 Explotng Spatal and Spectral Image Regulartes for Color Constancy Barun Sngh and Wllam T. Freeman MIT Computer Scence and Artfcal Intellgence Laboratory July 2, 23 Abstract We study the problem of color constancy nferng from an mage the spectrum of the llumnaton and the reflectance spectra of all the depcted surfaces. Ths estmaton problem s underdetermned: many surface and llumnaton spectra can be descrbed as a lnear combnaton of 3 bass functons, gvng 3 unnowns per pxel, plus 3 parameters for a global llumnaton. A trchromatc vsual system maes fewer measurements than there are unnowns. We address ths problem by wrtng the reflectance spectra of small groups of pxels as a lnear combnaton of spato-spectral bass functons. These aggregated surface reflectance spectra requre fewer parameters to descrbe than the sum of the spectral parameters for the ndvdual surface pxels, gvng us more measurements than unnown parmaeters. We explore ths problem n a Bayesan context, showng when the problem s over or underdetermned based on analyzng the local curvature characterstcs of the log-lelhood functon. We show that usng the spato-spectral bass functons gves mproved reflectance and llumnaton spectral estmates when appled to real mage data. 1 Introducton Color s mportant n our understandng of the vsual world and provdes an effectve cue for object detecton and recognton. In general, however, the observed color of an object dffers from ts true color due to factors such as lghtng and orentaton. Color constancy refers to the ablty to perceve the color of an object as approxmately constant regardless of the color of the lght fallng upon t [7]. We are able to relably use color for a varety of vson tass largely because of our ablty to perform color constancy well. Inherently, the color constancy problem s underdetermned. The mage formaton process conssts of an llumnaton reflectng off of a surface, then beng passed through a set of sensors. The nput to the sensors s the product of the llumnaton spectrum and the surface s reflectance 1
2 spectrum. Dfferent combnatons of llumnaton and reflectance spectra can produce the same spectrum mpngng on the sensor, and varous sensor nputs can result n the same sensor responses. Due to these ambgutes, t may be mpossble to unquely separate the effect of the llumnaton and the surface reflectances n an mage. The goal of computatonal color constancy [18, 14, 4, 15, 3, 17, 1, 11, 19, 2, 6], therefore, s to determne an optmal separaton of reflectance and llumnaton under some metrc. Gven the sensor responses, we see an estmate of the reflectance and llumnaton spectra. Ths would appear to nvolve estmatng very many numbers. If we specfy a 3 nm spectrum at 1 nm ntervals, even assumng a sngle llumnaton spectrum over the whole mage, we would need 3N + 1 numbers to specfy the reflectance spectra for N pxels plus one llumnant. In order to smplfy the color constancy problem, low-dmensonal lnear models are used to descrbe llumnaton and reflectance spectra [13, 5, 16, 12]. A suffcently large porton of the energy n these spectra typcally 99% - can be descrbed usng as low as three-dmensonal models for both surfaces and llumnants. An addtonal constrant used by some approaches s that surfaces and llumnants must be physcally realzable, e.g. ther spectra cannot be negatve and surface reflectances must be less than 1 [1, 2, 6]. Even after these smplfcatons, the color constancy problem remans underdetermned and exstng approaches must mae further assumptons n order to obtan a soluton. Buchsbaum s Gray World algorthm assumes that the mean reflectance of all mages s the same, and the llumnaton s estmated usng ths mean [4]. Maloney and Wandell s Subspace method requres that a two-dmensonal model descrbe surface reflectances for the case of trchromatc sensors [17]. Gamut mappng methods [9, 8] explot the observed color gamut to estmate the llumnant spectrum, and can be combned wth realzablty constrants. Snce a Bayesan approach [2] can ncorporate the varous assumptons above nto ts pror probabltes, Bayesan decson theory [1] provdes a prncpled framewor whch we wll use for studyng the color constancy problem. A parameter countng argument reveals the underlyng problem we address n ths wor: f we use a 3-dmensonal model for the surface reflectance at each pxel, and a 3-dmensonal model for the llumnaton spectrum, for the case of trchromatc color sensors, we have more unnowns than observatons. We measure 3 numbers at each poston, yet have to estmate 3 numbers at each poston, plus the 3 numbers descrbng the llumnant. The problem s always underdetermned, requrng, n a Bayesan soluton, more relance on the pror probabltes or loss functon than on the lelhood functon to estmate the best answer. One would prefer the stuaton where the data lelhood functon domnated the other terms. In ths paper, we mae the problem overdetermned by ntroducng lnear bass functons that descrbe both spectral and spatal varatons n the surface reflectances. These spato-spectral bass functons explot mage regulartes whch allow us to specfy surfaces reflectances usng fewer numbers, yeldng more mage measurements than unnown parame- 2
3 ters. In the next sectons, we ntroduce the notaton and lnear bass functon analyss, then explore the Bayesan approach. We show wth smple examples that the structure of the posteror ndcates condtons under whch color constancy s stll undetermned by the data. We then apply our approach to real mages, verfyng usng hyperspectral mage data that our surface reflectance estmates mprove through usng the spato-spectral bass functons. 2 Lnear models We assume there s one global llumnaton n each scene and that the lght spectrum leavng each surface s the term-by-term product of the llumnaton and local reflectance spectrum. For a surface reflectance Sλ and llumnaton Eλ, the response at poston x of a photoreceptor wth a spectral response of R λ s: y x = λ R λeλs x λ, 1 The llumnant and surface spectra can be wrtten as lnear combnatons of the llumnaton bass functons E λ and reflectance bass functons S j λ, wth coeffcents e and s x j, respectvely, at poston x: Eλ = S x λ = L E λe, 2 =1 L S j λs x j, 3 j=1 where L s defned as the number of elements n the λ vector.e., the number of wavelength samples. Dong so allows us to wrte the renderng equaton as y x = λ L R λ E λe L =1 j=1 S j λs x j. 4 Summng over λ, we get a blnear form, L y x = L e G j, s x j, 5 =1 j=1 where G j, = λ R λe λs j λ. In general, we wsh to approxmate the true llumnant Eλ and surface spectra S x λ 3
4 usng lower dmensonal lnear models. Thus, we can defne Ẽλ = S x λ = d E =1 d S j=1 E λe, 6 S j λs x j, 7 where d E s the dmensonalty of the llumnant approxmaton Ẽλ and d S s the dmensonalty of the surface approxmaton S x λ. In addton, we can decompose 5 as: y x = d E = d S =1 j=1 d E d S =1 j=1 e G j, s x j + d E e G j, s x j + w x, L =1 j=d S +1 e G j, s x j + L d S =d E +1 j=1 e G j, s x j + L L =d E +1 j=d S +1 e G j, s x j where w x s a nose term representng the error due to the use of lower dmensonal models. A summary of the notaton used n ths paper s provded n Table 1. Equaton 8 s perhaps best understood by vewng color constancy as an estmaton problem. The goal s to estmate S x λ and Ẽλ gven yx. Thus, we vew the true llumnants as havng d E degrees of freedom as defned by the frst d E llumnant bass functons, wth remanng bass functons contrbutng n the form of nose. Analogously for surface reflectance, the frst d S bass functons defne the space of true reflectances and the remanng bass functons add nose. Note that whle the llumnaton nose and reflectance nose are orthogonal to the true llumnaton and reflectance, the projectons of the true data and the nose nto the sensor response space are not orthogonal. 8 3 Bayesan Approach to Color Constancy The Bayesan approach to color constancy utlzes a probablstc framewor to examne the problem. Ths framewor s based on three fundamental probablty dstrbutons - the pror, the lelhood, and the posteror. The pror descrbes the probablty that a certan set of parameters s the correct estmate wthout nowng anythng about the data. Ths dstrbuton s wrtten as P e, s, where e and s are the global llumnaton weghts and the surface weghts for all postons n an mage. The lelhood, gven by P y e, s, governs the relatonshp between the parameters beng estmated e and s and the observed data n ths case the set of all sensor responses n an mage, y. The posteror descrbes what s nown about the parameters beng 4
5 Symbol Symbol Defnton Symbol Symbol Defnton N number of pxels n an mage m number of pxels along one dmenson of a square bloc beng consdered wthn an mage λ wavelength γ ndex nto spato-spectral bass functons L number of wavelength samples length of λ vector K number of sensor responses avalable at any pxel Eλ spectral radance of llumnant E {} γ spato-spectral radance of llumnaton n m m bloc E λ th bass functon of llumnaton Ê γ th spato-spectral llumnaton bass functon e scalar weght of th llumnaton bass functon e row vector of all e e {} row vector of all e {} e {} d E scalar weght of th spato-spectral llumnaton bass functon d E dmensonalty of llumnaton representaton dmensonalty of spato-spectral llumnaton representaton Ẽλ approxmaton to llumnant from d E dmensonal Ẽ {}γ approxmaton to spato-spectral llum- lnear model nant from d E dmensonal lnear model S x λ surface reflectance at pont x S {x} γ spato-surface reflectance for pxel bloc {x} S j λ jth bass functon of surface reflectance Ŝ j γ jth spato-spectral surface reflectance bass functon s x j scalar weght of jth surface reflectance bass functon at poston x s {x} j weght of jth spato-spectral surface reflectance bass functon for pxel bloc {x} s x column vector of s x j for all j s{x} column vector of s {x} j for all j s matrx whose columns are gven by s x s {} matrx whose columns are gven by s {x} d S dmensonalty of surface reflectance representaton dmensonalty of spato-spectral surface reflectance representaton Sλ approxmaton to surface reflectance S {}γ approxmaton to spato-spectral surface from d S dmensonal lnear model reflectance from d S dmensonal lnear model R λ spectral senstvty of th sensor R γ spato-spectral senstvty of th sensor y x scalar response of th sensor at x y {x} d S scalar response of th sensor for pxel bloc x y x vector of y x for all y{x} vector of y {x} for all y matrx of y x vectors for all x y {} matrx of y {x} vectors for all x G j, 3-d tensor relatng llumnaton and reflectance weghts to sensor responses Ĝ j, Table 1: Symbol Notaton 3-d tensor relatng spato-spectral llumnaton and reflectance weghts to spatospectral sensor responses 5
6 estmated after havng observed the data and can be calculated usng Bayes rule as P e, s y = 1 P y e, sp e, s, 9 Z where the normalzaton constant 1 Z s ndependent of the parameters to be estmated. In addton to these probabltes, the Bayesan formulaton requres that we specfy a cost functon that defnes the penalty assocated wth a parameter estmate of ẽ, s when the true parameter values are e, s. For estmatng the relatve surface and llumnaton spectra, ndependent of any overall scale factor, we fnd that the loss functon has lttle effect [2], so we use MAP estmaton and maxmze the posteror probablty. The underdetermned nature of the general color constancy problem mples that there should be an nfnte set of solutons whch maxmze the posteror.to see that ths s the case, we must examne the propertes of equaton 9. Assumng ndependent and dentcally dstrbuted Gaussan observaton nose wth varance σ2 n the photoreceptor responses at each patch, the posteror probablty s: P e, s y = 1 e yx,j e G j, s x j 2/2σ2 P e, s. 1 Z x, If the posteror s flat along any dmenson n ths regon, there s a famly of possble solutons to the mnmzaton problem, whereas f the posteror s not flat along any dmensons, a fnte number of local mnma must exst. Furthermore, f we assume that the pror probablty P e, s vares slowly over the regon beng consdered, the structure of the posteror can be seen by examnng the local structure of the log lelhood functon, Ly e, s = x, y x,j e G j, s x j Local Curvature Analyss We explore how the structure of the posteror probablty reveals whether or not the color constancy problem s solvable. The local structure we are nterested n s the curvature of the log lelhood functon, whch tells us how movng n the parameter space affects our ablty to explan the observed data. We wll analyze how ths structure changes when we ntroduce low-level spatal nformaton nto the model, and use ths analyss to motvate the use of such nformaton for color constancy. The curvature of the log lelhood can be obtaned from an egen decomposton of ts Hessan matrx. The Hessan s a matrx of all second order dervatves and thus, for an N- pxel mage, s a d E + Nd S d E + Nd S matrx. The egenvectors of the Hessan matrx gve prncpal drectons of curvature and the correspondng egenvalues gve the extent of curvature n each of these drectons. 6
7 At a maxmum of the log lelhood, all egenvalues of the Hessan must be non-negatve meanng that error cannot decrease as we move away from the local maxmum. If there are any egenvalues equal to zero, ths mples that there are drectons of zero curvature - e.g., there are ways we can vary the estmated parameters wthout affectng the lelhood of the data. For a unque maxmum, all egenvalues of Hessan must be postve at the maxmum. Furthermore, the larger these egenvalues are, the more robust s ths soluton to observaton nose or unmodelled mage varatons. To help us understand the structure of the color constancy problem for real-world mages, we frst examne representatve specal cases n toy examples. Appendx B gves a full dervaton of the Hessan for the log lelhood functon gven by Underdetermned Case We constructed a toy problem n whch the sensor responses for all ponts n an mage are generated usng equaton 8 wth the nose term set to zero. To perform smulatons, we used a hyperspectral data set of 28 natural scenes collected at Brstol Unversty by Brelstaff, et. al. as descrbed n []. Each of these mages s pxels n sze and contans sensor responses to 31 spectral bands, rangng from 4 nm to 7 nm n 1 nm ntervals. Each scene also contans a Koda greycard at a nown locaton wth a constant reflectance spectrum of nown ntensty. The scene llumnant s approxmated as the spectrum recorded at the locaton of the greycard dvded by ts constant reflectance. Our dataset therefore conssts of 256x256x28 reflectance spectra and 28 llumnaton spectra. The frst three llumnaton and reflectance bass functons obtaned by applyng prncpal components analyss PCA to ths data are plotted n Fgure 1a and b, respectvely. We assume, wthout loss of generalty, a Gaussan model for sensor responses centered at 65 red, 55 green, and 45 nm blue as shown n Fgure 1c. Generatng 1 ponts usng random llumnaton and reflectance weghts and evaluatng the Hessan at the correct locaton n parameter space results n the egenvalue spectrum shown n Fgure 2. We can see that, as expected, there are 3 drectons of zero curvature. The three assocated egenvectors gve the drectons of zero curvature n parameter space. Any lnear combnaton of these egenvectors s also a drecton of zero curvature. It s nterestng to note that there are 3 llumnaton weghts and also three egenvectors wth correspondng zero egenvalues. Each of these egenvectors s of dmenson d E + Nd S, wth three of those dmensons correspondng to the llumnant weghts. The three egenvectors span the space of the 3-dmensonal llumnant space, meanng that for any set of llumnaton coeffcents, there exsts some set of reflectance weghts such that the lelhood assocated wth that set of parameters s equal to the lelhood assocated wth the correct set of parameters. In other words, ths means that we can move n any drecton n the 3-dmensonal space of the llumnant and stll fnd surface reflectance values that render to the observed sensor val- 7
8 ntensty arbtrary scale ntensty arbtrary scale wavelength, λ nm a Illumnaton Bass Functons wavelength, λ nm b Reflectance Bass Functons 5 sensor response wavelength, λnm c Sensor Responses Fgure 1: Bass functons and sensor responses used n toy examples. Bass functons are obtaned from a hyperspectral dataset. 8
9 ues. One example of ths s a multplcatve scalng up of the llumnaton and a correspondng scalng down of the surface reflectances. log of egenvalues curves wth slope = a Egenvalue spectrum b Graphc depcton Fgure 2: Egenvalue spectrum and correspondng curvature of the log lelhood for a toy example of the color constancy problem. The drectons of zero curvature and egenvalues at zero show that the problem s underdetermned Suffcent Sensors If there are 4 ndependent photoreceptor responses avalable nstead of 3, we would expect for a better behaved log-lelhood functon. However, there should stll be one drecton of zero curvature n the Hessan, correspondng to a smple scalng of the llumnaton and surfaces. The bass functons and sensor responses gven n Fgure 1 are used for ths example as well as a fourth sensor response whch s chosen to be random and thus ndependent of the other three. We agan generate 1 random ponts and fnd that the Hessan behaves as expected, as shown n Fgure 3. Not only does the Hessan have only one egenvalue equal to zero, the other egenvalues have a much larger value than the egenvalues of the Hessan n the underdetermned case. log of egenvalues curve wth slope = a Egenvalue spectrum b Graphc depcton Fgure 3: Egenvalue spectrum and correspondng curvature of the log lelhood for a case when the number of sensors exceeds the dmensonalty of the surface model. There s now only one drecton of zero curvature, correspondng to an unnown scale factor. 9
10 3.2 Bayesan Color Constancy n the Underdetermned Case Although there may be multple degrees of ambguty n the lelhood functon, n general, the Bayesan approach s stll able to produce a unque parameter estmate, because the pror or the loss functon wll favor one soluton over the others [2]. In the deal case, however, we would le for our parameter estmate to be domnated by the effect of the lelhood functon. That s, we would le for the estmate to be based on the data tself, not on pror assumptons about the data or how much we value partcular parts of the data. 4 Spato-spectral Bass Functons We now ntroduce an alternatve formulaton of the fnte-dmensonal models presented n Secton 2 that model both spatal and spectral propertes of groups of pxels n natural mages. The hypothess s that by tang characterstc spatal varatons of natural mages nto account, the number of parameters necessary to descrbe the reflectance of an mage wll be reduced so that the problem s no longer underdetermned. Certan physcal phenomena, such as nterreflectons, may generate characterstc spatal and spectral sgnatures whch allow estmaton of the desred spectra from mage data. Natural mages, le folage, may exhbt characterstc spatal changes n color. The spato-spectral bass functons allow us to explot these, or other, regulartes n the vsual world n order to solve the color constancy problem. We expect ths approach wll wor best n rchly textured mages, and worst n flat, color Mondran-type mages [18]. 4.1 Modfed Lnear Models Instead of usng lnear models to descrbe the reflectance of ndvdual pxels, we wll now use these models to descrbe groups of pxels. Wthout loss of generalty, we can group pxels nto m m blocs and use the same basc formulaton as was developed n Secton 2. In order to do so, t s necessary to convert blocs of pxels nto vector format. We do ths by rasterzng the pxels wthn the bloc. The reflectance of a bloc of pxels s defned as a vector of length m 2 L consstng of the reflectance of each pxel wthn the bloc staced on top of each other n raster order. The same process s used to descrbe the sensor response of the bloc as a vector of length m 2 K and the llumnaton as a vector of length m 2 L. The bass functons used to model the reflectance of blocs of pxels are now referred to as spato-spectral reflectance bass functons, snce they descrbe both the spectral and spatal characterstcs of a bloc of pxels. We shall denote a group of pxels by {x}, so that the llumnaton and reflectance of a bloc 1
11 of pxels s gven by: E {} γ = S {x} γ = m 2 L =1 m 2 L j=1 Ê γe {}, 12 Ŝ j γs {x} j, 13 where Êγ and Ŝjγ are the spato-spectral llumnaton and reflectance bass functons, e {} and s {x} j are the weghts assocated wth these bass functons, E {} γ s the llumnaton of all blocs n the mage, and S {x} γ s the reflectance of the bloc of pxels {x}. Note that the elements of the scene are now wrtten as a functon of γ rather than λ. Ths s due to the fact that the spato-spectral representaton contans nformaton about both the frequency and spatal characterstcs of the scene. Approxmatng these models wth fewer dmensons, we can defne Ẽ {} γ = S {x} γ = d E =1 d S j=1 Ê γe {}, 14 Ŝ j γs {x} j, 15 where Ẽ{} γ s the approxmate llumnaton of all blocs n an mage, constructed usng a d E dmensonal model, and S {x} γ s the approxmated reflectance for the bloc {x}, constructed usng a d S dmensonal model. We defne an m m bloc of pxels as havng m 2 K sensor outputs, wth K sensor outputs per pxel. Thus, we defne the sensor responses of the group of pxels as the bloc dagonal matrx wth m2 blocs along the dagonal, and Rλ... Rλ... Rγ = Rλ 16 R = [R 1 γ R 2 γ... R γ]. We let R γ refer to the th column of the matrx Rγ. Followng a dervaton analogous to that presented n Secton 2, we can wrte the sensor 11
12 output n a blnear form wth nose as: where y {x} y {x} = d E d S =1 j=1 e {} Ĝ j, s {x} j + w {x}, 17 s the sensor response of the bloc of pxels {x}, Ĝj, s defned as Ĝ j, = γ R γêγŝjγ, 18 and w {x} s the nose ntroduced from usng a lower-dmensonal lnear model. 4.2 The Advantage of Usng Spatal Informaton The advantage of ncorporatng spatal nformaton nto the lnear models used to descrbe scenes s that t provdes more descrptve power usng a fewer number of parameters. It s straghtforward to show that n even n the worst case,.e. when ncorporatng spatal nformaton provdes no beneft and ndvdual pxels are ndependent, the spato-spectral method cannot do worse than the tradtonal method. The amount of mprovement n descrptve power provded by the new method can be tested by fndng a lnear reflectance bass usng real mages for blocs of varous szes ncludng m = 1, whch corresponds to the tradtonal case of examnng each pxel ndependently and calculatng how much of the varance of a set of test mages s descrbed n each case. To do ths, we use the dataset of hyperspectral mages descrbed earler n Secton The amount of varance descrbed by lnear models of varyng dmensonalty when consderng bloc szes of m =1, 2, 3, and 4 s shown n Fgure 4. The fgure plots the number of bass functons per pxel the number of bass functons used to descrbe the m m bloc dvded by m2 aganst the amount of varance descrbed when usng that many bass functons. The lnear model was obtaned usng approxmately half of the data n the 28 scenes selected randomly and tested on the entre data set. It can be seen that usng a bloc sze of m = 2 dramatcally mproves performance. For example, the data shows that the error rate obtaned when descrbng each pxel wth 3 bass functons can be acheved by usng only 1.5 bass functons per pxel when descrbng an mage wth 2 2 blocs.e., 6 bass functons for the bloc. Increasng the bloc sze beyond m = 2 does not show much of an mprovement n reconstructon error. Ths s because the majorty of the advantage of usng blocs s to tae advantage of local flatness n an mage, whch s already done when 2 2 blocs are used. Fgure 5 plots the frst 12 spato-spectral reflectance bass functons for m = 2. These bass functons were extracted from the hyperspectral data usng the calbraton gray card n each mage of the dataset, n the same manner as descrbed n Secton It can be seen that the frst three bass functons are essentally the same as 12
13 square error of reconstructon pxel bloc 2 2 pxel bloc 3 3, 4 4 pxel blocs number of coeffcents per pxel n bloc Fgure 4: The squared reconstructon error usng lnear models of varyng dmensons for bloc szes of m =1, 2, 3, and 4. Usng bloc szes of m = 2 or larger greatly reduces the number of coeffcents needed to descrbe each pxel. the standard sngle pxel bases repeated at all 4 pxels. To see the advantage of usng spatal nformaton n the context of Bayesan color constancy, we must once agan analyze the local curvature of the posteror probablty. Followng the dervatons n Secton 3, we once agan mae the assumpton of a locally flat pror dstrbuton, allowng us to smplfy the problem and examne the log lelhood functon, now wrtten as Ly {} e {}, s {} = {x}, y {x},j 5 Experments wth Natural Images e {} 2. Ĝ j, s {x} j 19 We loo at groups of 4 pxels, grouped nto 1 sets of 2x2 pxel blocs. The 1 sets were selected from randomzed postons n the mage. In order to get the prors, we project our dataset of reflectances and llumnatons onto the bass functons gven n Fgures 1a for llumnaton and 5 for spato-spectral reflectance. We ft truncated Gaussans to the data and use these as our prors. Our goal s now to fnd the set of llumnaton and reflectance coeffcents that mnmze the posteror probablty. In order to do ths, we need to search over the space of all possble llumnaton and surface reflectance coeffcents. Snce the number of surface coeffcents scales wth the number of pxels n the mage, ths qucly becomes an ntractble problem. Followng [2], n order to mae the problem more feasble, we lmt our search to loo over the space of llumnaton coeffcents and solve for the surfaces at each teraton usng a determnstc relatonshp. In the underdetermned case, where the number of sensor responses at each pxel s equal to the number of surface coeffcents at each pxel, we solve for sur- 13
14 .6 poston 1.6 poston 2.6 poston 1.6 poston poston 3.6 poston 4.4 poston 3.6 poston a bass functons 1, 2, and 3 b bass functons 4, 5, and 6.4 poston 1.6 poston 2.4 poston 1.4 poston poston 3.6 poston 4.4 poston 3.4 poston c bass functons 7, 8, and 9 d bass functons 1, 11, and 12 Fgure 5: The frst 12 spato-spectral bass functons for 2x2 pxel blocs. Each bass functon s plotted for wavelength values from 4 to 7 nm on the x-axs. The frst 3 spato-spectral bass functons, a, show only spectral varatons and no spatal varaton. The next 3 bass functons, b, correspond to spatal dervatves. The fnal 6 ndcate a more complex relatonshp of spatal and spectral varatons, c and d. 14
15 faces that produce the sensor responses exactly gven an llumnaton ths s done by solvng equaton 8 assumng no sensor nose through a smple matrx nverson. Ths s equvalent to constranng our search to locatons of maxmum probablty n the lelhood. In the case where we have more sensor responses than surface coeffcents, we tae the pseudo-nverse to fnd the surface coeffcents correspondng to a gven llumnaton. Unfortunately, applyng ths technque of constranng the search space to real mages gves numercal problems. In these mages, the nose term n equaton 8, whch corresponds to the surface and llumnaton components not ncluded n a low-dmensonal model, causes the surface coeffcents that maxmze the lelhood term gven the true llumnant to be very dfferent from the true surfaces coeffcents. Ths maes t hard to properly analyze the posteror probablty correspondng to a gven lllumnant. To avod the numercal ssues mentoned above, we test our algorthm on mages constructed by frst projectng the true surface reflectances down to a number of dmensons equal to the number of sensor responses 3 for 1 pxel at a tme, 12 for 2x2 blocs, multplyng the reflectance mage by the true llumnant, and passng the result through the Gaussan sensors shown n Fgure 1. Fgure? shows that there s very lttle dfference between the mage obtaned usng the true reflectance and the mage obtaned after projectng the reflectance onto the lower-dmensonal subspace. We need to be clear: these are pre-processed mages, not real mages, although they are tantalzngly close to real mages. We show the benefts of usng spato-spectral bass functons n solvng color constancy usng the pre-processed mages, and expect that extensons to real mages wll follow n wor by us or by others. a Sample mage from dataset b Image after projecton Fgure 6: The effect of projectng reflectance to lower dmensons s very small. Fgure 7 shows results for our approach usng spato-spectral bass functons n a Bayesan approach wth the standard Bayesan approach and the Gray World approach. The partcular llumnant we wsh to estmate s not ft well by the pror, as seen n the fgure. Each algorthm s run on 15 random groups of 4 pxels chosen from the mage. Despte the low pror probablty of the llumnant, the Bayesan approach usng spato-spectral bass functons allows 15
16 us to locate the correct llumnant for each draw. Ths llustrates that the lelhood term does domnates our estmate, as we would expect. The standard Bayesan approach, examnng one pxel at a tme, and the Gray World approach both result n ncorrect estmates..3.3 ntensty arbtrary scale ntensty arbtrary scale wavelength λ a usng spato-spectral bass functons 4 7 wavelength λ b standard Bayesan approach.35.3 ntensty arbtrary scale wavelength λ c Gray World algorthm Fgure 7: Results of color constancy appled to a natural mage. Each algorthm was run 15 tmes, wth results shown n dotted lnes. The mean llmnaton from the pror s gven n the dashed lne as reference, and the true llumnant s mared by crcles. In our experments, we also found that the postvty constrant restrcted the set of possble llumnants more when usng 2x2 blocs than when consderng 1 pxel at a tme, so that the results for 2x2 blocs usng 12 coeffcents underdetermned were better than the results for the standard underdetermned case. 6 Conclusons We have studed the effect of usng spato-spectral surface reflectance bass functons to fnd a low-dmensonal estmate of surface reflectance characterstcs. These bass functons can convert the color constancy problem from an under-determned problem to an over-determned one. We can see ths n the curvature characterstcs of the 16
17 log-llhood functon at parameter local maxma. For natural mages, pre-processed to restrct the surface reflectance varatons to be explaned by an average of 3 bass functons per pxel, we fnd that usng spato-spectral bass functons allows for very accurate estmates of the global llumnaton spectrum and therefore of surface reflectance spectra, too. For the same mages, usng purely spectral bass functons results n an underdetermned problem, wth much hgher estmaton error for the optmal Bayesan estmate. Acnowledgments We than Davd Branard for many helpful conversatons. APPENDIX: The Hessan of the Log Lelhood Functons wth Blnear Forms H el e m = 2 L e l e m L = y x e l e e G j, s x j 2 l,j = x, x, = 2 x, = 2 x, e l y x,j y x,j y x,j e G j, s x j 2 e G j, s x j e l e G j, s x j j,j G lj, s x j e G j, s x j A-1 A-2 A-3 A-4 2L e l e m = 2 e m = 2 x, = 2 x, x, y x,j y x e m,j j G lj, s x j j e G j, s x j j e G j, s x j j G mj, s x j G lj, s x j G lj, s x j A-5 A-6 A-7 17
18 H s n l s p m = 2 L s n l sp m L s n l = s n l = s n l = s n l = 2 = 2 y x e G j, s x j 2 x,,j y x e G j, s x j 2 + y x,j x=n,j x n y n e G j, s n j 2,j y n e G j, s n j s n,j l y n,j e G j, s n j,j e G l, e G j, s n j A-8 e G j, s x j 2 A-9 A-1 A-11 A-12 2 L s n l sp m 2 L s n l sn m = A-13 = s n m = 2 = 2 2 y n,j s n m,j e G m, e G j, s n j e G j, s n j e G l, e G l, e G l, A-14 A-15 A-16 H el s p m = 2 L e l s p m 2L e l s p m = 2 y p e e G j, s p j e G m, A-17 l,j = 2 y p e e G j, s p j e G m, + l,j y p e G j, s p j e G m, A-18 e,j l = 2 G lj, s p j e G m, y p e G j, s p j G lm, A-19 j,j References [1] J. O. Berger. Statstcal decson theory and Bayesan analyss. Sprnger, [2] D. H. Branard and W. T. Freeman. Bayesan color constancy. Journal of the Optcal Socety of Amerca A, 147: , [3] D H Branard and B A Wandell. Analyss of the retnex theory of color vson. Journal of the Optcal Socety of Amerca A, 31: ,
19 [4] G. Buchsbaum. A spatal processor model for object colour percepton. J. Franln Inst., 31:1 26, 198. [5] CIE. Colormetry. Bureau Central de la CIE, [6] M. D Zmura, G. Iverson, and B. Snger. Probablstc color constancy. In R. D. Luce et. al., edtor, Geometrc representatons of perceptual phenomena: papers n honor of Tarow Indow s 7th brthday. Lawrence Erlbaum, Hllsdale, NJ. n press. [7] R. M. Evans. The percepton of color. Wley, New Yor, [8] G. Fnlayson and S. Hordley. Improvng gamut mappng color constancy. Image and Vson Computng, 9: , 2. [9] D. Forsyth. A novel approach to color constancy. Internatonal Journal of Computer Vson, 5:5 36, 199. [1] D. A. Forsyth. A novel approach to colour constancy. In Proc. 1st Intl. Conf. Computer Vson, pages IEEE, [11] R. Gershon and A. D. Jepson. The computaton of color constant descrptors n chromatc mages. Color Res. Appl., 14: , [12] T. Jaaselanen, J. Parnen, and S. Toyooa. A vector-subspace model for color representaton. Journal of the Optcal Socety of Amerca A, 7:725 73, 199. [13] D. B. Judd, D. L. MacAdam, and G. W. Wyszec. Spectral dstrbuton of typcal daylght as a functon of correlated color temperature. J. Opt. Soc. Am., page 131, [14] E H Land. The retnex theory of color vson. Scentfc Amercan, 2376:18 128, [15] E. H. Land. Recent advances n retnex theory and some mplcatons for cortcal computatons: color vson and the natural mage. Proc. Nat. Acad. Sc. USA, 8: , [16] L. T. Maloney. Evaluaton of lnear models of surface spectral reflectance wth small numbers of parameters. Journal of the Optcal Socety of Amerca A, 31: , [17] L T Maloney and B A Wandell. Color constancy: a method for recoverng surface spectral reflectance. Journal of the Optcal Socety of Amerca A, 31:29 33, [18] J. J. McCann, S. P. McKee, and T. H. Taylor. Quanttatve studes n retnex theory: a comparson between theoretcal predctons and observer responses to the color mondran experments. Vson Research, 16: , [19] H. J. Trussell and M. J. Vrhel. Estmaton of llumnaton for color correcton. In Proc. ICASSP, pages ,
y and the total sum of
Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationLecture 4: Principal components
/3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationStructure from Motion
Structure from Moton Structure from Moton For now, statc scene and movng camera Equvalentl, rgdl movng scene and statc camera Lmtng case of stereo wth man cameras Lmtng case of multvew camera calbraton
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationA Robust Method for Estimating the Fundamental Matrix
Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
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 informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationLECTURE : MANIFOLD LEARNING
LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors
More informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationA Bilinear Model for Sparse Coding
A Blnear Model for Sparse Codng Davd B. Grmes and Rajesh P. N. Rao Department of Computer Scence and Engneerng Unversty of Washngton Seattle, WA 98195-2350, U.S.A. grmes,rao @cs.washngton.edu Abstract
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationRecognizing Faces. Outline
Recognzng Faces Drk Colbry Outlne Introducton and Motvaton Defnng a feature vector Prncpal Component Analyss Lnear Dscrmnate Analyss !"" #$""% http://www.nfotech.oulu.f/annual/2004 + &'()*) '+)* 2 ! &
More informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationLecture #15 Lecture Notes
Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationFace Recognition University at Buffalo CSE666 Lecture Slides Resources:
Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationSix-Band HDTV Camera System for Color Reproduction Based on Spectral Information
IS&T's 23 PICS Conference Sx-Band HDTV Camera System for Color Reproducton Based on Spectral Informaton Kenro Ohsawa )4), Hroyuk Fukuda ), Takeyuk Ajto 2),Yasuhro Komya 2), Hdeak Hanesh 3), Masahro Yamaguch
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationSimulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010
Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement
More informationElectrical analysis of light-weight, triangular weave reflector antennas
Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna
More informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationAccounting for the Use of Different Length Scale Factors in x, y and z Directions
1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,
More informationSynthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007
Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons
More informationBootstrapping Color Constancy
Bootstrappng Color Constancy Bran Funt and Vlad C. Carde * Smon Fraser Unversty Vancouver, Canada ABSTRACT Bootstrappng provdes a novel approach to tranng a neural network to estmate the chromatcty of
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
More informationOptimal Workload-based Weighted Wavelet Synopses
Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationCorner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity
Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent
More informationBackpropagation: In Search of Performance Parameters
Bacpropagaton: In Search of Performance Parameters ANIL KUMAR ENUMULAPALLY, LINGGUO BU, and KHOSROW KAIKHAH, Ph.D. Computer Scence Department Texas State Unversty-San Marcos San Marcos, TX-78666 USA ae049@txstate.edu,
More informationReview of approximation techniques
CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More informationIntegrated Expression-Invariant Face Recognition with Constrained Optical Flow
Integrated Expresson-Invarant Face Recognton wth Constraned Optcal Flow Chao-Kue Hseh, Shang-Hong La 2, and Yung-Chang Chen Department of Electrcal Engneerng, Natonal Tsng Hua Unversty, Tawan 2 Department
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationAppearance-based Statistical Methods for Face Recognition
47th Internatonal Symposum ELMAR-2005, 08-10 June 2005, Zadar, Croata Appearance-based Statstcal Methods for Face Recognton Kresmr Delac 1, Mslav Grgc 2, Panos Latss 3 1 Croatan elecom, Savsa 32, Zagreb,
More informationTECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.
TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of
More informationUSING LINEAR REGRESSION FOR THE AUTOMATION OF SUPERVISED CLASSIFICATION IN MULTITEMPORAL IMAGES
USING LINEAR REGRESSION FOR THE AUTOMATION OF SUPERVISED CLASSIFICATION IN MULTITEMPORAL IMAGES 1 Fetosa, R.Q., 2 Merelles, M.S.P., 3 Blos, P. A. 1,3 Dept. of Electrcal Engneerng ; Catholc Unversty of
More informationNew Extensions of the 3-Simplex for Exterior Orientation
New Extensons of the 3-Smplex for Exteror Orentaton John M. Stenbs Tyrone L. Vncent Wllam A. Hoff Colorado School of Mnes jstenbs@gmal.com tvncent@mnes.edu whoff@mnes.edu Abstract Object pose may be determned
More informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
More informationDynamic Camera Assignment and Handoff
12 Dynamc Camera Assgnment and Handoff Br Bhanu and Ymng L 12.1 Introducton...338 12.2 Techncal Approach...339 12.2.1 Motvaton and Problem Formulaton...339 12.2.2 Game Theoretc Framework...339 12.2.2.1
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationParallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)
Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)
More informationVanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay,
Vanshng Hull Jnhu Hu Suya You Ulrch Neumann Unversty of Southern Calforna {jnhuhusuyay uneumann}@graphcs.usc.edu Abstract Vanshng ponts are valuable n many vson tasks such as orentaton estmaton pose recovery
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationA Gradient Difference based Technique for Video Text Detection
A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng, Natonal Unversty of Sngapore {shva, phanquyt, tancl }@comp.nus.edu.sg
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More informationOverview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION
Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup
More informationSurface Mapping One. CS7GV3 Real-time Rendering
Surface Mappng One CS7GV3 Real-tme Renderng Textures Add complexty to scenes wthout addtonal geometry Textures store ths nformaton, can be any dmenson Many dfferent types: Dffuse most common Ambent, specular,
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationA Gradient Difference based Technique for Video Text Detection
2009 10th Internatonal Conference on Document Analyss and Recognton A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng,
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationAn Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method
Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and
More informationIMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS
IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS Davd Belton Cooperatve Research Centre for Spatal Informaton (CRC-SI) The Insttute for
More informationAPPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT
3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationGSLM Operations Research II Fall 13/14
GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationSome Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.
Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,
More informationA Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems
A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty
More informationReading. 14. Subdivision curves. Recommended:
eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.-6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton
More informationA New Feature of Uniformity of Image Texture Directions Coinciding with the Human Eyes Perception 1
A New Feature of Unformty of Image Texture Drectons Concdng wth the Human Eyes Percepton Xng-Jan He, De-Shuang Huang, Yue Zhang, Tat-Mng Lo 2, and Mchael R. Lyu 3 Intellgent Computng Lab, Insttute of Intellgent
More informationMachine Learning. Support Vector Machines. (contains material adapted from talks by Constantin F. Aliferis & Ioannis Tsamardinos, and Martin Law)
Machne Learnng Support Vector Machnes (contans materal adapted from talks by Constantn F. Alfers & Ioanns Tsamardnos, and Martn Law) Bryan Pardo, Machne Learnng: EECS 349 Fall 2014 Support Vector Machnes
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationOnline Detection and Classification of Moving Objects Using Progressively Improving Detectors
Onlne Detecton and Classfcaton of Movng Objects Usng Progressvely Improvng Detectors Omar Javed Saad Al Mubarak Shah Computer Vson Lab School of Computer Scence Unversty of Central Florda Orlando, FL 32816
More informationPROJECTIVE RECONSTRUCTION OF BUILDING SHAPE FROM SILHOUETTE IMAGES ACQUIRED FROM UNCALIBRATED CAMERAS
PROJECTIVE RECONSTRUCTION OF BUILDING SHAPE FROM SILHOUETTE IMAGES ACQUIRED FROM UNCALIBRATED CAMERAS Po-Lun La and Alper Ylmaz Photogrammetrc Computer Vson Lab Oho State Unversty, Columbus, Oho, USA -la.138@osu.edu,
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
More informationGlobal Illumination: Radiosity
Last Tme? Global Illumnaton: Radosty Planar Shadows Shadow Maps An early applcaton of radatve heat transfer n stables. Projectve Texture Shadows (Texture Mappng) Shadow Volumes (Stencl Buffer) Schedule
More information