Advances. Photometric Stereo

Size: px
Start display at page:

Download "Advances. Photometric Stereo"

Transcription

1 Advances n Photometrc tereo uggero Pntus Tutor Prof. assmo Vanz

2 Contents ) ntroducton g.3 ) mage formaton and reflectance ma g.5 3) Changng from two to four lghts g. 4) Basc theory gradent extracton g. 5) ays correcton g.3 6) Gradent ntegraton g.4 7) Alcatons g.55 8) Aendx A g.7 9) eferences g.77

3 . ntroducton Photometrc tereo s a fundamental art of the entre rocess concernng comuter vson []. Ths ssue s very mortant n ndustral alcatons artfcal ntellgence researches and so on. t s based on an mage rocessng rocedure that analyses the scene and tres to recover ts three-dmensonal surface. There are a lot of technues to 3D ma a sngle obect or an entre scene and each of them has dfferent features regardng the aroach to the roblem. The most used s laser scannng technues snce t s able to 3D ma searately and most of all ndeendently each sngle ont of a samle. nstead almost all other methods need to analyse a xel cluster or even all xels n N mages to recover surface heghts. bvously ths reresents a drawbac snce the heght value of one ont (whose data s suosed noseless) wll be based by the nose n the adacent xels. For ths reason all of these methods are carefully used and n most cases are merged wth other more accurate methods []. However deendng on the nature of samles and mage acuston systems sometmes we are forced to mae use of only one technue. For nstance n secton 7 we show the 3D ma of obect observed wth scannng electron mcroscoe (E); we beleve that t s really dffcult to use a laser scannng nsde the E don t you? n ths sense we have focused our efforts n solvng some trouble concernng both the management of nondealtes (wth resect to the mathematcal model) and the numercal algorthm to enhance ts erformances n terms of accuracy and comutatonal tme. Before showng our wor we want to lst some reference about revous wors n Photometrc tereo and generally n hae from X (e.g. shae from shadng) algorthms. Photometrc tereo was conceved by Woodham [3] that taes the theory of shae from shadng whch reconstructs the heghts usng only one mage and extends t to a number N mages. Ths technue uses a reflectance ma as a mathematcal model or a loou table whch decreases the comutatonal tme n some smle alcatons. The loou tables are bult wth a calbraton shere of nown shae and materal behavour. Deendng on used algorthm the shere should be of the same materal of obects to be 3D maed. n the other hand the algorthms that reconstruct also albedo arameters don t need ths constrant. Note that f there s no need to fnd albedo t s better to acure only gray-scale mages to mnmze used memory whle colour mages are obvously necessary f we need chromatc nformaton. Generally the vast maorty of methods use gray-scale mages. For Lambertan surface as we ll see n next sectons hotometrc euatons are lnear and only three mages are enough to reconstruct both gradent and albedo. Wth more than three mages some aers use the surlus nformaton to fnd other obect art as outlers [4] or to recover unnown llumnaton drectons and strengths [5]. Whle some methods start from a gven reflectance ma and then fnd the heghts other technues focus ther attenton to estmate reflectance arameters. 3

4 ome nstances are Nayar [6] who uses the so-called hybrd reflectance model and Tagare and de Fgueredo [7] who develoed a hotometrc stereo for the class of m-lobe reflectance mas (they called t so). As we ll also see n ths wor many aers deal wth the ossblty to consder a surface as Lambertan even f t has non-dealtes as shadows or hghlghts. The trc s to consder a mathematcal model that defne hghlghts and shadows as devatons from Lambertan law; n ths way the algorthm can manage them and reconstruct surfaces roerly. ne of these technues was roosed by Coleman and Jan [8]. n the other hand colour mages contan a lot of redundant nformaton regards the gradent extracton. f one could have ths data he should use ths nformaton whether to mae the algorthm more robust or to comute more than heghts. Chrstensen and haro [9] ntroduced the method of colour hotometrc stereo (CP) for surfaces wth an arbtrary reflectance ma. A drawbac of ths technue s that t needs a calbraton ste whle (other aers already do that) we ll demonstrate n the followng sectons that t s not necessary. ther aers (as []) searate the Lambertan sgnal to the others wth an mage rocessng tool whch ermts to avod any non-dealty bas. Before startng to face our ssue we lst here the sectons of ths wor. ecton descrbes the bascs n hotometrc stereo hyscal model and fnds the most used reflectance ma euaton for Lambertan surfaces. ecton shows the frst stes we had done studyng P and esecally the changng from usng two to four lght sources and lays the bases of next sectons. Then ecton 3 llustrates the theory of gradent and albedo extracton. ecton 4 deals wth an algorthm we have develoed to avod llumnaton bases. n ecton 5 we exlan our gradent ntegraton algorthm and comare t wth exstng ones. We also study ts erformances n terms of comutatonal tme and robustness. ecton 6 s made by all alcatons we are contended wth and we ll show there our algorthm otental. The last two sectons are the Aendx A n whch we demonstrate the mathematcal detals n choosng the best lghtng condtons used to lght the analytcal P samle (the vase) and references. 4

5 . mage formaton and reflectance ma n ths secton we deal wth the mage formaton rocess and we fnd a mathematcal model that relates obect and lght geometry wth xels ntensty. Frst we ntroduce some notons as radometry rradance radance mage brghtness and bdrectonal reflectance dstrbuton functon. The latter s the most mortant functon that together wth nown lght sources oston leads to reflectance ma formulaton. Followng theory sums u the bascs of hotometrc stereo as dscussed n []. To understand how the xels ntensty n acured mages s determned we should study some radometry concets. Frst the rradance s the amount of lght fallng on a surface and t s the ower er unt area ncdent on t ( W m ). The radance nstead s the amount of lght radated from a surface and t s measured as the ower radated from the surface er unt area er unt sold angle ( W m ). emember that the sold angle s defned as: sr Acosϑ Ω (.) where A s surface area ϑ s the angle between surface normal and a lne connectng the atch to the orgn and s the length of ths lne. tartng from these defntons we now dscuss the mage formaton rocess. Let s consder Fg.. where there are one obect a lens and an mage lane. Fg.. mage formaton system 5

6 As easy to see f the rays assng through the lens are not deflected the sold angle concernng the obect s eual to the sold angle regardng the mage lane. These sold angles are: δ cos f cos δ cosϑ ( z ) cos (.) and f they are eual t holds δ δ cos cosϑ f z (.3) Now we should nvestgate how much of the lght emtted from the surface atch go through the lens. The sold angle subtended by the lens as seen from surface atch s π d cos π d 3 Ω cos 4 ( z ) 4 z cos (.4) where d s dameter lens. The ower of the lght emtted from the surface atch and fallng on mage lane s π d 3 δp LΩδ cosϑ Lδ cos cosϑ (.5) 4 z where L s the radance of the surface n the drecton toward lens. The rradance of the mage lane atch wll be δp δ π d 3 E L cos cosϑ (.6) δ δ 4 z 6

7 Usng (.3) we fnd ths relatonsh π d 4 E L cos (.7) 4 f Thus mage rradance s roortonal to scene radance L and to the angle alha between the ray connectng the center of the lens and the atch and the otcal axs. Ths s the frst mortant result n the rocedure that leads to reflectance ma. We saw how mage rradance deends on scene radance but what does radance deend on? t deends on the lght that falls on the obect and the fracton of ths lght that s reflected due to many reasons as obect geometry or obect reflecton roertes. The euaton that descrbe what we have ust sad s called bdrectonal reflectance dstrbuton functon (BDF) f ( ϑ ϕ ; ϑ ϕ ) ( ϑe ϕe ) ( ϑ ϕ ) δl e e (.8) δe where ( ϑ e ϕ e ) and ( ϕ ) ϑ are the vewng and lghtng drecton (Fg..). Fg.. BDF geometry 7

8 ne mortant roerty of ths functon conssts n Helmholtz recrocty condton f ( ϑ ϕ ; ϑ ϕ ) f ( ϑ ϕ ; ϑ ϕ ) (.9) e e e e Generally we don t have a sngle secfc drecton whch the lght comes from but we have a sy wth dfferent radance that deends on the sy regon. Consder such a sy as a hemshere and a art of t of sze ( δϑ δϕ ). uosed that a atch s n the hemshere center and then t subtends a sold angle (.) δω snϑ δϑ δϕ The rradance receved from ths art of the sy wll be E ( ϑ ϕ ) sn ϑδϑ δϕ (.) o the total rradance s π π π ( ϑ ϕ ) E E sn ϑ cosϑδϑδϕ (.) where cos accounts for the foreshortenng of surface seen from the drecton ( ) ϑ o the radance of the surface wll be ϑ. ϕ π π e e e e sn ϑ cos π ( ϑ ϕ ) f ( ϑ ϕ ; ϑ ϕ ) E( ϑ ϕ ) L ϑ δϑ δϕ (.3) The same aroach has to be consdered f we want to comute the radance of a Lambertan surface. n an deal Lambertan surface one atch aears eually brght from all vewng drectons and doesn t absorb any radaton ower. o the BDF functon must be constant. To fnd that value we have to use the revous ntegrals settng that the total rradance s eual to radance ntegral over all drectons so 8

