Image Contrast Gain Control by Linear Neighbourhood Embedding

Size: px
Start display at page:

Download "Image Contrast Gain Control by Linear Neighbourhood Embedding"

Transcription

1 Vsal nformaton Processng Laborator School of Compter Scence and nformaton Technolog The Unverst of Nottngham Techncal Report Report-VPLAB November 2005 mage Contrast Gan Control b Lnear Neghborhood Embeddng Jan Gan and Gopng Q School of Compter Scence and nformaton Technolog The Unverst of Nottngham 1

2 mage Contrast Gan Control b Lnear Neghborhood Embeddng Jan Gan and Gopng Q School of Compter Scence and nformaton Technolog The Unverst of Nottngham Abstract n ths paper we present a method that adaptvel comptes a contrast gan control map for the mage throgh the se of a novel technqe termed lnear neghborhood embeddng (LNE) whch frst comptes a locall lnear relaton for each pxel and ts neghbors and then embeds these relatons globall n the gan map mage. We borrow the thnk globall ft locall concept and comptatonal technqes from locall lnear embeddng (LLE) and compte the gan control mage n closed forms b solvng constraned optmzaton problems. We constran the gan map locall followng a gan contrast control mechansm smlar to that fond n the vsal cortex to ensre that weak local contrasts are boosted and strong local contrasts are compressed and propagate these local constrants globall followng the orgnal mage pxels locall lnear relatons. We have appled or technqe to compress hgh dnamc range mages for reprodcton n low dnamc range meda and to enhance ordnar dgtal photographs. Reslts demonstrate that or technqe s capable of preservng local detals whle avodng artfacts sch as halo 1. ntrodcton Toda dgtal cameras are bqtos. However when magng scenes contanng wde varatons of llmnaton ntenstes the pctre qalt often trns ot to be less than satsfactor and mage enhancement has to be appled to mprove the mage. Althogh the statons can be remeded b sng hgh dnamc range (HDR) magng technolog [4 21] where the so called HDR radance maps record the actal dnamc range of the scenes there s stll the problem of fathfll reprodcng the mage n conventonal low dnamc range (LDR) reprodcton meda sch as prnt paper and CRT. n ths paper we present a technolog that adaptvel comptes a contrast gan control mage for a gven mage throgh the se of a novel technqe termed lnear neghborhood embeddng (LNE). LNE comptes the gan map b solvng constraned optmzaton problems sng the concept and comptatonal technqes smlar to those of a recent hgh dmensonalt redcton method called local lnearl embeddng (LLE) [22]. We ntrodce the dea of thnk locall ft globall whch comptes the gan control mage at local and global scales smltaneosl. We show that or technolog can be appled to compress the dnamc range of HDR radance maps for vsalzaton n LDR reprodcton devces and to enhance low qalt ordnar LDR dgtal photographs. n secton 2 we brefl revew prevos work. n secton 3 we ntrodce or lnear neghborhood embeddng technolog for adaptvel comptng a contrast gan control mage for a gven mage. n secton 4 we present mplementaton detals. We present or reslts n secton 5 and conclde or presentaton n secton Prevos Work n the past several ears there has been tremendos nterest n hgh dnamc range magng from captrng [9 13] to storage [20] to dspla [ ]. Althogh new hgh dnamc range dspla devces are beng developed e.g. [19] the domnant reprodcton meda for HDR mages are tradtonal montors and prnt paper havng a lmted dnamc range between onl one to two orders of magntde. Therefore how to best compress the dnamc range of the HDR radance map so that the nformaton n the orgnal scene can be fathfll reprodced n LDR devces s one of the mportant techncal challenges n HDR magng workflow and a varet of HDR mage dspla technqes have appeared n the lteratre. Extensve revews can also be fond n prevos works sch as [ ]. There are manl two categores of technqes: global (spatall nvarant) and local (spatall varant). n a global method a nonlnear fncton T s sed to map each pxel of the npt mage (x ) ndependentl to form an otpt mage (x ) = T((x )). The ke to ths tpe of method s to fnd the approprate mappng fncton T whch can be some power fnctons [5 18] or mappng crves derved from the mage s hstogram [8]. The advantage of the global method s that t s comptatonal effcent bt t can destro local contrasts makng the 2

