ANALYSIS OF NON-NEGATIVE TIKHONOV AND TRUNCATED SINGULAR VALUE DECOMPOSITION REGULARIZATION INVERSION IN PCS

Size: px
Start display at page:

Download "ANALYSIS OF NON-NEGATIVE TIKHONOV AND TRUNCATED SINGULAR VALUE DECOMPOSITION REGULARIZATION INVERSION IN PCS"

Transcription

1 1 th February 13. Vol. 48 No JATIT & LLS. All rghts reserved. ISSN: E-ISSN: ANALYSIS OF NON-NEGATIVE TIKHONOV AND TRUNCATED SINGULAR VALUE DECOMPOSITION REGULARIZATION INVERSION IN PCS 1 YAJING WANG, 1 JIN SHEN, GANG ZHENG, 1 ZHENHAI DOU, 1 ZHENMEI LI 1 School of Electrcal and Electronc Engneerng, Shandong Unversty of Technology, Zbo 5591, Shandong, Chna College of Optcs and Electronc Informaton Engneerng, Shangha Unversty of Scence and Technology, Shangha 93, Chna ABSTRACT Consderng non-negatve characterstc of the partcle sze dstrbuton (PSD), based on trust-regonreflectve Newton method, two non-negatve regularzaton methods of truncated sngular value decomposton (TSVD) and Tkhonov (TIK) for photon correlaton spectroscopy (PCS) are proposed n ths paper. Combnng two regularzaton parameter crterons of and, two non-negatve regularzaton methods are studed. The study results show that, compared wth TIK, TSVD has bgger truncaton effect, poorer smoothness and narrower dstrbuton wdth of nverson PSD, n the case of nose, TSVD has smaller relatve error and peak value error of PSD, better capacty to dscrmnate bmodalty and stronger ant-nose, but at nose-free case, TSVD hasn t obvous advantages, TIK and TSVD are respectvely more sutable for usng and crteron to determne the regularzaton parameter. Keywords: Photon Correlaton Spectroscopy, Partcle Sze, Non-negatve Regularzaton, Inverson 1. INTRODUCTION Photon correlaton spectroscopy (PCS, s also called dynamc lght scatterng) technology has become an effectve method for measurng submcron and nano-partcles sze[1], whch obtan the partcle sze dstrbuton (PSD) by measurng and nvertng the autocorrelaton functon (ACF) of the ntensty fluctuatons scattered by the nvestgated sample. However, nvertng PSD from ACF s a hgh ll-posed problem, whch has been the dffculty n PCS technology. Only when ACF measured s no noses and data calculaton s no roundng errors, does the equaton have a unque soluton n theory. In the measurement, because of the presence of the nose and roundng errors, the exstence, unqueness and stablty of solutons are dffcult to guarantee. Therefore, n PCS technology, we can t solve true PSD, and only obtan ts approxmate value. For approxmate soluton, researchers have proposed numerous methods such as Cumulants method [], exponental samplng method [3], the Bayesan strateges method [4], and the neural network method [5]. Consders non-negatvty of PSD, there are some other methods such as CONTIN [6] and NNLS [7], whch have been verfed to mprove the nverson accuracy of PSD. However, these methods have the drawbacks of senstvty to nose, dffculty n choosng a regularzaton parameter, and complcatons n operaton, poor the capacty to dscrmnate bmodalty. For the solvng of ll-posed equaton, regularzaton s one of most powerful approaches. In PCS nverson, consderng together the regularzaton and non-negatvty should be very effectve. Trustregon-reflectve Newton method [8] s a wdely used non-negatve constrant method whch s ncluded n the Matlab toolbox. Therefore, based on Trust-regon-reflectve Newton method, nonnegatve regularzaton for PCS s proposed n ths paper. The regularzaton are many methods such as Tkhonov (TIK) regularzaton, truncated sngular value decomposton (TSVD) regularzaton, landweber regularzaton, conjugate gradent(cg) regularzaton and so on. So far, there s not an optmal regularzaton method sutable for any problem. Therefore, the study of dfferent regularzaton methods s very meanngful n PCS nverson. In ths paper, TIK and TSVD were compared. In regularzaton method, selecton of regularzaton parameter s crtcal. The generalzed 33