9 π π π f ( ϑ ϕ ; ϑe ϕe ) E cosϑ sn ϑe cosϑeδϑeδϕ e E cos ϑ (.4) whch becomes π πf sn ϑ cosϑ δϑ (.5) e e e Ths leads to π f (.6) o L E E cosϑ π π (.7) We have found the relaton that correlates the drecton and ntensty of llumnaton wth the surface radance whch the xels brghtness deends on. Now we have only to wrte ths relaton n terms of surface dervatves along x and y. We can easly demonstrate that a normal vector could be wrtten as r n ( ) T (.8) n the same way and for usng smlar notaton we could defne the llumnaton vector as 9

10 r l ( ) T (.9) Now usng these euatons cosϑ (.) nce ths euaton s the unue term that really nfluence the xels brghtness whle the other terms are only scale factors usually we defne a normalzed reflectance ma ( ) ( ) (.) As we shall see n next secton ths nd of reflectance ma doesn t care about the surface albedo. Ths surface roerty should be added as an mortant scale factor that deends on the nature of each sngle area atch corresondng wth one mage xel. Before movng on wth the next secton Photometrc tereo bascs are now descrbed. Consder now the ( ) sace and an acured mage of a surface wth unform albedo. Let us consder also a sngle xel wth value E. Then we have ( ) E (.) Ths euaton s a curve n the ( ) lane. We can t comute the ( ) value matchng E snce there are nfnte values of ths gradent ar. We need much more nformaton. We need more mages wth dfferent lght condton (dfferent l r vector)! ther mages reresent other curves and the ntersecton ont of these curves s the gradent of the analysed ont. Fg..3 shows reflectance ma curves for some E values settng and. 5. Ths s the startng ont for the develoment of all P algorthms.

11 Fg..3 eflectance ma curves for ten values of E

12 3. Changng from two to four lghts When we started to aly P algorthm to real surfaces we used a artcular form of the reflectance ma seen n revous chaters to comute the gradent feld and we laced only two lghts one on the rght and the other on the left of the camera z z tan cos β senβ ( )cos x y ρ x y (3.) z z x y where s the acured obect mage whch deends on the scene geometry and on obect reflectance roertes s the ntensty of the lght ( x y) 3.). ρ s the albedo and ( β ) defnes the oston of each lght (Fg. Fg. 3. ystem geometry Wth ths model we used to comute the dervatves n such an easy way: n the case of dervatve along x we consder β and β π and easly fnd

13 3 tan tan )cos ( tan )cos ( x z y z x z x z y x y z x z x z y x ρ ρ (3.) and n the same way choosng π β and π β tan y z (3.3) However ths leads to a bg roblem snce wth two lghts could obtan only a art of the gradent feld that s absolutely necessary for comutng the deth ma. Wth one dervatve could only now the heght ma of one row along x a tme (or column along y) but can t establsh a connecton wth the heght nformaton of adacent rows (or column). For ths reason the frst 3D reconstructons are very oor and there s a great roblem wth nose effects on them. The frst soluton s to use the same formulas but four lghts the frst two ones for the x dervatve and the latter ones for the y dervatve. t s obvous that ths aroach ncreases enormously the 3D reconstructon algorthm ossbltes. Let s see an examle of ths frst smle aroach at the hotometrc stereo ssue. n every art of ths thess we ll use always one artcular P samle whch ermts us to comare dfferent methods whether a gradent extracton or an ntegraton algorthm s erformed. Fg.3.3 shows ths obect to be 3D maed. ne bg ssue n hotometrc stereo and shae from shadng algorthms s accuracy estmaton snce f a real samle s chosen rarely t s ossble to numercally comare the real geometry wth the reconstructed one. o n addton to a real samle we have to consder durng ths wor also an analytcal one. Tycally there are some P and F numercal surface (Fg.3.) []. We choose the vase and the reasons of ths wll be clear when the ntegraton algorthms wll be develoed and analysed.

14 a) b) c) d) e) f) Fg. 3. tycal P and F test mages 4

15 Fg. 3.3 the P samle n ths wor to test used algorthms Fg. 3.4 The crcle wth the mnmum ray that ncludes all surface( ) ars was dslayed n red and t corresonds to the maxmum alha value that doesn t allow shadows n gray scale mages 5

16 n the case of the vase we have to choose the best llumnaton condton. eferrng to aendx A we should analyse the gradent feld n the ( ) sace to solve ths tas. Precsely consderng all ossble beta values we have to fnd the alha value that doesn t n any case mae the shadow lne ntersect the mnmum crcle that ncludes all surface onts lotted n the ( ) lane. Fg.3.4 shows vase gradent ars lotted n ( ) crcle that contans them. The coordnates of the most dstant ( ) we could fnd that.79rad max lane and the mnmum ar are(.7.4). Usng ths arameter n (8.9) n the aendx Usng the euatons above we could comute the dervatves along x and y of both shell and vase. tartng wth the x one we have to consder β and β π. Fg. 3.5 and 3.6 show ( ) of shell and vase and ther x dervatve. nstead for the y dervatve we ut π β and β π. Fg. 3.7 and 3.8 show ( ) of shell and vase and ther y dervatve. Note that n shell case we don t now the numercal exact value of alha (assumng arallel rays see secton 5) but t doesn t matter because t wll only affect scale 3D reconstructon. 6

17 a) b) c) Fg. 3.5 a) and b) show shell mages lt resectvely from rght and left whle c) surface dervatve along x 7

18 a) b) c) d) Fg. 3.6 a) and b) show vase mages lt resectvely from rght and left whle c) surface dervatve along x. d) s the error between the orgnal x dervatve and the comuted one 8

19 a) b) c) Fg. 3.7 a) and b) show shell mages lt resectvely from the usde and downsde whle c) surface dervatve along y. N.B. n real mages the y axs has the ooste drecton than y axs n analytcal mage (vase) 9

20 a) b) c) d) Fg. 3.8 a) and b) show vase mages lt resectvely from the usde and downsde whle c) surface dervatve along y

21 n ths sense the gradent recovery assumes a mnor mortance than the second ste the gradent ntegraton whch s a fundamental ssue to reach the heght ma startng from the gradent feld. However s the four lghts set the best soluton and f yes n whch terms? Actually the choce of a secfc lghts set deends on many factors. For nstance f we want to decrease acuston tme we could acure only three color mages whch are the mnmum data set that ermts to comute the gradent feld and the albedo. However f the surface s away from the smoothness condton more than four mages are robably needed to avod shadows dstortons n gradent and albedo. o t s obvous that the more mages we have the more accurate wll be the 3D recovered ma but the more s also the acuston tme. n any case we need to fnd a trade-off between these ssues. For examle n real-tme alcatons we are bound by hardware acuston rate and we should choose the best soluton n terms of mages number and mages resoluton. The latter deends on whch obect we have to deal wth. n the next secton the basc gradent extracton theory and formulas were exlaned [].

22 4. Basc theory gradent extracton n ths secton we dscuss the theory of gradent comutaton. n order to defne a roer mathematcal model we consder a Lambertan surface behavour. any wors demonstrate that t s ossble under some assumtons to searate ths secal cue to the others (hghlght shadows an so on) []. n such a way many non-deal surfaces can be transformed to be treated as Lambertan. For ths reason the followng theory s usable n almost every hotometrc stereo exerment. The reflectance functon n Lambertan case s the scalar roduct of two vectors the lghtng one and the surface normal: (4.) ( ) ( ) ( ) Now to smlfy notaton consder ths vectors: l n ( ) ( ) (4.) f we have K N lght sources we can wrte: l n (4.3) Ths formula doesn t care about surface chromatcty (albedo). But where could albedo occur and what does ts aearance deend on? Whle we are sure that t occurs n surface mcrofacets (whch are roected onto xels n mage lane) as ts absolute roerty so-called body colour ts aearance could deend on the lght colour. Consderng ths latter factor we have to rewrte the revous euaton n ths way:

23 3 ( ) ( ) n l L µ µ (4.4) where [ ] T B G µ µ µ µ f we consder the searated GB sgnals. Now from (4.3) and (4.4) we obtan ( ) ( ) ( ) ( ) ( ) ( ) n L B G T B G µ µ µ µ µ µ µ (4.5) Let now deal wth the body colour. As the lght colour s a GB vector multled by the lght drecton vector n the same way the body colour s a GB vector multled by surface normal. (4.4) becomes ( ) ( ) n N l L ρ ρ µ µ (4.6) where [ ] T B G ρ ρ ρ ρ. n ths case the colour acured mage s ( ) ( ) ( ) ( ) ( ) ( ) N L B B G G B B G G T B G B G µ ρ µ ρ µ ρ µ ρ µ ρ µ ρ ρ ρ ρ µ µ µ (4.7)