3 mage look washed ot. n a local method how a pxel s mapped wll depend on both the pxel vale and ts spatal context. Local methods are sgnfcantl more complex and can be ver dffclt to mplement n practce. Earler methods sch as [3] ntrodce halo artfacts mproved methods sch as [12] can redce the vsblt of halos and newer methods sch as [15 21] can avod halo artfacts. One tpe of sccessfl local methods that avod halo estmate edge preservng gan control mage. The ke observaton s that the gan map shold have sharp edges at the same ponts that the orgnal mage does thereb preventng halos [ ]. n [17] the athors compte a gan map sng the blateral flter and have acheved ver good reslts. n [15] the athors compte the gan map n the gradent doman that compresses strong edges and boosts weak edges. The redced low dnamc range mage s then retreved b solvng Posson s eqaton sng an approxmated solton whch acheves satsfactor reslts wth reasonable comptatonal cost. n [21] the athors ntrodce a method that comptes a gan map for mltscale sbband mages and the have sccessfll avoded halos that are often assocated wth mltscale methods. We have developed a method that comptes a gan map mage n the ntenst mage doman b solvng constraned optmzaton problems and we have appled the method to compress hgh dnamc range mage for dspla and to the enhancement of ordnar mages and have acheved good reslts. 3. Contrast Gan Control b LNE For a gven mage (x ) we seek a gan map mage G(x ) to prodce a new mage (x ) = (x ) + G(x ) for hgh dnamc range compresson and/or mage enhancement. Or basc dea s llstrated n Fgre 1 whch conssts of two steps; we frst compte a lnear relaton for each pxel and ts local neghbors n the orgnal mage and then embed these lnear relatons n the gan map mage. We sparsel constran the gan map mage locall b sng a contrast gan control mechansm smlar to that fond n the vsal cortex [25] and propagate these sparse local gan controls globall throghot the entre mage followng the locall lnear pxel neghborhood relatons of the orgnal mage. We compte the locall lnear relatons and solve the global embeddng problem b borrowng the comptatonal technqes of the thnk globall ft locall framework [22]. n fact as wll become clear later n the paper or work can be more accratel descrbed as thnk locall ft globall strateg Gan Map b Neghborhood Embeddng An mage (x ) can be regarded as a prodct of the srface reflectance mage R(x ) and llmnaton mage L(x ) [1] we can wrte (n logarthmc doman): ( ) x = Rx ( ) + Lx ( ) (1) (x ) ( v) w x (v) x = w x w v v 1 Compte lnear neghborhood relatonshp on the orgnal mage w x (v) G(x ) G( v) ( ) ( ) ( ) ( ) ( ) ( ) G x = w x w G v v 2 Map to embedded gan map Fgre 1: Schematc of lnear neghborhood embeddng (LNE) and ts applcaton to comptng the gan map mage. The locall lnear neghborhood relatons of the orgnal mage are sed to compte the gan map mage sbject to some approprate constrants. The largest varaton of the mage comes from the llmnaton mage snce real world reflectance mages are nlkel to have contrast greater than 100:1. The llmnaton mage tends to var slowl across the mage [2] and large ntenst varatons tend to mostl occr between regons rather than locall wthn a small area. f the mage can be separated nto the prodct of R and L then hgh dnamc range compresson can be acheved b compressng the llmnaton mage L onl. Ths wa the large contrast between brghtl llmnated regons and dark shadow areas can be redced whle the contrast cased b reflectance of local textre featres s preserved. However separatng the reflectance from the llmnaton s an ll-posed problem and t s almost mpossble to completel separate L from R. Assme that we can compte a gan map G(x ) for the mage (x ) to prodce a new mage (x ) for applcatons sch as hgh dnamc range compresson and/or mage enhancement we can wrte ( ) x = Rx ( ) + Lx ( ) + Gx ( ) (2) The gan map shold serve at least two objectves at a coarse scale t shold redce the hgh contrast between ver brghtl llmnated regons and dark shadow areas; and at a local scale t shold enhance or preserve the detals wthn local regons. As well as achevng these two objectves smltaneosl t mst avod ntrodcng artfacts sch as halo. Therefore G(x ) shold compress strong edges cased b llmnaton varatons (hgh dnamc range compresson) preserve or boost local edges (mage enhancement) and protect orgnal edge sgns (avodng halo). We have developed a thnk locall ft globall technolog to compte the gan map mage to acheve these goals smltaneosl based on followng ratonale. 3

4 Becase hman vsal sstem s most senstve to local ntenst varatons then t s most mportant to preserve mabe even enhance local ntenst contrasts. However processng local contrasts wll have to be done at a global scale n the sense that when pttng locall processed regons together the whole mage shold preserve the orgnal scene s vsal ntegrt. Therefore we cannot process local regons ndependentl bt rather local regons contrasts shold be processed sch that the wll ft together globall. Eqall mportant the gan map shold protect the drectons of the ntenst changes across the whole mage to avod halo whch also reqres that local processng ft nto global relatons. Therefore the gan map mage mst be compted at local and global scales smltaneosl. Or method frst thnk locall t strategcall pcks a few local patches of the mage fnds the largest and the smallest ntenstes wthn each patch and processes the mn/max pxel pars accordng to a contrast gan control mechansm smlar to that fond n the vsal cortex. The processed mn/max pxel pars from these local patches are then ft globall to whole mage. To acheve sch thnk locall ft globall strateg we borrow the concept and comptatonal technqes smlar to those of the thnk globall ft locall framework locall lnear embeddng (LLE) [22]. At a coarse scale the regonal ntenst varatons wthn the mage ma be characterzed b locall lnear pxel relatons. One possble approach to characterzng the locall lnear spatal pxel relaton s to constrct a lnear model that reconstrcts the pxels from a lnear combnaton of ther neghbors. To bld sch model we can perform followng constraned optmzaton: Mnmzng 2 x (3) x v ( ) = ( ) ( ) ( ) E W x w v v Sbject to w v = 1 and w v = 0 f ( v) N v ( ) ( ) x x x where N x denotes a local neghborhood srronds the pxel at locaton (x ) w x ( v) s the weght whch qantfes the contrbton of the neghborhood pxel at locaton ( v) to reconstrctng the pxel at (x ). Note that the relaton s made local b settng the weghts of pxels otsde a local neghborhood of the pxel to zero. All weghts smmed to 1 to be nvarance to the absolte ntenst of the mage. The locall lnear spatal relaton at pxel locaton (x) n the orgnal mage s captred n the weght matrx W x = {w x ( v)}. These weght matrces shold also captre the spatal varatons of the gan map G becase from (2) t s clear that the gan map G shold follow the varatons of. Therefore we can constrct G b embeddng W x s n the gan map b solvng followng constraned optmzaton problem: Mnmzng 2 x (4) x v ( ) = ( ) ( ) ( ) E G G x w v G v Sbject to G(x ) = g = 1 2 where g s are pre-determned vales of the gan map at locaton (x ). Note that althogh the reconstrcton weght matrx for each pxel s compted from a local neghborhood n the orgnal mage and s ndependent of the weghts of other pxels the embeddng s a global operaton that coples all gan map pxels. Therefore G shold follow locall and globall as well. However becase the local weghts onl captre the lnear relatons the can onl captre the slow changng components of that shold reflect regonal varatons of the mage. Local scale processng can be realzed b settng the constrants locall. nformall we can vew (4) as globall fts the local constrants G(x ) to the whole mage globall. Clearl G wll be greatl dependent on the nmbers the locatons and the vales of the constrants G(x ) and settng the constrants s a crcal step n or algorthm Settng Constrants To get some nsght nto how the constrants shold be set t ma be helpfl to consder how the hman vsal sstem performs gan control. The vsal world s hgel complex and the vsal sstem s constantl exposed to scenes of hge dnamc ranges. Apparentl the vsal sstem performs varos tpes of atomatc control to cope wth the hgh dnamc ranges and nos envronments to keep t wthn the optmal operatng range. At a global level there seems to be a gan control mechansm at the retna where the photoreceptors rapdl adapt to the ambent lght level. n comptatonal vson ths tpe of gan control s normall modeled b takng the log of the npt ntenst. t s wdel accepted that the logarthm of the lmnance s a (crde) approxmaton to the perceved brghtness. Therefore dsplang the log mage drectl shold gve reasonabl correct brghtness bt sch mage wll be lack of detals 1. t s also wdel accepted that hman vsal sstem s not ver senstve to absolte lmnance reach the retna bt rather responds to local 1 Logarthm tself ncrs no nformaton loss the detals are destroed b nmercal qantzaton. When the log mage s scaled down to wthn the dnamc range of the reprodcton devces pxels wth smlar vales wll be qantzed to the same level ths destrong detals. 4