2 1 th February 13. Vol. 48 No JATIT & LLS. All rghts reserved. ISSN: E-ISSN: cross-valdaton () crteron [9] and crteron [1] are more wdely used n practce. and crteron are also compared n the PCS. By the comparson, we fnd out that characterstcs and sutable regularzaton parameter crteron of each method, and draw a concluson that TSVD has better capacty to dscrmnate bmodalty and stronger ant-nose.. INVERSION PRINCIPLES OF PCS For the lght feld of the Gaussan dstrbuton, ACF of scattered lght ntensty s gven by a Segert relatonshp. For the polydsperse partcles, the normalzed ACF of scattered lght ntensty s expressed as g ( τ) = G( Γ)exp( Γτ) dγ G ( Γ) dγ = 1 (1) where τ s the samplng tme, Γ s the decay wdth, G (Γ) s normalzed dstrbuton functon of the decay wdth. In Eq.(1), the relatonshp of decay wdth and the partcle sze s as follow, 4πn θ kbτ Γ = Dq, q = sn( ), D = () λ 3 πηd where D s dffuson coeffcent, q s the scatterng wave vector, n s the refractve ndex of the solvent, λ s the wavelength of the ncdent lght n vacuum, θ s the scatterng angle, k s the Β Boltzman constant, T s absolute temperature, η s solvent vscosty, and d s the dameter of equvalent sphercal partcles. Eq.(1) s a hgh llposed equaton. In theory, we can nvert G (Γ) from measured g (τ), G (Γ) s retreval PSD. 3. REGULARIZATION INVERSION METHOD In the practcal soluton, Eq.(1) s dscretzed as Ax = b (3) where elements of matrx b, x and A are b j = g( τ j ), x = G( Γ ) and a, j = exp( Γ τ j ), respectvely. Soluton of Eq.(3) can be expressed as the followng least squares(ls) problem, Ax b = mn = (4) x LS A powerful tool for the solvng of LS problem s the sngular value decomposton (SVD). Then, SVD of A s as follows A n T = U V = = 1 u σ T v (5) where = dag ( σ1, σ, σn ), σ are the sngular values of A, U and V s left and rght sngular values vectors, respectvely. LS soluton of Eq. (3) s also expressed as n < u, b > x = v (6) LS = 1 σ In Eq.(6), f b contans noses, then σ wll be nfntely small, whch wll lead to bg devaton of x LS. For solvng of ths problem, regularzaton s an effectve method. 3.1 Tkhonov Regularzaton (TIK) TIK adds the -norm of soluton as a constrants condton to Eq.(3). Then, LS soluton of Eq.(3) s approxmately equal to followng problem. mn{ Ax b + λ L( x-x ) } (7) where L s unt matrx, x s ntal soluton, λ s the regularzaton parameter. When x =, based on SVD theory, TIK soluton of Eq.(3) s can expressed as n σ < u, b > xtik = ( ) v (8) = 1 σ + λ σ From Eq.(8), we can see that TIK soluton of Eq.(3) actually adds the followng flter factors to the orgnal soluton of Eq.(3). σ f = (9) σ + λ In order to avod solvng of SVD and reduce the computaton, Eq.(8) can also be expressed as A b mn x- (1) λi 3. Truncated Sngular Value Decomposton Regularzaton (TSVD) Prncple of TSVD s to remove small sngular value whch amplfes the dsturbances. Prncple of TSVD s to remove small sngular value whch amplfes the dsturbances. Based on ths prncple, after truncatng small sngular value, matrx A can be expressed as 34