24 Generally snce the concet of colour s relatve to a fxed colour whch s consdered the reference one we could consder system normalzed regardng the lght colour. n such a way the mage euaton s: ( L n) ρ (4.8) Note that n the deal case t doesn t matter usng gray-scale or colour mages and t s obvous after consderng last euaton. However f there s some nose n acured mage the analyss of three cues (GB) could allow us to understand the orgnal colour vector n the GB cube [][] or at least to obtan most accurate 3D ma. Consderng (4.8) t s obvous that we need at least three mages for havng a soluton. Wth three mages ( 3 ) we have ths lnear system: [ L] ρ n (4.9) 3 where [ L] [ L L L ] T 3 and [ ] T nverse matrx:. As well nown f > 3 we should aly the oore-penrose T T ([ L] [ L] ) [ L] ρ n (4.) That s all regardng the basc theory of gradent extracton. ore comlex ssues wll be treated n next sectons. For the moment we are nterested n comarng ths nd of gradent comutaton and the artcular method based on four mage acustons seen n revous secton. We analytcally analyse euaton form usng oore-penrose matrx and n the same lght set condton than before. Wth the four lght sources used n secton 3 where we have 4

25 5 4 3 π β π β π β β (4.) the L matrx wll be cos sn cos sn cos sn cos sn L (4.) so [ ] [ ] ( ) [ ] 4 3 sec sec sec sec csc csc csc csc 4 L L L n T T ρ (4.3) Ths leads to ( ) sec 4 cot cot ρ (4.4) n the GB case we could wrte these euatons n such a way

26 6 ( ) B B B B G G G G B G B G B G B G B G B G B G B G B G B G B G B G B G B G B G sec 4 cot cot ρ ρ ρ (4.5) n absence of nose each colour cue roduces the same gradent. However t s very useful because we could use ths behavour to mae the algorthm more robust n resence of nose. Euatons (4.4) comared wth euatons (3.) and (3.3) tell us that f there aren t any non-dealtes 4 3 (4.6) Ths wll be a smle way to detect non-dealtes such shadows hghlghts or non-arallel rays. Now let comare the gradent feld of the two used mages sets (shell and vase) comuted wth the latter euatons and wth (3.) and (3.3). We should exect the same result wth the vase due to the fact that t s an analytcal deal surface whle we should have a very dfferent result n the shell case most of all n shadows areas. Fg.4. shows what we exected.e. the two vase comuted gradents are numercally the same. nstead Fg.4. states that the two shell gradent felds are dfferent. Precsely they dffer more n the zone n whch there are non-dealtes. For ths reason Fg. 4.3 shows an mage where blac means less dfference; as exected shadows zone are whte.

27 a) b) Fg. 4. a) and b) are the dfferences between the vase x and y dervatves comuted wth (4.4) and (3.) wth (3.3) 7

28 a) b) Fg. 4. a) and b) are the dfferences between the shell x and y dervatves comuted wth (4.4) and (3.) wth (3.3) 8

29 a) b) Fg. 4.3 a) and b) are the dfference mages between the shell x and y dervatves comuted wth (4.4) and (3.) wth (3.3) 9

30 5. ays correcton o far we have seen the basc theory of gradent extracton. However we made some assumtons that could not ft the real condtons. f we tae care about consderng surface non-dealtes there could be also lght behavours that roduce gradent and 3D reconstructon bases. n ths sense and under artcular condtons we have develoed a method to correct ths structured nose. n ths secton we study the smle case of ont lght source near the obect and startng from ths artcular stuaton we fnd that t s ossble to aly the founded fnal euatons to any case. We start ths analyss assumng that a ont lght source s lghtng a lane so for all xels. f the lght s near the lane we easly note that two surface onts wth the same ( ) values wll be lt wth dfferent alha. o the corresondng xels n lane mage have dfferent gray level Fg. 5.. Ths s n contrast to (4.8). Fg. 5. wth a ont lght source to surface atches wth the same gradent are lt wth dfferent lght drectons and then have dfferent xel gray levels ne thng s clear: for a lane have a dfferent alha value for each surface ont. We solve ths roblem (for now n the lane case) usng three stes. The frst s consderng a lane wth nown albedo (or we could consder ts albedo as the reference colour value). Then an average alha value s found. The last ste s to buld a correcton matrx for the secfc lght source. After these stes we are able to 3D ma and to recover albedo of any lane at the same z 3

31 value. t s not really a bg result but after descrbng ths rocedure we demonstrate that t s ossble to mrove t under artcular but not too bndng condtons. nly n ths case we use a dfferent samle nstead of shell (t would be van to consder an deal surface such the vase) due to the fact that what we are gong to exlan s more vsble wth t rather than the shell. Let consder a whte lane a whte lght source and gray-scale mages (for now we don t care about random nose correcton). For ths surface as state above for all atches so we can wrte: L N cos ( ) ( ) T (5.) f rays are not arallel we should mae a dstncton between all xels so n matrx terms ~ cos (5.) f we now the value of alha we also now the alha bases n each real mage xel. Now how we could state the real value of alha f the lght s a ont lght source? ne method should be to consder the alha between the ray whch lns lght oston and the ntersecton between lane and vew drecton. However t would be a good method only for ont lght source and we should choose another aroach wth a casual lght dstrbuton (not only regardng lght drecton but also regardng lght ntensty). nstead nowng the albedo and gradent of the lane we could measure the average alha value. Fg. 5. shows the same lane lt from four dfferent drectons (the same of the revous secton). As s easy to see nstead of the deal case the gray-level dstrbuton s not unform n a sngle mage and t s not eual comarng mages one another. 3

32 a) b) c) d) Fg. 5. a)b)c) and d) show the whte lane lt resectvely from rght left usde and downsde o f we consder a Nx matrx the mean alha value s K N arccos (5.3) KN 3

33 33 These two methods are the aroach boundares. The frst s the same as the second wth a Drac functon aled n the mage center. A reasonable trade-off s addng a weght deendng on the dstance between the xel and mage center. The euaton becomes N K N w K w arccos (5.4) (N.B. we ut K out of the summary because the four weghted matrces are eual each other) where N N w (5.5) nce we have comuted alha we buld a correcton matrx n such a way ~ (5.6) so cos cos ~ (5.7) We have founded a smle euaton for the correcton matrx ~ cos (5.8)

34 Fg. 5.3 shows lane mages after alyng the correcton matrces on them. The comuted alha value s.45rad 6. Chosen these correcton matrces obvously t doesn t matter f we ll deal wth a lane wth dfferent albedo because t s only a gray-level xel scale factor. n ths case we only have a dfferent euaton ~ ρ cos ρ cos (5.9) o K N w ρ arccos N (5.) K w and ρ cos ~ (5.) As we sad before ths s not a really great result snce f move the lane forwards or bacwards along z axs the alha correcton at the same xel changes. For nstance f ut an obect on the lane and want to recover ts gradent should consder a dfferent alha dstorton than the lane case. How can go on to mae ths result be worth effort? n Fg. 5. we have seen that two xels nvolve dfferent lght drectons f the lght s not far enough to mae us consder arallel rays. But f the lght s not too near the lane we could demonstrate that for a lttle dfference n z axs the same correcton matrx s vald yet. The only thng we have to study s ths z range n whch we could generalze the artcular lane correcton matrces and use them for any obect. Let start to see the geometrc roblem (Fg. 5.4). have to fnd the z that ermts me to consder alha varaton numercally zero n the case of ont lght source. ndeendently of the surface sloe the alha varaton nvolve a varaton n l term. We would want that each element of lght vector doesn t change the value out of a secfc range. 34

35 a) b) c) d) Fg. 5.3 a)b)c) and d) show the whte lane lt resectvely from rght left usde and downsde after alyng the correcton matrx on t 35

36 Fg. 5.4 For alyng correcton matrces to any obect beng 3D maed should fnd the varaton of z that ermts to consder numercally zero the varaton of alha The nvolved vector s [ sn cos β sn sn β cos ] l (5.) We want that l max l l % (5.3) Ths condton leads to sn sn. ε sn cos cos. ε cos (5.4) Usng Fg. 5.4 we can wrte 36

37 εb δ ε z (5.5) Ths result means that f the lane n whch the lght sources le s one meter and a half far from the lane where could ut any samle on could reconstruct a gradent feld of a surface that has a z ma n almost 3 cm range. Ths s a very smlar condton comarng wth our exerments so we could aly correcton matrces even f there s an obect on the orgnal whte lane. Fg. 5.5 shows four mages of an archaeologcal samle. Now we aly on them the correcton matrces (Fg. 5.6) and we show the results (Fg. 5.7). Even f we ddn t menton the ntegraton algorthm yet n order to understand the effect of ths correcton aroach we also show the 3D reconstructons usng the orgnal mages and the corrected ones (Fg. 5.8). As s easy to see the 3D ma usng orgnal mages s based: the lane should be a flat surface nstead of sem-shercal. n the other hand the surface comuted after usng correcton matrces aear no based and the lane under the samle s flat as t should be. 37

38 a) b) c) d) Fg. 5.5 a)b)c) and d) show the archaeologcal samle lt resectvely from rght left usde and downsde before alyng the correcton matrx on t 38