5 Log() G Log() (e) Fgre 2. The orgnal hgh dnamc range sgnal wth a dnamc range of 6218 : 1. Logarthm of. The gan map where the * are the constraned ponts. The reslt sgnal = +. (e) Lnearl scale and to the same dnamc range of 10 : 1. t s seen that n the reslt sgnal local detals are well preserved (slghtl enhanced) n the low dnamc range mage. ntenst varatons. n the vsal cortex there are nerons that operate a gan control mechansm known as contrast gan control n whch moderatel low contrasts are boosted whle hgh contrasts are compressed [25]. These mportant propertes of the hman vsal sstem ma provde s wth some mportant cles to set the local constrants for eqaton (4) to acheve or goals. Frstl we shold set the constrants G(x ) sparel scattered across the mage to enable the embeddng process to enforce G to follow the varatons of ths protectng the vsal ntegrt of the orgnal mage. Secondl we shold set the vales of these constrants sch that the wll boost weak local contrasts and compress local hgh contrasts. n ths paper we se followng strateg to set the constrants: Constrants Settng Procedre ) Segment the mage nto coarse regons ) Wthn each segmented regon randoml pck nonoverlappng patches of certan sze (n ths paper 17x17 patch sze s sed other patch szes are possble). ) For each patch P fnd the smallest and the largest pxel wthn the patch x = arg max x ; x P ( max( p ) max( ) ) ( { ( ) ( ) }) p ( xmn( p ) mn( ) ) arg( mn { ( ); ( ) }) p = x x P and compte the patch s contrast as C( P) = ( xmax( p ) max( ) ) ( mn( ) mn( ) ) p x p (5) p v) Wthn each patch set two constrants for G one at (x max(p) max(p) ) and the other at (x mn(p) mn(p) ) accordng to β ( ( ) ) 0 mn( ) mn( ) ( C P (6) G x P max( ) max( ) ) ( ) P = G x P P = α C P α where α determne whch local contrasts are boosted or compressed. f the local contrasts are smaller than α then the are boosted and f the are greater than α then the are compressed (assmng 0 < β < 1). A smlar fncton was sed n [15] and [21] for gradent doman gan contrast control and sbband doman gan control. n all reslts presented n ths paper α s set to 0.3 tmes the average local patch contrast of the mage and β between From the above contrast settng procedre we can make followng observatons. The prpose of coarsel segmentng the mage s to dentf the strongest changes across mage regons. Becase the edges across these regons are so mportant n protectng the vsal ntegrt of the mage we do not want to set constrants across these strong edges rather we want to set constrants awa from these strong edges and prefer to fnd the gan map pxels for these strong edges throgh embeddng. For each local patch we onl fx two pxels for the gan map one at the smallest pxel s poston and the other at the largest pxel poston. Bascall we fx the smallest pxel and ncrease or decrease the largest pxel. Althogh we n effect assme that logarthm wll make the smallest pxel n each patch have the rght brghtness (gan map vale eqals zero) and set the gan map vale at the largest pxel poston these constrants are rather mld becase frstl onl two pxels wthn a 17x17 wndow are fxed (n practce <0.1% pxels are sed as constrants) secondl these pxels are onl borrowed to constran the optmzaton and over 99.9 % of the pxels are fond throgh global embeddng. The gan map pxels wthn each local patch are not onl affected b the constrants of ts own patch bt are also nflenced b ALL constrants from dfferent patches therefore these locall set constrants wll propagate globall. n fact n the fnal gan map the pxels at the constrant postons can be replaced b averagng or majort votng ths removng the hard constrants ntall pt on for comptatonal prpose Algorthm Smmar The LNE gan map constrcton method and ts applcaton can be smmarzed n followng steps: 1 Compte the logarthm of the npt 2 Compte lnear pxel neghborhood relatons accordng to (3) 3 Set gan map constrants accordng to the constran settng procedre 4 Compte the gan map G accordng to (4) 5 Compte the otpt mage = + G and lnearl scale t to wthn the dnamc range of the reprodcton meda. The procedre of or method s llstrated n Fgre 2. 5