3 1 th February 13. Vol. 48 No JATIT & LLS. All rghts reserved. ISSN: E-ISSN: A k k = = 1 u σ v T (11) where k s regularzaton parameter. Thus, solvng of Eq.(3) s changed nto solvng of followng well-posed equatons A k x = b (1) Accordng to Eq.(5) and Eq.(11), Soluton of Eq.(1) s expressed as x TSVD = k < u, = 1 σ b > v (13) From Eq.(13), we can see that flter factors of TSVD s 1 σ > λ f = (14) σ < λ where λ s threshold, whch meets σ1 > σ > σ k > λ > σk + 1 > σn > Soluton of TSVD can also be expressed as mn A k x- b (15) 3.3 Selecton of the Regularzaton Parameter crteron crteron computes the curvature of the followng curve n log-log scale ( l g( xλ ), lg( b Ax )) λ (wth λ as ts parameter) and seek the pont wth maxmum curvature, whch s defned as the curve's corner. The curve's corner λ corresponds to the optmal regularzaton parameter value. For dscrete llposed problems, because ths curve almost always has a character-stc L-shaped appearance wth a dstnct corner separatng the vertcal and the horzontal parts of the curve. So hence ts name s called as crteron Generalzed cross-valdaton () crteron wavelength s 63.8nm, the refractve ndex of scatterng medum(water) 1.331,scatterng angle 9, absolute temperature 5, Botlzman constant J K -1,the vscosty coeffcent of water N S K -1. Generalzed cross-valdaton () selects the regularzaton parameter by mnmzng the followng functon Axreg b G= (16) I [ trace( I AA )] where G s defned as regularzaton parameters I, A s a matrx whch produces the regularzed soluton xreg when multpled wth b, I.e, x = A b,trace represents the matrx trace. reg 4. ANALYSIS OF SIMULATION DATA The solvng of Eq.(1) and Eq.(15) are acheved by trust-regon-reflectve Newton method. In Eq.(1) and Eq.(15), two crterons of regularzaton parameter are respectvely used, and form four methods such as TIK+, TIK+, TSVD+ and TSVD+. In order to verfy the valdty of non-negatve TIK and TSVD based on trust-regon-reflectve Newton method and study ther characterstc n the PCS nverson, usng four methods, nose-free and nosy ACFs of unmodal and bmodal dstrbutons partcles were nverted. Ther nverson results are shown n Fgs.1~6, Inverson data of PSD are shown n Tables1~4. In the Tables1~4, the relatve error s defned as relatve error = x x theory x (17) theory In the study, nose-free and nosy ACFs wth nose level of.5 and.1 respectvely were acqured by the smulaton. The smulaton ntal PSD s Johnson s SB dstrbuton [11]. In the smulatons, the unmodal dstrbutons partcles share parameters of Johnson s SB ρ =, β =1.1, α max =6nm and α mn =5nm, the bmodal dstrbutons partcles utlzed the sum of two Johnson s SB functons of equal ntensty quotents, sharng parameters ρ 1 =3.8, β 1 =.1, ρ =-.4, β =., α max =7nm and α mn =1nm. Smulaton experment condtons are as follows, the 35

4 1 th February 13. Vol. 48 No JATIT & LLS. All rghts reserved. ISSN: E-ISSN: Tabel.1 Inverted Data Of Unmodal Partcles For TIK In The Dfferent Crteron nose levels peak peak value relatve peak peak value relatve value/nm error % error value/nm error % error Tabel. Inverted Data Of Unmodal Partcles For TSVD In The Dfferent Crteron nose levels peak peak value relatve peak peak value relatve Fgure.1: Inverted PSD Of Unmodal Partcles Wth Free-Nose (A) TIK (B) TSVD Fgure.: Inverted PSD Of Unmodal Partcles At Nose Levels.5 (A) TIK (B) TSVD Fgure.3: Inverted PSD Of Unmodal Partcles At Nose Levels.1 (A) TIK (B) TSVD 36

5 1 th February 13. Vol. 48 No JATIT & LLS. All rghts reserved. ISSN: E-ISSN: Tabel.3 Inverted data of bmodal partcles for TIK n the dfferent crteron nose levels peak peak value relatve peak peak value relatve 16.8, , , , , , Fgure.4: Inverted PSD Of Bmodal Partcles Wth Free-Nose (A) TIK (B) TSVD Fgure.5: Inverted PSD of bmodal Partcles at nose levels.5 TIK TSVD Fgure.6: Inverted PSD Of Bmodal Partcles At Nose Levels.1 (A) TIK (B) TSVD Tabel.4 Inverted Data Of Bmodal Partcles For TSVD In The Dfferent Crteron nose levels peak peak value relatve peak peak value relatve value/nm error % error 167.4, 553.6, ,533.6, , , ,546.9, , 533.6, , ,