39 a) b) c) d) Fg. 5.6 a)b)c) and d) show the archaeologcal samle lt resectvely from rght left usde and downsde after alyng the correcton matrx on t 39

40 a) b) Fg. 5.7 a) b) show the archaeologcal samle gradent comuted after alyng the correcton matrx on t 4

41 a) b) Fg. 5.8 the archaeologcal samle 3D ma comuted a) wthout and b) after alyng the correcton matrx on t 4

42 6. Gradent ntegraton n revous secton we have analysed the gradent comutaton rocess. Now we start to deal wth the second man ste.e. the ntegraton ste whch ermts to erform a transformaton between the gradent feld and the corresondng heghts ma. n the ast the frst test conssts n alyng the emann one dmensonal ntegraton snce we had only two hotos and one dervatve (x or y). The results are not really good most of all n the real case. ndeed the emann aroach s not too bad n the deal case but t s very nose senstve so t becomes unusable wth real surfaces. Concernng the vase for examle the 3D ma s ute good n the case of x dervatve whle s really bad wth the y dervatve (Fg. 6.). Ths deends on the fact that emann ntegraton erforms only one ntegraton er row (or column) and doesn t mae any correlaton between columns (or rows). Furthermore f t doesn t have the boundary condton as ntal cue the frst row (or column) starts from zero value. t s not worth develong a emann based algorthm that cares about the boundares. For ths reason an deal surface wth the frst column eual to zero (as the vase) has a good reconstructon wth the emann ntegral aled on the x dervatve (Fg. 6.). Ths reresents the frst tral and for obvous reasons we mmedately abandon ths nd of aroach. We have read a lot of wors and tred some nown algorthms concernng ths ssue and there s a lot of dfferent ways to recover z ma from the gradent feld for nstance usng Fourer transforms [3] or Green s formulas but so far we beleve that the best tradeoff between the reconstructon accuracy and comutatonal tme s the bconugate gradent method (BG) aroach [4]. n ths secton we re gong to dscuss a artcular algorthm we have develoed based on BG tang care of both surface and boundary ntegrals. Frst we ll tal about the matrx roblem nvolved n two-dmensonal ntegraton rocess (Posson matrx) then we ll show the theory concernng BG and fnally we ll llustrate our modfed algorthm. 6. Posson matrx Posson euaton s the rototycal elltc euaton x z y z ρ ( x y) (6.) where ( x y) ρ s the nown term. Usng the fnte-dfference and matrx reresentaton t becomes 4

43 43 z z z z z z ρ (6.) where s the dstance n ( ) y x lane between two surface atch centers along x (or y) suosed they are eual. Now let us consder a surface that conssts n a Nx matrx. We could wrte z z z z z 4 ρ (6.3) for N K and K. Ths leads to a matrx formulaton whch nvolves the so-called trdagonal wth frnges matrx. For examle f ( ) ( ) 66 N we ll have a 6x6 Posson matrx x L L L L L L L L L L L L L L L L L L (6.4)

44 a) b) Fg. 6. 3D ma comuted alyng emann ntegral to a) x and b) y dervatve The unnown term s [ z z z z z z z z z z z z z z z ] T z (6.5) nstead the gven term s buld by ρ and the boundary condtons n such a way 44

45 [ ρ ρ 3 ρ 4 ρ 5 ρ 3 ρ33 ρ 34 ρ35 ρ 4 ρ 43 ρ 44 ρ 45 ρ 5 ρ 53 ρ 54 ρ55 ] T [ z z6 z3 z36 z4 z 46 z5 z56 ] [ z z z z z z z z ] T T (6.6) Note that the four xels at the matrx edge are not nvolved n the surface ntegraton. o we could generalze these matrces usng a generc Nx matrx and usng ths reresentaton Az b (6.7) where A and : KN : : A 4 n K N 3 : n K : n K N 3 : n : A : A ( N ) ( N ) A A (6.8) b ρ z bc z br (6.9) where z bc n( ) ( ) n KN 3 : zbc n KN : n zbc z n KN 3 n KN : n z n n ( ) n ( ) z bc (6.) z br : K z : : br z ( )( N 3) K( )( N ) zbr z N ( )( N 3) K ( )( N 3) K( )( N ) z br (6.) 45

46 46 For solvng (6.7) euaton t s ossble to use a lot of numercal methods but we should narrow down the ossble algorthm tang care that most of all nvolve A nverse matrx comutaton. nce A matrx has ( )( ) ( )( ) ( ) N N dmenson even wth small value of N and the calculaton of the nverse could be comutatonally very hard. The BG avods the nverse comutaton but nvolves the orgnal sarse matrx storage. For the moment we shall exlan ths algorthm and then we ll modfy t to avod also ts storage n hardware memory ncreasng comutatonal tme. 6. BG The conugate gradent algorthm s based on the mnmzaton of ths formula [4]: ( ) z b z A z z f (6.) t s mnmzed when b z A f (6.3) o t s s mnmzed for the z values that solves (6.7). The generc numercal algorthm (nown as bconugate gradent method) starts sulyng ntal vectors r and r (whch have the same z dmenson) the frst guess z and set r and r. Then t carres out ths recurrence T z z r r r r r r A r r A r r A r r β β β (6.4)

47 n our case A s symmetrc so we can set r r and. Furthermore we choose z whch means that the resdual r b. The recurrence becomes r z r r A r r β r z r r r A β (6.5) 6.3 ur algorthm o far we have seen the two-dmensonal ntegraton roblem and the numercal method to solve t. However n real hotometrc stereo case we haven t any gven boundary condton and we really don t want to store a bg matrx even f t s sarse. n fact f we have a common 5x5 mage the A matrx wll be 644x644 matrx wth more than mllon non-zero elements. We mrove ths algorthm erformng two tass frst we use the conugate method to execute a boundary ntegraton and then we avod storng the sarse matrx wth a smle algorthm that comute A Boundary ntegraton uosed the dervatves along x and y are two NxN matrces. A artcular case of Posson s formula s used to comute the deth ma n the matrx contour. Frst of all the boundary s consdered as a lnear vector [ z z L z z z L z z z L z z z z z ] T zc N N N N N N N N N N N N L Then the euaton (6.) s rewrtten consderng only one dervatve along the drecton of the contour vector (6.6) z z C u z C z C ρ (6.7) 47

48 48 where ρ deends on the surface dervatves along x and y and ts value s N N N K N N N N K N N N N K N N N K K K N N K N K N N N N N N K N K N N K K K K K K K K K K ρ (6.8) Note that the frst and the last elements of C z vector are the same and snce an ntegraton nvolves an addtve constant we could set z. Ths rocedure leads to an A matrx wth the dagonal element eual to - and for each row the element value before and after - s urface ntegraton Usng revous results as BG algorthm cues we have to analyse only the nown term of (6.7). Ths s the sum of the second dervatves but n our exerments we have the frst dervatve. Usng fnte-dfference aroxmaton we ut y y z x x z (6.9) tate ths we could wrte the nown term as br z bc z b ρ where bc z and br z are the same as before and ρ s ρ (6.)

49 The last thng we have to dscuss s the rocedure that ermts us to avod A matrx storage. We sad that we erfectly now the A matrx and excet lttle dfferences the n row s eual to the shfted n row. f we manage these lttle dfferences we could erform the roduct only wth a for loo wthout storng the sarse matrx. These dfferences are the zero values that nterrut the dagonal wth "" values adacent to matrx dagonal. These values occur wth a regular recurrence whch deends on the number of columns n the orgnal acured mages. o every change s redctable and there s no roblem to erform ths oeraton. n ths way we could reach an algorthm erformance better than common algorthm used n rofessonal software for comutaton. Now we show the result of ths rocedure n the analytcal and real test cases (vase and shell) (Fg. 6. and 6.3). As we exlan n secton 4 the algorthm recovers the albedo nformaton too. Fg. 6.3 shows the shell reconstructed surface wth ts aled albedo. Then we nvestgate algorthm changed verson to mrove ts erformances and among many tral we found that the teraton number (hence the comutatonal tme) could be decreased usng a 9 xels ernel nstead of Posson s 5 ernel. nce the dervatves along all drecton could be wrtten as a lnear combnaton of x and y dervatves f we consder also the dervatves along the dagonals of a surface matrx we ll have a Posson s euaton that nclude all xels n a 3x3 ernel centered on ( ) coordnates. Fg. 6.4 shows a comarson between 5-ernel and 9-ernel algorthm erformances n terms of number of teraton and comutatonal tme. 49

50 a) b) c) Fg. 6. a) Vase 3D ma comuted alyng BG ntegral b) the orgnal surface and c) the heght error %. 5

51 a) b) c) Fg. 6.3 a) b) shell 3D ma comuted alyng BG ntegral c) the reconstructed surface wth aled albedo ma. 5

52 a) b) Fg. 6.4 a) b) show the erformance dfferences between our algorthm based on Posson s euaton (5 ernel) and the modfed 9 ernel algorthm resectvely regardng the number of teratons and comutatonal tme. n abscssas there s the dmenson N of a NxN surface matrx. 5