6 4. mplementaton mplementaton of the LNE gan map algorthm s relatvel straghtforward. Becase t s onl necessar to segment the mages nto coarse regons and accrate mage segmentaton s not necessar we frst down scale the orgnal mage b a factor of 4 n both dmensons and then se the mean shft robst comptatonal segmentaton method [23] to atomatcall segment the mage nto regons. Snce or man prpose s to dentf where the strong edges are lkel stated we then rescale the segmented mage nto fll resolton and prodce thck bondares where constrant pxels shold not be placed across. nsde each segmented regon we place a 17 x 17 wndow at non-overlappng postons and at each poston dentf the smallest and the largest pxels wthn the wndow and set the constrants for G at these mn and max locatons accordng to (6). To solve the constraned least sqares ft problem of (3) we follow the comptatonal method of LLE [22] b solvng a lnear sstem of eqatons. However snce n or case the data s 1-d and there wll alwas be more neghbors than npt dmensons the least sqares problem for fndng the weghts does not have a nqe solton. We follow the method of [22] b addng a reglarzaton term to the reconstrcton cost fncton to solve the problem. The comptatonal complext of ths step scales as O(mn 3 ) where m s the nmber of pxels and n s the neghborhood pxels (n = 8 n all or reslts) For the embeddng problem of (4) snce the cost fncton s qadratc and the constrants are lnear ths optmzaton problem elds a large sparse sstem of lnear eqatons whch ma be solved sng a nmber of standard methods. The embeddng step of LLE solve a smlar optmzaton problem bt nder dfferent constrants. Wthot specal optmzaton the complext of ths step scales as O(m 3 ) where m s the nmber of pxels. To speed p the comptaton there are several alternatve methods for solvng the embeddng problem sch as mltgrd solver [24 27] whch wll lead to a complext scales as O(m). For hgh dnamc range compresson lke all other methods n the lteratre we onl work on the lmnance channel and color of the mage s ntoched. After compressng the lmnance color s pt back to the mage n a wa smlar to those n [15]. For ordnar mage enhancement we also onl process the achromatc channel. 5. Reslts Hgh dnamc range mage compresson. We have appled or technqe to compress hgh dnamc range radance maps for dspla n low dnamc range devce. Fgre 3 shows the segmented regons the locatons of the constrant pxels the gan map mage the log mage and gan map modfed mage of the Memoral Chrch HDR radance map. Fgre 4 shows a comparson of or reslt wth those of three other recent hgh dnamc range compresson technqes for the Memoral Chrch mage. Fgre 3. Segmented regons and constrants. The thck black crves shows the regon bondares fond b the segmentaton algorthm where constrants shold not be placed across. Constrants postons are shown n dfferent colors wthn the regons. The gan map mage compted b LNE. The achromatc channel of the log mage n whch local detals s lost de to scalng. Reslt mage = +. Radance map cortes of Pal Debevec. Fgre 5 shows the segmented coarse regons and the locatons of the constrants sed for constrctng the gan map the gan map mage or reslt and the reslt of the gradent doman method [15] for the Belgm Hose mage. Fgre 6 shows more examples of or reslt as compared wth other methods n the lteratre. These reslts demonstrate that or technqe works effectve n compressng hgh dnamc range mage for dspla. t s seen that n all or reslts local detals are 6

7 well preserved and n some case slghtl enhanced. Compared or method wth those state of the art shows that or method works eqall well. Vsall there are some dfferences amongst the reslts of dfferent technqes sch as the overall brghtness contrast and color of the mages however as has been ver well stated n [21] these dfferences shold not be over-nterpreted snce the ma change dependng on the detal mplementaton. enhanced more when the mage s scaled down to ft the reprodcton devce the end effect s that local small detals are relatvel enhanced whle large changes between regons are relatvel compressed. Fgre 7 shows a scanlne form the Belgm Hose mage n Fgre 5 whch perfectl llstrates the behavor of or technqe. Fgre 4. Or reslt. Reslt of gradent doman technqe [15]. Reslt of sbband technqe [21] Reslts of blateral flterng method [17]. Radance map cortes Pal Debevec. A ver mportant propert of or technqe s that t s completel free from halo artfacts snce t wll not reverse the edges. n fact the wa n whch or technqe works can be nderstood n ths wa: t enhances the contrasts everwhere n the mage bt enhances small contrasts more and large contrast less. Therefore the drectons of ntenst changes wll be protected whle the magntde of changes are ether boosted or attenated. Becase strong changes are enhanced relatvel less and weak changes are Fgre 5 Coarsel segmented regons and the constrants sed for constrctng the gan map. The gan map mage or reslt Reslt of gradent doman technqe. Radance map cortes of Raanan Fattal Dan Lschnsk and Mchael Werman. mage enhancement. Or technqe can be eqall appled to the enhancement of ordnar mages. Fgre 8 shows an example of applng or technqe to the 7

8 enhancement of an ordnar mage. As a comparson reslt of the gradent doman technqe s also shown. We see that or technqe works well. The two reslts are slghtl dfferent agan the dfferences shold not be over-nterpreted becase the ma change dependng on the detals of mplementaton. sng weghts compted sng LNE clearl follows the orgnal sgnal and preserves and enhances local detals those sng weghts from sqared dfference and normalzed correlaton clearl loss track of the sgnal and smear local detals. ' = + G G Fgre 7 A scanlne from the Belgm Hose mage all three sgnals are scaled to 0 ~ 255. t s seen that the gan map mage (bottom lne) strctl follows the changes of the orgnal mage (mddle lne). The reslt mage (top lne) and the orgnal mage (mddle lne) have exactl the same edge drectons. t s also seen that (top lne) has more local detals than (mddle lne) (e) (f) (g) (h) Fgre 6 more examples. Or reslts (e) and (g). Reslts of gradent doman technqe [15] and blateral flterng technqe [17] (f) and (h). Radance map cortes of Raanan Fattal Dan Lschnsk and Mchael Werman and Pal Debevec. t s nterestng to note that the colorzaton sng optmzaton work of [26] solves a smlar optmzaton as eq. (4). However the se the W s drectl compted sng the sqared dfference or normalzed correlaton of neghborng pxels rather than compted sng eq. (3). These drectl compted weghts are not stable for comptng the gan map mage becase the fal to captre the local changes of the mage. Fgre 9 shows a scanlne and ts processed reslts b sng gan maps constrcted weghts from eq. (3) and those from sqared dfference and normalzed correlaton. t s seen that whle the reslt Fgre 8 Orgnal mage The gan map mage Or reslt Reslt of gradent doman technqe [15]. mage data and gradent doman reslt cortes of Raanan Fattal Dan Lschnsk and Mchael Werman. 6. Concldng remarks n ths paper we have presented a novel technqe for comptng a contrast gan control mage for a gven mage. We ntrodce the dea of thnk locall ft globall to constrct the gan map mage to acheve local detal enhancement/preservaton and global vsal ntegrt protecton smltaneosl. We have developed technqes to compte the gan map mage n closed form b solvng 8

