Mohammed El Hassouni DESTEC FLSHR, University of Mohammed V-Agdal- Rabat, Morocco
|
|
- Melvin Morgan
- 6 years ago
- Views:
Transcription
1 (IJCSIS) Internatonal Journal of Computer Scence an Informaton Securty, Vol. 8, No., 00 3D-Mesh enosng usng an mprove vertex base ansotropc ffuson Mohamme El Hassoun DESTEC FLSHR, Unversty of Mohamme V-Agal- Rabat, Morocco Drss Aboutane LRIT, UA CNRST FSR, Unversty of Mohamme V-Agal- Rabat, Morocco Abstract Ths paper eals wth an mprovement of vertex base nonlnear ffuson for mesh enosng. Ths metho rectly flters the poston of the vertces usng Laplace, reuce centere Gaussan an Raylegh probablty ensty functons as ffusvtes. The use of these DFs mproves the performance of a vertex-base ffuson metho whch are aapte to the unerlyng mesh structure. We also compare the propose metho to other mesh enosng methos such as Laplacan flow, mean, mean, mn an the aaptve MMSE flterng. To evaluate these methos of flterng, we use two error metrcs. The frst s base on the vertces an the secon s base on the normals. Expermental results emonstrate the effectveness of our propose metho n comparson wth the exstng methos. Keywors- Mesh enosng, ffuson, vertex. I. INTRODUCTION The current graphc ata processng tools allow the esgn an the vsualzaton of realstc an precse 3D moels. These 3D moels are gtal representatons of ether the real worl or an magnary worl. The technques of acquston or esgn of the 3D moels (moellers, scanners, sensors) generally prouce sets of very ense ata contanng both geometrcal an appearance attrbutes. The geometrcal attrbutes escrbe the shape an mensons of the obect an nclue the ata relatng to a unt of ponts on the surface of the moelle obect. The attrbutes of appearance contan nformaton whch escrbes the appearance of the obect such as colours an textures. These 3D moels can be apple n varous fels such as the mecal magng, the veo games, the cultural hertage... etc []. These 3D ata are generally represente by polygonal meshes efne by a unt of vertex an faces. The most meshes use for the representaton of obects n 3D space are the trangular surface meshes. The presence of nose n surfaces of 3D obects s a problem that shoul not be gnore. The nose affectng these surfaces can be topologcal, therefore t woul be create by algorthms use to extract the meshes startng from groups of vertces; or geometrcal, an n ths case t woul be ue to the errors of measurements an samplng of the ata n the varous treatments []. To elmnate ths nose, a frst stuy was mae by Taubn [3] by applyng sgnal processng methos to surfaces of 3D obects. Ths stuy has encourage many researchers to evelop extensons of mage processng methos n orer to apply them to 3D obects. Among these methos, there are those base on Wener flter [4], Laplacan flow [5] whch austs smultaneously the place of each vertex of mesh on the geometrcal center of ts neghborng vertex, mean flter [5], an Alpha-Trmmng flter [6] whch s smlar to the nonlnear ffuson of the normals wth an automatc choce of threshol. The only fference s that nstea of usng the nonlnear average, t uses the lnear average an the non teratve metho base on robust statstcs an local prectve factors of frst orer of the surface to preserve the geometrc structure of the ata [7]. There are other approaches for enosng 3D obects such as aaptve flterng MMSE [8]. Ths flter epens on the form [9] whch can be consere n a specal case as an average flter [5], a mn flter [9], or a flter arrange between the two. Other approaches are base on blateral flterng by entfcaton of the characterstcs [0], the non local average [] an aaptve flterng by a transform n volumetrc stance for the conservaton of the characterstcs []. Recently, a new metho of ffuson base on the vertces [3] was propose by Zhang an Ben Hamza. It conssts n solvng a nonlnear screte partal fferental equaton by entrely preservng the geometrcal structure of the ata. In ths artcle, we propose an mprovement of the vertex base ffuson propose by Zhang an Ben Hamza. The only fference s to use of fferent ffusvtes such as the functons of Laplace, reuce centre Gaussan an Raylegh nstea of the functon of Cauchy. To estmate these varous methos of flterng, two error metrc L [3] are use. Ths artcle s organze as follows: Secton presents the problem formulaton. In Secton 3, we revew some 3D mesh ISSN
2 (IJCSIS) Internatonal Journal of Computer Scence an Informaton Securty, Vol. 8, No., 00 enosng technques; Secton 4 presents the propose T. Denote by N(T) the set of all mesh trangles that have a approaches; Secton 5 presents the use error metrcs. In common ege or vertex wth T (see Fg. )T Secton 6, we prove expermental results to emonstrate a much mprove performance of the propose methos n 3D mesh smoothng. Secton 7 eals wth some conclung remarks. II. ROBLEM FORMULATION 3D obects are usually represente as polygonal or trangle meshes. A trangle mesh s a trple M= (, ε, T) where = {,, n } s the set of vertces, ε = {e } s the set of eges an T = {T,,T n } s the set of trangles. Each ege connects a par of vertces (, ). The neghbourng of a vertex s the set * = { : ~ }. The egree of a vertex s the number of the neghbours. N( ) s the set of the neghbourng vertces of. N(T ) s the set of the neghbourng trangles of T. We enote by A(T ) an n(t ) the area an the unt normal of T, respectvely. The normal n at a vertex s obtane by averagng the normals of ts neghbourng trangles an s gven by n = n( T ) () * 5 T T The mean ege length l of the mesh s gven by l = e ε e ε Durng acquston of a 3D moel, the measurements are perturbe by an atve nose: () = ' +η (3) Where the vertex nclues the orgnal vertex an the ranom nose processη. Ths nose s generally consere as a Gaussan atve nose. For that, several methos of flterng of the meshes were propose to flter an ecrease the nose contamnatng the 3D moels. III. RELATED WORK In ths secton, we present the methos base on the normals such as the mean, the mean, the mn an the aaptve MMSE flters an the methos base on the vertces such as the laplacen flow an the vertex-base ffuson usng the functons of Cauchy, Laplace, Gaussan an Raylegh. A. Normal-base methos Conser an orente trangle mesh. Let T an U be a mesh trangles, n(t) an n(u ) be the unt normal of T an U respectvely, A(T) be the area of T, an C(T) be the centro of Fg. Left: Trangular mesh. Rght: upatng mesh vertex poston. ) Mean Flter: The mesh mean flterng scheme nclues three steps [5]: Step. For each mesh trangle T, compute the average normal m(t) : m T = U N ( T ) n( U ) Step. Normalze the average normal m(t) : (4) m T m( T ) (5) m T Step 3. Upate each vertex n the mesh: Wth ( T ) new ol + A T v( T ) A T ( T ) C m( T ) m( T ) v.. (6) = (7) v s the proecton of the vector C.. onto the recton of m(t), as shown by the rght mage of Fg.. ) Mn flter : The process of mn flterng ffers from the average flterng only at step. Instea of makng the average of the normals, we etermne the narrowest normal, η, for each face, by usng the followng steps [9]: - Compute of angle Φ between n(t) an n(u ). - Research of the mnmal angle: If Φ s the mnmal angle n N(T) then n(t) s replace by n(u ) ISSN
3 (IJCSIS) Internatonal Journal of Computer Scence an Informaton Securty, Vol. 8, No., 00 3) Angle Mean Flter: Ths metho s smlar to mn flterng; the only fference s that nstea of seekng the narrowest normal we etermne the mean normal by applyng the angle mean flter [5]: ( ( T ) n) θ = n, (8) U If θ s the mean angle n N(T) then n(t) s replace by n(u ). 4) Aaptve MMSE Flter: Ths flter ffers from the average flter only at step. The new normal m(t) for each trangle T s calculate by [8]: ( T) Ml σn > σlouσ l = 0 m T = σ n σn n + 0 T M l T σn σletσ l σl σl N n ( U ) = 0 (9) = = 0 M l T (0) N Conserng the followng expresson whch allows the upate of the mesh vertces [5] new ol ( ) + λd () Where D() s a splacement vector, an λ s a step-sze parameter. The Laplacan smoothng flow s obtane f the splacement vector D() s efne by the so-calle umbrella operator [4] (see Fg. ) : U ( ) = n N ( ) ol N() s the -rng of mesh vertces neghbourng on (3) ) Vertex-Base Dffuson usng the Functon of Cauchy: Ths metho [3] conssts n upatng the mesh vertces by solvng a nonlnear screte partal fferental equaton usng the functon of Cauchy. σ n s the varance of atve nose an σ l s the varance of neghbourng mesh normals whch s change accorng to elements of normal vector. Thus, σ l s calculate as follows: N n ( U ) = 0 σ l = M l ( T ) () N = 0 B. Vertex-base methos ) Laplacan Flow Fg 3. Illustraton of two neghbourng rngs. The upate of the vertces of mesh (see Fg. 3) s gven by + * ( g( ) + g( ) Where g s Cauchy weght functon gven by (4) g ( x) = (5) x + c Fg. Upatng vertex poston by umbrella operator. an c s a constant tunng parameter that nees to be estmate ISSN
4 (IJCSIS) Internatonal Journal of Computer Scence an Informaton Securty, Vol. 8, No., 00 The graent magntues are gven by Conser an orgnal moel M an the moel after ang nose or applyng several teratons smoothng M. s a vertex of M. Let set st (, M ) equal to the stance between an / a trangle of the eal mesh M closest to. Our L vertexposton error metrc s gven by = (6) An * / k = * (7) k k ε v = A () 3A ( M ) M ' ( ) st(, M ) Where A() s the summaton of areas of all trangles ncent on an A(M) s the total area of M. Note that the upate rule of the propose metho requres the use of two neghbourng rngs as epcte n Fg. 3. IV. ROOSED METHOD The metho of vertex-base ffuson [3] was propose by Zhang an Ben Hamza an whch conssts n solvng a nonlnear screte partal fferental equaton usng the functon of Cauchy. In ths secton, we propose an mprovement of the vertexbase ffuson propose by Zhang an Ben Hamza. The only fference s the use of other ffusvty functons nstea of Cauchy functon. These functons are presente as follows: - Reuce Centere Gaussan functon : x exp c g x = (8) p - Laplace functon : x exp abs c g x = (9) - Raylegh functon : x c x g x = exp (0) c c s a constant tunng parameter that nees to be estmate for each strbuton. V. L ERROR METRIC To quantfy the better performance of the propose approaches n comparson wth the metho base on the vertces usng the functon of Cauchy an the other methos, we compute the vertex-poston an the face-normal error metrcs L [3]. The face-normal error metrc s efne by ' ε f = A( T ) n( T ) n( T ) () A M T M Here T an T are trangles of the meshes M an M respectvely; n(t) an n(t ) are the unt normals of T an T respectvely an A(T) s the total area of T. VI. EXERIMENTAL RESULTS Ths secton presents smulaton results where the normal base methos, the vertex-base methos an the propose metho are apple to nosy 3D moels obtane by ang Gaussan nose as shown n Fgs 6 an 8. The stanar evaton of Gaussan nose s gven by σ = nose l (3) Where l s the mean ege length of the mesh. We also test the performance of the propose methos on orgnal nosy laser-scanne 3D moels shown n Fgs 4 an 0. The metho of vertex-base ffuson usng the propose ffusvty functons of Laplace, reuce centre Gaussan an Raylegh are a lttle bt more accurate than the metho of vertex-base ffuson usng the functon of Cauchy. Some features are better preserve wth the approaches of vertex base ffuson usng these functons (see Fgs 4 an 0). By comparng the four stnct methos (see Fgs 5 an ), we notce that the propose metho gves the smallest error metrcs comparng to metho of vertex-base ffuson usng the functon of Cauchy. The expermental results show clearly that vertex-base methos outperform the normal-base methos n term of vsual qualty. These results are llustrate by Fg 6. In Fg 7, the values of the two error metrcs show clearly that the vertex-base ffuson usng the functons of Laplace, reuce centre Gaussan an Raylegh gve the best results an they are more effectve than the methos base on the normals. Fg 7 also shows that the approaches base on the ISSN
5 (IJCSIS) Internatonal Journal of Computer Scence an Informaton Securty, Vol. 8, No., 00 vertces such as Laplacen flow an the vertex-base ffuson usng the functons of Cauchy, Laplace, reuce centre Gaussan an Raylegh gve results whose varaton s remarkably small. In all the experments, we observe that the vertex-base ffuson usng fferent laws s smple an easy to mplement, an requre only some teratons to remove the nose. The ncrease n the number of teraton nvolves a problem of over smoothng (see Fg 8). In Fg 9, we see that the metho of vertex-base ffuson usng the functon of Cauchy leas more quckly to an over smoothng than the methos of vertex-base ffuson usng the functons of Laplace, reuce centere Gaussan an Raylegh. VII. CONCLUSION In ths paper, we ntrouce a vertex-base ansotropc ffuson for 3D mesh enosng by solvng a nonlnear screte partal fferental equaton usng the ffusvty functons of Laplace, reuce centere Gaussan an Raylegh. These metho s effcent for 3D mesh enosng strategy to fully preserve the geometrc structure of the 3D mesh ata. The expermental results clearly show a slght mprovement of the performance of the propose approaches usng the functons of Laplace, reuce centere Gaussan an Raylegh n comparson wth the methos of the laplacen flow an the vertex-base ffuson usng the functon of Cauchy. The Experments also emonstrate that our metho s more effcent than the methos base on the normals to mesh smoothng. Fg 4. (a) Statue moel gtze by a Rolan LX-50 laser range scanner (3344 vertces an 453 faces); smoothng moel by metho base on the vertces usng the functons of (b) Cauchy (c = ), (c) Laplace (c = ), () Gaussan (c = ) an (e) Raylegh (c = ). The number of teraton tmes s 7 for each case. Fg 5. Top: L vertex-poston error metrc of 3D moel n Fg 4 Bottom: L face-normal error metrc of 3D moel n Fg ISSN
6 (IJCSIS) Internatonal Journal of Computer Scence an Informaton Securty, Vol. 8, No., 00 Fg7. Left: L vertex-poston error metrc of 3D moel n Fg 6. Rght: L face-normal error metrc of 3D moel n Fg 6. Fg 6. (a) Orgnal moel(4349 vertces an 60 faces); (b) Ang Gaussan nose (ε v = , ε f = an σ = 0.8 l ); (c) Mn flter (7 teratons); () Mean flter (3 teratons); (e) Aaptatf MMSE flter (3 teratons); (f) Mean flter (4 teratons); (g) Laplacen flow ( teratons an λ=0.45); smoothng moel by metho base on the vertces usng the functons of (h) Cauchy (3 teratons an c =.3849), () Laplace (6 teratons an c = ), () Gaussan (6 teratons an c= ) an (k) Raylegh (6 teratons an c = 0.3). Fg 8. (a) Orgnal moel (08 vertces an 46 faces); (b) Ang Gaussan nose (σ = 0.7 l ); smoothng moel by metho base on the vertces usng the functons of (c) Cauchy (c =.3849), () Laplace (c = ), (e) Gaussan (c = ) an (f) Raylegh (c = ). The number of teraton tmes s 0 for each case ISSN
7 (IJCSIS) Internatonal Journal of Computer Scence an Informaton Securty, Vol. 8, No., 00 Fg 9. Left: L vertex-poston error metrc of 3D moel n Fg 8. Rght: L face-normal error metrc of 3D moel n Fg8. Fg 0. (a) Statue moel gtze by mpact 3D scanner (59666 vertces an 0955 faces); smoothng moel by metho base on the vertces usng the functons of (b) Cauchy (c = ), (c) Laplace (c = ), () reuce centere Gaussan (c = ) an (e) Raylegh (c = ).The number of teraton tmes s for each case ISSN
8 Fg. Hgh: L vertex-poston error metrc of Fg 0. Low: L face-normal error metrc of Fg 0. REFERENCES [] Akram Elkef et Marc Antonn, Compresson e mallages 3D multrsoluton, transforme en onelettes ème génératon, rapport e recherche, 88 pages, novembre 003. (IJCSIS) Internatonal Journal of Computer Scence an Informaton Securty, Vol. 8, No., 00 [] Mchael Roy, comparason et analyse multrsoluton e mallages rrégulers avec attrbuts apparence, thèse e octorat e l Unversté e Bourgogne, 6 cembre 004. [3] Gabrel Taubn, A sgnal processng approach to far surface esgn, Internatonal Conference on Computer Graphcs an Interactve Technques, roceengs of the n annual conference on Computer graphcs an nteractve technques, SIGGRAH, ACM ages: , 995. [4] Janbo eng, Vasly Strela an Dens Zorn, A Smple Algorthm for Surface Denosng, roceengs of the conference on Vsualzaton 0, pp , -6 October 00. [5] Hrokazu Yagou, Yutaka Ohtakey an Alexaner Belyaevz, Mesh Smoothng va Mean an Mean Flterng Apple to Face Normals, roceengs of the Geometrc Moelng an rocessng Theory an Applcatons, IEEE Computer Socety, pp.4, 00. [6] Hrokazu Yagou, Yutaka Ohtake an Alexaner G. Belyaev, Mesh enosng va teratve alpha-trmmng an nonlnear ffuson of normals wth automatc thresholng, roceengs of the Computer Graphcs Internatonal (CGI 03) IEEE, pp. 8-33, 9- July 003. [7] Thous R. Jones, Fro Duran an Matheu Desbrun, Non-teratve, feature-preservng mesh smoothng, roceengs of ACM SIGGRAH 003, ACM Transactons on Graphcs (TOG) Volume, Issue 3, pp , July 003. [8] Takash Mashko, Hrokazu Yagou, Damng We,Youong Dng an Genfeng Wu, 3D Trangle Mesh Smoothng va Aaptve MMSE Flterng, roceengs of the The Fourth Internatonal Conference on Computer an Informaton Technology (CIT 04) - Volume 00, pp , 004. [9] Chen Chun-Yen an Cheng Kuo-Young, A sharpness epenent flter for mesh smoothng, Computer Ae Geometrc Desgn, Geometry processng, Volume, pp , 005. [0] Takafum Shmzu, Hroak Date, Satosh Kana, Takesh Kshnam, A New Blateral Mesh Smoothng Metho by Recognzng Features, roceengs of the Nnth Internatonal Conference on Computer Ae Desgn an Computer Graphcs (CAD-CG 05), IEEE Computer Socety, pp 8-86,005. [] Shn Yoshzawa, Alexaner Belyaev an Hans-eter Seel, Smoothng by Example: Mesh Denosng by Averagng wth Smlarty-base Weghts, roceengs of the IEEE Internatonal Conference on Shape Moelng an Applcatons (SMI 06), pp. 9, 4-6 June 006. [] M. Fourner, J-M. Dschler et D. Bechmann, Fltrage aaptatf es onnes acquses par un scanner 3D et représentées par une transformée en stance volumétrque, Journées AFIG 006, In roceengs of FDB06a, pp. 7-78, Novembre 006. [3] Yng Zhang an A. Ben Hamza, Vertex-Base Dffuson for 3-D Mesh Denosng, IEEE Transactons on mage processng, Volume 6, n0 4, Avrl 007. [4] L. Kobbelt, S. Campagna, J.Vorsatz, H.-. Seel, Interactve multresoluton moelng on arbtrary meshes, ACM SIGGRAH 98 proceengs, pp. 05-4, 998. [5] W. J. Rey, Introucton to Robust an Quas-Robust Statstcal Methos. Berln ; New York : Sprnger-Verlag, ISSN
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 informationFeature-Preserving Mesh Denoising via Bilateral Normal Filtering
Feature-Preservng Mesh Denosng va Blateral Normal Flterng Ka-Wah Lee, Wen-Png Wang Computer Graphcs Group Department of Computer Scence, The Unversty of Hong Kong kwlee@cs.hku.hk, wenpng@cs.hku.hk Abstract
More informationFair Triangle Mesh Generation with Discrete Elastica
Far Trangle Mesh Generaton wth Dscrete Elastca Shn Yoshzawa, and Alexander G. Belyaev, Computer Graphcs Group, Max-Planck-Insttut für Informatk, 66123 Saarbrücken, Germany Phone: [+49](681)9325-414 Fax:
More informationSegmentation in Echocardiographic Sequences Using Shape-Based Snake Model
Segmentaton n chocarographc Sequences Usng Shape-Base Snake Moel Chen Sheng 1, Yang Xn 1, Yao Lpng 2, an Sun Kun 2 1 Insttuton of Image Processng an Pattern Recognton, Shangha Jaotong Unversty, Shangha,
More informationCT Image Reconstruction in a Low Dimensional Manifold
CT Image Reconstructon n a Low Dmensonal Manfol Wenxang Cong 1, Ge Wang 1, Qngsong Yang 1, Jang Hseh 3, Ja L, Rongje La 1 Bomecal Imagng Center, Department of Bomecal Engneerng, Department of Mathematcal
More informationFuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches
Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of
More informationPolyhedral Surface Smoothing with Simultaneous Mesh Regularization
olyhedral Surface Smoothng wth Smultaneous Mesh Regularzaton Yutaka Ohtake The Unversty of Azu Azu-Wakamatsu Cty Fukushma 965-8580 Japan d800@u-azu.ac.jp Alexander G. Belyaev The Unversty of Azu Azu-Wakamatsu
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 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 informationFaces Recognition with Image Feature Weights and Least Mean Square Learning Approach
Faces Recognton wth Image Feature Weghts an Least Mean Square Learnng Approach We-L Fang, Yng-Kue Yang an Jung-Kue Pan Dept. of Electrcal Engneerng, Natonal Tawan Un. of Sc. & Technology, Tape, Tawan Emal:
More informationThe Objective Function Value Optimization of Cloud Computing Resources Security
Open Journal of Optmzaton, 2015, 4, 40-46 Publshe Onlne June 2015 n ScRes. http://www.scrp.org/journal/ojop http://x.o.org/10.4236/ojop.2015.42005 The Objectve Functon Value Optmzaton of Clou Computng
More informationFeature-Preserving Denoising of Point-Sampled Surfaces
Feature-Preservng Denosng of Pont-Sampled Surfaces Jfang L College of Computer Scence and Informaton Technology Zhejang Wanl Unversty Nngbo 315100 Chna Abstract: Based on samplng lkelhood and feature ntensty,
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 informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationRobust Denoising of Point-Sampled Surfaces
Jfang L, Renfang Wang Robust Denosng of Pont-Sampled Surfaces Jfang L, Renfang Wang College of Computer Scence and Informaton Technology Zhejang Wanl Unversty Nngbo 315100, Chna Abstract: - Based on samplng
More informationMesh Editing in ROI with Dual Laplacian
Mesh Edtng n ROI wth Dual Laplacan Luo Qong, Lu Bo, Ma Zhan-guo, Zhang Hong-bn College of Computer Scence, Beng Unversty of Technology, Chna lqngng@sohu.com, lubo@but.edu.cn,mzgsy@63.com,zhb@publc.bta.net.cn
More informationEfficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model. Eiji Oki May 28, 2009 The University of Electro-Communications
Effcent Loa-Balance IP Routng Scheme Base on Shortest Paths n Hose Moel E Ok May 28, 2009 The Unversty of Electro-Communcatons Ok Lab. Semnar, May 28, 2009 1 Outlne Backgroun on IP routng IP routng strategy
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 informationIMPLEMENTATION OF THE DUAL-BODY INTELLIGENT INSPECTION ROBOT IN SUBSTATION BASED ON DATA MINING ALGORITHM
IMPLEMENTATION OF THE DUAL-BODY INTELLIGENT INSPECTION ROBOT IN SUBSTATION BASED ON DATA MINING ALGORITHM Janfeng WU, Chengzh MA, Png XU, Sume GUO, Ku LAI, Ta HU, Ln QIAO Aress:Jangmen Power Supply Bureau
More informationLevel set segmentation using image second order statistics
Level set segmentaton usng mage secon orer statstcs Bo Ma, Yuwe Wu, Pe L Bejng Laboratory of Intellgent Informaton Technology, School of omputer Scence, Bejng Insttute of Technology (BIT), Bejng, P.R.
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 informationParameterization of Quadrilateral Meshes
Parameterzaton of Quadrlateral Meshes L Lu 1, CaMng Zhang 1,, and Frank Cheng 3 1 School of Computer Scence and Technology, Shandong Unversty, Jnan, Chna Department of Computer Scence and Technology, Shandong
More informationReversible Digital Watermarking
Reversble Dgtal Watermarkng Chang-Tsun L Department of Computer Scence Unversty of Warwck Multmea Securty an Forenscs 1 Reversble Watermarkng Base on Dfference Expanson (DE) In some mecal, legal an mltary
More informationImage Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline
mage Vsualzaton mage Vsualzaton mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and Analyss outlne mage Representaton & Vsualzaton Basc magng Algorthms Shape Representaton and
More 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 informationLearning Depth from Single Still Images: Approximate Inference 1
Learnng Depth from Sngle Stll Images: Approxmate Inference 1 MS&E 211 course project Ashutosh Saxena, Ilya O. Ryzhov Channng Wong, Janln Wang June 7th, 2006 1 In ths report, Saxena, et. al. [1] somethng
More informationMODULE - 9 LECTURE NOTES 1 FUZZY OPTIMIZATION
Water Resources Systems Plannng an Management: vance Tocs Fuzzy Otmzaton MODULE - 9 LECTURE NOTES FUZZY OPTIMIZTION INTRODUCTION The moels scusse so far are crs an recse n nature. The term crs means chotonomous.e.,
More informationTHE FAULT LOCATION ALGORITHM BASED ON TWO CIRCUIT FUNCTIONS
U THE FAULT LOCATION ALGORITHM BASED ON TWO CIRCUIT FUNCTIONS Z. Czaa Char of Electronc Measurement, Faculty of Electroncs, Telecommuncatons an Informatcs, Techncal Unversty of Gañsk, Polan The paper presents
More informationCOLOR HISTOGRAM SIMILARITY FOR ROBOT-ARM GUIDING
COLOR HITOGRAM IMILARITY FOR ROBOT-ARM GUIDING J.L. BUELER, J.P. URBAN, G. HERMANN, H. KIHL MIP, Unversté e Haute Alsace 68093 Mulhouse, France ABTRACT Ths paper evaluates the potental of color hstogram
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 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 informationAdaptive Fairing of Surface Meshes by Geometric Diffusion
Adaptve Farng of Surface Meshes by Geometrc Dffuson Chandrajt L. Bajaj Department of Computer Scences, Unversty of Texas, Austn, TX 78712 Emal: bajaj@cs.utexas.edu Guolang Xu State Key Lab. of Scentfc
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 informationIdentifying Efficient Kernel Function in Multiclass Support Vector Machines
Internatonal Journal of Computer Applcatons (0975 8887) Volume 8 No.8, August 0 Ientfng Effcent Kernel Functon n Multclass Support Vector Machnes R.Sangeetha Ph.D Research Scholar Department of Computer
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 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 informationA Modified Median Filter for the Removal of Impulse Noise Based on the Support Vector Machines
A Modfed Medan Flter for the Removal of Impulse Nose Based on the Support Vector Machnes H. GOMEZ-MORENO, S. MALDONADO-BASCON, F. LOPEZ-FERRERAS, M. UTRILLA- MANSO AND P. GIL-JIMENEZ Departamento de Teoría
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 informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More information3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method
NICOGRAPH Internatonal 2012, pp. 114-119 3D Vrtual Eyeglass Frames Modelng from Multple Camera Image Data Based on the GFFD Deformaton Method Norak Tamura, Somsangouane Sngthemphone and Katsuhro Ktama
More informationSymmetrical recursive median filter for region smoothing without edge distortion
Int'l Conf. IP, Comp. Vson, and Pattern Recognton IPCV'16 171 Symmetrcal recursve medan flter for regon smoothng wthout edge dstorton A. Raj Laboratory of Images, Sgnals and Intellgent Systems Pars Est
More informationDELAUNAY TRIANGULATION BASED IMAGE ENHANCEMENT FOR ECHOCARDIOGRAPHY IMAGES
17th European Sgnal Processng Conference (EUSIPCO 9) Glasgow, Scotland, August 4-8, 9 DELAUNAY TRIANGULATION BASED IMAGE ENHANCEMENT FOR ECHOCARDIOGRAPHY IMAGES V Ahanathaplla 1, J. J. Soraghan 1, P. Soneck
More informationEnhanced Watermarking Technique for Color Images using Visual Cryptography
Informaton Assurance and Securty Letters 1 (2010) 024-028 Enhanced Watermarkng Technque for Color Images usng Vsual Cryptography Enas F. Al rawashdeh 1, Rawan I.Zaghloul 2 1 Balqa Appled Unversty, MIS
More informationK-means Clustering Algorithm in Projected Spaces
K-means Clusterng Algorthm n Projecte paces Alssar NAER, Dens HAMAD.A.. -U..C.O 50 rue F. Busson, BP 699, 68 Calas, France Emal: nasser@lasl.unv-lttoral.fr Chaban NAR ebanese Unversty E.F Rue Al-Arz, rpol
More informationA PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION
1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute
More informationImage Retrieval using Dual Tree Complex Wavelet Transform
Image Retreval usng Dual Tree Complex Wavelet Transform Sanjay Patl # an Sanjay Talbar $ # Assocate Professor, Jaywant College of Engg. an Management, K.M. Ga, Maharashtra, Ina E-mal: sanjayashr@reffmal.com
More informationA Software Tool to Teach the Performance of Fuzzy IR Systems based on Weighted Queries
A Software Tool to Teach the Performance of Fuzzy IR Systems base on Weghte Queres Enrque Herrera-Vema 1, Sergo Alonso 1, Francsco J. Cabrerzo 1, Antono G. Lopez-Herrera 2, Carlos Porcel 3 1 Dept. of Computer
More informationIntegrated high-resolution tomography
Marco A. Perez an John C. Bancroft ABSRAC A common problem n sesmc tomography s the naequate amount of ata requre for accurate traveltme nverson. he nherent nature n whch ata s acqure an the subsurface
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 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 informationTERRESTRIAL LASER SCANNING CIVIL ENGINEERING APPLICATIONS
Internatonal Archves of Photogrammetry, Remote Sensng an Spatal Informaton Scences, Vol. XXXVIII, Part 5 Commsson V Symposum, Newcastle upon Tyne, UK. 1 TERRESTRIAL LASER SCANNING CIVIL ENGINEERING APPLICATIONS
More informationLanguage-specific Models in Multilingual Topic Tracking
Language-specfc Moels n Multlngual Topc Trackng Leah S. Larkey, Fangfang Feng, Margaret Connell, Vctor Lavrenko Center for Intellgent Informaton Retreval Department of Computer Scence Unversty of Massachusetts
More informationSimilarity-based denoising of point-sampled surfaces *
Wang et al. / J Zhejang Unv Sc A 008 9(6):807-85 807 Journal of Zhejang Unversty SCIENCE A ISSN 673-565X (Prnt); ISSN 86-775 (Onlne) www.zju.edu.cn/jzus; www.sprngerlnk.com E-mal: jzus@zju.edu.cn Smlarty-based
More informationA rate-distortion driven approach to remote visualization of 3D models
A rate-storton rven approach to remote vsualzaton of 3D moels Petro Zanuttgh, Ncola Brusco, Guo Cortelazzo Unversty of Paova, Italy Dav Tauman UNSW, Australa Astract- Ths paper presents a novel approach
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 informationCOMPUTER AIDED DIAGNOSIS IN MAMMOGRAPHY BASED ON FRACTAL ANALYSIS
Proc. of the 5th WSEAS Int. Conf. on Non-Lnear Analyss, Non-Lnear Systems an Chaos, Bucharest, Romana, October 16-18, 2006 39 COMPUTER AIDED DIAGNOSIS IN MAMMOGRAPHY BASED ON FRACTAL ANALYSIS DAN POPESCU,
More informationAPPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET
APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET Jae-young Lee, Shahram Payandeh, and Ljljana Trajovć School of Engneerng Scence Smon Fraser Unversty 8888 Unversty
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 informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
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 informationAPPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET
APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET Jae-young Lee, Shahram Payandeh, and Ljljana Trajovć School of Engneerng Scence Smon Fraser Unversty 8888 Unversty
More informationBiostatistics 615/815
The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts
More informationNonlocal Mumford-Shah Model for Image Segmentation
for Image Segmentaton 1 College of Informaton Engneerng, Qngdao Unversty, Qngdao, 266000,Chna E-mal:ccluxaoq@163.com ebo e 23 College of Informaton Engneerng, Qngdao Unversty, Qngdao, 266000,Chna E-mal:
More informationPalmprint Feature Extraction Using 2-D Gabor Filters
Palmprnt Feature Extracton Usng 2-D Gabor Flters Wa Kn Kong Davd Zhang and Wenxn L Bometrcs Research Centre Department of Computng The Hong Kong Polytechnc Unversty Kowloon Hong Kong Correspondng author:
More informationAn Efficient Scanning Pattern for Layered Manufacturing Processes
Proceengs of the 2 IEEE Internatonal Conference on Robotcs & Automaton Seoul, Korea May 2-26, 2 An Effcent Scannng Pattern for Layere Manufacturng Processes Y.Yang, J.Y.H Fuh 2, H.T.Loh 2 Department of
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 informationAnt Colony Optimization Applied to Minimum Weight Dominating Set Problem
Ant Colony Optmzaton Appled to Mnmum Weght Domnatng Set Problem Raa JOVANOVIC Mlan TUBA Dana SIMIAN Texas AM Unversty Faculty of Computer Scence Department of Computer Scence at Qatar Megatrend Unversty
More informationThe Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole
Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng
More informationA 2D to 3D Conversion Scheme Based on Depth Cues Analysis for MPEG Videos
A to 3 Converson Scheme ase on epth Cues Analss for PEG eos Guo-Shang Ln, Cheng-Yng Yeh, e-chh Chen, an en-ung Le ept. of Computer Scence an Informaton Engneerng, a-yeh Unverst awan epartment of Electrcal
More informationDeep 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 informationSIGGRAPH Interactive Image Cutout. Interactive Graph Cut. Interactive Graph Cut. Interactive Graph Cut. Hard Constraints. Lazy Snapping.
SIGGRAPH 004 Interactve Image Cutout Lazy Snappng Yn L Jan Sun Ch-Keung Tang Heung-Yeung Shum Mcrosoft Research Asa Hong Kong Unversty Separate an object from ts background Compose the object on another
More informationFace Recognition using 3D Directional Corner Points
2014 22nd Internatonal Conference on Pattern Recognton Face Recognton usng 3D Drectonal Corner Ponts Xun Yu, Yongsheng Gao School of Engneerng Grffth Unversty Nathan, QLD, Australa xun.yu@grffthun.edu.au,
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 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 informationSEMANTIC REGION LABELLING USING A POINT PATTERN ANALYSIS
6th European Sgnal Processng Conference (EUSIPCO 008), Lausanne, Swtzerlan, ugust 5-9, 008, copyrght by EURSIP SEMTIC REGIO LBELLIG USIG POIT PTTER LYSIS Sahb Bahroun, Za Belha, ozha Bouemaa École Supéreure
More informationSliding-Windows Algorithm for B-spline Multiplication
Slng-Wnows Algorthm for B-splne Multplcaton Xanmng Chen School of Computng Unversty of Utah xchen@cs.utah.eu Rchar F. Resenfel School of Computng Unversty of Utah rfr@cs.utah.eu Elane Cohen School of Computng
More informationLocal Ridge Regression for Face Recognition
Local Rge Regresson for Face Recognton Hu Xue 1,2 Yulan Zhu 1 Songcan Chen *1,2 1 Department of Computer Scence & Engneerng, Nanjng Unversty of Aeronautcs & Astronautcs, 210016, Nanjng, P.R. Chna 2 State
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationUnsupervised Classification Using Immune Algorithm
Internatonal Journal of Computer Applcatons (975 8887) Volume 2 o.7, June 2 Unsupervse Classfcaton Usng Immune Algorthm M.T. Al-Muallm Department of Computer Engneerng & Automaton, Faculty of Mechancal
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 informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationTHE PULL-PUSH ALGORITHM REVISITED
THE PULL-PUSH ALGORITHM REVISITED Improvements, Computaton of Pont Denstes, and GPU Implementaton Martn Kraus Computer Graphcs & Vsualzaton Group, Technsche Unverstät München, Boltzmannstraße 3, 85748
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 informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationEnhanced AMBTC for Image Compression using Block Classification and Interpolation
Internatonal Journal of Computer Applcatons (0975 8887) Volume 5 No.0, August 0 Enhanced AMBTC for Image Compresson usng Block Classfcaton and Interpolaton S. Vmala Dept. of Comp. Scence Mother Teresa
More informationIEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. *, NO. *, Dictionary Pair Learning on Grassmann Manifolds for Image Denoising
IEEE TRANSACTIONS ON IMAGE PROCESSING, VOL. *, NO. *, 2015 1 Dctonary Par Learnng on Grassmann Manfolds for Image Denosng Xanhua Zeng, We Ban, We Lu, Jale Shen, Dacheng Tao, Fellow, IEEE Abstract Image
More informationContourlet-Based Image Fusion using Information Measures
Proceedngs of the 2nd WSEAS Internatonal Symposum on WAVELETS THEORY & APPLICATIONS n Appled Mathematcs, Sgnal Processng & Modern Scence (WAV '08), Istanbul, Turkey, May 2730, 2008 ContourletBased Image
More informationTopic 13: Radiometry. The Basic Light Transport Path
Topc 3: Raometry The bg pcture Measurng lght comng from a lght source Measurng lght fallng onto a patch: Irraance Measurng lght leavng a patch: Raance The Lght Transport Cycle The BrecAonal Reflectance
More informationDetection of an Object by using Principal Component Analysis
Detecton of an Object by usng Prncpal Component Analyss 1. G. Nagaven, 2. Dr. T. Sreenvasulu Reddy 1. M.Tech, Department of EEE, SVUCE, Trupath, Inda. 2. Assoc. Professor, Department of ECE, SVUCE, Trupath,
More informationJoint Example-based Depth Map Super-Resolution
Jont Example-based Depth Map Super-Resoluton Yanje L 1, Tanfan Xue,3, Lfeng Sun 1, Janzhuang Lu,3,4 1 Informaton Scence and Technology Department, Tsnghua Unversty, Bejng, Chna Department of Informaton
More informationA Multi-step Strategy for Shape Similarity Search In Kamon Image Database
A Mult-step Strategy for Shape Smlarty Search In Kamon Image Database Paul W.H. Kwan, Kazuo Torach 2, Kesuke Kameyama 2, Junbn Gao 3, Nobuyuk Otsu 4 School of Mathematcs, Statstcs and Computer Scence,
More informationDiscriminative Dictionary Learning with Pairwise Constraints
Dscrmnatve Dctonary Learnng wth Parwse Constrants Humn Guo Zhuoln Jang LARRY S. DAVIS UNIVERSITY OF MARYLAND Nov. 6 th, Outlne Introducton/motvaton Dctonary Learnng Dscrmnatve Dctonary Learnng wth Parwse
More informationResearch Paper A UNIFIED FRAMEWORK FOR MULTI-OBJECTIVE TEST CASE PRIORITIZATION IN REGRESSION TESTING Lilly Raamesh
Research Paper A UNIFIED FRAMEWORK FOR MULTI-OBJECTIVE TEST CASE PRIORITIZATION IN REGRESSION TESTING Llly Raamesh Aress for Corresponence Department of I.T, St. Joseph s College of Engneerng, Ol Mamallapuram
More informationDistance Calculation from Single Optical Image
17 Internatonal Conference on Mathematcs, Modellng and Smulaton Technologes and Applcatons (MMSTA 17) ISBN: 978-1-6595-53-8 Dstance Calculaton from Sngle Optcal Image Xao-yng DUAN 1,, Yang-je WEI 1,,*
More 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 informationAC : TEACHING SPREADSHEET-BASED NUMERICAL ANAL- YSIS WITH VISUAL BASIC FOR APPLICATIONS AND VIRTUAL IN- STRUMENTS
AC 2011-1615: TEACHING SPREADSHEET-BASED NUMERICAL ANAL- YSIS WITH VISUAL BASIC FOR APPLICATIONS AND VIRTUAL IN- STRUMENTS Nkunja Swan, South Carolna State Unversty Dr. Swan s currently a Professor at
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
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 informationKernel-Based Laplacian Smoothing Method for 3D Mesh Denoising
Kernel-Based Laplacian Smoothing Method for 3D Mesh Denoising Hicham Badri, Mohammed El Hassouni, Driss Aboutajdine To cite this version: Hicham Badri, Mohammed El Hassouni, Driss Aboutajdine. Kernel-Based
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More information