6 1 th February 13. Vol. 48 No JATIT & LLS. All rghts reserved. ISSN: E-ISSN: From thers nverson results of the Fgs 1~6 and Tables1~4, when non-negatve constrants of TIK and TSVD were acheved by Trust-regon-reflectve Newton method, we can fnd out the followng phenomenon and draw some conclusons. 1) For the unmodal dstrbutons partcles, nverson results of TIK and TSVD are the unmodal PSD. For the bmodal dstrbutons partcles, nverson results of TSVD are the bmodal PSD, at nose level ~.5, TIK + can obtan the bmodal PSD, at nose level.1, PSD of TIK + hasn t apparent bmodal characterstcs. Therefore, at nose level ~.1, TSVD can use for nverson of the unmodal and bmodal dstrbutons partcles, whle TIK can use for nverson of the unmodal dstrbutons partcles and bmodal dstrbutons partcles wth nose level of less than.5. ) The nverson results of TIK and TSVD may emerge fluctuatons. Inverson PSD of TIK s relatvely smoother, whle that of TSVD fluctuates more serous. Ths s because dfferent flter wndow for truncatng sngular value s respectvely used n TIK and TSVD. Dfferent flter wndow has dfferent truncaton effects, whch leads to fluctuatons of nverson PSD. Steeper the wndow functon s, more outstandng truncaton effect s. Takng nverson of unmodal dstrbuton partcles wth nose level.5 as an example, flter wndows of TIK and TSVD are shown n Fg.7. The sngular value of TSVD was truncated by the rectangular wndow functon n flterng process. Rectangular wndow functon s steeper, ts truncaton effect s outstandng and fluctuatons phenomenon of nverson PSD s more severe. Compared wth TSVD, flterng wndow of TIK s smoother, ts truncaton effect s weaker, and ts nverson PSD s relatvely smoother TIK TSVD Fgure.7: Flter Wndow Functon Of TIK And TSVD 3) For a unmodal dstrbutons partcles nverson, peak value error of two methods s the same. However, from nverson relatve error pont of vew, at free-nose case, relatve error of TIK s smaller, at the nose case, compared wth TIK, relatve error of TSVD s sgnfcantly lower and s lower than that of TIK up to.445; For the bmodal dstrbuton partcles nverson, compared wth TIK, at all noses cases, relatve errors of TSVD were lower and s lower than that of TIK up to From the peak value error the pont of vew, at nose-free case, peak value error of TSVD + s 6.97%, t was sgnfcantly hgher than that of TIK. However, at all nose cases, compared wth TIK, peak value error of TSVD s smaller and most reduce the peak error 3.94%. From the capacty to dscrmnate bmodalty the pont of vew, capacty to dscrmnate bmodalty of TSVD s stronger than TIK, at nose level.1, nverson results of TSVD stll has apparent bmodal characterstcs, whle nverson results of TIK hasn t apparent bmodal characterstcs. From the peak wdth the pont of vew, n all nose cases, nverted PSD of TIK s wder than that of TSVD. In summary, we can draw the followng conclusons: n the nose cases, TSVD has smaller relatve error and peak value error, better capacty to dscrmnate bmodalty, a stronger ant-nose, narrower peak wdth, but at nose-free cases, TSVD haven t obvous advantage than TIK. 4) By comparng and regularzaton parameter crteron n the nverson of TIK and TSVD, we can be seen that, for the unmodal dstrbuton partcles, peak value error of TIK + and TIK + s same, but at the nose level.1, relatve error of crteron s sgnfcantly lower than that of, for the bmodal dstrbuton partcles, when the nose level s greater than or equal to.5, nverson result of crteron can not dscrmnate two peaks, whle crteron can clearly dstngush two peaks at the nose level lower than.1, at the nose level.1, nverson PSD of crteron stll has weak characterstc of two peaks. Therefore, the crteron s more sutable to determne the regularzaton parameter for TIK n PCS nverson; when nvertng PSD by TSVD, and crteron can get more accurate nverson results, however, compared wth crteron, peak value error of crteron s smaller, maxmum peak value error of TSVD+ s less than 6.97%, whle that of TSVD + s 7.94%, moreover, relatve error of TSVD + s generally hgher, at nose level.1, ts capacty to dscrmnate two peaks s relatvely poorer. Therefore, crteron s more sutable to determne the regularzaton parameter for TSVD n PCS nverson. 38

7 1 th February 13. Vol. 48 No JATIT & LLS. All rghts reserved. ISSN: E-ISSN: EXPERIMENTAL RESULTS ACF of scattered lght ntensty was obtaned through PCS experment setup of our research group[1].the materals tested were standard polystyrene latex spheres suspended n purfed water. They are unmodal partcle wth average dameters 1nm and bmodal dstrbutons partcle wth average dameters 6 nm and nm, For the latter, the relatve proporton of two samples was approxmately 1:1. All measurements were made at scatterng angle of 9 and temperture 98 K. Usng TIK+, TIK+, TSVD+ and TSVD+, respectvely, the above measured ACF data were nverted. The nverson PSDs and data are shown n Fgs.8 ~9 and Table 5. As can be noted from Fgs.8~9 and Table5, nverson PSD of TIK and TSVD are both consstent wth ther true PSD. However, compared wth TIK, the peak value of TSVD s more close to the true value, ts peak wdth s also narrower. It shows that TSVD has good nose mmunty. But nverson PSD smoothness of TSVD s worse. In terms of regularzaton parameters crteron, nverson results of TIK + and TSVD + L- curve more close to true dstrbuton. Therefore, from the analyss of the measured data, we can draw the concluson consstent wth smulaton data Fgure.8: Inverson PSD Of 1nm Partcles (A) TIK (B) TSVD Fgure.9: Inverson PSD Of 6nm And nm Partcles (A) TIK (B) TSVD Partcles (nm) Table 5 Inverson Peak Value Of Expermental Unmodal And Bmodal Partcles TIK TSVD , 54,.5 63, ,.5 39