9 constraned optmzaton problems. We have demonstrated that mage gan map constrcted b or method can be sed to compress hgh dnamc range mages and enhance ordnar mages wthot ntrodcng vsal artfacts. LNE Sqared Dfference Normalzed Correlaton Fgre 9 An orgnal mage scanlne () and the processed reslts sng gan maps constrcted from weghts compted n dfferent was. t clearl shows that sng sqared dfference or normalzed correlaton between neghborhood pxels to compte the local pxel relatons are nstable for comptng the gan map. References [1] T. Stockham mage processng n the context of a vsal model Proceedngs of the EEE vol. 60 pp [2] B. K. P. Horn Determnng lghtness from an mage Compter Graphcs and mage Processng vol. 3 pp [3] K. Ch et al "Spatall nonnform scalng fnctons for hgh contrast mages" n Proceedngs of Graphcs nterface'93 pp [4] J. Tmbln and H. E. Rshmeer "Tone reprodcton for realstc mages" EEE Compter Graphcs and Applcatons vol. 13 pp [5] C. Schlck "Qantzaton technqes for the vsalzaton of hgh dnamc range pctres" n Proceedngs of 5th Erographcs Workshop on Renderng Jne 1994 [6] Greg Ward. A contrast-based scale factor for lmnance dspla. n Graphcs Gems V pages Academc Press 1994 [7] J. A. Ferwerda S. N. Pattanak P. Shrle and D. P. Greenberg. " A model of vsal adaptaton for realstc mage snthess". Proceedngs of SGGRAPH 96 pp [8] G. Ward H. Rshmeer and C. Patko "A vsblt matchng tone reprodcton operator for hgh dnamc range scenes" EEE Trans on Vsalzaton and Compter Graphcs vol. 3 pp [9] P. E. Debevec and J. Malk "Recoverng hgh dnamc range radance maps from photographs" n Proceedngs of SGGRAPH'97 pp [10] D. J. Jobson Z. Rahman and G. A. Woodell A Mltscale Retnex for Brdgng the Gap between Color mages and the Hman Observaton of Scenes EEE Transactons on mage Processng Vol. 6 pp [11] S. N. Pattanak James A. Ferwerda Mark D. Farchld and Donald P. Greenberg "A Mltscale Model of Adaptaton and Spatal Vson for Realstc mage Dspla" Proceedngs of SGGRAPH'98 pp Orlando Jl 1998 [12] J. Tmbln J. K. Hodgns and B. K Genter "Two methods for dspla of hgh contrast mages" ACM Trans on Graphcs vol. 18 pp [13] T. Mtsnaga and S. K. Naar Hgh dnamc range magng: Spatall varng pxel exposres Proc. CVPR 2000 vol. 1 pp [14] J. DCarlo and B. Wandell Renderng hgh dnamc range mages Proc. SPE vol.3965 pp [15] R. Fattal D. Lschnsk and M. Werman "Gradent doman hgh dnamc range compresson" n Proceedngs of SGGRAPH 2002 pages [16] E. Renhard M. Stark. P. Shrle and J. Ferwerda "Photographc tone reprodcton for dgtal mages" n Proceedngs of SGGRAPH 2002 pages [17] F. Drand and J. Dorse "Fast blateral flterng for the dspla of hgh dnamc range mage" n Proceedngs of SGGRAPH 2002 pages [18] Mchael Ashkhmn. A tone mappng algorthm for hgh contrast mages n Renderng Technqes 02 (Proceedngs of the 13th Erographcs Workshop on Renderng) pages Jne [19] H. Seetzen W. Hedrch W. Sterzlnger G. Ward L. Whtehead M. Trentacoste A. Ghosh A. Vorozcovs Hgh dnamc range dspla sstems ACM Transactons on Graphcs (Sggraph 2004) 23(3): [20] G. Ward and M. Smmons Sbband encodng of hgh dnamc range mager Proceedngs of the 1st Smposm on Appled percepton n graphcs and vsalzaton Pages: [21] Y. L L. Sharan E. H. Adelson Compressng and compandng hgh dnamc range mages wth sbband archtectres ACM Transactons on Graphcs (TOG) 24(3) Proceedngs of SGGRAPH 2005 [22] L. K. Sal and S. T. Rowes Thnk Globall Ft Locall: Unspervsed Learnng of Low Dmensonal Manfolds The Jornal of Machne Learnng Research [23] D. Comanc P. Meer: Mean Shft: A Robst Approach toward Featre Space Analss EEE Trans. Pattern Analss Machne ntell. Vol. 24 No [24] W. H. Press S. A. Tekolsk et al. "Nmercal Recpes n C++ -- The Art of Scentfc Comptng" Cambrdge MA Cambrdge Unverst Press 2002 [25] D. J. Heeger Half-sqarng n responses of cat strate cells Vsal Neroscence 9: [26] A. Levn D. Lschnsk and Y. Wess Colorzaton sng optmzaton SGGRAPH 2004 [27] W. Hackbsch Mlt-grd Methods and Applcatons Sprnger Berln

Numerical Solution of Deformation Equations. in Homotopy Analysis Method

Numerical Solution of Deformation Equations. in Homotopy Analysis Method Appled Mathematcal Scences, Vol. 6, 2012, no. 8, 357 367 Nmercal Solton of Deformaton Eqatons n Homotopy Analyss Method J. Izadan and M. MohammadzadeAttar Department of Mathematcs, Faclty of Scences, Mashhad

More information

OBJECT TRACKING BY ADAPTIVE MEAN SHIFT WITH KERNEL BASED CENTROID METHOD

OBJECT TRACKING BY ADAPTIVE MEAN SHIFT WITH KERNEL BASED CENTROID METHOD ISSN : 0973-739 Vol. 3, No., Janary-Jne 202, pp. 39-42 OBJECT TRACKING BY ADAPTIVE MEAN SHIFT WITH KERNEL BASED CENTROID METHOD Rahl Mshra, Mahesh K. Chohan 2, and Dhraj Ntnawwre 3,2,3 Department of Electroncs,

More information

Modeling Local Uncertainty accounting for Uncertainty in the Data

Modeling Local Uncertainty accounting for Uncertainty in the Data Modelng Local Uncertanty accontng for Uncertanty n the Data Olena Babak and Clayton V Detsch Consder the problem of estmaton at an nsampled locaton sng srrondng samples The standard approach to ths problem

More information

Hybrid Method of Biomedical Image Segmentation

Hybrid Method of Biomedical Image Segmentation Hybrd Method of Bomedcal Image Segmentaton Mng Hng Hng Department of Electrcal Engneerng and Compter Scence, Case Western Reserve Unversty, Cleveland, OH, Emal: mxh8@case.ed Abstract In ths paper we present

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE 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 information

