GLOBAL REGISTRATION OF NON STATIC 3D LIDAR POINT CLOUDS: SVD FACTORISATION AND ROBUST GPA METHODS
|
|
- Ann Juliana Barber
- 5 years ago
- Views:
Transcription
1 GLOBAL REGISRAION OF NON SAIC 3D LIDAR POIN CLOUDS: SVD FACORISAION AND ROBUS GPA EHODS Fabo Croslla*, Alberto Benat Unversty of Udne, Dp d Georsorse e errtoro, Va Cotonfco 4, I-33 UDINE (Italy) fabo.croslla@unud.t, alberto.benat@unud.t KEY WORD: Regstraton, Non statc confguraton, LDAR, SVD factorsaton, Robust generalsed Procrustes analyss ABSRAC: he paper reports two analytcal methods capable to relably perform the smultaneous global regstraton of non statc 3D LDAR pont clouds, and nvestgates ther applcablty by analysng the results of some prelmnary numercal examples. he frst method, proposed by Xao (5), and Xao et al. (6), apply a drect SVD factorsaton to non statc 3D fully overlappng pont clouds charactersed by target ponts. he factorsaton s appled to a matrx, sequentally contanng by rows the coordnates of the correspondng targets present n the cloud scenes. Besdes the rgd transformaton parameters, a number of shape bases s determned for each pont cloud, whose lnear combnaton descrbes the dynamc component of the scenes. A lnear closed-form soluton s fnally obtaned, enforcng lnear constrants on orthonormalty of the rgd rotatons and on unqueness of the lnear bases. he second method analysed s the so called Robust Generalsed Procrustes Analyss, recently proposed by the authors. o overcome the lac of robustness of Generalsed Procrustes Analyss, a progressve sequence nspred to the forward search was developed. Startng from an ntal partal pont cloud confguraton satsfyng the LS prncple, the confguraton s updated, pont by pont, tll a sgnfcant varaton of the regstraton parameters occur. hs reveals the presence of non statonary ponts among the new elements ust nserted, that are therefore not ncluded n the regstraton process. Both methods are capable to correctly determne the regstraton parameters, when compared to the commonly appled two steps method, where the regstraton of deformable shapes s based by non - rgd deformaton components.. INRODUCION In some papers publshed a few years ago (e.g. Benat and Croslla, ), the authors proposed the Generalsed Procrustes Analyss to perform a hgh precson smultaneous regstraton of multple partally overlappng 3D pont clouds acqured wth terrestral laser scannng devces. he proposed technque requres for each pont cloud the matchng of a suffcent number of artfcal targets, eventually pre-sgnalsed on the obect surface to survey. Furthermore, the same authors have recently proposed (Benat, Croslla, Sepc, 6) an automatc regstraton technque that does not requre any manual matchng of the target ponts, but that nstead uses the morphologcal or the radometrc local varatons on the surveyed surface. he method, by studyng the dfferental propertes of the sampled pont surface, computes at frst the local values of the Gaussan curvature, then apples a topologcal research to defne for each pont cloud the correspondng zones charactersed by the same curvature values. By applyng an SVD algorthm, t s possble to automatcally solve a coarse regstraton followed by an Iteratve Closest Pont (ICP) global refnement. Both regstraton approaches can be correctly appled f the obect does not change ts shape durng the survey of the complete sequence of pont clouds. hat s, the regstraton problem conssts n the defnton of the correct smlarty transformaton parameters for each pont cloud. On the other hand, regstraton and modellng of dynamc pont cloud scenes s a promnent problem for robot navgaton, for reconstructon of deformable obects, and for montorng envronmental phenomena. he recovery of the resultng shapes can be regarded as a combnaton of rgd smlarty transformatons of the 3D pont clouds and unnown non - rgd deformatons. In the lterature (e.g. Dryden and arda, 999), the problems soluton s usually carred out n two consecutve steps. he frst step regsters the pont clouds by smlarty transformaton, consderng the deformable shapes as contamnated by Gaussan nose. he second step determnes the lnear deformable model of the regstered shapes by applyng Prncpal Component Analyss (PCA) to the regstraton resduals. Proceedng n ths way, the regstraton of deformable shapes s based by non - rgd deformaton components. It s therefore necessary to apply some procedures that mae possble to relably estmate the roto-translaton components, and the deformable shapes. he paper synthetcally descrbes two methods recently proposed n the lterature, and analyses the results obtaned for the regstraton of a 3D scene charactersed by statc and dynamc elements. he frst method, ntroduced by Xao (5), solves the combned problem of regstraton and dynamc shape modellng by a drect factorsaton of the ponts coordnate matrx, contanng by rows for each acqured scene the 3D sampled model pont coordnates. he method wors well when the dynamc obect shape can be descrbed by a lnear combnaton of a small number of shape bases, that, together wth the smlarty transformaton parameters for each cloud, are the unnown elements of the ont regstraton and shape modellng problem. he second method proposed (Croslla, Benat; 6) represents a robust soluton of the Generalsed Procrustes problem. he descrbed algorthm derves from the Robust Regresson Analyss based on the Iteratve Forward Search approach proposed by Atnson and Ran (), and Cerol and Ran. he procedure starts from a partal pont confguraton only contanng statonary ponts. At each teraton, the transformaton parameters are determned, and the ntal dataset s enlarged by one or more new ponts, tll a sgnfcant varaton of the transformaton parameters occur. At ths pont the method allows to dentfy n the varous confguratons the remanng non statonary ponts that represent the dynamc component of the scene.
2 . JOIN REGISRAION AND SHAPE ODELING BY SVD FACORISAION he method proposed by Xao (5) and Xao et al. (6) s based on the fact that the shape S of a deformng obect, or of a non statc scene at epoch ( = N), can be modelled as a lnear combnaton of shape bases B (= K). Each bass s a (D P) matrx, where D s the space coordnate dmenson and P s the number of the ponts. Accordng to these postons, we can wrte that: K S = l B = where l s a coeffcent to apply to the B bass n order to defne the shape S at epoch. Of course, every shape S can be measured from a dfferent pont of vew, (eventually) wth a dfferent scale, and the coordnates of each shape model may be defned wth respect to a dfferent coordnate system. herefore, the measured shape W can be consdered as a smlarty transformaton of the shape S, that s number of shape bases requred to descrbe the shape varaton model. In fact, f ran(w)=dk, than K=ran(W)/D. Furthermore, the SVD of W allows to obtan at frst a (DN DK) matrx %, and a (DK P) matrx B %. atrces and B, contanng the unnown terms of the problem reported n Equaton, can be determned by applyng a further unnown lnear correctve transformaton (DK DK) matrx G to the matrces % and B %, that s = G % n order to satsfy: % % W = GG B= B B= G B % (4) atrx G can be parttoned nto the followng K sub-matrces of sze (DK D): G = (G G K ) W R S t () = c + ' where c s a non zero scalar, R s a (D D) rotaton matrx, t s a translaton vector and s a unt vector. Combnng formula and (), matrx W can be expressed as ( µ L µ )( L ) W = R R t B B Now, consderng all the N measurement epochs, a (DN P) matrx W can be defned. Of course matrx W can be consdered as a result of the followng matrx expresson W = B+ t Where s a (DN DK) matrx Sub-matrces G (=...K) satsfy the followng property: % µ R G % = = G % N µ NRN Now, let Q = G G be a (DK DK) matrx. hen, from Eq. (5) t s possble to consder the followng general condton: Q % % = µ µ RR (, = N) (6) that has to be consdered n order to satsfy two fundamental constrants:. orthonormalty of the rotatons. unqueness of the shape bases. he frst constrant s satsfed by the followng condton: (5) µ R L µ R = µ N N µ R L NRN B s a (DK P) bass matrx B= ( B B ) (DN ) translaton vector ( N ) t L t. L and t s a he ont regstraton and shape modellng problem proposed by Xao et al. (6), consders at ths pont a drect factorzaton of matrx W. Before dong so, all the pont coordnates are translated nto a barycentral system, so to neglect the translaton components. From now on, let W be the coordnate matrx, where the coordnates of each sampled pont cloud are referred to the correspondng centrod. Next step s to proceed to the Sngular Value Decomposton (SVD) of W, so to obtan a factorzaton that can be wrtten as W = B %%. he ran of W s mn(dk, DN, P). Snce generally DN>DK and P>DK, the SVD of W maes possble to determne K, that s the Q % % ' = µ I (=..N) (7) ( dxd) As an example for D =3, snce Q s symmetrc, and due to the presence of the unnown term µ, for each submatrx % (=...N), condton (7) generates the followng system of lnear equatons m% Q m% ' m% Q m% ' = () () m% Q m% ' m% Q m% ' = () ' = (8) () () where m%, m%, (D DK) sub-matrx m% are the frst, second and thrd row of the %. Enforcng the orthonormalty constrants alone, s not enough n the case n whch a deformaton of the pont clouds occurs. It s
3 therefore necessary to enforce also the second constrants that guarantee the unqueness of the bases. he problem can be solved analysng the ndependence propertes of the measured shape random samples. hat s, t s necessary to determne K measured shapes that contan ndependent deformable shapes. hs can be done by measurng the condton number for all the possble permutaton sets of (DK P) sub-matrces of W, and by choosng the set that mnmzes that value (Xao et al., 6). Smaller condton number means hgher ndependence. he deformable shapes contaned n the selected K measurement shapes are consdered as the unque bases. Snce scalng does not nfluence the ndependence of the shapes, the scalars µ are absorbed nto the bases, and then the chosen K measurements are smply the rotated bases. Denotng the K selected bass measurements as the frst K measurements n the barycentral coordnate matrx W, t follows that W = RB (=...K). he correspondng coeffcents are thus: µ = (= K) (9) µ = (, = K ; ) Accordng to Equatons (7), and (9) the unqueness of the bases s satsfed by the followng condtons Q % % ' = ( =.. ( dxd K ; =..N; ) (a) ) Q % % ' = I (==) (b) ( dxd) As n the prevous example for D=3, for each matrx product reported n (a), we can wrte the followng set of lnear equatons ' = () ' = () () () ' = () Whle, for each matrx product reported n (b) t follows the followng equatons ' = () ' = () () () ' = () ' = Systems (8), (), and () enlarged for all possble ndexes and mae possble to fnd an nconsstent system of lnear equatons n the unnown terms of the symmetrc matrx Q upper trangle that can be solved by least squares. Once Q s determned, to compute G, t s necessary to apply an SVD to matrx Q, snce Q = GG. hs decomposton allows to determne matrx G apart for an arbtrary (D D) orthonormal transformaton F, snce GFFG = Q. hs ambguty s due to the fact that matrces G (=...K) are ndependently estmated under dfferent coordnate systems (Xao et al., 6). herefore matrces G (=...K) have to be transformed under a unque reference system. Before dong so, t s necessary to determne for each the rotaton matrces R relatng to each scene. Rememberng that G % = µ R (=...N), snce R s orthonormal,.e. R =, than R =± G G. In ths way K sets of rotaton matrces R (=...N) are computed. Specfyng one of the sets as the reference one, an Ordnary Procrustes Analyss (OPA) s appled to all the other sets so to algn them to the selected one. he result furnshed by OPA maes also possble to transform G (= K) under a common coordnate system, and n ths way the searched transformaton matrx G s acheved. he coeffcents are then computed by (5), and the shape bases B are recovered by (4). In ths way the shape of a non statc scene at epoch can be fnally determned by. 3. ROBUS GENERALISED PROCRUSES ANALYSIS Generalsed Procrustes Analyss (GPA) s a well nown multvarate technque used to provde multple and smultaneous L.S. smlarty transformatons of data sets composed of P correspondng D-dm ponts, whose coordnates are referred to dfferent reference frames, and charactersed by measurement nose. he followng least squares obectve functon has to be satsfed: S= tr ( c + ) ( c + ) X R t X R t < ( c + ) ( c + ) X R t X R t = mn under the orthogonalty condton R R = I; where X X are data matrces of sze (P D), each one contanng the coordnates of the same set of P correspondng ponts defned n dfferent reference frames; s the (P ) auxlary untary vector; t, R and c are the unnowns (= ),.e. the (D ) th translaton vector, the (D D) th rotaton matrx, and the th sotropc scale factor, respectvely. he soluton of Equaton represents the GPA problem descrbed by Krstof and Wngersy (97), Gower (975), ten Berge (977), and Goodall (99). hs problem has an alternatve formulaton. Sad p X = c X R + t, the followng measures: p p p p p p = tr < < X X X X X X (4) p p p X H = tr X H X H (5)
4 are perfectly equvalent (e.g. Borg and Groenen, 997), where H s the unnown centrod. herefore Eq. (5), nstead of Eq. (4), can be mnmsed so to determne the unnowns {c, R, t} (= ) that mae t possble to teratvely compute the fnal p X (= ). p atrx Hˆ = X represents the LS estmate of H. Note that = H+ E = X, where vec ( E ): N, Σ =σ ( Q Q ) and σ p { } n has a factored structure. In the current algorthm mplementaton of the Robust Generalsed Procrustes problem soluton, the procedure starts from a partal pont confguraton contanng only statonary data. At each teraton, the ntal dataset s enlarged by one or more ponts, tll a sgnfcant varaton of the transformaton parameters occurs. In order to defne the ntal confguraton subset X of X,.e. the one contanng statonary data, t s necessary to compute the LS estmate of the correspondng centrod H, and consequently determne the smlarty transformaton parameters for all the = data sub-matrces X : H X (6) ˆ = c R + t = where H ˆ corresponds to the LS estmate of the unnown H. hs procedure s repeated for every = P possble S confguraton subset X, where S s the number of ponts formng the subset. Now, the global pseudo-centrod s computed by applyng the transformaton parameters, relatve to the -th data submatrx X, to the full correspondng X, obtanng X P() : P() ( c ) = + = = = H % X R t X (7) o defne the ntal subset X contanng statonary ponts, the least medan of squares (LS) prncple s appled (Rousseauw, 984). As well nown, ths regresson method can normally reach a brea down pont as hgh as 5%: among all the possble confguraton subsets X, the one satsfyng the followng LS condton s chosen as the ntal one: P () P () ( ) = meddag X H % X H % = mn (8) hs ntal subset s then enlarged onng up the pont for whch: P () P () ( ) = dag X H % X H % = mn (9) selected from the remanng (P S) ponts of the confguraton, not belongng to the ntal subset. he LS estmate of the enlarged partal centrod H (+), and the S-transformaton parameters for the sub-matrces X (+), are computed agan as: H X X () ( + ) ( + ) ( + ) ( + ) ( + ),P ˆ + = c R + t = = = Now, Procrustes statstcs (Sbson, 979; Langron and Collns, 985) s appled to verfy whether a sgnfcant varaton of the S-transformaton parameters occurs by enlargng the orgnal selected data subset. o ths am, the total dstance between the partal centrod H ˆ,P ( + ) and the sub-matrces X, obtaned by applyng to the orgnal X the S-transformaton parameters relatng to the (+) dataset, s computed:,p [ ( + ) ],P[ ˆ + ] tr ˆ G = ( X H ) ( X H ) () = he followng dstances are also computed:,p [ ( + ) ],P[ ˆ + ] tr ˆ Gt = ( X + dt H ) ( X + dt H ) (a) =,P [ ( + ) ],P[ ˆ + ] tr ˆ GtR = ( X dr + dt H ) ( X dr + dt H ) = (b),p [ ],P tr c ˆ c G = d X + dr + dt H d X + dr + dt Hˆ [ ] trc = (c) after havng taen care of the fact that the translaton components relatng to the (+) subset must be prevously reduced by the dfference between the centrods of H ˆ ( +) and H ˆ. hese dstances are resdual dstances after a Procrustes transformaton. In partcular G t s the resdual dstance after a translaton, G tr s the resdual dstance after a translaton and a rotaton, and G trc s the resdual dstance after a translaton, a rotaton, and a scalng. Assumng a proper frst nd error α, and the proper degrees of freedom df and df, the reecton of the null hypothess for the followng tests (Langron and Collns 985): G G G G G G ; ; GtRc GtRc GtRc t t tr tr trc > F α, df, df ndcates a sgnfcant varaton of some or of all the transformaton parameters at ths step, due to the possble enterng nto the X (+) datasets of non statonary data. If the null hypothess for all the tests s accepted nstead, the teratve process contnues wth the nserton of a further new pont X (+), satsfyng Equaton 9 wthn the remanng ones of the dataset. 4. ALGORIH IPLEENAION AND ESING he SVD factorsaton, and the Robust GPA methods were mplemented n atlab, n order to test ther capablty to correctly regster models by usng both statc and non-statc tepont confguratons. he experments, related to smulated envronments, let us to ntroduce varably modulated measurement nose n the te-pont coordnates.
5 enttes (buldngs, roofs, walls, roads), and 4 relate to movng obects (cars). Statc te-ponts are evdenced by red damond symbols, non statc ones by blue crcles. Fgure : Global regstraton by Robust GPA Fgure shows the result of the global algnment of the four models of Fgure, performed by Robust GPA. he method dentfes all the non-statc te-ponts, and treats them as outlers: the global regstraton s then acheved by way of the largest statc te-pont subset, common to all the models Fgure 3: e ponts dstrbuton after Robust GPA regstraton: statc ones (red damonds) appear precsely overlapped. Fgure 3 shows the te-pont dstrbuton after the regstraton: non-statonary ponts are automatcally detected, and outlned by blue crcle symbols, whle statc ones are mared by overlappng red damonds. 4 3 Fgure a,b,c,d: Smulated models of an urban envronment, and statc and non-statc te-ponts for model regstraton. As example, we report one of these tests. Fgures a to d depct four models (or scenes) of one reconstructed urban envronment, n dfferent reference systems (or poses). Of the te-ponts employed for the model algnment, 8 dentfy statc Fgure 4: e ponts dstrbuton after Ordnary GPA regstraton: statc te-ponts are not overlapped, and the hgh value of the resduals represents a dstorted reconstructon
6 Fgure 4 represents, for comparson, the results obtaned performng the regstraton by an ordnary GPA: non-statc teponts heavly contamnate the regstraton accuracy by a quantty proportonal to ther number, dsplacement length and relatve poston (leverage effect). Several experments were performed varyng te-ponts locaton, number, and accuracy. A detaled analyss of the numercal experments wll be presented n a future wor. 5. CONCLUDING REARKS Our nvestgatons concernng the regstraton methods for non statc models are stll under development, nevertheless some clear consderatons regardng the methods dscussed here can be expressed. As commonly nown, ordnary GPA, although very effcent, may fal n achevng an acceptable regstraton accuracy due to the presence of outlers or non-statonary data. On the contrary, the SVD factorsaton method (Xao et al., 6) reported n the paper, does not exclude, but s capable to employ the non-statonary ponts for a correct regstraton process. oreover t furnshes the geometrc bases to reconstruct the deformable shapes. But ths method, although robust aganst measurement nose, ntroduces a restrctve operatve condton: the shape deformatons, n whole, must span all the model space dmensons. As mentoned n Secton, the shape of a deformable obect can be regarded as a lnear combnaton of a selected number of shape bases. When at least three ponts smultaneously move along three dfferent fxed drectons n the 3D space, ther traectores form a deformaton bass of ran 3. If two ponts move along fxed drectons wthn a D plane, ther traectores form a ran- shape bass. If fnally one pont moves along a fxed drecton, ts traectory forms a ran- bass. Non-degenerate bases of a 3D non rgd shape are characterzed by a full ran 3 and, accordng to what reported n Secton, a closed form soluton exsts enforcng lnear rotaton, and bass constrants. Degenerate deformatons often occur n practce,.e. some bases are of ran or. Relatng to the reported example, cars movng ndependently on a straght plane road refer to ran- deformaton of the scene. Cars movng along two dfferently orented straght plane roads refer to a ran- deformaton of the scene. Fnally, cars movng on two dfferently orented straght and slope roads refer to ran-3 non-degenerate deformaton of the scene. he soluton of degenerate deformatons could requre further and computatonally heavy constrants, or may not exst (Xao and Kanade, 4). Robust GPA overcomes the drawbacs due to nsuffcent ran deformatons provdng a correct model regstraton. If the number of non-statc te-ponts s less than the LS breadown lmt of 5%, and the number of the statc te-ponts s at least equal to the model space dmensons, Robust GPA can represent a vald complement, or a valuable alternatve, to SVD factorsaton for the deformable shape regstraton, and for the relatve non-statonary components detecton. REFERENCES LDAR close range mages, Internatonal Archves of Photogrammetry, Remote Sensng and Spatal Informaton Scences, 5-7 september 6, Dresden, Germany. Borg, I., Groenen, P.J.F., 997. odern multdmensonal scalng: heory and applcatons. New Yor, Sprnger. Cerol, A., Ran,., 3. Robust ethods for the Analyss of Spatally Autocorrelated Data, Statstcal ethods & Applcatons,, pp Croslla, F.; Benat, A. 6. A forward search method for robust generalsed Procrustes analyss, Data Analyss, Classfcaton and the Forward Search, S. Zan, A. Cerol,. Ran and. Vch (Eds), Sprnger-Verlag, pp Dryden, I.L.; arda, K.V Statstcal Shape Analyss, J. Wley, Chchester, pp Goodall, C., 99. Procrustes methods n the statstcal analyss of shape, Journal Royal Stat. Soc.. Part B 53,, pp Gower, J. C., 975. Generalzed Procrustes analyss, Psychometra, 4, pp Langron, S. P.; Collns, A. J.; 985. Perturbaton theory for Generalzed Procrustes Analyss. Journal Royal Statstcal Socety, 47(), pp Krstof, W.; Wngersy, B., 97. Generalzaton of the orthogonal Procrustes rotaton procedure to more than two matrces. Proc. of the 79-th Annual Conv. of the Amercan Psychologcal Ass., 6, pp Rousseeuw, P. J., 984. Least edan of Squares Regresson, J. of the Amercan Statstcal Assocaton, 79(388), pp Sbson, R., 979. Studes n the Robustness of ultdmensonal Scalng: Perturbatonal Analyss of Classcal Scalng, Journ. R. Stats. Soc., B, 4, pp ten Berge, J.. F., 977. Orthogonal Procrustes rotaton for two or more matrces. Psychometra, 4(), pp Xao, J., 5. Reconstructon, Regstraton and odelng of Deformable Obect Shapes, PhD thess, ech. eport CU-RI- R-5-, Robotcs Insttute, Carnege ellon Un., Pttsburgh Xao, J.; Georgescu, B.; Zhou, X.; Comancu, D.; Kanade. 6. Smultaneous Regstraton and odelng of Deformable Shapes, 6 IEEE Computer Socety Conference on Computer Vson and Pattern Recognton,, pp Xao, J.; Kanade,., 4. Non-Rgd Shape and oton Recovery: Degenerate Deformatons. IEEE Internatonal Conference on Computer Vson and Pattern Recognton (CVPR), pp ACKNOWLEDGENS hs wor was carred out wthn the research actvtes supported by the INERREG IIIA Italy-Slovena 3-6 proect "Cadastral map updatng and regonal techncal map ntegraton for the Geographcal Informaton Systems of the regonal agences by testng advanced and nnovatve survey technques" Atnson, A.C., Ran.,. Robust Dagnostc Regresson Analyss, Sprnger, N.Y. Benat, A., Croslla, F.,. Generalzed Procrustes Analyss for sze and shape 3D obect reconstructon. Gruen, Kahmen (Eds), Optcal 3D easurement echnques, pp , Venna, Austra. Benat, A., Croslla, F., Sepc, F., 6. Automatc morphologcal pre-algnment and global hybrd regstraton of
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 informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationLecture 4: Principal components
/3/6 Lecture 4: Prncpal components 3..6 Multvarate lnear regresson MLR s optmal for the estmaton data...but poor for handlng collnear data Covarance matrx s not nvertble (large condton number) Robustness
More informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationStructure from Motion
Structure from Moton Structure from Moton For now, statc scene and movng camera Equvalentl, rgdl movng scene and statc camera Lmtng case of stereo wth man cameras Lmtng case of multvew camera calbraton
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationProper 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 informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationAccounting for the Use of Different Length Scale Factors in x, y and z Directions
1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationN-View Point Set Registration: A Comparison
N-Vew Pont Set Regstraton: A Comparson S. J. Cunnngton and A. J. Centre for Vson, Speech and Sgnal Processng Unversty of Surrey, Guldford, GU2 5XH, UK fa.stoddart,s.cunnngtong@ee.surrey.ac.uk Abstract
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationStitching of off-axis sub-aperture null measurements of an aspheric surface
Sttchng of off-axs sub-aperture null measurements of an aspherc surface Chunyu Zhao* and James H. Burge College of optcal Scences The Unversty of Arzona 1630 E. Unversty Blvd. Tucson, AZ 85721 ABSTRACT
More informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationFitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.
Fttng & Matchng Lecture 4 Prof. Bregler Sldes from: S. Lazebnk, S. Setz, M. Pollefeys, A. Effros. How do we buld panorama? We need to match (algn) mages Matchng wth Features Detect feature ponts n both
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationCorner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity
Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent
More informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationMOTION 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 informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationMulti-stable Perception. Necker Cube
Mult-stable Percepton Necker Cube Spnnng dancer lluson, Nobuuk Kaahara Fttng and Algnment Computer Vson Szelsk 6.1 James Has Acknowledgment: Man sldes from Derek Hoem, Lana Lazebnk, and Grauman&Lebe 2008
More informationParallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)
Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationAn Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method
Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and
More informationFitting and Alignment
Fttng and Algnment Computer Vson Ja-Bn Huang, Vrgna Tech Many sldes from S. Lazebnk and D. Hoem Admnstratve Stuffs HW 1 Competton: Edge Detecton Submsson lnk HW 2 wll be posted tonght Due Oct 09 (Mon)
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationArticulated Tree Structure from Motion A Matrix Factorisation Approach
Artculated Tree Structure from Moton A Matrx Factorsaton Approach arl Scheffler, Konrad H Scheffler, hrstan Omln Department of omputer Scence Unversty of the estern ape 7535 ellvlle, South Afrca cscheffler,
More informationy 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 informationCalibration of an Articulated Camera System
Calbraton of an Artculated Camera System CHEN Junzhou and Kn Hong WONG Department of Computer Scence and Engneerng The Chnese Unversty of Hong Kong {jzchen, khwong}@cse.cuhk.edu.hk Abstract Multple Camera
More informationSIMULTANEOUS REGISTRATION OF MULTIPLE VIEWS OF A 3D OBJECT
SIMULTANEOUS REGISTRATION OF MULTIPLE VIEWS OF A 3D OBJECT Helmut Pottmann a, Stefan Leopoldseder a, Mchael Hofer a a Insttute of Geometry, Venna Unversty of Technology, Wedner Hauptstr. 8 10, A 1040 Wen,
More informationImage Alignment CSC 767
Image Algnment CSC 767 Image algnment Image from http://graphcs.cs.cmu.edu/courses/15-463/2010_fall/ Image algnment: Applcatons Panorama sttchng Image algnment: Applcatons Recognton of object nstances
More informationComputer Animation and Visualisation. Lecture 4. Rigging / Skinning
Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume
More informationAvailable online at ScienceDirect. Procedia Environmental Sciences 26 (2015 )
Avalable onlne at www.scencedrect.com ScenceDrect Proceda Envronmental Scences 26 (2015 ) 109 114 Spatal Statstcs 2015: Emergng Patterns Calbratng a Geographcally Weghted Regresson Model wth Parameter-Specfc
More informationLearning Ensemble of Local PDM-based Regressions. Yen Le Computational Biomedicine Lab Advisor: Prof. Ioannis A. Kakadiaris
Learnng Ensemble of Local PDM-based Regressons Yen Le Computatonal Bomedcne Lab Advsor: Prof. Ioanns A. Kakadars 1 Problem statement Fttng a statstcal shape model (PDM) for mage segmentaton Callosum segmentaton
More informationNew Extensions of the 3-Simplex for Exterior Orientation
New Extensons of the 3-Smplex for Exteror Orentaton John M. Stenbs Tyrone L. Vncent Wllam A. Hoff Colorado School of Mnes jstenbs@gmal.com tvncent@mnes.edu whoff@mnes.edu Abstract Object pose may be determned
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationCalibration of an Articulated Camera System with Scale Factor Estimation
Calbraton of an Artculated Camera System wth Scale Factor Estmaton CHEN Junzhou, Kn Hong WONG arxv:.47v [cs.cv] 7 Oct Abstract Multple Camera Systems (MCS) have been wdely used n many vson applcatons and
More informationA NEW APPROACH FOR SUBWAY TUNNEL DEFORMATION MONITORING: HIGH-RESOLUTION TERRESTRIAL LASER SCANNING
A NEW APPROACH FOR SUBWAY TUNNEL DEFORMATION MONITORING: HIGH-RESOLUTION TERRESTRIAL LASER SCANNING L Jan a, Wan Youchuan a,, Gao Xanjun a a School of Remote Sensng and Informaton Engneerng, Wuhan Unversty,129
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned
More informationModule 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell
Module 6: FEM for Plates and Shells Lecture 6: Fnte Element Analyss of Shell 3 6.6. Introducton A shell s a curved surface, whch by vrtue of ther shape can wthstand both membrane and bendng forces. A shell
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationFace Recognition University at Buffalo CSE666 Lecture Slides Resources:
Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural
More informationProgramming 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 informationWavefront Reconstructor
A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes
More informationGenerating Fuzzy Term Sets for Software Project Attributes using and Real Coded Genetic Algorithms
Generatng Fuzzy Ter Sets for Software Proect Attrbutes usng Fuzzy C-Means C and Real Coded Genetc Algorths Al Idr, Ph.D., ENSIAS, Rabat Alan Abran, Ph.D., ETS, Montreal Azeddne Zah, FST, Fes Internatonal
More informationCalibration of an Articulated Camera System
Calbraton of an Artculated Camera System CHEN Junzhou and Kn Hong WONG Department of Computer Scence and Engneerng The Chnese Unversty of Hong Kong {jzchen, khwong}@cse.cuhk.edu.hk Abstract Multple Camera
More informationSVM-based Learning for Multiple Model Estimation
SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:
More information12/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 informationLecture #15 Lecture Notes
Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal
More informationA NEW IMPLEMENTATION OF THE ICP ALGORITHM FOR 3D SURFACE REGISTRATION USING A COMPREHENSIVE LOOK UP MATRIX
A NEW IMPLEMENTATION OF THE ICP ALGORITHM FOR 3D SURFACE REGISTRATION USING A COMPREHENSIVE LOOK UP MATRIX A. Almhde, C. Léger, M. Derche 2 and R. Lédée Laboratory of Electroncs, Sgnals and Images (LESI),
More informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationMOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN
MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS by XUNYU PAN (Under the Drecton of Suchendra M. Bhandarkar) ABSTRACT In modern tmes, more and more
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationA Volumetric Approach for Interactive 3D Modeling
A Volumetrc Approach for Interactve 3D Modelng Dragan Tubć Patrck Hébert Computer Vson and Systems Laboratory Laval Unversty, Ste-Foy, Québec, Canada, G1K 7P4 Dens Laurendeau E-mal: (tdragan, hebert, laurendeau)@gel.ulaval.ca
More informationA Deflected Grid-based Algorithm for Clustering Analysis
A Deflected Grd-based Algorthm for Clusterng Analyss NANCY P. LIN, CHUNG-I CHANG, HAO-EN CHUEH, HUNG-JEN CHEN, WEI-HUA HAO Department of Computer Scence and Informaton Engneerng Tamkang Unversty 5 Yng-chuan
More information3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method
NICOGRAPH Internatonal 2012, pp. 114-119 3D Vrtual Eyeglass Frames Modelng from Multple Camera Image Data Based on the GFFD Deformaton Method Norak Tamura, Somsangouane Sngthemphone and Katsuhro Ktama
More informationAngle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga
Angle-Independent 3D Reconstructon J Zhang Mrelle Boutn Danel Alaga Goal: Structure from Moton To reconstruct the 3D geometry of a scene from a set of pctures (e.g. a move of the scene pont reconstructon
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationEcient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem
Ecent Computaton of the Most Probable Moton from Fuzzy Correspondences Moshe Ben-Ezra Shmuel Peleg Mchael Werman Insttute of Computer Scence The Hebrew Unversty of Jerusalem 91904 Jerusalem, Israel Emal:
More informationCell Count Method on a Network with SANET
CSIS Dscusson Paper No.59 Cell Count Method on a Network wth SANET Atsuyuk Okabe* and Shno Shode** Center for Spatal Informaton Scence, Unversty of Tokyo 7-3-1, Hongo, Bunkyo-ku, Tokyo 113-8656, Japan
More informationInverse-Polar Ray Projection for Recovering Projective Transformations
nverse-polar Ray Projecton for Recoverng Projectve Transformatons Yun Zhang The Center for Advanced Computer Studes Unversty of Lousana at Lafayette yxz646@lousana.edu Henry Chu The Center for Advanced
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationRecognizing Faces. Outline
Recognzng Faces Drk Colbry Outlne Introducton and Motvaton Defnng a feature vector Prncpal Component Analyss Lnear Dscrmnate Analyss !"" #$""% http://www.nfotech.oulu.f/annual/2004 + &'()*) '+)* 2 ! &
More informationThe 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 informationA Factorization Approach to Structure from Motion with Shape Priors
A Factorzaton Approach to Structure from Moton wth Shape Prors Alesso Del Bue Insttute for Systems and Robotcs Insttuto Superor Técnco Av. Rovsco Pas 1 1049-001 Lsboa Portugal http://www.sr.st.utl.pt/
More informationHigh-Boost Mesh Filtering for 3-D Shape Enhancement
Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,
More informationImage Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline
mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and
More informationALTERNATIVE METHODOLOGIES FOR THE ESTIMATION OF LOCAL POINT DENSITY INDEX: MOVING TOWARDS ADAPTIVE LIDAR DATA PROCESSING
Internatonal Archves of the Photogrammetry, Remote Sensng and Spatal Informaton Scences, Volume XXXIX-B3, 2012 XXII ISPRS Congress, 25 August 01 September 2012, Melbourne, Australa ALTERNATIVE METHODOLOGIES
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationDistance Calculation from Single Optical Image
17 Internatonal Conference on Mathematcs, Modellng and Smulaton Technologes and Applcatons (MMSTA 17) ISBN: 978-1-6595-53-8 Dstance Calculaton from Sngle Optcal Image Xao-yng DUAN 1,, Yang-je WEI 1,,*
More informationA Robust Method for Estimating the Fundamental Matrix
Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.
More informationAUTOMATED REGISTRATION OF UNORGANISED POINT CLOUDS FROM TERRESTRIAL LASER SCANNERS
AUTOMATED REGISTRATION OF UNORGANISED POINT CLOUDS FROM TERRESTRIAL LASER SCANNERS Kwang-Ho Bae and Derek D. Lcht Department of Spatal Scences, Curtn Unversty of Technology, GPO Box U1987, Perth, WA, 6845,
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationScienceDirect. The Influence of Subpixel Corner Detection to Determine the Camera Displacement
Avalable onlne at www.scencedrect.com ScenceDrect Proceda Engneerng ( ) 8 8 th DAAAM Internatonal Symposum on Intellgent Manufacturng and Automaton, DAAAM The Influence of Subpxel Corner Detecton to Determne
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationA Robust LS-SVM Regression
PROCEEDIGS OF WORLD ACADEMY OF SCIECE, EGIEERIG AD ECHOLOGY VOLUME 7 AUGUS 5 ISS 37- A Robust LS-SVM Regresson József Valyon, and Gábor Horváth Abstract In comparson to the orgnal SVM, whch nvolves a quadratc
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More informationHuman Skeleton Reconstruction for Optical Motion Capture
Journal of Computatonal Informaton Systems 9: 0 (013) 8073 8080 Avalable at http://www.jofcs.com Human Skeleton Reconstructon for Optcal Moton Capture Guanghua TAN, Melan ZHOU, Chunmng GAO College of Informaton
More informationOptimal Combination of Stereo Camera Calibration from Arbitrary Stereo Images.
Tna Memo No. 1991-002 Image and Vson Computng, 9(1), 27-32, 1990. Optmal Combnaton of Stereo Camera Calbraton from Arbtrary Stereo Images. N.A.Thacker and J.E.W.Mayhew. Last updated 6 / 9 / 2005 Imagng
More informationExterior Orientation using Coplanar Parallel Lines
Exteror Orentaton usng Coplanar Parallel Lnes Frank A. van den Heuvel Department of Geodetc Engneerng Delft Unversty of Technology Thsseweg 11, 69 JA Delft, The Netherlands Emal: F.A.vandenHeuvel@geo.tudelft.nl
More informationA Bilinear Model for Sparse Coding
A Blnear Model for Sparse Codng Davd B. Grmes and Rajesh P. N. Rao Department of Computer Scence and Engneerng Unversty of Washngton Seattle, WA 98195-2350, U.S.A. grmes,rao @cs.washngton.edu Abstract
More informationSolitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis
Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of
More informationVery simple computational domains can be discretized using boundary-fitted structured meshes (also called grids)
Structured meshes Very smple computatonal domans can be dscretzed usng boundary-ftted structured meshes (also called grds) The grd lnes of a Cartesan mesh are parallel to one another Structured meshes
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More information