8 1 th February 13. Vol. 48 No JATIT & LLS. All rghts reserved. ISSN: E-ISSN: CONCLUSION For nverson problem of PCS, based on trustregon-reflectve Newton method, at regularzaton parameter crteron of and, two nonnegatve constrants regularzatons wth TIK and TSVD were proposed and compared n ths paper. By the study of smulaton and experment data of unmodal and bmodal dstrbutons partcles, we can be drawn the followng conclusons. Frstly, compared wth TIK, truncaton error of TSVD s bgger, smoothness and peak wdth of ts nverson PSD s poorer and narrower, respectvely. Secondly, n the case of nose, nverson PSD of TSVD has smaller relatve error, smaller peak value error, better capacty to dscrmnate bmodalty and stronger ant-nose, but nose-free case, TSVD hasn t obvous advantages. Thrdly, for PCS nverson, TIK and TSVD are respectvely more sutable for usng and crteron to determne the regularzaton parameter. These conclusons can be treated as a reference for the applcaton of regularzaton method n PCS nverson. ACKNOWLEDGEMENTS Ths work was supported by the Natural Scence Foundaton of Shandong Provnce (ZR1FM5, ZR1EEM8) REFERENCES: [1] K. Takahash, H.Kato and T.Sato, Precse measurement of the sze of nanopartcles by dynamc lght scatterng wth Uncertanty Analyss, Part. Part. Syst. Charact, Vol. 5, No. 1, 8, pp [] D. E. Kopple, Analyss of macromolecular polydspersty n ntensty correlaton spectroscopy:the method of cumulants, J. Chem. Phys, Vol.57, No. 11,197, pp [3] N. Ostrowsky, D. Sornette, P. Parker, and E. R. Pke, Exponental samplng method for lght scatterng polydspersty analyss, J. Mod. Opt, Vol. 8, No. 8, 1981, pp [4] M. Iqbal, On photon correlaton measurements of collodal sze dstrbutons usng Bayesan strateges, J. Comput. Appl. Math, Vol. 16, No. 1-,, pp [5] L. M Guglotta, G. S Stegmayer and L.A Clement, A neural network model for estmatng the partcle sze dstrbuton of dlute latex from multangle dynamc lght scatterng measurements, Part Part Syst Charact, Vol. 6, No.4, 9, pp [6] S.W. Provencher, CONTIN: A general purpose constraned regularzaton program for nvertng nosy lnear algebrac and ntegral equatons, Comput Phy Commun, Vol. 7, 198, pp.9-4. [7] I. D. Morrson and E. F. Grabowsk, Improved Technques for Partcle Sze Determnaton by Quas-Elastc Lght Scatterng, Langmur, No. 1, 1985, pp [8] Coleman, T.F. and Y. L, "An Interor, Trust Regon Approach for Nonlnear Mnmzaton Subject to Bounds," SIAM Journal on Optmzaton, Vol. 6, No., 1996, pp [9] G.H.Golub, M.T.Heath and G. Wahba. Generalzed cross-valdaton as a method for choosng a good rdge parameter, Technometrcs, Vol.1, 1979, pp [1] P. C. Hansen. The Use of the L-Curve n the Regularzaton of Dscrete Ill-posed Problems, SIAM J Sc Comput, Vol. 14, No.6, 1993, pp [11] A. B.Yu, N.Standsh. A study of partcles sze dstrbuton, Powder Technology, Vol. 6, 199, pp [1] W. Lu, J. Shen, and X. Sun, Desgn of multple-tau photon correlaton system mplemented by FPGA. Proceedngs of the Internatonal Conference on Embedded Software and Systems, Inst. of Elec. and Elec. Eng. Computer Socety, July, 9-31, 8, pp