53 Fg. 6.5 A comarson between our algorthm and a famous calculus software n solvng BG teraton rocess. n abscssas there s the dmenson N of a NxN surface matrx. These mrovements mae our algorthm worng better than commercal software n solvng Posson s and modfed Posson s algorthms. We fnd that our algorthm taes less tme to comute the bconugate gradent rocess than a famous software (that we are not gong to menton) (Fg.6.5). There s another way to mrove the comutatonal tme regardng the 3D ma of a surface. any aers deal wth Photometrc stereo ssue but most of all tae as ntal cue the boundary condtons whch s a really bndng thng. We are able to fnd a 3D ma wthout any nformaton but the gradent and ths s a secal feature that allows us to more decrease the tme taen to have surface heghts. We have only to tae not the entre mage n a sngle ste but art of t. After comutng the boundary we reconstruct the boundary of a surface regon (e.g. the uer left uarter); startng from the nown boundary we have to comute only two edges of ths subsurface. Then ts surface ntegral s erformed and we could contnue fndng the 3D ma of the other regons. Note that after ths ste f we want to reconstruct the uer rght uarter we already now the heghts of three of ts edge and so on. The ont of fact s that the tme needed to wor the entre surface out s more than the tme taen for calculatng four sub-surfaces. Let us consder a NxN matrx wth N 6. ur algorthm taes more than seven mnutes (about seven mnutes and a half) for the entre surface whle t taes about one second for a nxn sub-matrx wth n. o wth ths dvde et mera aroach we send about 4 seconds nstead of 45. f we consder a nxn wth n 5 the entre surface wll be reconstructed n about 3 seconds. We decrease the comutatonal tme by 94%. Ths aroach could be very useful regardng the real-tme ssue whch could clear the way for new nnovatve alcatons. 53

54 The ossblty of havng an algorthm that comute boundary of any regon wth any toologcal (twodmensonal) features allows us to solve one of the most mortant roblems: the bases of shadow regon. There are some aers [] that state the caablty of dentfyng shadow zones and robustly comutng the real gradent wthout any dstorton. But the shadow zone contans also a lot of nformaton n the case of a non-deal surface most of all n the resence of dscontnutes whch are the devl n hotometrc stereo. n such cases shadows can hel us frst to recognze dscontnutes and then to reconstruct the rght gradent and the rght surface. Consder a lt cube lyng on a lanar surface. t roduces a cast shadow on the lane. f we aled one algorthm to remove the shadows effect n gradent feld we ll have an eual to zero gradent and the reconstructed surface wll be a lane. Ths s one nstance whch shows both the lac of many algorthms n managng shadows and the great nformaton contaned n them. As an examle of alyng a smle algorthm to rght reconstruct shadow zones wthout losng the nformaton held n them let see Fg. 6.6 where we use the caabltes of the curvlnear algorthm (one-dmensonal Posson s aroach) to reconstruct a self-shadow n a facal 3D ma. a) b) Fg. 6.6 Comarson between facal reconstructon a) wthout shadow managng and b) removng one of the cast shadows due to the nose 54

55 7. Alcatons The most wonderful feature n ths nd of research s that P could be aled to a large number of samles and t wors not only for near Lambertan surface and usng common lghts but also wth dfferent nd of mages and wth surfaces that s non-lambertan. For nstance we reconstruct obects acurng ther scannng electron mcroscoe (E) mages. Another examle s face 3D ma; whle the sn s aroxmately Lambertan the eye s rght reconstructed even f we couldn t consder t Lambertan at all. These are to examles that demonstrate the adatablty of P to many real cases even f they are really far from the deal condtons. Ths fact roves the develoed algorthm s robust regardng most of the dstortons causes. Due to ths robustness we have aled t to many research and alcaton felds and n the followng secton we searately analyse each of them: - archaeology - bometrcs - grahology - huge and far obects 3D ma - olce nury - E samles - bology - olynomal texture ma (PT) samles Furthermore durng these exerments we need a software to manage some data. o we had develoed a vsualzaton tool and a software that controls the acuston of E mages (secton 7.). We ll broadly show them and ther behavour. 7. tcal alcatons Archaeology s the frst alcaton feld we have dealt wth durng our research. The frst samle was a double of a umeran tablet wth a great number of ncsons on t. We were surrsed to note that the 3D ma s erfectly readable even f n the frst exerments we use a surface matrx wth low resoluton (Fg. 7. and Fg. 7.). The effect of the heghts wth albedo searaton s evdent f we comare the 3D ma wth and wthout the chromatc nformaton. 55

56 a) b) c) Fg. 7. a) one of umeran tablet (front) orgnal mages b) 3D ma and c) 3D ma wth albedo 56

57 a) b) c) Fg. 7. a) one of umeran tablet (rear) orgnal mages b) 3D ma and c) 3D ma wth albedo Concernng archaeologcal ssues a very mortant alcaton s stratgrahy. Usng our algorthm archaeologsts can 3D ma every ste of stratgrahc rocess avodng the needed drawng tas. Ths maes ths rocedure more accurate and relable. Fg. 7.3 shows a smulaton of a stratgrahc oeraton suosng we have three surfaces. 57

58 a) b) c) Fg. 7.3 These are three stratgrahc surfaces. a) s the frst layer b) the frst and the second layers and c) all layers. 58

59 ne feature of our algorthm s the searated extracton of heghts and chromatc nformaton. Ths roves to be very useful n archaeology when an nscrton s llegble due to ts drtness. Fg. 7.4 shows a headstone comletely mossble to read whle Fg. 7.5 demonstrates that removng the albedo wth a 3D ma we are able to read the orgnal oman nscrtons. Fg. 7.4 A comletely llegble headstone 59

60 a) b) Fg. 7.5 a) An mage of a art of the headstone and b) ts 3D ma n whch we are able to read the orgnal nscrtons Another mortant alcaton s bometrcs. n ths secton we are gong to show the caabltes of P n 3D mang art of human body useful for nstance for securty alcaton. The frst samles we llustrate are facal reconstructons (N.B. we have human gunea-g leave to ublc her hoto). n Fg. 7.6 we have a face wth oen eyes. Ths demonstrates that even non-deal surfaces could be consdered almost Lambertan due to the algorthm robustness regardng non-dealtes. 6

61 Fg. 7.6 A face 3D ma wth rght reconstructon of eyes zone n ths samle we could see that the face s reconstructed roerly but a lot of dstortons aear n the har. Deendng on the secfc alcaton (for nstance securty) we could consder a art of mage n whch we are able to manage all non-deal elements and to avod surface bases. The followng fgure (Fg. 7.7) roves that t s ossble to use our algorthm to 3D ma fngerrnts. Ths feature s really mortant because generally fngerrnts dentfcaton s erformed wth two dmensonal data. Possblty to use three-dmensonal nformaton mroves the dentfcaton accuracy and decreases a lot otental errors. Fg. 7.7 A fngerrnt 3D ma 6

62 Grahology s the scence of human dentfcaton by hs handwrtng. Broadly t uses letter shaes and n ntensty to dentfy the author of any wrtng; all of these nstruments are two-dmensonal. Even n ths case havng three-dmensonal nformaton can hel n dentfyng tas. We have tred our algorthm reconstructng two suermosed drawn lnes (Fg. 7.8). Usng ths nd of nformaton we mmedately see that one lne s deeer than the other so the man who wrtes n ths aer has used dfferent effort drawng the lnes. Ths could be a good nformaton deendng on what somebody s searchng for. Fg. 7.8 A 3D ma of two suermosed drawn lnes Fnally the last nd of alcaton concernng otcal doman s the 3D ma usng solar lght of obect at a great dstance from the vewer. n Fg. 7.9 we show the 3D reconstructon of a moon crater. nstead Fg. 7. reresents a summarse of the caabltes of our method. 6

63 a) b) Fg. 7.9 A moon crater. rgnal mage a) and reconstructed detal b) by -source (sunlght at mdnght of two successve days) Photometrc tereo. a) b) c) Fg. 7. Pure albedo a) ure geometry b) and rendered 3D reconstructon c) of a shell by Photometrc tereo. These are the general results after alyng our algorthm to a samle n otcal doman 63