A Binarization Algorithm specialized on Document Images and Photos

A 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 information

A General Algorithm for Computing Distance Transforms in Linear Time

A General Algorithm for Computing Distance Transforms in Linear Time Ths chapter has been pblshed as: A. Mejster, J. B. T. M. Roerdnk and W. H. Hesselnk, A general algorthm for comptng dstance transforms n lnear tme. In: Mathematcal Morphology and ts Applcatons to Image

More information

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification

12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero

More information

TN348: Openlab Module - Colocalization

TN348: 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 information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace 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 information

Performance Modeling of Web-based Software Systems with Subspace Identification

Performance Modeling of Web-based Software Systems with Subspace Identification Acta Poltechnca Hngarca Vol. 13, No. 7, 2016 Performance Modelng of Web-based Software Sstems wth Sbspace Identfcaton Ágnes Bogárd-Mészöl, András Rövd, Shohe Yokoama Department of Atomaton and Appled Informatcs,

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A 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 information

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and

More information

Edge Detection in Noisy Images Using the Support Vector Machines

Edge 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 information

Robust Visual Tracking via Fuzzy Kernel Representation

Robust Visual Tracking via Fuzzy Kernel Representation Research Jornal of Appled Scences, Engneerng and Technolog 5(): 3-38, 3 ISSN: 4-7459; e-issn: 4-7467 Maxwell Scentfc Organzaton, 3 Sbmtted: October 7, Accepted: December, Pblshed: Aprl 5, 3 Robst Vsal

More information

Feature Reduction and Selection

Feature 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 information

GSLM Operations Research II Fall 13/14

GSLM 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 information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement 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 information

Support Vector Machines

Support 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 information

LECTURE : MANIFOLD LEARNING

LECTURE : 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 information

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

Face 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 information

Hybrid Non-Blind Color Image Watermarking

Hybrid Non-Blind Color Image Watermarking Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

High-Boost Mesh Filtering for 3-D Shape Enhancement Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,

More information

Person Identity Clustering in TV Show Videos

Person Identity Clustering in TV Show Videos Person Identty Clsterng n TV Show Vdeos Yna Han*, Gzhong L* *School of Electrcal and Informaton Engneerng, X an Jaotong Unversty, X an, P.R.Chna Emal:yan@malst.xjt.ed.cn, lgz@mal.xjt.ed.cn Keywords: Identty

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A 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 information

Multi-stable Perception. Necker Cube

Multi-stable Perception. Necker Cube Mult-stable Percepton Necker Cube Spnnng dancer lluson, Nobuuk Kaahara Fttng and Algnment Computer Vson Szelsk 6.1 James Has Acknowledgment: Man sldes from Derek Hoem, Lana Lazebnk, and Grauman&Lebe 2008

More information

Support Vector Machines. CS534 - Machine Learning

Support Vector Machines. CS534 - Machine Learning Support Vector Machnes CS534 - Machne Learnng Perceptron Revsted: Lnear Separators Bnar classfcaton can be veed as the task of separatng classes n feature space: b > 0 b 0 b < 0 f() sgn( b) Lnear Separators

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

Structure from Motion

Structure 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 information

An Improved Isogeometric Analysis Using the Lagrange Multiplier Method

An Improved Isogeometric Analysis Using the Lagrange Multiplier Method An Improved Isogeometrc Analyss Usng the Lagrange Mltpler Method N. Valzadeh 1, S. Sh. Ghorash 2, S. Mohammad 3, S. Shojaee 1, H. Ghasemzadeh 2 1 Department of Cvl Engneerng, Unversty of Kerman, Kerman,

More information

Array transposition in CUDA shared memory

Array transposition in CUDA shared memory Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content 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 information

Obstacle Avoidance by Using Modified Hopfield Neural Network

Obstacle Avoidance by Using Modified Hopfield Neural Network bstacle Avodance by Usng Modfed Hopfeld Neral Network Panrasee Rtthpravat Center of peraton for Feld Robotcs Development (FIB), Kng Mongkt s Unversty of Technology Thonbr. 91 Sksawas road Tongkr Bangkok

More information

Discriminative Dictionary Learning with Pairwise Constraints

Discriminative Dictionary Learning with Pairwise Constraints Dscrmnatve Dctonary Learnng wth Parwse Constrants Humn Guo Zhuoln Jang LARRY S. DAVIS UNIVERSITY OF MARYLAND Nov. 6 th, Outlne Introducton/motvaton Dctonary Learnng Dscrmnatve Dctonary Learnng wth Parwse

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

Scheduling with Integer Time Budgeting for Low-Power Optimization

Scheduling with Integer Time Budgeting for Low-Power Optimization Schedlng wth Integer Tme Bdgetng for Low-Power Optmzaton We Jang, Zhr Zhang, Modrag Potkonjak and Jason Cong Compter Scence Department Unversty of Calforna, Los Angeles Spported by NSF, SRC. Otlne Introdcton

More information

The Codesign Challenge

The 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 information

2D Raster Graphics. Integer grid Sequential (left-right, top-down) scan. Computer Graphics

