Using Radial Basis Functions to Solve Geodesics Equations for Body Measurements *
|
|
- Crystal Mason
- 5 years ago
- Views:
Transcription
1 7659, England, UK Journal of Informaton and Computng Scence Vol. 2, No. 2, 2007, pp Usng Radal Bass Functons to Solve Geodescs Equatons for Body Measurements * R. Ng 1+, G.T.Y. Pong 2 and M. Wong 2 1 Insttute of Textles and Clothng, Hong Kong Polytechnc Unversty, Hong Kong SAR, Chna 2 Department of Appled Mathematcs, Hong Kong Polytechnc Unversty, Hong Kong SAR, Chna ( Receved 4 October 2006, accepted 4 February 2007 ) Abstract. For the applcaton of apparel ndustry, 3D body measurements are the mnmal arc length dstances between the pont couples along the body surface. The calculaton of geodescs s nontrval, and can only be approxmated for free-form surfaces, because the computaton of geodescs requres solvng a set of ordnary dfferental equatons (geodescs equatons), whch do not exhbt any closed form soluton for free-form surfaces. In ths artcle, the method of radal bass functon (RBF) s used n solvng the geodescs equatons based on the bcubc tensor product Bezer patches. Ths method does not requre any mesh to support the localzed approxmatons. The accuracy and effcency of ths meshless collocaton method are examned by comparson to the Rtz s method. Keywords: Geodescs, Radal Bass Functons 1. Introducton The ntroducton s dvded nto three parts: the background of solvng the geodescs equatons, the applcaton of geodescs equaton n the apparel ndustry, and the focus of the current research work. 1) Background of solvng geodesc equatons: Geodescs are defned n the dfferental geometry lterature as the locally shortest path between two ponts on a surface. The trajectory of the geodesc depends on the ntrnsc propertes of the surface. A local geodesc satsfes a par of ODEs, (1) and (2), defned usng the Chrstoffel symbols, Γ jk. The complexty of solvng the geodesc equatons depends on the defnton of the surface. Typcally, the solutons of geodescs on free-form surfaces do not have any closed form soluton. For ths reason, numercal method must be used to approxmate the value. GE 1 (u, v) = u" + Γ 1 11(u') Γ 1 12u'v' + Γ 1 22(v') 2 = 0 (1) GE 2 (u, v) = v" + Γ 2 11(u') Γ 2 12u'v' + Γ 2 22(v') 2 = 0 (2) The numercal methods beng used can be typcally classfed nto two classes accordng to whether the surface s contnuous or dscrete. In solvng the geodescs on contnuous surfaces, one usually solves the dfferental numercally. Gray [1] presented a numercal scheme of solvng the geodesc equaton (1) and (2) wth uv-parametrzaton usng the Mathematca TM software. Maekawa [2] presented another numercal scheme based on fnte dfference method. A survey of numercal schemes for solvng dfferental equatons and ntegral equatons s avalable n Cheney [3]. The other class of technques s used for the polyhedral surfaces. Polther and Schmes [4] derved the lght ray tracng method of shootng the end pont of the geodescs along the polyhedral surface. Pham-Trong, Szafran and Bard [5] searched for the dscrete geodescs usng the subdvson of patches wth unfoldng, so that the beam propagaton can reach the destnaton pont on the other end of the geodescs. Rav Kumar, Srnvasan, Devaraja Holla, Shastry, and Prakash [6] ntroduced modfed verson of Polther and Schmes work, by ncorporatng the normal nformaton of the surface. Kmmel and Sethan [7] demonstrated the applcaton of the Fast Matchng Method n fndng the geodesc paths on a trangularly meshed surface. These methods are not meshless. In terms of the meshless methods, Ng and Pong [8] reported the use of dstrbuted collocaton method, * Ths project s fnancally supported by the Polytechnc Unversty Research Grant, A/C PE04. + Contact detal: Phone: , Fax: , E-mal: roger.ng@polyu.edu.hk Phone: , Fax: , E-mal: Glory.Pong@polyu.edu.hk Publshed by World Academc Press, World Academc Unon
2 120 R. Ng, et al: Usng Radal Bass Functons to Solve Geodescs Equatons for Body Measurements whch s a parallel verson of the collocaton method. In the current study, another meshless method, radal bass functon (RBF), s used n solvng the geodescs equatons on a famly of bcubc tensor product Bezer surface patches under uv-parametrzaton, snce nterpolaton by radal bass functons s a powerful tool n approxmaton theory. 2) Applcaton of geodescs equaton n the apparel ndustry: In the 3D garment pattern desgn, a surface mappng technque, Bjectve Pattern Map [9], unfolds the 3D surface patches nto 2D enclosed areas usng the geodesc nformaton on the 3D mannequn. Manually, the body measurement can be measured by usng a tensoned measurng tape. In a vrtual world, as a free-form surface, the 3D vrtual mannequn can be represented as an atlas of tensor product Bezer or B-Splne or NURBS surface patches. In ths case, the body measurement, such as the surface patch shown n Fg. 1, can only be calculated usng the geodesc arc length. Fg. 1. Hp to Crotch Surface Patch 3) Focus of research work: In ths artcle, the calculaton of the geodesc wll focus on a class of nonself-ntersectng surface patches, defned usng the bcubc tensor product Bezer form. Self-ntersectng surface can be reduced to non-self-ntersecton surface subpatches. Wth the scalable propertes, t s possble to reduce the problem by consderng only the normalzed patches, lyng wthn the unt cube. The numercal algorthm s based on the radal bass functon method. The choce of the tral functons wll be presented. The comparson to the Rtz s method wll be gven to llustrate the effectveness of the radal bass functon method. Fnally, the numercal result wll be compared to the data measured from the vrtual model of a real mannequn. All the programs are wrtten usng Mathematca TM verson NORMALIZATION OF SURFACE PATCHES A famly of normalzed bcubc tensor product Bezer surface patches s defned over the unt cube wth the longest sde of the patch algned wth the lne segment of [0, 1] along the x-axs. As the bcubc tensor product patch representaton s fully scalable, ths representaton can cover the whole famly of bcubc tensor product Bezer surface patches, snce any fnte bcubc tensor product Bezer surface can be enclosed by a cubc of sze equals to the longest straght lne dstance between any par of control vertces. The normalzaton process can be acheved by these transformatons: Stage 1 (Set orgn, and force all ponts nto postve zone): P = p Mn(p ) (3) Stage 2 (Scale to ft the unt cube): P n = P / Max(P ) (4) where p are the orgnal data ponts, P are the translated ponts, and P n are the normalzed ponts wth Mn(.) and Max(.) to be the mnmum and maxmum functon respectvely. It should be noted that when the Mn(.) s taken over the ordnates ndvdually, the data ponts are guaranteed to be translated nto the postve zone of {x, y, z : x 0; y 0; z 0}. However, any of the data ponts may not be located at the orgn. Yet, at least one of the data ponts can be found on the surface of the unt cube. JIC emal for contrbuton: edtor@jc.org.uk
3 Journal of Informaton and Computng Scence, 2 (2007) 2, pp PREPARATION OF COLLOCATION POINTS The geodesc from a pont q 0 to another pont q 1 along the bcubc tensor product Bezer surface patch S(u, v) s ntended to be wrtten n the form of a parametrc curve α(t) wth the end ponts matchng the boundary condton of α(0) = q 0 and α(1) = q 1. The collocaton ponts are thus defned as the set of N chosen ponts {α(t ) where = 1, 2,..., N, and each t les n the range of (0, 1)}. In ths study, the collocaton ponts are evenly dstrbuted along (0, 1). Based on the experence wth usng collocaton method, the collocaton ponts must be chosen n a way to ensure the non-degenerate determnant of the matrx derved by submttng the tral functons and combnng the matchng requrement at the collocaton ponts. 4. SELECTION OF TRIAL FUNCTIONS The tral functons geo 1 (t) and geo 2 (t) are both selected to be the lnear combnaton of radal bass functons wth coeffcents {a } and {b } respectvely, n whch we match the condtons avalable, ncludng the par of geodesc ODEs, the boundary condtons and the matchng at the collocaton ponts. The geo 1 (t) corresponds to the u-parameter whle the geo 2 (t) corresponds to the v-parameter. Snce the surface s represented n the form of S(u, v), the GE 1 (u, v) and GE 2 (u, v) can n fact be wrtten as GE 1 (t) = GE 1 (u(t), v(t)) and GE 2 (t) = GE 2 (u(t), v(t)) respectvely by substtutng: geo 1 (t) = u(t) = a 0 + a 1 φ(t, c 1 ) + a 2 φ(t, c 2 ) + a 3 φ(t, c 3 ) +... (5) geo 2 (t) = v(t) = b 0 + b 1 φ(t, c 1 ) + b 2 φ(t, c 2 ) + b 3 φ(t, c 3 ) +... (6) n whch we select the radal bass functons φ(t, c ) [10] of the form: d d d d d , 0 d r φ(, t c ) = r r r r r 0,, d > r where d = t c s the dstance between the pont t and the center c ; and r s the radus of the support for the radal bass functons centered at the center c. In ths study, the radus of the support s chosen to be 2. The advantage n usng radal bass functons s generally that they provde nterpolants rrespectve of complexty of the geometry. The compactly supported postve defnte radal bass functons φ(t, c ) are feasble n the current applcaton. From the experence of approxmatng the geodescs on the bcubc tensor product Bezer surface patches, radal bass functons must be chosen n a way to ensure the tral functons are at least twce dfferentable and wth compact support over [0, 1]. 5. FORMATION OF MATRIX EQUATION In ths study, the scope s lmted to the geodescs across the dagonal of the surface patch, because such measurements are most commonly used n the Bjectve Pattern Map. By substtutng the defnton of S(u, v), the geo 1 (t) and geo 2 (t) nto the par of geodescs equatons, two equatons are found, GE 1 (t) and GE 2 (t). Note that these two equatons wth the unknown coeffcents are very long and are omtted here. By matchng the boundary condtons, four more equatons are found, (7) to (10). u(0) = 0 = a 0 + a 1 φ(0, c 1 ) + a 2 φ(0, c 2 ) + a 3 φ(0, c 3 ) + (7) v(0) = 0 = b 0 + b 1 φ(0, c 1 ) + b 2 φ(0, c 2 ) + b 3 φ(0, c 3 ) +... (8) u(1) = 1 = a 0 + a 1 φ(1, c 1 ) + a 2 φ(1, c 2 ) + a 3 φ(1, c 3 ) +... (9) v(1) = 1 = b 0 + b 1 φ(1, c 1 ) + b 2 φ(1, c 2 ) + b 3 φ(1, c 3 ) ) Fnally, requrng a perfect match of the estmaton by geo 1 (t) and geo 2 (t) at the collocaton ponts t, 2N equatons are found, (11) and (12). These equatons can be wrtten n the matrx form. GE 1 (t ) = 0, = 1,..., N (11) GE 2 (t ) = 0, = 1,..., N ) After the substtuton process s completed, they form a matrx equaton. It s mportant to check and ensure the determnant of ths matrx equaton to be non-zero, so that soluton can be guaranteed. In case, the determnant s zero, the choce of collocaton ponts must be revsed. As an example, from the experence of calculatng the geodescs on the bcubc tensor product Bezer JIC emal for subscrpton: publshng@wau.org.uk
4 122 R. Ng, et al: Usng Radal Bass Functons to Solve Geodescs Equatons for Body Measurements surface patches when developng the Bjectve Pattern Map, two radal bass functons could be suffcent for patches wth small Gaussan curvature. In that case, sx equatons (two from (1) and (2) and four from (5) and (6)) wll be derved wth two boundary ponts and one collocaton pont. When more radal bass functons are used, more collocaton ponts are needed to solve the extra coeffcents. If the coeffcent matrx of the equaton s sngular, another set of collocaton ponts fallng n between the exstng collocaton ponts can be chosen or the number of radal bass functons can be elevated. 6. DATA PREPARATION 6.1. Testng Data The testng data s prepared based on the followng crtera: All control vertces are postoned wthn a unt cube. The startng endpont s fxed wth the heght of 0; and the termnatng endpont s wth the heght of 1. The total sample sze s 12 ponts at 6 possble heghts = 72 choces. The control vertces s randomly chosen wthn a unt cube, but wth a predetermned ncrement, say , whle a total 1000 samples are selected. The samples are dvded nto four groups of data. In ths confguraton, some of the patches can have local optmal values, however unqueness of the geodescs s not guaranteed, as conjugate ponts may exst. Yet, as long as the control ponts do not ntersect each other, the surface patch does not ntersect tself. The surface s also ensured to be compact and contnuous Evaluaton Data Based on Rtz s Method The full set of testng normalzed bcubc tensor product Bezer surface patches was run agan usng another numercal method. Among many choces, the Rtz s method was chosen because t s a popular numercal technque for Calculus of Varaton [11]. The bass functon for the Rtz s method was chosen to be polynomal n the form of (13) and (14). In ths case, the v-parameter becomes a functon of u-parameter. The values of geodesc dstances were compared to those of the radal bass functon method. u(t) = t (13) v(t) = c 0 + c 1 t + c 2 t 2 + c 3 t c n t n (14) 6.3. Evaluaton Data From Physcal Objects One more set of data measured from the vrtual model of a real mannequn was prepared for comparson. In prevous study, the modelng of human mannequn usng bcubc tensor product Bezer patches had been demonstrated wth reasonable accuracy f the patches were properly defned [12]. The mannequn was dgtzed by a 3D body scanner and stored n the form of a bcubc tensor product Bezer surface atlas. The lengths of the boundary curves of each patch were ensured to be equal to the physcal value. Then, both of the dagonal lengths were measured and used as the reference physcal data, and compared to the computer-calculated values. 7. SOLVING THE MATRIX EQUATION The matrx equaton derved accordng to secton V was solved usng the bult-n equaton solver of Mathematca TM 5.0. However, an adaptve scheme must be used to select dfferent collocaton ponts because t s possble that some pars of collocaton ponts do share some knd of symmetry, meanng that the rank of the matrx equaton may be reduced. In these cases, other collocaton ponts must be used. It should be noted that the matrx equaton s nonlnear wth respect to the coeffcents a and b, as the surface patches are n the bcubc tensor product form. Therefore, there can be one or more real soluton sets. Each soluton set must be testfed and compared to determne the global optmal soluton set. Durng the calculaton by Mathematca TM, the response was very slow when three or more radal bass functons were used. So, n ths study, the results are based on two radal bass functons centered at t = 1 and 1.5 wth the radus of compact support of EVALUATION OF RESULT The computaton speeds of both methods were measured usng the TIMING command of the Mathematca TM. JIC emal for contrbuton: edtor@jc.org.uk
5 Journal of Informaton and Computng Scence, 2 (2007) 2, pp Snce there are many common codes shared by both methods, the tmng of the radal bass functon method ncluded the executon of the followng lnes n pseudo code, see Table I, whle the counterpart for the Rtz s Method s lsted n Table II. Table 1 KERNEL OF RADIAL BASIS FUNCTION Part 1 (Generate and solve the matrx equaton): Manually select the centers of the radal bass functon; Generate_Equatons_of_Collocaton_Ponts; Whle (Equaton_Degenerate), { Use_Other_Collocaton_Ponts; Generate_Equatons_of_Collocaton_Ponts; } Answer = Solve_Matrx_Equaton; Part 2 (Calculate the arc length): Mn_Arc_Length = Infnty; For[ = 1; < Number_of_Answers, Arc_Length = Calculate_Arc_Length[Answer[[]]]; Mn_Arc_Length = Mn[Mn_Arc_Length, Arc_Length]; ++]; (Here s the counter.) The total computatonal cost ncludes the tme n generatng and solvng the matrx equaton, and calculatng the geodesc dstance. Table 2 KERNEL OF RITZ S METHOD Intalze_Varaton_Parameter; Intalze_Max_Iteraton; Error = Infnty; Geodesc = Infnty; Whle (Error > Error_Bound && j < Max_Iteraton), { Increase_Order_of_Bass_Functon; Substtute_Dfferental_Equaton; Prepare_Matrx_Equaton; Solve_Varaton_Parameter; Arc_Length = Verfy_Varaton_Parameter; Error = Abs[Geodesc Arc_Length]; Geodesc = Mn[Geodesc, Arc_Length]; j++;} (Here j s the teraton counter.) The sample report of the result s lsted n Table III. The comparatve result between radal bass functon method and Rtz s method s summarzed n Table IV. The relatve Root-Mean-Square error (RMS), (15), s used to ndcate the dfferences n the accuracy of the approxmated geodesc dstance usng radal bass functons, gc, and the geodesc dstance from Rtz s Method, gr, whle a relatve rato (16) s used for the mprovement of the computaton tme, tr for Rtz method and tc for radal bass functon method. The result s presented n sx sgnfcant fgures n the normalzed unt. Sgn(gC gr) * Sqrt( (((gr gc) / gr) 2 )) (15) [Note: Sqrt s the square root functon.] tr / tc (16) JIC emal for subscrpton: publshng@wau.org.uk
6 124 R. Ng, et al: Usng Radal Bass Functons to Solve Geodescs Equatons for Body Measurements Table 3 SAMPLE DATA OUTPUT TABLE Radal Bass Functon Rtz s Method Normalzed Unt Second Normalzed Unt Second Table 4 COMPARISON OF RADIAL BASIS FUNCTION METHOD AND RITZ METHOD Set Mean Accuracy Loss Mean Tme Improved % 101% % 101% % 98% % 105% Fnally, a set of sample geodesc dstances approxmated usng the radal bass functons accordng to the scanned patches was compared to the geodesc dstances measured from the vrtual model of a real mannequn. The calculated geodesc dstances are rounded up to sx sgnfcant fgures. The relatve error was measured accordng to (17), wth gp representng physcal geodesc. The result s shown n Table V. Sgn(gC gp) * Sqrt((gP gc) / gp) 2 ) (17) 9. COMMENTS ON USING RADIAL BASIS FUNCTIONS Table 5 COMPARISON OF CALCULATION BY RADIAL BASIS FUNCTION METHOD AND PHYSICAL DATA Data Calculated by RBF Method Physcal Data (cm) Relatve Error (%) Accordng to the current plot study, the advantages of usng the radal bass functons n calculatng geodesc dstances nclude: Effcent method wth reasonably accuracy even when small set of radal bass functons to be used. Ease of software mplementaton. Yet, ths method has the followng dsadvantages: JIC emal for contrbuton: edtor@jc.org.uk
7 Journal of Informaton and Computng Scence, 2 (2007) 2, pp Effcency drops when more collocaton ponts are used. The convergence of the matrx equaton solvng may take much longer tme when more radal bass functons are used. The typcal computaton of radal bass functon method based on based on two radal bass functons, mplemented on a dual Xeon TM 1.8 GHz personal computer under Mathematca TM Verson 5.0. Ths method can be very tme consumng as the number of the radal bass functons ncreases. 10. CONCLUSION In the plot study, the geodesc equatons on the subset of bcubc tensor product Bezer patches have been solved numercally by the nterpolaton usng radal bass functons. The results of computng the geodescs by ths radal bass functon method are compared to that by the Rtz s method. The agreement between these two methods s acceptable, whle the computaton effcency of the radal bass functon method s farly good. Moreover, the accuracy of approxmatng geodescs on the scanned patches s found excellent when compared wth the measurements on the vrtual model of a real mannequn. The future work s to extend the study to at the full scale, wth the theoretcal analyss, and weak-form solutons. 11. References [1] A. Gray. Modern Dfferental Geometry of Curves and Surfaces. CRC Press, [2] T. Maekawa. Computaton of shortest paths on free-form parametrc surfaces. Journal of Mechancal Desgn. 1996, 118: [3] W. Cheney. Analyss for Appled Mathematcs. New York: Sprnger-Verlag, [4] K. Polther, M. Schmes. Straghtest geodescs on polyhedral surfaces, In: H. C. Hege, H. K. Polther (Eds.). Mathematcal Vsualzaton. Sprnger-Verlag, [5] V. Pham-Trong, N. Szafran, L. Bard. Pseudo-geodescs on three-dmensonal surfaces and pseudo-geodesc meshes. Numercal Algorthms. 2001, 26: [6] G.V.V. Rav Kumar, P. Srnvasan, V. Devaraja Holla, K.G. Shastry, B.G. Prakash. Geodesc curve computatons on surfaces. Computer Aded Geometrc Desgn. 2003, 20: [7] R. Kmmel and J.A. Sethan. Computng geodescs paths on manfolds. Appled Mathematcs. 95: [8] R. NG, G.T.Y. Pong. Measurng Geodesc Body Measurements wth Dstrbuted Collocaton Method. IMAC T1-I , 2005, [9] R. NG, C. K. CHAN, R. AU, T.Y. PONG. Analytcal soluton to the Bjectve Mappng Problem n pattern desgn. Journal of Chna Textle Unversty. (Englsh Edton), 1996, 13: [10] Z. Wu. Compactly supported postve defnte radal functons. Advances n Computatonal Mathematcs. 1995, 4: [11] I. M. Gelfand, S. V. Fomn. Calculus of Varaton. New Jersey: Prentce Hall, [12] R. NG, C. K. CHAN, R. AU, T.Y. PONG. Automatc generaton of human model from lnear measurements - Algebrac Mannequn. Ergon-Axa , TRADEMARK Mathematca TM s a trademark of Wolfram Research Inc. Xeon TM s a trademark of Intel Corporaton. JIC emal for subscrpton: publshng@wau.org.uk
8 126 R. Ng, et al: Usng Radal Bass Functons to Solve Geodescs Equatons for Body Measurements JIC emal for contrbuton:
R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationA Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme
Mathematcal and Computatonal Applcatons Artcle A Fve-Pont Subdvson Scheme wth Two Parameters and a Four-Pont Shape-Preservng Scheme Jeqng Tan,2, Bo Wang, * and Jun Sh School of Mathematcs, Hefe Unversty
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 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 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 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 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 informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More 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 informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More 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 informationRadial Basis Functions
Radal Bass Functons Mesh Reconstructon Input: pont cloud Output: water-tght manfold mesh Explct Connectvty estmaton Implct Sgned dstance functon estmaton Image from: Reconstructon and Representaton of
More informationTsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance
Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for
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 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 informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationAlgorithm for directional projection of parametric curves onto B-spline surfaces
Algorthm for drectonal projecton of parametrc curves onto B-splne surfaces Ha-Chuan Song, Jun-Ha Yong To cte ths verson: Ha-Chuan Song, Jun-Ha Yong. Algorthm for drectonal projecton of parametrc curves
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
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 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 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 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 informationFast Computation of Shortest Path for Visiting Segments in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More 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 informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationCollaboratively Regularized Nearest Points for Set Based Recognition
Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,
More informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More informationClassification / Regression Support Vector Machines
Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM
More informationDesign of Structure Optimization with APDL
Desgn of Structure Optmzaton wth APDL Yanyun School of Cvl Engneerng and Archtecture, East Chna Jaotong Unversty Nanchang 330013 Chna Abstract In ths paper, the desgn process of structure optmzaton wth
More informationAP PHYSICS B 2008 SCORING GUIDELINES
AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationA new paradigm of fuzzy control point in space curve
MATEMATIKA, 2016, Volume 32, Number 2, 153 159 c Penerbt UTM Press All rghts reserved A new paradgm of fuzzy control pont n space curve 1 Abd Fatah Wahab, 2 Mohd Sallehuddn Husan and 3 Mohammad Izat Emr
More informationResearch Article Quasi-Bézier Curves with Shape Parameters
Hndaw Publshng Corporaton Appled Mathematcs Volume 3, Artcle ID 739, 9 pages http://dxdoorg/55/3/739 Research Artcle Quas-Bézer Curves wth Shape Parameters Jun Chen Faculty of Scence, Nngbo Unversty of
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 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 informationA Newton-Type Method for Constrained Least-Squares Data-Fitting with Easy-to-Control Rational Curves
A Newton-Type Method for Constraned Least-Squares Data-Fttng wth Easy-to-Control Ratonal Curves G. Cascola a, L. Roman b, a Department of Mathematcs, Unversty of Bologna, P.zza d Porta San Donato 5, 4017
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 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 informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented
More informationShape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram
Shape Representaton Robust to the Sketchng Order Usng Dstance Map and Drecton Hstogram Department of Computer Scence Yonse Unversty Kwon Yun CONTENTS Revew Topc Proposed Method System Overvew Sketch Normalzaton
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 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 informationAnalysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress
Analyss of 3D Cracks n an Arbtrary Geometry wth Weld Resdual Stress Greg Thorwald, Ph.D. Ted L. Anderson, Ph.D. Structural Relablty Technology, Boulder, CO Abstract Materals contanng flaws lke nclusons
More informationA COMPARISON OF TWO METHODS FOR FITTING HIGH DIMENSIONAL RESPONSE SURFACES
Mam, Florda, U.S.A., Aprl 6-8, 7 A COMPARISON OF TWO METHODS FOR FITTING HIGH DIMENSIONAL RESPONSE SURFACES Marcelo J. Colaço Department of Mechancal and Materals Eng. Mltary Insttute of Engneerng Ro de
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More 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 informationOptimal Workload-based Weighted Wavelet Synopses
Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,
More 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 informationElectrical analysis of light-weight, triangular weave reflector antennas
Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More 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 informationAPPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF
APPLICATION OF AN AUGMENTED REALITY SYSTEM FOR DISASTER RELIEF Johannes Leebmann Insttute of Photogrammetry and Remote Sensng, Unversty of Karlsruhe (TH, Englerstrasse 7, 7618 Karlsruhe, Germany - leebmann@pf.un-karlsruhe.de
More informationSupport Vector Machines
Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned
More 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 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 informationOn Some Entertaining Applications of the Concept of Set in Computer Science Course
On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,
More informationLine Clipping by Convex and Nonconvex Polyhedra in E 3
Lne Clppng by Convex and Nonconvex Polyhedra n E 3 Václav Skala 1 Department of Informatcs and Computer Scence Unversty of West Bohema Unverztní 22, Box 314, 306 14 Plzeò Czech Republc e-mal: skala@kv.zcu.cz
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 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 informationConstructing Minimum Connected Dominating Set: Algorithmic approach
Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected
More informationKinematics of pantograph masts
Abstract Spacecraft Mechansms Group, ISRO Satellte Centre, Arport Road, Bangalore 560 07, Emal:bpn@sac.ernet.n Flght Dynamcs Dvson, ISRO Satellte Centre, Arport Road, Bangalore 560 07 Emal:pandyan@sac.ernet.n
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationExplicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements
Explct Formulas and Effcent Algorthm for Moment Computaton of Coupled RC Trees wth Lumped and Dstrbuted Elements Qngan Yu and Ernest S.Kuh Electroncs Research Lab. Unv. of Calforna at Berkeley Berkeley
More informationCubic Spline Interpolation for. Petroleum Engineering Data
Appled Mathematcal Scences, Vol. 8, 014, no. 10, 5083-5098 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.1988/ams.014.4484 Cubc Splne Interpolaton for Petroleum Engneerng Data * Samsul Arffn Abdul Karm
More informationChapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward
More informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
More informationComputers and Mathematics with Applications. Discrete schemes for Gaussian curvature and their convergence
Computers and Mathematcs wth Applcatons 57 (009) 87 95 Contents lsts avalable at ScenceDrect Computers and Mathematcs wth Applcatons journal homepage: www.elsever.com/locate/camwa Dscrete schemes for Gaussan
More informationOptimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming
Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered
More informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
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 informationON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE
Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton
More informationDynamic wetting property investigation of AFM tips in micro/nanoscale
Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen
More informationAPPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA
RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO
More informationEdge Detection in Noisy Images Using the Support Vector Machines
Edge Detecton n Nosy Images Usng the Support Vector Machnes Hlaro Gómez-Moreno, Saturnno Maldonado-Bascón, Francsco López-Ferreras Sgnal Theory and Communcatons Department. Unversty of Alcalá Crta. Madrd-Barcelona
More information2-Dimensional Image Representation. Using Beta-Spline
Appled Mathematcal cences, Vol. 7, 03, no. 9, 4559-4569 HIKARI Ltd, www.m-hkar.com http://dx.do.org/0.988/ams.03.3359 -Dmensonal Image Representaton Usng Beta-plne Norm Abdul Had Faculty of Computer and
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More 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 informationData Representation in Digital Design, a Single Conversion Equation and a Formal Languages Approach
Data Representaton n Dgtal Desgn, a Sngle Converson Equaton and a Formal Languages Approach Hassan Farhat Unversty of Nebraska at Omaha Abstract- In the study of data representaton n dgtal desgn and computer
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 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 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 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 informationUB at GeoCLEF Department of Geography Abstract
UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department
More informationGlobal Illumination: Radiosity
Last Tme? Global Illumnaton: Radosty Planar Shadows Shadow Maps An early applcaton of radatve heat transfer n stables. Projectve Texture Shadows (Texture Mappng) Shadow Volumes (Stencl Buffer) Schedule
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationEVALUATION OF THE PERFORMANCES OF ARTIFICIAL BEE COLONY AND INVASIVE WEED OPTIMIZATION ALGORITHMS ON THE MODIFIED BENCHMARK FUNCTIONS
Academc Research Internatonal ISS-L: 3-9553, ISS: 3-9944 Vol., o. 3, May 0 EVALUATIO OF THE PERFORMACES OF ARTIFICIAL BEE COLOY AD IVASIVE WEED OPTIMIZATIO ALGORITHMS O THE MODIFIED BECHMARK FUCTIOS Dlay
More informationModeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach
Modelng, Manpulatng, and Vsualzng Contnuous Volumetrc Data: A Novel Splne-based Approach Jng Hua Center for Vsual Computng, Department of Computer Scence SUNY at Stony Brook Talk Outlne Introducton and
More informationLECTURE : MANIFOLD LEARNING
LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors
More 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 information