64 7. cannng Electron croscoe o far we have dealt wth otcal mages and we have consdered surfaces behavour as Lambertan. There s another tye of mages that even f t s hyscally comletely dfferent from common mages ermts to consder the surface n the same Lambertan way. They are scannng electron mcroscoe (E) mages. bvously t ncreases the ossble alcaton feld and as we demonstrate that t s ossble to reconstruct huge and far obect usng for nstance solar lght now we can say we are able to nvestgate the mcroscoc world. n the followng we ll see many exemlars of tycal E samles but before dong ths we should llustrate the rocedure to acured E mages for 3D reconstructon algorthm. Even f the mage acuston system s very dfferent from many ont of vew we need the same mages set. o not consderng the nature of E sgnal the unue dfference s that E mages are gray-level matrces and the concet of albedo n ths data s not the real chromatc roerty. n scannng electron mcroscoe albedo varatons reresent materal varatons along the surface. Gvng a closer loo to the P-based 3D recovery method t conssts of the acuston of 4 Bac-cattered (B) mages whch allow us to comute surface gradent and snce we have to rotate the samle under observaton due to the fact that we have only one lght source (n E the corresondng lght source s the electron detector) and snce the rotaton s not erfectly erformed by the mcro mechancal system n E we need to algn acured mages to gve our algorthm them. tated ths to acure mages we need to erform the followng rocedure due to the ntrnsc mcroscoe behavour. a) b) Fg. 7. a) B and b) mages of the same frame scan. Frst of all the subect s framed magnfed and focused. Then both brghtness and contrast are searately set for the two detectors to be used.e. the off-axs Baccattered (B) electron detector and the comlete crcular axal 64

65 B detector whch roduce sotroc shadng (we ndcated them as mages). n Fg. 7. you can see the B and mages related to the frst mage acuston. o after framng these two mages of the obect we want to 3D ma we start ths seuence ) Acuston of a ar B and mages as n fg. 7.. ) mechancal rotaton of the secmen by 9 3) Acuston of a reduced mage n the central area that s frst counter-rotated by 9 and then Fg. 7. reduced mage counter-clocwse rotated by 9 4) cross-correlate wth the revous mage. Ths gves the ( x y) that we use to re-algn the mage n E acuston dslay Fg. 7.3 cross-correlate wth the revous mage 5) The new mage center of the rotated secmen s mechancally brought bac by ( x y) as close as ossble to the revous centre 6) tes -4 are reeated 3 tmes At the end of the rocess (whch taes few mnutes ncludng the mage acuston) a twn set of 44 mages s stored (Fg. 7.4). 65

66 Fg. 7.4 tored mages at the end of E acuston rocess. B mages n the frst row and mages n the second. The automatc algnment durng the acuston rocess s not really accurate for a good 3D reconstructon so we have to erform also a software mage rocessng to refne the algnment. Then we have the four mages (Fg. 7.5) that wll be used by the P algorthm to fnd surface heghts (Fg. 7.6). Fg. 7.5 The mages after the mage rocessng algnment. These mages are ready to be rocessed by P algorthm Fg. 7.6 The 3D ma of ths E samle Followng fgures shows other ossble nd of E samles that are useful to be 3D reconstructed. 66

67 Fg. 7.7 A set of B mages (uer row) the corresondng twn set (central row) and some 3D vews (lower row) of the reconstructed surface of a damaged sold-state electron devce. a) b) Fg. 7.8 a) ne of the B E mages of a con detal and b) ts 3D reconstructon. a) b) c) Fg. 7.9 a) tcal mage and b) E detal of the ercusson surface of an exloded bullet-case; c) reveals the 3D shae. 67

68 7.3 Polynomal Texture a The last alcaton we want to descrbe nvolves an algorthm and software develoed n HP labs at Palo Alto (CA). Ths algorthm called Polynomal Texture ang (PT) taes N mages of an obect and nterolates ths cue data to vrtually render the surface as lt from any chosen drectons [5]. nce we can choose the drecton of llumnaton of a PT samle t s evdent that we can lght the surface from the drectons we need to erform P algorthm and to fnd surface 3D ma. For ths reason we download from h-labs web ste the PT software and some samles and we fnd the heghts of them. Next fgures demonstrate the advantages of mergng our and ther algorthm. a) b) c) Fg. 7. a) one of PT (umeran tablet) orgnal mages b) 3D ma and c) 3D ma wth albedo 68

69 a) b) c) Fg. 7. a) one of PT (a front of an ancent con) orgnal mages b) 3D ma and c) 3D ma wth albedo 69

70 a) b) c) Fg. 7. a) one of PT (a rear of an ancent con) orgnal mages b) 3D ma and c) 3D ma wth albedo 7

71 8. Aendx A n order to have the best P test mages a artcular ssue has to be faced: the lght set-u. nce we have an analytcal surface ma (wth real obect t s more comlcated and we don t deal wth t here) t s necessary that the roduced mages set s the best to be aled to P algorthms. n few words we should avod n the mages every nondeal element such as cast and self shadows hghlghts and nose. Frst of all we should note that the smoothness of surface must be sutable for P whch s not able enough to recognze strong surface dscontnutes and we should not have any nose or hghlghts; ths s due to the fact that the surface s not a real obect and we could choose the roer materal behavour. The last ssue s the resence of shadows (cast and/or self). To solve ths roblem we have to analyse the gven analytcal surface gradent feld and fnd a rule to decde the llumnaton arameters whch don t roduces any shadow. Let s mae an examle n one dmenson. uose we have a yramd wth the base n the x-y lane and let z-axs be ts axs. Consder a secton on the x-z lane (Fg. 8.). Before movng on note that shadows n mages (both cast or self) nvolve the resence of a negatve scalar roduct between the llumnaton drecton and surface normal n at least one mage xel (or one obect mcrofacet). Fg. 8. one dmensonal geometry for best lght set-u estmaton We now that the reflectance functon stated that 7

72 (8.) ( ) ( ) ( ) where the term wth the s-ndces s the llumnaton drecton vector whle the other term s the surface normal. f we want to avod shadows we should choose a roer llumnaton vector whch assures us that n every obect mcrofacet the functon s non-negatve. Ths tas s really smle f we now surface gradent feld. As we can easly see n one dmenson f shadows along the entre surface wll be π (and ths s a necessary condton n P) then the maxmum alha value to avod π π z max γ tan (8.) x max Now let consder the usual two dmensonal condton. Whle n the revous case we deal wth alha snce the dervatve could be only n x drecton now the analyss of beta s needed. n other words we should study all ossble drectons of lght rays to choose the maxmum alha value that does not roduce any shadow ndeendently of beta value. n ths sense frst of all note that usually the P algorthms consder a contnuous surface made by a fnte number of mcrofacets whch begn xels n mage doman. Furthermore we consder the xel as an mage of a suare obect regon wth untary edge. tated ths the deth varaton (Fg. 8.) wthn a xel s δ z δx δy (8.3) 7

73 Fg. 8. The change n heght s the sum of the roducts between dervatve and the ste along each drecton Fg. 8.3 mage gray level value deends on the lght drecton vector and the normal of the z z segment that les on ntersecton lane 73

Lecture Note 08 EECS 4101/5101 Instructor: Andy Mirzaian. All Nearest Neighbors: The Lifting Method

Lecture Note 08 EECS 4101/5101 Instructor: Andy Mirzaian. All Nearest Neighbors: The Lifting Method Lecture Note 08 EECS 4101/5101 Instructor: Andy Mrzaan Introducton All Nearest Neghbors: The Lftng Method Suose we are gven aset P ={ 1, 2,..., n }of n onts n the lane. The gven coordnates of the -th ont

More information

IMRT workflow. Optimization and Inverse planning. Intensity distribution IMRT IMRT. Dose optimization for IMRT. Bram van Asselen

IMRT workflow. Optimization and Inverse planning. Intensity distribution IMRT IMRT. Dose optimization for IMRT. Bram van Asselen IMRT workflow Otmzaton and Inverse lannng 69 Gy Bram van Asselen IMRT Intensty dstrbuton Webb 003: IMRT s the delvery of radaton to the atent va felds that have non-unform radaton fluence Purose: Fnd a

More information

Region Segmentation Readings: Chapter 10: 10.1 Additional Materials Provided

Region Segmentation Readings: Chapter 10: 10.1 Additional Materials Provided Regon Segmentaton Readngs: hater 10: 10.1 Addtonal Materals Provded K-means lusterng tet EM lusterng aer Grah Parttonng tet Mean-Shft lusterng aer 1 Image Segmentaton Image segmentaton s the oeraton of

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

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

Motivation. Motivation. Monte Carlo. Example: Soft Shadows. Outline. Monte Carlo Algorithms. Advanced Computer Graphics (Fall 2009)

Motivation. Motivation. Monte Carlo. Example: Soft Shadows. Outline. Monte Carlo Algorithms. Advanced Computer Graphics (Fall 2009) Advanced Comuter Grahcs Fall 29 CS 294, Renderng Lecture 4: Monte Carlo Integraton Rav Ramamoorth htt://nst.eecs.berkeley.edu/~cs294-3/a9 Motvaton Renderng = ntegraton Relectance equaton: Integrate over

More information

Recognition of Identifiers from Shipping Container Images Using Fuzzy Binarization and Enhanced Fuzzy Neural Network

Recognition of Identifiers from Shipping Container Images Using Fuzzy Binarization and Enhanced Fuzzy Neural Network Recognton of Identfers from Shng Contaner Images Usng uzzy Bnarzaton and Enhanced uzzy Neural Networ Kwang-Bae Km Det. of Comuter Engneerng, Slla Unversty, Korea gbm@slla.ac.r Abstract. In ths aer, we

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

Bayesian Networks: Independencies and Inference. What Independencies does a Bayes Net Model?