2D Raster Graphics. Integer grid Sequential (left-right, top-down) scan. Computer Graphics 2D Graphcs 2D Raster Graphcs Integer grd Sequental (left-rght, top-down scan j Lne drawng A ver mportant operaton used frequentl, block dagrams, bar charts, engneerng drawng, archtecture plans, etc. curves

More information

Using Geometric Primitives to Calibrate Traffic Scenes

Using Geometric Primitives to Calibrate Traffic Scenes Usng Geometrc Prmtves to Calbrate Traffc Scenes Osama Masod Department of Compter Scence and Engneerng Unverst of Mnnesota Mnneapols, MN masod@cs.mn.ed Nkolaos P. Papankolopolos Department of Compter Scence

More information

Wishing you all a Total Quality New Year!

Wishing 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 information

Outline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1

Outline. 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 information

COMPARISON OF IMAGE ENHANCEMENT TECHNIQUES USING RETINEX MODELS

COMPARISON OF IMAGE ENHANCEMENT TECHNIQUES USING RETINEX MODELS COMPARISON OF IMAGE ENHANCEMENT TECHNIQUES USING RETINEX MODELS 1 Anktha A Reddy, Poorvaja R Jos, 3 J Deekshtha, 4 Namratha S, 5 Rajeshwar Hegde 1345 Department of Telecommuncaton Engneerng, BMS College

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism 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 information

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION

A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION 1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute

More information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL 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 information

Simplification of 3D Meshes

Simplification of 3D Meshes Smplfcaton of 3D Meshes Addy Ngan /4/00 Outlne Motvaton Taxonomy of smplfcaton methods Hoppe et al, Mesh optmzaton Hoppe, Progressve meshes Smplfcaton of 3D Meshes 1 Motvaton Hgh detaled meshes becomng

More information

Lecture #15 Lecture Notes

Lecture #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 information

Optimizing Document Scoring for Query Retrieval

Optimizing Document Scoring for Query Retrieval Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng

More information

Problem Set 3 Solutions

Problem 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 information

S1 Note. Basis functions.

S1 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 information

CS 534: Computer Vision Model Fitting

CS 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 information

Symmetry Integrated Region-based Image Segmentation

Symmetry Integrated Region-based Image Segmentation Smmetr Integrated Regon-based Image Segmentaton Yu Sun, Br Bhanu Center for Research n Intellgent Sstems, Unverst of Calforna at Rversde, Rversde, CA, 95 sun@ee.ucr.edu, bhanu@crs.ucr.edu Abstract Smmetr

More information

College of Information & Computer, Anhui Agricultural University, Hefei, Anhui, , China

College of Information & Computer, Anhui Agricultural University, Hefei, Anhui, , China 4th Internatonal Conference on Mechatroncs Materals Chemstry and Computer Engneerng (ICMMCCE 15) Improved retnex mage enhancement algorthm based on blateral flterng Ya nan Yang 1 a Zhaohu Jang 1 b * Chunhe

More information

An Optimal Algorithm for Prufer Codes *

An 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 information

A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC -Trees Abstract 1. Introduction

A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC -Trees Abstract 1. Introduction A Lnear Tme Algorthm for Fndng a Mamal Planar Sbgraph Based on PC-Trees Wen-Lan Hs Insttte of Informaton Scence, Academa Snca, Tape, Tawan, ROC hs@s.snca.ed.tw Abstract In Shh & Hs, a planart test was

More information

IMAGE MATCHING WITH SIFT FEATURES A PROBABILISTIC APPROACH

IMAGE MATCHING WITH SIFT FEATURES A PROBABILISTIC APPROACH IMAGE MATCHING WITH SIFT FEATURES A PROBABILISTIC APPROACH Jyot Joglekar a, *, Shrsh S. Gedam b a CSRE, IIT Bombay, Doctoral Student, Mumba, Inda jyotj@tb.ac.n b Centre of Studes n Resources Engneerng,

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM 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 information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum 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 information

Recognizing Faces. Outline

Recognizing 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 information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

Implementation of a Dynamic Image-Based Rendering System

Implementation of a Dynamic Image-Based Rendering System Implementaton of a Dynamc Image-Based Renderng System Nklas Bakos, Claes Järvman and Mark Ollla 3 Norrköpng Vsualzaton and Interacton Studo Lnköpng Unversty Abstract Work n dynamc mage based renderng has

More information

GSA Training Notes Raft and Piled-raft Analysis

GSA Training Notes Raft and Piled-raft Analysis GSA Tranng Notes Rat and Pled-rat Analyss 1 Introdcton Rat analyss n GSA provdes a means o lnkng GSA statc analyss and sol settlement analyss, so the sol-strctre nteractons can be consdered n the analyss.

More information

Research and Application of Fingerprint Recognition Based on MATLAB

Research and Application of Fingerprint Recognition Based on MATLAB Send Orders for Reprnts to reprnts@benthamscence.ae The Open Automaton and Control Systems Journal, 205, 7, 07-07 Open Access Research and Applcaton of Fngerprnt Recognton Based on MATLAB Nng Lu* Department

More information

Fuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches

Fuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of

More information

ELEC 377 Operating Systems. Week 6 Class 3

ELEC 377 Operating Systems. Week 6 Class 3 ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems

More information

Monte Carlo Rendering

Monte Carlo Rendering Monte Carlo Renderng Last Tme? Modern Graphcs Hardware Cg Programmng Language Gouraud Shadng vs. Phong Normal Interpolaton Bump, Dsplacement, & Envronment Mappng Cg Examples G P R T F P D Today Does Ray

More information

SUPPLEMENTARY INFORMATION

SUPPLEMENTARY INFORMATION The crrent I NS as a fncton of the bas oltage V throgh a N/S pont contact nterface can be descrbed by the BTK theory [3] n whch the nterfacal barrer s represented by a fncton wth a dmensonless strength

More information

LEAST SQUARES. RANSAC. HOUGH TRANSFORM.

LEAST SQUARES. RANSAC. HOUGH TRANSFORM. LEAS SQUARES. RANSAC. HOUGH RANSFORM. he sldes are from several sources through James Has (Brown); Srnvasa Narasmhan (CMU); Slvo Savarese (U. of Mchgan); Bll Freeman and Antono orralba (MI), ncludng ther

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For 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 information

Lecture 5: Multilayer Perceptrons

Lecture 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 information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite 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 information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An 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 information

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15 CS434a/541a: Pattern Recognton Prof. Olga Veksler Lecture 15 Today New Topc: Unsupervsed Learnng Supervsed vs. unsupervsed learnng Unsupervsed learnng Net Tme: parametrc unsupervsed learnng Today: nonparametrc

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 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 information

THE PULL-PUSH ALGORITHM REVISITED

THE PULL-PUSH ALGORITHM REVISITED THE PULL-PUSH ALGORITHM REVISITED Improvements, Computaton of Pont Denstes, and GPU Implementaton Martn Kraus Computer Graphcs & Vsualzaton Group, Technsche Unverstät München, Boltzmannstraße 3, 85748

More information

Optimal Parameter Tuning Based Multi-Scale Image Enhancement

Optimal Parameter Tuning Based Multi-Scale Image Enhancement RESEARCH ARTICLE OPEN ACCESS Optmal Parameter Tunng Based Mult-Scale Image Enhancement S.Sona,A.J. Adln Deepka Sona S studng M.Tech n Vns Chrstan College of Engneerng,ssona4@gmal.com A.J.AdlnDeepka A.J.M.E,

More information

COMPLEX WAVELET TRANSFORM-BASED COLOR INDEXING FOR CONTENT-BASED IMAGE RETRIEVAL

COMPLEX WAVELET TRANSFORM-BASED COLOR INDEXING FOR CONTENT-BASED IMAGE RETRIEVAL COMPLEX WAVELET TRANSFORM-BASED COLOR INDEXING FOR CONTENT-BASED IMAGE RETRIEVAL Nader Safavan and Shohreh Kasae Department of Computer Engneerng Sharf Unversty of Technology Tehran, Iran skasae@sharf.edu

More information

5 The Primal-Dual Method

5 The Primal-Dual Method 5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton

More information

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) , VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