Solving two-person zero-sum game by Matlab

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

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

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

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

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

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

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

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

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

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

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Cluster Analysis of Electrical Behavior

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

An Image Fusion Approach Based on Segmentation Region

An Image Fusion Approach Based on Segmentation Region Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua

More information

Finite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c

Finite Element Analysis of Rubber Sealing Ring Resilience Behavior Qu Jia 1,a, Chen Geng 1,b and Yang Yuwei 2,c Advanced Materals Research Onlne: 03-06-3 ISSN: 66-8985, Vol. 705, pp 40-44 do:0.408/www.scentfc.net/amr.705.40 03 Trans Tech Publcatons, Swtzerland Fnte Element Analyss of Rubber Sealng Rng Reslence Behavor

More information

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.

REFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water. Purpose Theory REFRACTION a. To study the refracton of lght from plane surfaces. b. To determne the ndex of refracton for Acrylc and Water. When a ray of lght passes from one medum nto another one of dfferent

More information

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

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

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

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

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

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

Design of Structure Optimization with APDL

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

Positive Semi-definite Programming Localization in Wireless Sensor Networks

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

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

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

More information

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

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

An Improved Image Segmentation Algorithm Based on the Otsu Method

An Improved Image Segmentation Algorithm Based on the Otsu Method 3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES

REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES Laser dffracton s one of the most wdely used methods for partcle sze analyss of mcron and submcron sze powders and dspersons. It s quck and easy and provdes

More information

Solitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis

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

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc.

An Indian Journal FULL PAPER ABSTRACT KEYWORDS. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 97-735 Volume Issue 9 BoTechnology An Indan Journal FULL PAPER BTAIJ, (9), [333-3] Matlab mult-dmensonal model-based - 3 Chnese football assocaton super league

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Dynamic wetting property investigation of AFM tips in micro/nanoscale

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

Virtual Machine Migration based on Trust Measurement of Computer Node

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

Electrical analysis of light-weight, triangular weave reflector antennas

Electrical analysis of light-weight, triangular weave reflector antennas Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna

More information

Boundary Condition Simulation for Structural Local Refined Modeling Using Genetic Algorithm

Boundary Condition Simulation for Structural Local Refined Modeling Using Genetic Algorithm 2016 Internatonal Conference on Artfcal Intellgence: Technques and Applcatons (AITA 2016) ISBN: 978-1-60595-389-2 Boundary Condton Smulaton for Structural Local Refned Modelng Usng Genetc Algorthm Zhong

More information

BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET

BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET 1 BOOSTING CLASSIFICATION ACCURACY WITH SAMPLES CHOSEN FROM A VALIDATION SET TZU-CHENG CHUANG School of Electrcal and Computer Engneerng, Purdue Unversty, West Lafayette, Indana 47907 SAUL B. GELFAND School

More information

Dependence of the Color Rendering Index on the Luminance of Light Sources and Munsell Samples

Dependence of the Color Rendering Index on the Luminance of Light Sources and Munsell Samples Australan Journal of Basc and Appled Scences, 4(10): 4609-4613, 2010 ISSN 1991-8178 Dependence of the Color Renderng Index on the Lumnance of Lght Sources and Munsell Samples 1 A. EL-Bally (Physcs Department),

More information

The Research of Support Vector Machine in Agricultural Data Classification

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

X- Chart Using ANOM Approach

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

A Robust Method for Estimating the Fundamental Matrix

A Robust Method for Estimating the Fundamental Matrix Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.

More information

TEST-05 TOPIC: OPTICS COMPLETE

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

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

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

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Face Recognition University at Buffalo CSE666 Lecture Slides Resources:

Face Recognition University at Buffalo CSE666 Lecture Slides Resources: Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural

More information

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

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

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

Recognizing Faces. Outline

Recognizing Faces. Outline Recognzng Faces Drk Colbry Outlne Introducton and Motvaton Defnng a feature vector Prncpal Component Analyss Lnear Dscrmnate Analyss !"" #$""% http://www.nfotech.oulu.f/annual/2004 + &'()*) '+)* 2 ! &

More information

Learning a Class-Specific Dictionary for Facial Expression Recognition

Learning a Class-Specific Dictionary for Facial Expression Recognition BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 4 Sofa 016 Prnt ISSN: 1311-970; Onlne ISSN: 1314-4081 DOI: 10.1515/cat-016-0067 Learnng a Class-Specfc Dctonary for

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