Bayesian Networks: Independencies and Inference. What Independencies does a Bayes Net Model? Bayesan Networks: Indeendences and Inference Scott Daves and Andrew Moore Note to other teachers and users of these sldes. Andrew and Scott would be delghted f you found ths source materal useful n gvng

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

Electrical analysis of light-weight, triangular weave reflector antennas

Electrical 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 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

Outline. Seamless Image Stitching in the Gradient Domain. Related Approaches. Image Stitching. Introduction Related Work

Outline. Seamless Image Stitching in the Gradient Domain. Related Approaches. Image Stitching. Introduction Related Work Outlne Seamless Image Sttchng n the Gradent Doman Anat Levn, Assaf Zomet, Shmuel Peleg and Yar Wess ECCV 004 Presenter: Pn Wu Oct 007 Introducton Related Work GIST: Gradent-doman Image Sttchng GIST GIST

More information

Indirect Volume Rendering

Indirect Volume Rendering Indrect Volume Renderng Balázs Csébalv Deartment o Control Engneerng and Inormaton Technology Budaest Unversty o Technology and Economcs Classcaton o vsualzaton algorthms Drect Volume Renderng DVR: The

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

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

THE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY

THE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY Proceedngs of the 20 Internatonal Conference on Machne Learnng and Cybernetcs, Guln, 0-3 July, 20 THE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY JUN-HAI ZHAI, NA LI, MENG-YAO

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

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

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

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

Transactions on Visualization and Computer Graphics. Sketching of Mirror-symmetric Shapes. Figure 1: Sketching of a symmetric shape.

Transactions on Visualization and Computer Graphics. Sketching of Mirror-symmetric Shapes. Figure 1: Sketching of a symmetric shape. Page of 0 Transactons on Vsualzaton and omuter Grahcs 0 0 0 Abstract Sketchng of Mrror-symmetrc Shaes For Peer Revew Only Ths aer resents a system to create mrror-symmetrc surfaces from sketches. The system

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

A note on Schema Equivalence

A note on Schema Equivalence note on Schema Equvalence.H.M. ter Hofstede and H.. Proer and Th.P. van der Wede E.Proer@acm.org PUBLISHED S:.H.M. ter Hofstede, H.. Proer, and Th.P. van der Wede. Note on Schema Equvalence. Techncal Reort

More information

3D vector computer graphics

3D 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 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

Skew Estimation in Document Images Based on an Energy Minimization Framework

Skew Estimation in Document Images Based on an Energy Minimization Framework Skew Estmaton n Document Images Based on an Energy Mnmzaton Framework Youbao Tang 1, Xangqan u 1, e Bu 2, and Hongyang ang 3 1 School of Comuter Scence and Technology, Harbn Insttute of Technology, Harbn,

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

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

Solving Optimization Problems on Orthogonal Ray Graphs

Solving Optimization Problems on Orthogonal Ray Graphs Solvng Otmzaton Problems on Orthogonal Ray Grahs Steven Chalck 1, Phl Kndermann 2, Faban L 2, Alexander Wolff 2 1 Insttut für Mathematk, TU Berln, Germany chalck@math.tu-berln.de 2 Lehrstuhl für Informatk

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

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

NOVEL APPROACH FOR MOVING HUMAN DETECTION AND TRACKING IN STATIC CAMERA VIDEO SEQUENCES

NOVEL APPROACH FOR MOVING HUMAN DETECTION AND TRACKING IN STATIC CAMERA VIDEO SEQUENCES THE PUBLIHING HOUE PROCEEDING OF THE ROMANIAN ACADEMY, eres A, OF THE ROMANIAN ACADEMY Volume 3, Number 3/202,. 269 277 NOVEL APPROACH FOR MOVING HUMAN DETECTION AND TRACKING IN TATIC CAMERA VIDEO EQUENCE

More information

Contour Error of the 3-DoF Hydraulic Translational Parallel Manipulator. Ryszard Dindorf 1,a, Piotr Wos 2,b

Contour Error of the 3-DoF Hydraulic Translational Parallel Manipulator. Ryszard Dindorf 1,a, Piotr Wos 2,b Advanced Materals Research Vol. 874 (2014) 57-62 Onlne avalable snce 2014/Jan/08 at www.scentfc.net (2014) rans ech Publcatons, Swtzerland do:10.4028/www.scentfc.net/amr.874.57 Contour Error of the 3-DoF

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

Lecture 4: Principal components

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

Image Segmentation. Image Segmentation

Image Segmentation. Image Segmentation Image Segmentaton REGION ORIENTED SEGMENTATION Let R reresent the entre mage regon. Segmentaton may be vewed as a rocess that arttons R nto n subregons, R, R,, Rn,such that n= R = R.e., the every xel must

More information

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton

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

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On Some Entertaining Applications of the Concept of Set in Computer Science Course On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,

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

FULL-FRAME VIDEO STABILIZATION WITH A POLYLINE-FITTED CAMCORDER PATH

FULL-FRAME VIDEO STABILIZATION WITH A POLYLINE-FITTED CAMCORDER PATH FULL-FRAME VIDEO STABILIZATION WITH A POLYLINE-FITTED CAMCORDER PATH Jong-Shan Ln ( 林蓉珊 ) We-Tng Huang ( 黃惟婷 ) 2 Bng-Yu Chen ( 陳炳宇 ) 3 Mng Ouhyoung ( 歐陽明 ) Natonal Tawan Unversty E-mal: {marukowetng}@cmlab.cse.ntu.edu.tw

More information

On the Two-level Hybrid Clustering Algorithm

On the Two-level Hybrid Clustering Algorithm On the Two-level Clusterng Algorthm ng Yeow Cheu, Chee Keong Kwoh, Zongln Zhou Bonformatcs Research Centre, School of Comuter ngneerng, Nanyang Technologcal Unversty, Sngaore 639798 ezlzhou@ntu.edu.sg

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

Optimized Query Planning of Continuous Aggregation Queries in Dynamic Data Dissemination Networks

Optimized Query Planning of Continuous Aggregation Queries in Dynamic Data Dissemination Networks WWW 007 / Trac: Performance and Scalablty Sesson: Scalable Systems for Dynamc Content Otmzed Query Plannng of Contnuous Aggregaton Queres n Dynamc Data Dssemnaton Networs Rajeev Guta IBM Inda Research

More information

Introduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2

Introduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2 Introducton to Geometrcal Optcs - a D ra tracng Ecel model for sphercal mrrors - Part b George ungu - Ths s a tutoral eplanng the creaton of an eact D ra tracng model for both sphercal concave and sphercal

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

TIME-EFFICIENT NURBS CURVE EVALUATION ALGORITHMS

TIME-EFFICIENT NURBS CURVE EVALUATION ALGORITHMS TIME-EFFICIENT NURBS CURVE EVALUATION ALGORITHMS Kestuts Jankauskas Kaunas Unversty of Technology, Deartment of Multmeda Engneerng, Studentu st. 5, LT-5368 Kaunas, Lthuana, kestuts.jankauskas@ktu.lt Abstract:

More information

An efficient method to build panoramic image mosaics

An efficient method to build panoramic image mosaics An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract

More information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

More information

MOTION BLUR ESTIMATION AT CORNERS

MOTION BLUR ESTIMATION AT CORNERS Gacomo Boracch and Vncenzo Caglot Dpartmento d Elettronca e Informazone, Poltecnco d Mlano, Va Ponzo, 34/5-20133 MILANO boracch@elet.polm.t, caglot@elet.polm.t Keywords: Abstract: Pont Spread Functon Parameter

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

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

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

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

A Method of Line Matching Based on Feature Points

A Method of Line Matching Based on Feature Points JOURNAL OF SOFTWARE, VOL. 7, NO. 7, JULY 2012 1539 A Method of Lne Matchng Based on Feature Ponts Yanxa Wang and Yan Ma College of Comuter and Informaton Scence, Chongqng Normal Unversty, Chongqng, 400047,

More information

Broadcast Time Synchronization Algorithm for Wireless Sensor Networks Chaonong Xu 1)2)3), Lei Zhao 1)2), Yongjun Xu 1)2) and Xiaowei Li 1)2)

Broadcast Time Synchronization Algorithm for Wireless Sensor Networks Chaonong Xu 1)2)3), Lei Zhao 1)2), Yongjun Xu 1)2) and Xiaowei Li 1)2) Broadcast Tme Synchronzaton Algorthm for Wreless Sensor Networs Chaonong Xu )2)3), Le Zhao )2), Yongun Xu )2) and Xaowe L )2) ) Key Laboratory of Comuter Archtecture, Insttute of Comutng Technology Chnese

More information

CMPS 10 Introduction to Computer Science Lecture Notes

CMPS 10 Introduction to Computer Science Lecture Notes CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not

More information

Uncertainty operations with Statool. Jianzhong Zhang. A thesis submitted to the graduate faculty