More information

WATERSHED SEGMENTATION WITH BOUNDARY CURVATURE RATIO BASED MERGING CRITERION

WATERSHED SEGMENTATION WITH BOUNDARY CURVATURE RATIO BASED MERGING CRITERION WATERSHED SEGENTATION WITH BOUNDARY CURVATURE RATIO BASED ERGING CRITERION Xaochen He, Nelson H. C. Yng 2, K.P. Chow, Francs Y.L. Chn, Ronald H. Y. Chng 3, K. Y. K. Wong, Kenneth S.H. Tsang 3 The Department

More information

Constrained Robust Model Predictive Control Based on Polyhedral Invariant Sets by Off-line Optimization

Constrained Robust Model Predictive Control Based on Polyhedral Invariant Sets by Off-line Optimization A pblcaton of 47 CHEMICA ENGINEERING TRANSACTIONS VO 3, 3 Cef Edtors: Saro Percc, Jří J Klemeš Copyrgt 3, AIDIC Servz Srl, ISBN 978-88-9568-3-5; ISSN 974-979 Te Italan Assocaton of Cemcal Engneerng Onlne

More information

A Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines

A Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines A Modfed Medan Flter for the Removal of Impulse Nose Based on the Support Vector Machnes H. GOMEZ-MORENO, S. MALDONADO-BASCON, F. LOPEZ-FERRERAS, M. UTRILLA- MANSO AND P. GIL-JIMENEZ Departamento de Teoría

More information

RETINEX IMAGE PROCESSING: IMPROVING THE VISUAL REALISM OF COLOR IMAGES

RETINEX IMAGE PROCESSING: IMPROVING THE VISUAL REALISM OF COLOR IMAGES Internatonal Journal of Informaton Technolog and Knowledge Management Jul-December 2011, Volume 4, o. 2, pp. 371-377 RETIEX IMAGE PROCESSIG: IMPROVIG THE VISUAL REALISM OF COLOR IMAGES Mrs. Anjal Chandra

More information

A Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures

A Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures A Novel Adaptve Descrptor Algorthm for Ternary Pattern Textures Fahuan Hu 1,2, Guopng Lu 1 *, Zengwen Dong 1 1.School of Mechancal & Electrcal Engneerng, Nanchang Unversty, Nanchang, 330031, Chna; 2. School

More information

Histogram of Template for Pedestrian Detection

Histogram of Template for Pedestrian Detection PAPER IEICE TRANS. FUNDAMENTALS/COMMUN./ELECTRON./INF. & SYST., VOL. E85-A/B/C/D, No. xx JANUARY 20xx Hstogram of Template for Pedestran Detecton Shaopeng Tang, Non Member, Satosh Goto Fellow Summary In

More information

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity

Corner-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 information

An Improved Stereo Matching Algorithm Based on Guided Image Filter

An Improved Stereo Matching Algorithm Based on Guided Image Filter nd Internatonal Conference on Modellng, Identfcaton and Control (MIC 015 An Improved Stereo Matchng Algorthm Based on Guded Image Flter Rudong Gao, Yun Chen, Lna Yan School of nstrumentaton Scence and

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

Classifier Selection Based on Data Complexity Measures *

Classifier 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 information

Lecture 13: High-dimensional Images

Lecture 13: High-dimensional Images Lec : Hgh-dmensonal Images Grayscale Images Lecture : Hgh-dmensonal Images Math 90 Prof. Todd Wttman The Ctadel A grayscale mage s an nteger-valued D matrx. An 8-bt mage takes on values between 0 and 55.

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki 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 information

MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN

MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS by XUNYU PAN (Under the Drecton of Suchendra M. Bhandarkar) ABSTRACT In modern tmes, more and more

More information

Complex 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. 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 information

SAO: A Stream Index for Answering Linear Optimization Queries

SAO: A Stream Index for Answering Linear Optimization Queries SAO: A Stream Index for Answerng near Optmzaton Queres Gang uo Kun-ung Wu Phlp S. Yu IBM T.J. Watson Research Center {luog, klwu, psyu}@us.bm.com Abstract near optmzaton queres retreve the top-k tuples

More information

Reading. 14. Subdivision curves. Recommended:

Reading. 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 information

Comparison Study of Textural Descriptors for Training Neural Network Classifiers

Comparison Study of Textural Descriptors for Training Neural Network Classifiers Comparson Study of Textural Descrptors for Tranng Neural Network Classfers G.D. MAGOULAS (1) S.A. KARKANIS (1) D.A. KARRAS () and M.N. VRAHATIS (3) (1) Department of Informatcs Unversty of Athens GR-157.84

More information

Coding Artifact Reduction Using Edge Map Guided Adaptive and Fuzzy Filter

Coding Artifact Reduction Using Edge Map Guided Adaptive and Fuzzy Filter MEL A MITSUBISHI ELECTIC ESEACH LABOATOY http://www.merl.com Codng Artfact educton Usng Edge Map Guded Adaptve and Fuzzy Flter Hao-Song Kong Yao Ne Anthony Vetro Hufang Sun Kenneth E. Barner T-2004-056

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range 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 information