A Clustering Algorithm for Key Frame Extraction Based on Density Peak

A Clustering Algorithm for Key Frame Extraction Based on Density Peak Journal of Computer and Communcatons, 2018, 6, 118-128 http://www.scrp.org/ournal/cc ISSN Onlne: 2327-5227 ISSN Prnt: 2327-5219 A Clusterng Algorthm for Key Frame Extracton Based on Densty Peak Hong Zhao

More information

An efficient method to build panoramic image mosaics

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

More information

Collaboratively Regularized Nearest Points for Set Based Recognition

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

5.0 Quality Assurance

5.0 Quality Assurance 5.0 Dr. Fred Omega Garces Analytcal Chemstry 25 Natural Scence, Mramar College Bascs of s what we do to get the rght answer for our purpose QA s planned and refers to planned and systematc producton processes

More information

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

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

Application of Grey-based Taguchi methods on Determining. Process Parameter of linear motion guide with Multiple. Performance Characteristics

Application of Grey-based Taguchi methods on Determining. Process Parameter of linear motion guide with Multiple. Performance Characteristics Proceedngs of the th WSEAS Internatonal Conference on APPLIED MATHEMATICS, Dallas, Texas, USA, March -, Applcaton of Grey-based Taguch methods on Determnng Process Parameter of lnear moton gude wth Multple

More information

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

2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.

More information

Optimizing Document Scoring for Query Retrieval

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

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

Correlative features for the classification of textural images

Correlative features for the classification of textural images Correlatve features for the classfcaton of textural mages M A Turkova 1 and A V Gadel 1, 1 Samara Natonal Research Unversty, Moskovskoe Shosse 34, Samara, Russa, 443086 Image Processng Systems Insttute

More information

A Novel Adaptive Descriptor Algorithm for Ternary Pattern Textures

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

More information

Performance Assessment and Fault Diagnosis for Hydraulic Pump Based on WPT and SOM

Performance Assessment and Fault Diagnosis for Hydraulic Pump Based on WPT and SOM Performance Assessment and Fault Dagnoss for Hydraulc Pump Based on WPT and SOM Be Jkun, Lu Chen and Wang Zl PERFORMANCE ASSESSMENT AND FAULT DIAGNOSIS FOR HYDRAULIC PUMP BASED ON WPT AND SOM. Be Jkun,

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

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

Lecture 13: High-dimensional Images

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

More information

Maximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation

Maximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 5) Maxmum Varance Combned wth Adaptve Genetc Algorthm for Infrared Image Segmentaton Huxuan Fu College of Automaton Harbn

More information

Network Intrusion Detection Based on PSO-SVM

Network Intrusion Detection Based on PSO-SVM TELKOMNIKA Indonesan Journal of Electrcal Engneerng Vol.1, No., February 014, pp. 150 ~ 1508 DOI: http://dx.do.org/10.11591/telkomnka.v1.386 150 Network Intruson Detecton Based on PSO-SVM Changsheng Xang*

More information

Simulation Based Analysis of FAST TCP using OMNET++

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

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

Deep learning is a good steganalysis tool when embedding key is reused for different images, even if there is a cover source-mismatch

Deep learning is a good steganalysis tool when embedding key is reused for different images, even if there is a cover source-mismatch Deep learnng s a good steganalyss tool when embeddng key s reused for dfferent mages, even f there s a cover source-msmatch Lonel PIBRE 2,3, Jérôme PASQUET 2,3, Dno IENCO 2,3, Marc CHAUMONT 1,2,3 (1) Unversty

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

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

Corner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent

More information

Computer Vision. Exercise Session 1. Institute of Visual Computing

Computer Vision. Exercise Session 1. Institute of Visual Computing Computer Vson Exercse Sesson 1 Organzaton Teachng assstant Basten Jacquet CAB G81.2 basten.jacquet@nf.ethz.ch Federco Camposeco CNB D12.2 fede@nf.ethz.ch Lecture webpage http://www.cvg.ethz.ch/teachng/compvs/ndex.php

More information

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES

More information

High-Boost Mesh Filtering for 3-D Shape Enhancement

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

More information

Face Recognition Method Based on Within-class Clustering SVM

Face Recognition Method Based on Within-class Clustering SVM Face Recognton Method Based on Wthn-class Clusterng SVM Yan Wu, Xao Yao and Yng Xa Department of Computer Scence and Engneerng Tong Unversty Shangha, Chna Abstract - A face recognton method based on Wthn-class