Uncertainty operations with Statool. Jianzhong Zhang. A thesis submitted to the graduate faculty Uncertanty oeratons wth Statool by Janzhong Zhang A thess submtted to the graduate faculty n artal fulfllment of the requrements for the degree of MASTER OF SCIECE Maor: Comutng Engneerng Program of Study

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

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng

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

Human Action Recognition Using Discriminative Models in the Learned Hierarchical Manifold Space

Human Action Recognition Using Discriminative Models in the Learned Hierarchical Manifold Space Human Acton Recognton Usng Dscrmnatve Models n the Learned Herarchcal Manfold Sace Le Han, We Lang*, nxao Wu and Yunde Ja School of Comuter Scence and Technology, Beng Insttute of Technology 5 South Zhongguancun

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

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

Parallel matrix-vector multiplication

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

UNIT 2 : INEQUALITIES AND CONVEX SETS

UNIT 2 : INEQUALITIES AND CONVEX SETS UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces

More information

Semi-Supervised Biased Maximum Margin Analysis for Interactive Image Retrieval

Semi-Supervised Biased Maximum Margin Analysis for Interactive Image Retrieval IP-06850-00.R3 Sem-Suervsed Based Maxmum Margn Analyss for Interactve Image Retreval Lnng Zhang,, Student Member, IEEE, Lo Wang, Senor Member, IEEE and Wes Ln 3, Senor Member, IEEE School of Electrcal

More information

AP PHYSICS B 2008 SCORING GUIDELINES

AP PHYSICS B 2008 SCORING GUIDELINES AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for

More information

Color in OpenGL Polygonal Shading Light Source in OpenGL Material Properties Normal Vectors Phong model

Color in OpenGL Polygonal Shading Light Source in OpenGL Material Properties Normal Vectors Phong model Color n OpenGL Polygonal Shadng Lght Source n OpenGL Materal Propertes Normal Vectors Phong model 2 We know how to rasterze - Gven a 3D trangle and a 3D vewpont, we know whch pxels represent the trangle

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

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

K-means and Hierarchical Clustering

K-means and Hierarchical Clustering Note to other teachers and users of these sldes. Andrew would be delghted f you found ths source materal useful n gvng your own lectures. Feel free to use these sldes verbatm, or to modfy them to ft your

More information

y and the total sum of

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 information

Real-time Joint Tracking of a Hand Manipulating an Object from RGB-D Input

Real-time Joint Tracking of a Hand Manipulating an Object from RGB-D Input Real-tme Jont Tracng of a Hand Manpulatng an Object from RGB-D Input Srnath Srdhar 1 Franzsa Mueller 1 Mchael Zollhöfer 1 Dan Casas 1 Antt Oulasvrta 2 Chrstan Theobalt 1 1 Max Planc Insttute for Informatcs

More information

Hierarchical clustering for gene expression data analysis

Hierarchical clustering for gene expression data analysis Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally

More information

A Vision-based Facial Expression Recognition and Adaptation System from Video Stream

A Vision-based Facial Expression Recognition and Adaptation System from Video Stream Internatonal Journal of achne Learnng and Comutng, Vol. 2, No. 5, October 202 A Vson-based Facal Exresson Recognton and Adataton System from Vdeo Stream Nurul Ahad awhd, Nasr Uddn Laskar, and Hader Al

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

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

TEST-05 TOPIC: OPTICS COMPLETE

TEST-05 TOPIC: OPTICS COMPLETE Q. A boy s walkng under an nclned mrror at a constant velocty V m/s along the x-axs as shown n fgure. If the mrror s nclned at an angle wth the horzontal then what s the velocty of the mage? Y V sn + V

More information

Biostatistics 615/815

Biostatistics 615/815 The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts

More information

Calibrating a single camera. Odilon Redon, Cyclops, 1914

Calibrating a single camera. Odilon Redon, Cyclops, 1914 Calbratng a sngle camera Odlon Redon, Cclops, 94 Our goal: Recover o 3D structure Recover o structure rom one mage s nherentl ambguous??? Sngle-vew ambgut Sngle-vew ambgut Rashad Alakbarov shadow sculptures

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

Monte Carlo 1: Integration

Monte Carlo 1: Integration Monte Carlo : Integraton Prevous lecture: Analytcal llumnaton formula Ths lecture: Monte Carlo Integraton Revew random varables and probablty Samplng from dstrbutons Samplng from shapes Numercal calculaton

More information

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract 12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,

More information

Computer Graphics. Jeng-Sheng Yeh 葉正聖 Ming Chuan University (modified from Bing-Yu Chen s slides)

Computer Graphics. Jeng-Sheng Yeh 葉正聖 Ming Chuan University (modified from Bing-Yu Chen s slides) Computer Graphcs Jeng-Sheng Yeh 葉正聖 Mng Chuan Unversty (modfed from Bng-Yu Chen s sldes) llumnaton and Shadng llumnaton Models Shadng Models for Polygons Surface Detal Shadows Transparency Global llumnaton

More information

Fuzzy Multi Objective Transportation Model. Based on New Ranking Index on. Generalized LR Fuzzy Numbers

Fuzzy Multi Objective Transportation Model. Based on New Ranking Index on. Generalized LR Fuzzy Numbers Aled Mathematcal Scences, Vol 8, 4, no 8, 6849-6879 HIKARI Ltd, wwwm-hkarcom htt://dxdoorg/988/ams4486 Fuzzy Mult Obectve Transortaton Model Based on New Rankng Index on Generalzed LR Fuzzy Numbers Y L

More information

Application of Genetic Algorithms in Graph Theory and Optimization. Qiaoyan Yang, Qinghong Zeng

Application of Genetic Algorithms in Graph Theory and Optimization. Qiaoyan Yang, Qinghong Zeng 3rd Internatonal Conference on Materals Engneerng, Manufacturng Technology and Control (ICMEMTC 206) Alcaton of Genetc Algorthms n Grah Theory and Otmzaton Qaoyan Yang, Qnghong Zeng College of Mathematcs,

More information

Accelerating X-Ray data collection using Pyramid Beam ray casting geometries

Accelerating X-Ray data collection using Pyramid Beam ray casting geometries Acceleratng X-Ray data collecton usng Pyramd Beam ray castng geometres Amr Averbuch Guy Lfchtz Y. Shkolnsky 3 School of Computer Scence Department of Appled Mathematcs, School of Mathematcal Scences Tel

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

Visual Hull Rendering with Multi-view Stereo Refinement

Visual Hull Rendering with Multi-view Stereo Refinement Vsual Hull Renderng wth Mult-vew Stereo Refnement Yang Lu ynglu@ucdavs.edu George Chen george-qan.chen@st.com Nelson Max max@llnl.gov Chrstan Hofsetz chofsetz@ucdavs.edu Peter McGunness eter.mcgunness@st.com

More information

Smoothing Spline ANOVA for variable screening

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

A Robust Method for Estimating the Fundamental Matrix

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

Pictures at an Exhibition

Pictures at an Exhibition 1 Pctures at an Exhbton Stephane Kwan and Karen Zhu Department of Electrcal Engneerng Stanford Unversty, Stanford, CA 9405 Emal: {skwan1, kyzhu}@stanford.edu Abstract An mage processng algorthm s desgned

More information

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION?

S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? S.P.H. : A SOLUTION TO AVOID USING EROSION CRITERION? Célne GALLET ENSICA 1 place Emle Bloun 31056 TOULOUSE CEDEX e-mal :cgallet@ensca.fr Jean Luc LACOME DYNALIS Immeuble AEROPOLE - Bat 1 5, Avenue Albert

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

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

View-Dependent Multiresolution Representation for a Height Map

View-Dependent Multiresolution Representation for a Height Map Internatonal Journal of Innovaton, Management and echnology, Vol. 4, No. 1, February 013 Vew-Deendent Multresoluton Reresentaton for a Heght Ma Yong H. Chung, Won K. Hwam, Dae S. Chang, Jung-Ju Cho, and

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

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements

2x 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 information

Multilayer Neural Networks and Nearest Neighbor Classifier Performances for Image Annotation

Multilayer Neural Networks and Nearest Neighbor Classifier Performances for Image Annotation (IJACSA) Internatonal Journal of Advanced Comuter Scence and Alcatons, Vol. 3, No. 11, 01 Multlayer Neural Networs and Nearest Neghbor Classfer erformances for Image Annotaton Mustaha OUJAOURA Laboratory

More information

Analysis of Continuous Beams in General

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

An Image Fusion Approach Based on Segmentation Region

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

Computer models of motion: Iterative calculations

Computer models of motion: Iterative calculations Computer models o moton: Iteratve calculatons OBJECTIVES In ths actvty you wll learn how to: Create 3D box objects Update the poston o an object teratvely (repeatedly) to anmate ts moton Update the momentum

More information

Ontology based data warehouses federation management system

Ontology based data warehouses federation management system Ontolog based data warehouses federaton management sstem Naoual MOUHNI 1, Abderrafaa EL KALAY 2 1 Deartment of mathematcs and comuter scences, Unverst Cad Aad, Facult of scences and technologes Marrakesh,

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

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information