COLOUR IMAGE MATCHING FOR DTM GENERATION AND HOUSE EXTRACTION
|
|
- Conrad Garrison
- 6 years ago
- Views:
Transcription
1 Hee Ju Prk OLOUR IMAGE MATHING FOR DTM GENERATION AND HOUSE EXTRATION Hee Ju PARK, Petr ZINMMERMANN * Swiss Federl Institute of Technology, Zuric Switzerlnd Institute for Geodesy nd Photogrmmetry heeju@ns.shingu-c.c.kr petr@geod.ug.ethz.ch Technicl Session III- KEY WORDS: DTM/DEM/DSM, Imge mtching, Reconstruction, Urn Ojects ABSTRAT Imge mtching plys key role in utomtic DTM genertion nd house extrction. For the house extrction from lrge scle imgery, point mtching nd line mtching complement one nother: Line mtching gives the 3 dimensionl line informtion which supports house reconstruction t ridge lines or roof oundries; dense well distriuted point mtching results contriute to the surfce model genertion of the remining non-rekline regions. We propose new epipolr line eqution, which is determined y orienttion prmeters nd supports oth epipolr line serch nd epipolr imgery genertion. The proposed mtching process is divided into point mtching nd line mtching. To derive highly relile results in point mtching we include lunder suppression sed on the positionl reltionship etween possile corresponding point pirs. Line mtching is supported y the results of point mtching to reduce the numer of possile corresponding line pirs. Regrding similrity comprison for line mtching we use the line shpe, the flnking regions colour, informtion on positionl reltionship nd connectivity etween cndidtes for corresponding lines nd neighouring points nd lines. We tested the proposed method with smple dtset nd show the results. INTRODUTION Imge mtching plys key role in utomtic DTM genertion nd house extrction. Applictions on DTM genertion cn e found in mny current commercil digitl photogrmmetry worksttions, nd methods nd pplictions of house extrction cn e found in [Gruen et l, 997; Henricsson, 996]. For the extrction of houses from lrge scle imgery, oth point mtching nd line mtching re necessry: Line mtching gives the 3 dimensionl line informtion which is useful for oth for rekline detection nd house reconstruction; wheres dense well distriuted point mtching contriutes to the surfce model genertion of the remining non-rekline regions. Mny studies hve een mde relted to this issue, ut still there is generl roust method missing. The im of this study is to find mtching method focussing on this prticulr prolem. In this pper firstly we will descrie the new epipolr eqution with geometricl proof. Secondly we will descrie our study on new mtching method. Finlly the results of our mtching methodwill e descried nd discussed. PROPOSED EPIPOLAR LINE EQUATION Epipolr line geometry is one fundmentl principle in imge mtching domin [Pul R. Wolf, 984]. Within n overlpping imgery pir, the corresponding point of one point lies on the epipolr line which is corresponding to tht point. Here we suggest new epipolr line finding method. The sic principle of the epipolr line derivtion is the condition of coplnrity, the detils re s follows: Let there e couple of cmers which cpture n oject t the sme time. We cll one s left cmer with indices, nother s right cmer with indices. Let O, O e the left nd the right cmer centre. And Let P e point on the oject. By definition O, O, P re on the sme plne clled epipolr plne. Epipolr lines corresponding to P re defined y the intersections of the epipolr plne nd the imge plnes of the left nd right cmer. As the intersection of two plnes is lwys stright line, the resulting epipolr lines re stright lines nd there exist couple Interntionl Archives of Photogrmmetry nd Remote Sensing. Vol. XXXIII, Prt B3. Amsterdm. 697
2 Hee Ju Prk of epipolr line corresponding to P. Let p e point of the left imge corresponding to P. Let k e point on the epipolr line of the left cmer imge, k point on the epipolr line of the right cmer. Then O, O,P, k, k lie on the sme plne, which is clled coplnr condition. Therefore the vectors O O, O p, O k nd O k lie on the sme plne. Let B r e vector of seline, f e the cmer s focl length. Let R nd R e the rottion mtrices of the left cmer nd right cmer. Let the terrestril coordintes of O, O, e (X, Y, Z ), (X, Y,Z ). Let the photo coordintes of p, k, k e, y ) (x,, ( x, y ). (x, y) 3 R = 3, R 3 3 = Then, r B = ( Bx, By, Bz) = ( X X, Y Y, Z Z) () 3 O = ( X, Yp, Z ) = 3( x, y, f ) 3 3 () 3 O k = ( X, Y, Z) = 3( x, y, f ) 3 3 (3) 3 O k = ( X, Y, Z ) = 3( x, y, f ) 3 3 (4) Becuse the vectors B r, O p, O k stisfy the coplnr condition, B r ( O P Ok ) = Therefore, (5) Bx By Bz X Y Z = Bx( YZ Z Y ) + By( Z X X Z ) + Bz( X Y Y X ) = X Y Z (6) From (),(3),(6) { + { + { ( ByZ 3 ( ByZ ( ByZ BzY BzY BzY ) + ) + )) + ( BzY ( BzX 3 ( BzX BxZ p BxZ BxZ ) + ) + 3 ( BxY 3 ) + ( BxY ( BxY ByX ByX )} x ByX )} y )} f = (7) (7) is the epipolr line eqution on the left imge which is corresponding to the point p(x,y) of the left imge. This cn e represented s follows. Ax By + f = + (8) 698 Interntionl Archives of Photogrmmetry nd Remote Sensing. Vol. XXXIII, Prt B3. Amsterdm.
3 Hee Ju Prk A = B T Bz By Bz Bx By Bx xp yp f (9) The epipolr line eqution for the right imge which is corresponding to the point p on left imge is otined s follows: Becuse the vectors B r, p B r ( O P Ok ) = Therefore, O nd O k stisfy the coplnr condition, () Bx By Bz X Y Z = Bx( YZ Z Y ) + By( Z X X Z ) + Bz( X Y Y X ) = X Y Z () So we cn get the following epipolr line eqution for the right imge which corresponds s to p of the left imge. A x + B y + f = A = B T Bz By Bz Bx By Bx xp yp f () (3) When we use pixel coordintes, we hve to know the trnsformtion etween pixel coordintes nd photo coordintes. If we hve pixel coordinte (u, u ) of the left imge, we cn get (x, y ) y trnsformtion etween pixel coordintes nd photo coordintes. The epipolr line eqution (8) lwys psses two points f (, - ), f (-, ), nd lso B A the epipolr line eqution () lwys psses two points f (, - ), f (-, ). We cn get the pixel coordintes of these B A points y trnsformtion etween photo coordintes nd pixel coordintes. Then we cn get the epipolr line eqution represented in pixel coordintes. 3 PROPOSED MATHING METHOD The sic proceeding of the proposed method is composed of two seprte steps: in the first stge we pply point mtching, nd in the next stge we perform line mtching. The positions of mtched points re used s constrint to reduce the numer of possile line mtches. Additionlly we cn get the pproximte differences for ech colour chnnel etween corresponding regions in overlpping imges for the mtched point set. This serves s nother supporting constrint for line mtching. oncerning point mtching the similrity etween corresponding res ner the point is used s locl consistency check, nd the positionl reltion etween possile neighouring mtched points is used s glol consistency check. oncerning line mtching the similrity in shpe, the ngle of the lines, the flnking regions colour serve s locl consistency check, nd the reltion etween possile corresponding lines nd neighouring mtched points serve s glol consistency check. A scheme of the sic flow of the proposed mtching method is shown in Figure. 3. Point Mtching First we generte points for mtching y the Foerstner Interest Opertor [Foerstner et l, 987] for ech imge. As Interntionl Archives of Photogrmmetry nd Remote Sensing. Vol. XXXIII, Prt B3. Amsterdm. 699
4 Hee Ju Prk Figure. Bsic flow of proposed mtching method Figure. Neighouring points in point mtching threshold of Interest Vlue w which is relted with the contrst, we use positive vlue of w lim, for exmple w lim =.. We don t consider the vlue q which is relted with shpe. The reson of this is the line mtching of the next step. In literture mny methods for mtching etween Interest Points cn e found [Foerstner et l, 987;Zhng, 994]. One simple method is the correltion coefficients method. To increse the reliility of mtched points, we perform n dditionl check for the cse when the templte window nd serch window is reversed. If the result for ech point pir mtched is the sme for oth - norml cse nd reversed cse-, it is ccepted. This method is clled ck-mtching [Hnn 989]. To improve the reliility we ccept the cse when oth of the mtched points re Interest Points. Till this stge the mtching is performed with the imges gry vlues ecuse of etter performnce. Through the ove process we get possile mtched points sets. Then we check the correltion coefficients etween ech mtched point pir for ech RGB colour chnnel. If ny of correltion coefficients for ech colour chnnel is less thn.5, tht point pir is rejected. Till this process we check the locl similrity of res ner the points. 3. Blunder suppression to possile mtched point set Bsed only on the locl similrity comprison, voiding lunders is difficult. To solve this prolem we check the glol similrity etween possile corresponding point pir nd its neighouring possile corresponding point pirs. Let two points of possile corresponding pir e point nd point j. We ssume tht there is numer M of neighouring points ner the point nd point j. Suppose point m, nd its possile corresponding point n re ner the point nd point j s shown in Figure. The coordintes of point point point m, point n re ( i x, iy ), ( j x, j y ), ( m, m ),( ) x y n x, ny. We define mesure of Strength of Mtching SM for the pir of point point j s follows : exp( s( dx) / sdv( dx)) + mn ( m, n) + [( d( n)]/ SM = (4) + + [( d( n)]/ ( m, n) : correltion coefficient etween point j nd point j : correltion coefficient etween point m nd point n mn d ( d ( n) dx = ( ix mx ) ( jx nx ) : distnce etween point i nd it s neighouring point m : distnce etween point j nd it s neighouring point n 7 Interntionl Archives of Photogrmmetry nd Remote Sensing. Vol. XXXIII, Prt B3. Amsterdm.
5 Hee Ju Prk This definition hs empiricl chrcter. If the point pir reltion etween other point pirs is similr, SM will e reltively high. If the reltion is wek then SM will e smll compred to other point pirs. Point pirs whose SM is lower thn threshold re eliminted, for exmple the pirs with lowest 5% in SM vlue. 3.3 Line mtching If we cn reduce the numer of cndidte lines to e compred, we reduce the processing time nd increse the possiility of finding corresponding line pirs. In line mtching, firstly we reduce the numer of possile cndidte lines s descried in the following: If the reltion etween ny mtched point nd pir of lines on oth imge is reversed like Figure 5, this cse of line cn e discrded. One line hs two flnking regions see Figure 3. If pir of lines is corresponding, then t lest one flnking region of them is similr in ech colour chnnel. So line pirs without ny similr flnking regions cn e rejected. Becuse we cn know the positions of mny overlpping windows y mtched point sets in previous stge, we know the pproximte difference in ech RGB colour chnnel vlue for whole corresponding regions using the mtched points. We represent the differences s men nd stndrd devition for ech colour chnnel. We ssume tht the following cse rrely hppens for ech colour chnnel. dg E( dg) > 4* sdv( dg) dg: flnk region difference etween line i nd line j E (dg), sdv (dg) : men & stndrd devition of corresponding region difference (5) If oth flnking regions of line pir fulfill the ove cse, then we cn discrd such line pir in the comprison. We consider the line pirs which pss the test s two check points. In the next step we clculte the similrity coefficient for the overlpping prt etween the lines for the locl similrity comprison. There re mny possile definitions for this similrity coefficient. One simple definition is s follows. Suppose the coordintes of point on the line of imge i s ( x, y i i ), nd its corresponding point s ( x, y j j). Then y i = yj without ny rottion except through relief displcement in stereo epipolr imgery. The line similrity coefficient s cn e defined s (6) cov( x x j ) = W W s c n s s c x i x j W : weight for the numer of overlpping flnks. (e.g. W = when one of the line flnks is similr. And W n W =.5 when oth flnking regions re similr for every colour chnnel.) c : weight for the numer of overlpping points etween line i & i.e. the numer which hs sme y coordinte ech other etween line i & j. c This ove definition doesn t consider the effect due to slope in oject spce. This slope my e stright or curve. To simplify comprison, we suppose verge slope in height. Suppose there is ngle q due to verge slope like Figure 6. The igger verge slope in height is, the igger the ngleq is. Figure 3. Flnking region of line Figure 4. Neighouring points nd lines in line mtching Interntionl Archives of Photogrmmetry nd Remote Sensing. Vol. XXXIII, Prt B3. Amsterdm. 7
6 Hee Ju Prk imge imge Figure 5. Suspicious corresponding point nd line reltion Figure 6. Angle due to verge slope in height Insted ofx j we cn use x j which is modified y ngle q. The Angle q my e relted with relief displcement, nd lso my not e relted with relief displcement. So we define s follow s s = s x i cov( x x j) W s exp( q) x j And we reject the line in which the expression c W n (7) cov( x is less thn certin threshold, for exmple <.6., ) s s j exp( q) Furthermore we reject the pirs which hve less overlpping points thn threshold, for exmple <. Then we define the prmeter Strength of mtching SM for line pirs s follows. x i x i x j SM exp( s( dx) / sdv( dx)) shk w( k )) Wp ( + Wn )( s ) ( m, n ) [( d( d( n)]/ h k + [( d( h) k )]/ = + (8) + + [( d ( n)]/ + [( d( h) + d ( k )]/ ( m, n) (m,n): pir of mtched points k: neighouring possile cndidtes for corresponding lines ner line j Wp: weight for neighouring mtched point. For exmple Wp=7 : line shpe similrity coefficient etween line i nd line j s shk : line shpe similrity coefficient etween line h nd line k h k w ( is like co-opertive coefficient in [Gruen et l, 998], which is relted with the proility when possile corresponding pir ( j) nd its neighouring pir ( k) exist t the sme time. In this context we define it s follows. If the reltion etween h nd k is reversed, w ( j; ( = -. And if h is connected nd j is overlpping with oth i nd then w ( = And if k is connected nd i is overlpping with oth k then w ( =. And if h is connected nd k is connected then w ( =. Other cse exp( s ( dx )) w( = + [ d( h) k)] / If we hve set of strength of mtching prmeters { SM } for lines in the left imge, then we cn esily get nother set of strength of mtching prmeters { SM } for lines in the right imge. { SM } nd { SM } re symmetric. When we clculte SM, we only need to find symmetric vlue corresponding to ech SM in the list of { SM }, nd then ssign it. The next step is to find the mtching pir using { SM } nd { SM }. For ech i in SM we determine the pir which hs the highest Strength of Mtching vlue. One line cn hve two or more corresponding lines. So we choose ll possile pirs with highest SMs which re not overlpping ech other. We pply the sme process with { SM }. If 7 Interntionl Archives of Photogrmmetry nd Remote Sensing. Vol. XXXIII, Prt B3. Amsterdm.
7 Hee Ju Prk line pir is corresponding to nother, then it will hve high proility concerning{ SM } nd { SM }. So oth results re consistent, nd we select the pirs nd continue with nother set of pirs. We cll this { P }. Then we discrd P less thn threshold, for exmple the lowest 5%.We receive finl set of mtched line pirs. j j 4 RESULTS OF TEST AND DISUSSION We tested the proposed mtching strtegy with the Avenches dtset descried in [Mson et l, 994]. We checked the results y humn visul inspection with stereoscope. Figure 7 shows one exmple of our tests. We used the SE opertor [Heitger, 995] s edge detection opertor. Our epipolr imgery genertion using the proposed epipolr line eqution ws successful in ll cses. oncerning point mtching there ws no lunder mong 5 mtched point pirs when we set the msk size for the Foerstner Interest Opertor W=5. oncerning line mtching line pirs were mtched nd no lunder ws found. At lest pirs of lines re mtched for ech house. Generlly the ridge line ws mtched. The use of previous mtched point sets supported line mtching useful. Aville mtched points reduced the numer of cndidte line pir in comprison to the cse without previous mtched points. So fr the chnging topology prolem ws not solved though our method lthough there is no lunders in mtched line pirs. For exmple sometimes the roof line nd the ottom line re seen s one line on one imge, ut hs two seprted corresponding lines in n other view. In this cse it cn hppen tht the roof line is mtched to the ottom line or to the roof line. We need more studies to solve this remining prolem successfully. 5 ONLUSIONS In this pper we propose new method which is useful for imge mtching, for DTM genertion nd house extrction. The proposed new epipolr line eqution which is determined y orienttion prmeters is esy to implement nd useful for epipolr line serch nd epipolr imgery genertion. oncerning imge mtching two new ides were proposed. One is lunder suppression to mtched point pirs sed on positionl reltionship etween possile mtched point pirs in point mtching. The other one is the use of mtched point sets s constrints for line mtching in two wys - one to define position constrints nd the other to define colour similrity constrint for overlpping flnking regions. The mtching strtegy of comining line shpe, flnking region similrity, positionl nd connectivity reltionship etween corresponding lines nd corresponding points, corresponding lines nd its neighouring corresponding lines works firly well with our test dtset. But there is still prolem in solving the chnging topology cse. More thorough evlution for vrious imgery nd nd serch for solution for the chnging topology cse will e continued in future studies. REFERENES Foerstner, W., Guelc E., 987. A fst Opertor for Detection nd Precise Loction of Distinct Points, orners of irculr Fetures, Proc. of IFPDD, pp Gruen, A., Wng, X., Modeler: A topology genertor for 3-D city models, Interntionl Archives of Photogrmmetry nd Remote Sensing, Vol.3, Prt 4, pp Gruen, A, Bltsvis E., Henricsson, O., 997, Automtic Extrction of Mn-Mde Ojects from Aeril nd Spce Imges (II), Birkheuser Verlg, Bsel. Hnn M.J, 989. A System for Digitl Stereo Imge Mtching, PE & RS, Vol. 55, No., pp Heitger, F., 995. Feture Detection using Suppression nd Enhncement. Technicl Report TR-63, Imge Science L, ETH-Zuric Switzerlnd. Henricsson O., 996, Anlysis of Imge Structures using olor Attriutes nd Similrity Reltions, PhD Thesis No. 663, Swiss Federl Institute of Technology. Mson, S., Bltsvis M., Stllmn, D., 994. High Precision Photogrmmetric Dt Set for Building Reconstruction nd Terrin Modelling, Internl Report, Institute for Photogrmmetry nd Geodesy, ETH, Zurich. Interntionl Archives of Photogrmmetry nd Remote Sensing. Vol. XXXIII, Prt B3. Amsterdm. 73
8 Hee Ju Prk Wolf P. R., 984. Elements of Photogrmmetry, nd Edition, pp McGrw-Hill Book ompny. Zhng, Z., 994. A Roust Technique for Mtching Two Unclirted Imges Through the Recovery of the Unknown Epipolr Geometry, INRIA Rpport de recherche no. 73. () edge lines nd mtched points set () mtched lines (white line) Figure 7. Test results for Avench dtset 74 Interntionl Archives of Photogrmmetry nd Remote Sensing. Vol. XXXIII, Prt B3. Amsterdm.
GENERATING ORTHOIMAGES FOR CLOSE-RANGE OBJECTS BY AUTOMATICALLY DETECTING BREAKLINES
GENEATING OTHOIMAGES FO CLOSE-ANGE OBJECTS BY AUTOMATICALLY DETECTING BEAKLINES Efstrtios Stylinidis 1, Lzros Sechidis 1, Petros Ptis 1, Spiros Sptls 2 Aristotle University of Thessloniki 1 Deprtment of
More informationBefore We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):
Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters
More information2 Computing all Intersections of a Set of Segments Line Segment Intersection
15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design
More informationUSING HOUGH TRANSFORM IN LINE EXTRACTION
Stylinidis, Efstrtios USING HOUGH TRANSFORM IN LINE EXTRACTION Efstrtios STYLIANIDIS, Petros PATIAS The Aristotle University of Thessloniki, Deprtment of Cdstre Photogrmmetry nd Crtogrphy Univ. Box 473,
More information6.3 Volumes. Just as area is always positive, so is volume and our attitudes towards finding it.
6.3 Volumes Just s re is lwys positive, so is volume nd our ttitudes towrds finding it. Let s review how to find the volume of regulr geometric prism, tht is, 3-dimensionl oject with two regulr fces seprted
More informationClass-XI Mathematics Conic Sections Chapter-11 Chapter Notes Key Concepts
Clss-XI Mthemtics Conic Sections Chpter-11 Chpter Notes Key Concepts 1. Let be fixed verticl line nd m be nother line intersecting it t fixed point V nd inclined to it t nd ngle On rotting the line m round
More informationIf you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.
Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online
More informationMA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork
MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html
More informationLecture 10 Evolutionary Computation: Evolution strategies and genetic programming
Lecture 10 Evolutionry Computtion: Evolution strtegies nd genetic progrmming Evolution strtegies Genetic progrmming Summry Negnevitsky, Person Eduction, 2011 1 Evolution Strtegies Another pproch to simulting
More informationP(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have
Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using
More informationComplete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li
2nd Interntionl Conference on Electronic & Mechnicl Engineering nd Informtion Technology (EMEIT-212) Complete Coverge Pth Plnning of Mobile Robot Bsed on Dynmic Progrmming Algorithm Peng Zhou, Zhong-min
More information4-1 NAME DATE PERIOD. Study Guide. Parallel Lines and Planes P Q, O Q. Sample answers: A J, A F, and D E
4-1 NAME DATE PERIOD Pges 142 147 Prllel Lines nd Plnes When plnes do not intersect, they re sid to e prllel. Also, when lines in the sme plne do not intersect, they re prllel. But when lines re not in
More informationOn the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis
On the Detection of Step Edges in Algorithms Bsed on Grdient Vector Anlysis A. Lrr6, E. Montseny Computer Engineering Dept. Universitt Rovir i Virgili Crreter de Slou sin 43006 Trrgon, Spin Emil: lrre@etse.urv.es
More informationA Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards
A Tutology Checker loosely relted to Stålmrck s Algorithm y Mrtin Richrds mr@cl.cm.c.uk http://www.cl.cm.c.uk/users/mr/ University Computer Lortory New Museum Site Pemroke Street Cmridge, CB2 3QG Mrtin
More informationCOMP 423 lecture 11 Jan. 28, 2008
COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring
More informationDr. D.M. Akbar Hussain
Dr. D.M. Akr Hussin Lexicl Anlysis. Bsic Ide: Red the source code nd generte tokens, it is similr wht humns will do to red in; just tking on the input nd reking it down in pieces. Ech token is sequence
More informationStained Glass Design. Teaching Goals:
Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to
More informationCS143 Handout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexical Analysis
CS143 Hndout 07 Summer 2011 June 24 th, 2011 Written Set 1: Lexicl Anlysis In this first written ssignment, you'll get the chnce to ply round with the vrious constructions tht come up when doing lexicl
More informationTries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries
Tries Yufei To KAIST April 9, 2013 Y. To, April 9, 2013 Tries In this lecture, we will discuss the following exct mtching prolem on strings. Prolem Let S e set of strings, ech of which hs unique integer
More informationAn Expressive Hybrid Model for the Composition of Cardinal Directions
An Expressive Hyrid Model for the Composition of Crdinl Directions Ah Lin Kor nd Brndon Bennett School of Computing, University of Leeds, Leeds LS2 9JT, UK e-mil:{lin,brndon}@comp.leeds.c.uk Astrct In
More informationSection 10.4 Hyperbolas
66 Section 10.4 Hyperbols Objective : Definition of hyperbol & hyperbols centered t (0, 0). The third type of conic we will study is the hyperbol. It is defined in the sme mnner tht we defined the prbol
More informationEfficient K-NN Search in Polyphonic Music Databases Using a Lower Bounding Mechanism
Efficient K-NN Serch in Polyphonic Music Dtses Using Lower Bounding Mechnism Ning-Hn Liu Deprtment of Computer Science Ntionl Tsing Hu University Hsinchu,Tiwn 300, R.O.C 886-3-575679 nhliou@yhoo.com.tw
More informationSlides for Data Mining by I. H. Witten and E. Frank
Slides for Dt Mining y I. H. Witten nd E. Frnk Simplicity first Simple lgorithms often work very well! There re mny kinds of simple structure, eg: One ttriute does ll the work All ttriutes contriute eqully
More information10.5 Graphing Quadratic Functions
0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions
More informationSemi-Automatic Technique for 3D Building Model Generation
Ngw El-ASHMAWY, Egypt Key words: DTM, DSM, 3D Building Model, Phoogrmmetry, Remote Sensing. SUMMARY Three Dimensionl Building models re excessively used in vrious pplictions. Digitl Surfce Model is the
More informationL. Yaroslavsky. Fundamentals of Digital Image Processing. Course
L. Yroslvsky. Fundmentls of Digitl Imge Processing. Course 0555.330 Lecture. Imge enhncement.. Imge enhncement s n imge processing tsk. Clssifiction of imge enhncement methods Imge enhncement is processing
More informationsuch that the S i cover S, or equivalently S
MATH 55 Triple Integrls Fll 16 1. Definition Given solid in spce, prtition of consists of finite set of solis = { 1,, n } such tht the i cover, or equivlently n i. Furthermore, for ech i, intersects i
More informationPresentation Martin Randers
Presenttion Mrtin Rnders Outline Introduction Algorithms Implementtion nd experiments Memory consumption Summry Introduction Introduction Evolution of species cn e modelled in trees Trees consist of nodes
More informationMTH 146 Conics Supplement
105- Review of Conics MTH 146 Conics Supplement In this section we review conics If ou ne more detils thn re present in the notes, r through section 105 of the ook Definition: A prol is the set of points
More information1.5 Extrema and the Mean Value Theorem
.5 Extrem nd the Men Vlue Theorem.5. Mximum nd Minimum Vlues Definition.5. (Glol Mximum). Let f : D! R e function with domin D. Then f hs n glol mximum vlue t point c, iff(c) f(x) for ll x D. The vlue
More informationChinese Academy of Surveying and Mapping, Beijing , China - - (zhangjx, b
SEMI-AUTOMATIC EXTRACTION OF RIBBON ROADS FORM HIGH RESOLUTION REMOTELY SENSED IMAGERY BY COOPERATION BETWEEN ANGULAR TEXTURE SIGNATURE AND TEMPLATE MATCHING X. G. Lin,,, J. X. Zhng, Z. J. Liu, J. Shen
More informationComputer Vision and Image Understanding
Computer Vision nd Imge Understnding 116 (2012) 25 37 Contents lists ville t SciVerse ScienceDirect Computer Vision nd Imge Understnding journl homepge: www.elsevier.com/locte/cviu A systemtic pproch for
More informationInternational Conference on Mechanics, Materials and Structural Engineering (ICMMSE 2016)
\ Interntionl Conference on Mechnics, Mterils nd tructurl Engineering (ICMME 2016) Reserch on the Method to Clibrte tructure Prmeters of Line tructured Light Vision ensor Mingng Niu1,, Kngnin Zho1, b,
More informationFig.25: the Role of LEX
The Lnguge for Specifying Lexicl Anlyzer We shll now study how to uild lexicl nlyzer from specifiction of tokens in the form of list of regulr expressions The discussion centers round the design of n existing
More informationII. THE ALGORITHM. A. Depth Map Processing
Lerning Plnr Geometric Scene Context Using Stereo Vision Pul G. Bumstrck, Bryn D. Brudevold, nd Pul D. Reynolds {pbumstrck,brynb,pulr2}@stnford.edu CS229 Finl Project Report December 15, 2006 Abstrct A
More information1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)
Numbers nd Opertions, Algebr, nd Functions 45. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) In sequence of terms involving eponentil growth, which the testing service lso clls geometric
More informationa < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1
Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the
More informationObject and image indexing based on region connection calculus and oriented matroid theory
Discrete Applied Mthemtics 147 (2005) 345 361 www.elsevier.com/locte/dm Oject nd imge indexing sed on region connection clculus nd oriented mtroid theory Ernesto Stffetti, Antoni Gru, Frncesc Serrtos c,
More informationSpectral Analysis of MCDF Operations in Image Processing
Spectrl Anlysis of MCDF Opertions in Imge Processing ZHIQIANG MA 1,2 WANWU GUO 3 1 School of Computer Science, Northest Norml University Chngchun, Jilin, Chin 2 Deprtment of Computer Science, JilinUniversity
More informationCHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE
CHAPTER III IMAGE DEWARPING (CALIBRATION) PROCEDURE 3.1 Scheimpflug Configurtion nd Perspective Distortion Scheimpflug criterion were found out to be the best lyout configurtion for Stereoscopic PIV, becuse
More informationIn the last lecture, we discussed how valid tokens may be specified by regular expressions.
LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.
More informationGeometric transformations
Geometric trnsformtions Computer Grphics Some slides re bsed on Shy Shlom slides from TAU mn n n m m T A,,,,,, 2 1 2 22 12 1 21 11 Rows become columns nd columns become rows nm n n m m A,,,,,, 1 1 2 22
More informationText mining: bag of words representation and beyond it
Text mining: bg of words representtion nd beyond it Jsmink Dobš Fculty of Orgniztion nd Informtics University of Zgreb 1 Outline Definition of text mining Vector spce model or Bg of words representtion
More information15. 3D-Reconstruction from Vanishing Points
15. 3D-Reconstruction from Vnishing Points Christin B.U. Perwss 1 nd Jon Lseny 2 1 Cvendish Lortory, Cmridge 2 C. U. Engineering Deprtment, Cmridge 15.1 Introduction 3D-reconstruction is currently n ctive
More informationDigital approximation to extended depth of field in no telecentric imaging systems
Journl of Physics: Conference Series Digitl pproximtion to extended depth of field in no telecentric imging systems To cite this rticle: J E Meneses nd C R Contrers 0 J Phys: Conf Ser 74 0040 View the
More informationMATH 25 CLASS 5 NOTES, SEP
MATH 25 CLASS 5 NOTES, SEP 30 2011 Contents 1. A brief diversion: reltively prime numbers 1 2. Lest common multiples 3 3. Finding ll solutions to x + by = c 4 Quick links to definitions/theorems Euclid
More informationAlgorithm Design (5) Text Search
Algorithm Design (5) Text Serch Tkshi Chikym School of Engineering The University of Tokyo Text Serch Find sustring tht mtches the given key string in text dt of lrge mount Key string: chr x[m] Text Dt:
More informationRay surface intersections
Ry surfce intersections Some primitives Finite primitives: polygons spheres, cylinders, cones prts of generl qudrics Infinite primitives: plnes infinite cylinders nd cones generl qudrics A finite primitive
More informationHyperbolas. Definition of Hyperbola
CHAT Pre-Clculus Hyperols The third type of conic is clled hyperol. For n ellipse, the sum of the distnces from the foci nd point on the ellipse is fixed numer. For hyperol, the difference of the distnces
More informationZZ - Advanced Math Review 2017
ZZ - Advnced Mth Review Mtrix Multipliction Given! nd! find the sum of the elements of the product BA First, rewrite the mtrices in the correct order to multiply The product is BA hs order x since B is
More information50 AMC LECTURES Lecture 2 Analytic Geometry Distance and Lines. can be calculated by the following formula:
5 AMC LECTURES Lecture Anlytic Geometry Distnce nd Lines BASIC KNOWLEDGE. Distnce formul The distnce (d) between two points P ( x, y) nd P ( x, y) cn be clculted by the following formul: d ( x y () x )
More informationCompression Outline :Algorithms in the Real World. Lempel-Ziv Algorithms. LZ77: Sliding Window Lempel-Ziv
Compression Outline 15-853:Algorithms in the Rel World Dt Compression III Introduction: Lossy vs. Lossless, Benchmrks, Informtion Theory: Entropy, etc. Proility Coding: Huffmn + Arithmetic Coding Applictions
More informationMath 35 Review Sheet, Spring 2014
Mth 35 Review heet, pring 2014 For the finl exm, do ny 12 of the 15 questions in 3 hours. They re worth 8 points ech, mking 96, with 4 more points for netness! Put ll your work nd nswers in the provided
More informationA dual of the rectangle-segmentation problem for binary matrices
A dul of the rectngle-segmenttion prolem for inry mtrices Thoms Klinowski Astrct We consider the prolem to decompose inry mtrix into smll numer of inry mtrices whose -entries form rectngle. We show tht
More informationINTRODUCTION TO SIMPLICIAL COMPLEXES
INTRODUCTION TO SIMPLICIAL COMPLEXES CASEY KELLEHER AND ALESSANDRA PANTANO 0.1. Introduction. In this ctivity set we re going to introduce notion from Algebric Topology clled simplicil homology. The min
More informationLecture 4 Single View Metrology
Lecture 4 Single View Metrology Professor Silvio Svrese Computtionl Vision nd Geometry Lb Silvio Svrese Lecture 4-4-Jn-5 Lecture 4 Single View Metrology Review clibrtion nd 2D trnsformtions Vnishing points
More informationF. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997.
Forced convex n-gons in the plne F. R. K. Chung y University ofpennsylvni Phildelphi, Pennsylvni 19104 R. L. Grhm AT&T Ls - Reserch Murry Hill, New Jersey 07974 Mrch 2,1997 Astrct In seminl pper from 1935,
More informationWhat are suffix trees?
Suffix Trees 1 Wht re suffix trees? Allow lgorithm designers to store very lrge mount of informtion out strings while still keeping within liner spce Allow users to serch for new strings in the originl
More informationChapter 2 Sensitivity Analysis: Differential Calculus of Models
Chpter 2 Sensitivity Anlysis: Differentil Clculus of Models Abstrct Models in remote sensing nd in science nd engineering, in generl re, essentilly, functions of discrete model input prmeters, nd/or functionls
More informationTopological Queries on Graph-structured XML Data: Models and Implementations
Topologicl Queries on Grph-structured XML Dt: Models nd Implementtions Hongzhi Wng, Jinzhong Li, nd Jizhou Luo Astrct In mny pplictions, dt is in grph structure, which cn e nturlly represented s grph-structured
More informationDefinition of Regular Expression
Definition of Regulr Expression After the definition of the string nd lnguges, we re redy to descrie regulr expressions, the nottion we shll use to define the clss of lnguges known s regulr sets. Recll
More informationTopic 3: 2D Transformations 9/10/2016. Today s Topics. Transformations. Lets start out simple. Points as Homogeneous 2D Point Coords
Tody s Topics 3. Trnsformtions in 2D 4. Coordinte-free geometry 5. (curves & surfces) Topic 3: 2D Trnsformtions 6. Trnsformtions in 3D Simple Trnsformtions Homogeneous coordintes Homogeneous 2D trnsformtions
More informationAgilent Mass Hunter Software
Agilent Mss Hunter Softwre Quick Strt Guide Use this guide to get strted with the Mss Hunter softwre. Wht is Mss Hunter Softwre? Mss Hunter is n integrl prt of Agilent TOF softwre (version A.02.00). Mss
More informationUnit #9 : Definite Integral Properties, Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationUNIT 11. Query Optimization
UNIT Query Optimiztion Contents Introduction to Query Optimiztion 2 The Optimiztion Process: An Overview 3 Optimiztion in System R 4 Optimiztion in INGRES 5 Implementing the Join Opertors Wei-Png Yng,
More informationGrade 7/8 Math Circles Geometric Arithmetic October 31, 2012
Fculty of Mthemtics Wterloo, Ontrio N2L 3G1 Grde 7/8 Mth Circles Geometric Arithmetic Octoer 31, 2012 Centre for Eduction in Mthemtics nd Computing Ancient Greece hs given irth to some of the most importnt
More informationCS311H: Discrete Mathematics. Graph Theory IV. A Non-planar Graph. Regions of a Planar Graph. Euler s Formula. Instructor: Işıl Dillig
CS311H: Discrete Mthemtics Grph Theory IV Instructor: Işıl Dillig Instructor: Işıl Dillig, CS311H: Discrete Mthemtics Grph Theory IV 1/25 A Non-plnr Grph Regions of Plnr Grph The plnr representtion of
More information4452 Mathematical Modeling Lecture 4: Lagrange Multipliers
Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl
More informationMachine vision system for surface inspection on brushed industrial parts.
Mchine vision system for surfce inspection on rushed industril prts. Nicols Bonnot, Rlph Seulin, Frederic Merienne Lortoire Le2i, CNRS UMR 5158, University of Burgundy, Le Creusot, Frnce. ABSTRACT This
More informationA multiview 3D modeling system based on stereo vision techniques
Mchine Vision nd Applictions (2005) 16: 148 156 Digitl Oject Identifier (DOI) 10.1007/s00138-004-0165-2 Mchine Vision nd Applictions A multiview 3D modeling system sed on stereo vision techniques Soon-Yong
More informationAnalysis of Computed Diffraction Pattern Diagram for Measuring Yarn Twist Angle
Textiles nd Light ndustril Science nd Technology (TLST) Volume 3, 2014 DO: 10.14355/tlist.2014.0301.01 http://www.tlist-journl.org Anlysis of Computed Diffrction Pttern Digrm for Mesuring Yrn Twist Angle
More informationFig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.
Answer on Question #5692, Physics, Optics Stte slient fetures of single slit Frunhofer diffrction pttern. The slit is verticl nd illuminted by point source. Also, obtin n expression for intensity distribution
More informationAlignment of Long Sequences. BMI/CS Spring 2012 Colin Dewey
Alignment of Long Sequences BMI/CS 776 www.biostt.wisc.edu/bmi776/ Spring 2012 Colin Dewey cdewey@biostt.wisc.edu Gols for Lecture the key concepts to understnd re the following how lrge-scle lignment
More informationTopics in Analytic Geometry
Nme Chpter 10 Topics in Anltic Geometr Section 10.1 Lines Objective: In this lesson ou lerned how to find the inclintion of line, the ngle between two lines, nd the distnce between point nd line. Importnt
More informationLily Yen and Mogens Hansen
SKOLID / SKOLID No. 8 Lily Yen nd Mogens Hnsen Skolid hs joined Mthemticl Myhem which is eing reformtted s stnd-lone mthemtics journl for high school students. Solutions to prolems tht ppered in the lst
More informationLecture 7: Integration Techniques
Lecture 7: Integrtion Techniques Antiderivtives nd Indefinite Integrls. In differentil clculus, we were interested in the derivtive of given rel-vlued function, whether it ws lgeric, eponentil or logrithmic.
More informationApproximation of Two-Dimensional Rectangle Packing
pproximtion of Two-imensionl Rectngle Pcking Pinhong hen, Yn hen, Mudit Goel, Freddy Mng S70 Project Report, Spring 1999. My 18, 1999 1 Introduction 1-d in pcking nd -d in pcking re clssic NP-complete
More informationThe Interdeciplinary Center Herzliya Technical Report CS-TR
The Interdeciplinry Center Herzliy Technicl Report CS-TR-2002-01 Recovering Epipolr Geometry from Imges of Smooth Surfces Yel Moses nd Iln Shimshoni Computer Science Deprtment The Interdisciplinry Center
More informationCS321 Languages and Compiler Design I. Winter 2012 Lecture 5
CS321 Lnguges nd Compiler Design I Winter 2012 Lecture 5 1 FINITE AUTOMATA A non-deterministic finite utomton (NFA) consists of: An input lphet Σ, e.g. Σ =,. A set of sttes S, e.g. S = {1, 3, 5, 7, 11,
More informationFrom Dependencies to Evaluation Strategies
From Dependencies to Evlution Strtegies Possile strtegies: 1 let the user define the evlution order 2 utomtic strtegy sed on the dependencies: use locl dependencies to determine which ttriutes to compute
More informationThe Greedy Method. The Greedy Method
Lists nd Itertors /8/26 Presenttion for use with the textook, Algorithm Design nd Applictions, y M. T. Goodrich nd R. Tmssi, Wiley, 25 The Greedy Method The Greedy Method The greedy method is generl lgorithm
More informationTilt-Sensing with Kionix MEMS Accelerometers
Tilt-Sensing with Kionix MEMS Accelerometers Introduction Tilt/Inclintion sensing is common ppliction for low-g ccelerometers. This ppliction note describes how to use Kionix MEMS low-g ccelerometers to
More informationChapter44. Polygons and solids. Contents: A Polygons B Triangles C Quadrilaterals D Solids E Constructing solids
Chpter44 Polygons nd solids Contents: A Polygons B Tringles C Qudrilterls D Solids E Constructing solids 74 POLYGONS AND SOLIDS (Chpter 4) Opening prolem Things to think out: c Wht different shpes cn you
More informationCS412/413. Introduction to Compilers Tim Teitelbaum. Lecture 4: Lexical Analyzers 28 Jan 08
CS412/413 Introduction to Compilers Tim Teitelum Lecture 4: Lexicl Anlyzers 28 Jn 08 Outline DFA stte minimiztion Lexicl nlyzers Automting lexicl nlysis Jlex lexicl nlyzer genertor CS 412/413 Spring 2008
More informationLexical Analysis: Constructing a Scanner from Regular Expressions
Lexicl Anlysis: Constructing Scnner from Regulr Expressions Gol Show how to construct FA to recognize ny RE This Lecture Convert RE to n nondeterministic finite utomton (NFA) Use Thompson s construction
More informationPointwise convergence need not behave well with respect to standard properties such as continuity.
Chpter 3 Uniform Convergence Lecture 9 Sequences of functions re of gret importnce in mny res of pure nd pplied mthemtics, nd their properties cn often be studied in the context of metric spces, s in Exmples
More informationSection 9.2 Hyperbolas
Section 9. Hperols 597 Section 9. Hperols In the lst section, we lerned tht plnets hve pproimtel ellipticl orits round the sun. When n oject like comet is moving quickl, it is le to escpe the grvittionl
More informationLecture 7: Building 3D Models (Part 1) Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)
Computer Grphics (CS 4731) Lecture 7: Building 3D Models (Prt 1) Prof Emmnuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) Stndrd d Unit itvectors Define y i j 1,0,0 0,1,0 k i k 0,0,1
More informationON THE DEHN COMPLEX OF VIRTUAL LINKS
ON THE DEHN COMPLEX OF VIRTUAL LINKS RACHEL BYRD, JENS HARLANDER Astrct. A virtul link comes with vriety of link complements. This rticle is concerned with the Dehn spce, pseudo mnifold with oundry, nd
More informationEfficient Rerouting Algorithms for Congestion Mitigation
2009 IEEE Computer Society Annul Symposium on VLSI Efficient Rerouting Algorithms for Congestion Mitigtion M. A. R. Chudhry*, Z. Asd, A. Sprintson, nd J. Hu Deprtment of Electricl nd Computer Engineering
More informationMobile IP route optimization method for a carrier-scale IP network
Moile IP route optimiztion method for crrier-scle IP network Tkeshi Ihr, Hiroyuki Ohnishi, nd Ysushi Tkgi NTT Network Service Systems Lortories 3-9-11 Midori-cho, Musshino-shi, Tokyo 180-8585, Jpn Phone:
More informationAn Effective Thresholding Technique for Otsu s Method using Contrast Enhancement 1 A Sankar Reddy, 2 C Usha Rani, 3 M. Sudhakar
www.ijecs.in Interntionl Journl Of Engineering And Computer Science ISSN:39-74 Volume 6 Issue 8 August 07, Pge No. 96-304 Index Copernicus vlue (05): 58.0 DOI: 0.8535/ijecs/v6i8. An Effective Thresholding
More informationHere is an example where angles with a common arm and vertex overlap. Name all the obtuse angles adjacent to
djcent tht do not overlp shre n rm from the sme vertex point re clled djcent ngles. me the djcent cute ngles in this digrm rm is shred y + + me vertex point for + + + is djcent to + djcent simply mens
More informationIntroduction to Integration
Introduction to Integrtion Definite integrls of piecewise constnt functions A constnt function is function of the form Integrtion is two things t the sme time: A form of summtion. The opposite of differentition.
More informationcisc1110 fall 2010 lecture VI.2 call by value function parameters another call by value example:
cisc1110 fll 2010 lecture VI.2 cll y vlue function prmeters more on functions more on cll y vlue nd cll y reference pssing strings to functions returning strings from functions vrile scope glol vriles
More informationIMAGE QUALITY OPTIMIZATION BASED ON WAVELET FILTER DESIGN AND WAVELET DECOMPOSITION IN JPEG2000. Do Quan and Yo-Sung Ho
IMAGE QUALITY OPTIMIZATIO BASED O WAVELET FILTER DESIG AD WAVELET DECOMPOSITIO I JPEG2000 Do Qun nd Yo-Sung Ho School of Informtion & Mechtronics Gwngju Institute of Science nd Technology (GIST) 26 Cheomdn-gwgiro
More information3.5.1 Single slit diffraction
3..1 Single slit diffrction ves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. e will consider this lter. Tke
More informationShape Representation and Indexing Based on Region Connection Calculus and Oriented Matroid Theory
Shpe Representtion nd Indexing Bsed on Region Connection Clculus nd Oriented Mtroid Theory Ernesto Stffetti 1, Antoni Gru 2, Frncesc Serrtos 3, nd Alerto Snfeliu 1 1 Institute of Industril Rootics (CSIC-UPC)
More informationIf f(x, y) is a surface that lies above r(t), we can think about the area between the surface and the curve.
Line Integrls The ide of line integrl is very similr to tht of single integrls. If the function f(x) is bove the x-xis on the intervl [, b], then the integrl of f(x) over [, b] is the re under f over the
More informationTree Structured Symmetrical Systems of Linear Equations and their Graphical Solution
Proceedings of the World Congress on Engineering nd Computer Science 4 Vol I WCECS 4, -4 October, 4, Sn Frncisco, USA Tree Structured Symmetricl Systems of Liner Equtions nd their Grphicl Solution Jime
More information