More information

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010 Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

Intra-Parametric Analysis of a Fuzzy MOLP

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

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

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

AP PHYSICS B 2008 SCORING GUIDELINES

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

More information

Kent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming

Kent 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

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

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

An Influence of the Noise on the Imaging Algorithm in the Electrical Impedance Tomography *

An Influence of the Noise on the Imaging Algorithm in the Electrical Impedance Tomography * Open Journal of Bophyscs, 3, 3, 7- http://dx.do.org/.436/ojbphy.3.347 Publshed Onlne October 3 (http://www.scrp.org/journal/ojbphy) An Influence of the Nose on the Imagng Algorthm n the Electrcal Impedance

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

Recommended Items Rating Prediction based on RBF Neural Network Optimized by PSO Algorithm

Recommended Items Rating Prediction based on RBF Neural Network Optimized by PSO Algorithm Recommended Items Ratng Predcton based on RBF Neural Network Optmzed by PSO Algorthm Chengfang Tan, Cayn Wang, Yuln L and Xx Q Abstract In order to mtgate the data sparsty and cold-start problems of recommendaton

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 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 A mathematcal programmng approach to the analyss, desgn and

More information

A Deflected Grid-based Algorithm for Clustering Analysis

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

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Module Management Tool in Software Development Organizations

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

Shape-adaptive DCT and Its Application in Region-based Image Coding

Shape-adaptive DCT and Its Application in Region-based Image Coding Internatonal Journal of Sgnal Processng, Image Processng and Pattern Recognton, pp.99-108 http://dx.do.org/10.14257/sp.2014.7.1.10 Shape-adaptve DCT and Its Applcaton n Regon-based Image Codng Yamn Zheng,

More information

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

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION

BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION BAYESIAN MULTI-SOURCE DOMAIN ADAPTATION SHI-LIANG SUN, HONG-LEI SHI Department of Computer Scence and Technology, East Chna Normal Unversty 500 Dongchuan Road, Shangha 200241, P. R. Chna E-MAIL: slsun@cs.ecnu.edu.cn,

More information

Monte Carlo Rendering

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

More information

Research of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm

Research of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm , pp.197-202 http://dx.do.org/10.14257/dta.2016.9.5.20 Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College,

More information

A Clustering Algorithm Solution to the Collaborative Filtering

A Clustering Algorithm Solution to the Collaborative Filtering Internatonal Journal of Scence Vol.4 No.8 017 ISSN: 1813-4890 A Clusterng Algorthm Soluton to the Collaboratve Flterng Yongl Yang 1, a, Fe Xue, b, Yongquan Ca 1, c Zhenhu Nng 1, d,* Hafeng Lu 3, e 1 Faculty

More information

A Background Subtraction for a Vision-based User Interface *

A Background Subtraction for a Vision-based User Interface * A Background Subtracton for a Vson-based User Interface * Dongpyo Hong and Woontack Woo KJIST U-VR Lab. {dhon wwoo}@kjst.ac.kr Abstract In ths paper, we propose a robust and effcent background subtracton

More information

A Study on Clustering for Clustering Based Image De-Noising

A Study on Clustering for Clustering Based Image De-Noising Journal of Informaton Systems and Telecommuncaton, Vol. 2, No. 4, October-December 2014 196 A Study on Clusterng for Clusterng Based Image De-Nosng Hossen Bakhsh Golestan* Department of Electrcal Engneerng,

More information

Modular PCA Face Recognition Based on Weighted Average

Modular PCA Face Recognition Based on Weighted Average odern Appled Scence odular PCA Face Recognton Based on Weghted Average Chengmao Han (Correspondng author) Department of athematcs, Lny Normal Unversty Lny 76005, Chna E-mal: hanchengmao@163.com Abstract

More information

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

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

THE PATH PLANNING ALGORITHM AND SIMULATION FOR MOBILE ROBOT

THE PATH PLANNING ALGORITHM AND SIMULATION FOR MOBILE ROBOT Journal of Theoretcal and Appled Informaton Technology 30 th Aprl 013. Vol. 50 No.3 005-013 JATIT & LLS. All rghts reserved. ISSN: 199-8645 www.jatt.org E-ISSN: 1817-3195 THE PATH PLANNING ALGORITHM AND

More information

Query Clustering Using a Hybrid Query Similarity Measure

Query Clustering Using a Hybrid Query Similarity Measure Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information