Feature-Preserving Denoising of Point-Sampled Surfaces

Size: px
Start display at page:

Download "Feature-Preserving Denoising of Point-Sampled Surfaces"

Transcription

1 Feature-Preservng Denosng of Pont-Sampled Surfaces Jfang L College of Computer Scence and Informaton Technology Zhejang Wanl Unversty Nngbo Chna Abstract: Based on samplng lkelhood and feature ntensty, n ths paper, a feature-preservng denosng algorthm for pont-sampled surfaces s proposed. In terms of movng least squares surface, the samplng lkelhood for each pont on pont-sampled surfaces s computed, whch measures the probablty that a 3D pont s located on the sampled surface. Based on the normal tensor votng, the feature ntensty of sample pont s evaluated. By applyng the modfed blateral flterng to each normal, and n combnaton wth samplng lkelhood and feature ntensty, the fltered pont-sampled surfaces are obtaned. Expermental results demonstrate that the algorthm s robust, and can denose the nose effcently whle preservng the surface features. Key-Words: samplng lkelhood; feature ntensty; blateral flterng; pont-sampled surfaces denosng 1 Introducton Pont-sampled models wthout topologcal connectvty are normally generated by samplng the boundary surface of physcal 3D objects wth 3D-scannng devces. Despte the steady mprovement n scannng accuracy, undesrable nose s nevtably ntroduced from varous sources such as local measurements and algorthmc errors. Consequently, nosy models need to be denosed or smoothed before performng any subsequent geometry processng such as smplfcaton, reconstructon and parameterzaton. It remans a challengng task to remove the nevtable nose whle preservng the underlyng surface features n computer graphcs. Earler methods such as Laplacan [1] for denosng pont-sampled surfaces (PSS) are sotropc, whch result commonly n pont drftng and oversmoothng. So the ansotropc methods were ntroduced. Clarenz et al. [] presented a PDE-based surface farng applcaton wthn the framework of processng pont-based surface va PDEs. Lange and Polther [3] proposed a new method for ansotropc farng of a pont sampled surface based on the concept of ansotropc geometrc mean curvature flow. Based on dynamc balanced flow, Xao et al. [4] presented a novel approach for farng PSS. Other methods have also been proposed for denosng PSS. Algorthms that recently attracted the nterest of many researchers are movng-least squares (MLS) approaches [5-7] to ft a pont set wth a local polynomal approxmaton; the pont set surface can be smoothed by shftng pont postons towards the correspondng MLS surface. The man problem of MLS-based methods s that promnent shape features are blurred whle smoothng PSS. Concernng the above problem of MLS approaches, ths paper puts forward a feature-preservng denosng algorthm for PSS. Based on MLS surface, the samplng lkelhood of sample pont s frst computed. In order to more effcently preserve the surface features whle denosng PSS, we adopt normal votng tensor to evaluate the feature ntensty of sample pont and apply the modfed blateral flterng to flter the normal of each sample pont. The smoothed model s fnally obtaned va the combnaton of samplng lkelhood and feature ntensty. Computng the samplng lkelhood In ths paper, we consder the probablty that a 3D pont s located on the sampled surface as the samplng lkelhood. The sample pont closer to the sampled surface should be characterstc of hgher samplng lkelhood than one beng more dstant. We approxmately take the MLS surface approxmatng the k nearest neghbors Nk(p) of sample pont p as the sampled surface. In the followng we wll brefly revew the MLS method and then descrbe how to compute the samplng lkelhood. Alexa et al.[8] proposed a representaton of pont-sampled model by fttng a local polynomal approxmaton to the pont set usng a MLS method. The result of the MLS-fttng s a smooth, -manfold surface for any pont set. Gven a pont set P = { p }, the contnuous MLS surface S s defned mplctly as ISSN: ISBN:

2 the statonary set of a projecton operator ψ ( r ) that projects a pont onto the MLS surface. To evaluateψ, a local reference plane H = { x 3 n x D =0} s frst computed by mnmzng the weghted sum of squared dstances,.e., arg mn ( n p n q) θ ( p q ), where q s the nq, p P projecton of r onto H and θ s the MLS kernel functon θ ( d) = exp(- d /h ), where h s a global scale factor. Accordngly, the local reference doman s gven by an orthonormal coordnate system on H so that q s the orgn of ths system. Then a bvarate polynomal g( uv, ) s ftted to the ponts projected onto the reference plane H usng a smlar weghted least squares optmzaton. Here ( u, v) s the representaton of q n the local coordnate system n H, where q s the projecton of p onto H. So, the projecton of r onto S s gven asψ ( r) = q + g00 (, ) n. More detals on the MLS method can be found n[9]. We take a thrd degree polynomal to approxmate the cluster of N k (p ): 3 3 y gx (, y)= ax 9 + ay 8 + axy 7 + ax 6 +ax 5. (1) + a y + a xy+ a x+ a y+ a Let q j be the projecton of p j N k ( p ) onto the above MLS surface gx (, y) ( q 0,.e. q, s the projecton of p ) and defne the samplng lkelhood l of p as l = 1-d / dmax k 1 θ ( pj p ) pj qj j = 0 d = k 1, () θ ( pj p ) j= 0 dmax = max N{ d} where N s the sze of pont-sampled model and d s the weghted-average dstance of p j to ts projecton onto the MLS surface. Obvously, the nfluence of p j on d decreases exponentally wth Eucldean dstance to p. On the other hand, the smaller d s, the greater d. Consequently, the samplng lkelhood l can effectvely denote the value of probablty that p s located on the sampled surface. Fg.1b demonstrates mean curvature vsualzaton of nosy Igea model as shown n Fg.la and samplng lkelhood vsualzaton of nosy model s llustrated n Fg.1c. In ths paper, all the pont-sampled models are rendered by usng a pont-based renderng technque. (a) (b) (c) (d) Fg.1 (a) Nosy Igea Model; (b) Mean curvature vsualzaton of (a); (c) Samplng kelhood vsualzaton of (a); (d) Feature ntensty vsualzaton of (a). 3 Measurng the feature ntensty We measure the feature ntensty of sample pont by extendng normal votng tensor appled to the extracton of sharp edge on 3D mesh [10] to pont-sampled surfaces. A normal votng tensor T for a sample pont p s defned T by T = u n n, where N () s the ndex set of j N () j j j p j belongng to N k (p ), u j s a weght defned as uj = exp(- pj p / σ e ). We take standard devaton σ e as σ e = r / 3, r s the radus of the enclosng sphere of N k (p ). n j s p j s normal ( n j = 1) and n j s determned as nj = ( nj wj ) wj nj, where wj = ( p pj ) nj ( p pj )( wj =1). From the defnton, T s symmetrc and postve sem-defnte. Accordngly, ts egenvalues are real-valued and non-negatve: v1 v v3 0. Furthermore, the correspondng egenvectors e1, e and e 3 form an orthonormals bass. So we defne the feature ntensty of sample pont p as ISSN: ISBN:

3 1 n e 1 < δ s = 1 v3 > α( v1-v) v3 > β( v- v3), ( v v3)/ v1 otherwse (3) n = u n s a weghted sum of votng where j N () j j normal n j, andδ,α, β are postve real numbers. In ths paper, we expermentally setδ,α, β to 0., 0.3 and 0.3, respectvely. The equaton classfes each sample pont nto three types whch correspond to the type of feature that the pont belongs to,.e. face, sharp edge, or corner. The feature ntensty becomes about 1.0 f sample pont les on a sharp edge or a corner, or about 0.0 f t les on a face. As a result, s ndcates the geometrc feature of surface at p. The feature ntensty vsualzaton of nosy Igea model (Fg.la) s llustrated n Fg.1d. where wx () s a Gaussan kernel: wc()=exp(- x x / σ c) and w ()=exp(- / s x x σ s ). The normal varaton α j s defned as α j = acos( n nj )( n = nj =1). Here, we take the parameterσ c as σ c = r/ and σ s as the standard devaton of the normal varatonα j. Accordng to the equaton, n s the weghted average of p j s normal where the weght of each normal s computed usng a standard Gaussan functon w c n the spatal doman multpled by an nfluence functon ws n the ntensty doman that decreases the weght of normals wth large normal varaton. Therefore, n s nfluenced manly by the smaplng ponts n N k (p ) that have a smlar ntensty. 4 Denosng of PSS The man dea of ths paper s denosng algorthm s as follows: p s normal s frst fltered by usng the modfed blateral flterng. In combnaton wth the samplng lkelhood and feature ntensty, the dstance weght m of p s then determned when denosng PSS. p s moved n the fltered normal drecton wth an offset D so as to smooth PSS. 4.1 Normal flterng If p s moved n the vector p q drecton when smoothng PSS, the surface features are blurred. In order to preservng those features more effectvely, we frst smooth p s normal accordng to the modfed blateral flterng. Surface normals play an mportant role n surface denosng as surface features are best descrbed wth the frst-order surface normals. It also s well-known that normal varatons offer more ntutve geometrc meanng than pont poston varatons. A smooth surface can be descrbed as one havng smoothly varyng normals whereas features such as sharp edges and corners appear as dscontnutes n the normals. Thus unlke the blateral flterng n [11], we desgn the followng blateral flterng wth the normal-varaton term to compute the fltered normal n w ( - ) ( ) () c pj p ws α n j N j j n, (4) w ( p - p ) w ( α ) = j N () c j s j 4. Sample pont flterng Next, for each sample pont p we fnd ts smoothed poston p by movng t along n wth an offset D,.e., p = p+d n, where D s determned as D = m q - p. In terms of the samplng lkelhood and feature ntensty, defne the dstance weght m as -l - m (-1) [ e +(1- )e s = ], where λ(0 λ 1) s a user-adjustable parameter; τ s set to 0 when n p q > 0, whch ndcates that p s moved along n, otherwse τ s set to 1 and p s moved along. n 5 Expermental results and dscusson In our experments, we use Mcrosoft Vsual C++ programmng language on a personal computer wth a Pentum IV.8 GHz CPU and 1 GB man memory. We have mplemented our denosng algorthm and another two denosng technques: the Blateral denosng (BIL) and the MLS-based denosng to compare ther denosng results. We use two models n our comparson: a nosy Fandsk model wth sample ponts (Fg.a) and a nosy Igea model wth sample ponts (Fg.1a). In ths paper, we use the vsualzaton scheme of mean curvature to compare these two technques wth our method. In Fg., we demonstrate a comparson of the denosed Fandsk models by MLS, BIL and our method. The denosed models are llustrated n the top row of Fg., and ther correspondng mean curvature vsualzatons n the bottom row. As seen n ISSN: ISBN:

4 Fg., our algorthm removes the hgh-frequency nose properly and acheves a more accurate result than MLS or BIL does. Fg.3 shows a comparson of MLS, BIL and our algorthm concernng feature preservaton. Note that our alogrthm preserves sharp features more accurately than MLS or BIL does whle producng a smooth result. Snce the MLS-based denosng shfts sample ponts to ts projecton onto the correspondng MLS surface, sharp features are sgnfcantly smoothed out. Although the blateral denosng performs well n general, the sharp features are not able to be effcently preserved as t actually uses a statc wndow/kernel n the two domans. Due to take not only nto account the samplng lkelhoods of sample ponts but also the feature ntenstes whle denosng PSS, our algorthm can delver qualty smoothng whle preservng the surface features more effcently than BIL or MLS. (a) Nose model (b) MLS (c) BIL (d) Ours Fg. Denosng nosy Fandsk model. Top: the denosed models. Bottom: the correspondng denosed model colored by mean curvature (The colorng helps us to compare ther correspondng fne detals). (a) MLS (b) BIL (c) Ours Fg.3 Denosng the nosy Igea model. Top: the denosed models. Bottom: the correspondng denosed model colored by mean curvature. ISSN: ISBN:

5 6 Concluson In ths paper, we presented a denosng algorthm for PSS. In terms of the MLS surfaces, the samplng lkelhood of sample pont s computed and the feature ntensty of sample pont s evaluated based on normal votng tensor. The pont s normal s fltered by usng the modfed blateral flterng. The PSS s smoothed by movng each sample pont along ts own fltered normal wth an offset determned accordng to the combnaton of the samplng lkelhood and feature ntensty. Our expermental results demonstrate that the proposed algorthm s robust, and can denose the nose effcently whle preservng the surface features. defned by pont sets. In: Proc. of the Eurographcs Symposum on Pont-Based Graphcs. Eurographcs Assocaton [10] Shmzu T, Date H, Kana S, Kshnam T. A New Blateral Mesh Smoothng Method by Recognzng Features In: Proc. of Nnth Internatonal Conference on CAD/CG [11] Fleshman S, Dror I, Cohen-Or D. Blateral mesh denosng. In: Proc. of the Computer Graphcs Annual Conf. Seres, ACM SIGGRAPH References: [1] Pauly M, Kobbelt, L.P., Gross, M. Multresoluton Modelng of Pont-Sampled Geometry. Techncal Report, CS #379, ETH, Zurch 00. [] Clarenz U, Rumpf M, Telea A. Farng of pont based surfaces. In: Computer Graphcs Internatonal(CGI04) 004: [3] Lange C, Polther K. Ansotropc smoothng of pont sets. Comput.Ad Geomet.Des. 005, (7): [4] Xao C.X., Mao Y.W., lu S., Peng Q.S. A dynamc balanced flow for flterng pont-sampled geometry. The Vsual Computer 006, (3): [5] Mederos B, Velho L, de Fgueredo L.H. Robust smoothng of nosy pont clouds. In: Proc. of the SIAM Conf. on Geometrc Desgn and Computng. Seattle: Nashboro Press 003. [6] Weyrch T, Pauly M, Keser R, Henzle S, Scandella S, Gross M. Post-processng of scanned 3D surface data. In: Proc. of Symp. on Pont-Based Graphcs 04, [7] Danels II J, Ha,L.K., Ochotta, T., Slva, C.T. Robust Smooth Feature Extracton from Pont Clouds. Proceedngs of Shape Modelng Internatonal [8] Alexa M BJ, Cohen-Or D, Fleshman S, Levn D, Slva T. Pont set surfaces. In: Proceedngs of IEEE Vsualzaton, San Dego, Calforna 001:1-8. [9] Alexa M, Adamson A. On normals and projecton operators for surfaces ISSN: ISBN:

Robust Denoising of Point-Sampled Surfaces

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

Similarity-based denoising of point-sampled surfaces *

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

Feature-Preserving Mesh Denoising via Bilateral Normal Filtering

Feature-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 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

The Theory and Application of an Adaptive Moving Least. Squares for Non-uniform Samples

The Theory and Application of an Adaptive Moving Least. Squares for Non-uniform Samples Xanpng Huang, Qng Tan, Janfe Mao, L Jang, Ronghua Lang The Theory and Applcaton of an Adaptve Movng Least Squares for Non-unform Samples Xanpng Huang, Qng Tan, Janfe Mao*, L Jang, Ronghua Lang College

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

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

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

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

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

Image Representation & Visualization Basic Imaging Algorithms Shape Representation and Analysis. outline

Image 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 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

LECTURE : MANIFOLD LEARNING

LECTURE : MANIFOLD LEARNING LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors

More 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

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

Machine Learning: Algorithms and Applications

Machine 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 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

Fair Triangle Mesh Generation with Discrete Elastica

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

1. Introduction. 2. Related Work

1. Introduction. 2. Related Work ASIAGRAPH 008 PROCEEDINGS Curvature Estmaton of 3D Pont Cloud Surfaces Through the Fttng of Normal Secton Curvatures Xaopeng Zhang* /LIAMA-NLPR, Insttute of Automaton, CAS; Hongjun L /LIAMA-NLPR, Insttute

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

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

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

Shape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram

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

Robust Curvature Estimation and Geometry Analysis of 3D point Cloud Surfaces

Robust Curvature Estimation and Geometry Analysis of 3D point Cloud Surfaces Robust Curvature Estmaton and Geometry Analyss of 3D pont Cloud Surfaces Xaopeng ZHANG, Hongjun LI, Zhangln CHENG, Ykuan ZHANG Sno-French Laboratory LIAMA, Insttute of Automaton, CAS, Bejng 100190, Chna

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

Polyhedral Surface Smoothing with Simultaneous Mesh Regularization

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

IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS

IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS IMPROVING AND EXTENDING THE INFORMATION ON PRINCIPAL COMPONENT ANALYSIS FOR LOCAL NEIGHBORHOODS IN 3D POINT CLOUDS Davd Belton Cooperatve Research Centre for Spatal Informaton (CRC-SI) The Insttute for

More information

Fuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches

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

Mesh Editing in ROI with Dual Laplacian

Mesh 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 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

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

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

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More 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

THE PULL-PUSH ALGORITHM REVISITED

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

Local Quaternary Patterns and Feature Local Quaternary Patterns

Local Quaternary Patterns and Feature Local Quaternary Patterns Local Quaternary Patterns and Feature Local Quaternary Patterns Jayu Gu and Chengjun Lu The Department of Computer Scence, New Jersey Insttute of Technology, Newark, NJ 0102, USA Abstract - Ths paper presents

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

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

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

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

Parameterization of Quadrilateral Meshes

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

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data

Type-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES

More information

Denoising Manifold and Non-Manifold Point Clouds

Denoising Manifold and Non-Manifold Point Clouds Denosng Manfold and Non-Manfold Pont Clouds Ranjth Unnkrshnan Martal Hebert Carnege Mellon Unversty, Pttsburgh, PA 23 ranjth,hebert@cs.cmu.edu Abstract The fathful reconstructon of 3-D models from rregular

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

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

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems

A Unified Framework for Semantics and Feature Based Relevance Feedback in Image Retrieval Systems A Unfed Framework for Semantcs and Feature Based Relevance Feedback n Image Retreval Systems Ye Lu *, Chunhu Hu 2, Xngquan Zhu 3*, HongJang Zhang 2, Qang Yang * School of Computng Scence Smon Fraser Unversty

More information

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints

TPL-Aware Displacement-driven Detailed Placement Refinement with Coloring Constraints TPL-ware Dsplacement-drven Detaled Placement Refnement wth Colorng Constrants Tao Ln Iowa State Unversty tln@astate.edu Chrs Chu Iowa State Unversty cnchu@astate.edu BSTRCT To mnmze the effect of process

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

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

Fast Computation of Shortest Path for Visiting Segments in the Plane

Fast Computation of Shortest Path for Visiting Segments in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN

MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS XUNYU PAN MOTION PANORAMA CONSTRUCTION FROM STREAMING VIDEO FOR POWER- CONSTRAINED MOBILE MULTIMEDIA ENVIRONMENTS by XUNYU PAN (Under the Drecton of Suchendra M. Bhandarkar) ABSTRACT In modern tmes, more and more

More information

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning

Computer Animation and Visualisation. Lecture 4. Rigging / Skinning Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume

More 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

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

MOTION BLUR ESTIMATION AT CORNERS

MOTION BLUR ESTIMATION AT CORNERS Gacomo Boracch and Vncenzo Caglot Dpartmento d Elettronca e Informazone, Poltecnco d Mlano, Va Ponzo, 34/5-20133 MILANO boracch@elet.polm.t, caglot@elet.polm.t Keywords: Abstract: Pont Spread Functon Parameter

More 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

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

Constrained Shape Modification of B-Spline curves

Constrained Shape Modification of B-Spline curves Constraned Shape Modfcaton of B-Splne curves Mukul Tul, N. Venkata Reddy and Anupam Saxena Indan Insttute of Technology Kanpur, mukult@tk.ac.n, nvr@tk.ac.n, anupams@tk.ac.n ABSTRACT Ths paper proposes

More information

Radial Basis Functions

Radial Basis Functions Radal Bass Functons Mesh Reconstructon Input: pont cloud Output: water-tght manfold mesh Explct Connectvty estmaton Implct Sgned dstance functon estmaton Image from: Reconstructon and Representaton of

More information

The Shortest Path of Touring Lines given in the Plane

The Shortest Path of Touring Lines given in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He

More information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and

More information

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

Adaptive Fairing of Surface Meshes by Geometric Diffusion

Adaptive 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 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

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

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

Fitting: Deformable contours April 26 th, 2018

Fitting: Deformable contours April 26 th, 2018 4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.

More information

Active Contours/Snakes

Active Contours/Snakes Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng

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

Optimal Workload-based Weighted Wavelet Synopses

Optimal Workload-based Weighted Wavelet Synopses Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,

More 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

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

Querying by sketch geographical databases. Yu Han 1, a *

Querying by sketch geographical databases. Yu Han 1, a * 4th Internatonal Conference on Sensors, Measurement and Intellgent Materals (ICSMIM 2015) Queryng by sketch geographcal databases Yu Han 1, a * 1 Department of Basc Courses, Shenyang Insttute of Artllery,

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

Simplification of 3D Meshes

Simplification of 3D Meshes Smplfcaton of 3D Meshes Addy Ngan /4/00 Outlne Motvaton Taxonomy of smplfcaton methods Hoppe et al, Mesh optmzaton Hoppe, Progressve meshes Smplfcaton of 3D Meshes 1 Motvaton Hgh detaled meshes becomng

More information

Shape controllable geometry completion for point cloud models

Shape controllable geometry completion for point cloud models Noname manuscrpt No. (wll be nserted by the edtor) Shape controllable geometry completon for pont cloud models Long Yang 1, 2 Qngan Yan 1 Chunxa Xao 1 * Receved: date / Accepted: date Abstract Geometry

More information

Monte Carlo Integration

Monte Carlo Integration Introducton Monte Carlo Integraton Dgtal Image Synthess Yung-Yu Chuang 11/9/005 The ntegral equatons generally don t have analytc solutons, so we must turn to numercal methods. L ( o p,ωo) = L e ( p,ωo)

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

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

A fast algorithm for color image segmentation

A fast algorithm for color image segmentation Unersty of Wollongong Research Onlne Faculty of Informatcs - Papers (Arche) Faculty of Engneerng and Informaton Scences 006 A fast algorthm for color mage segmentaton L. Dong Unersty of Wollongong, lju@uow.edu.au

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

An Improved Stereo Matching Algorithm Based on Guided Image Filter

An Improved Stereo Matching Algorithm Based on Guided Image Filter nd Internatonal Conference on Modellng, Identfcaton and Control (MIC 015 An Improved Stereo Matchng Algorthm Based on Guded Image Flter Rudong Gao, Yun Chen, Lna Yan School of nstrumentaton Scence and

More information

Adaptive Energy and Location Aware Routing in Wireless Sensor Network

Adaptive Energy and Location Aware Routing in Wireless Sensor Network Adaptve Energy and Locaton Aware Routng n Wreless Sensor Network Hong Fu 1,1, Xaomng Wang 1, Yngshu L 1 Department of Computer Scence, Shaanx Normal Unversty, X an, Chna, 71006 fuhong433@gmal.com {wangxmsnnu@hotmal.cn}

More information

Joint Example-based Depth Map Super-Resolution

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

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

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

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

More information

Design for Reliability: Case Studies in Manufacturing Process Synthesis

Design for Reliability: Case Studies in Manufacturing Process Synthesis Desgn for Relablty: Case Studes n Manufacturng Process Synthess Y. Lawrence Yao*, and Chao Lu Department of Mechancal Engneerng, Columba Unversty, Mudd Bldg., MC 473, New York, NY 7, USA * Correspondng

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

Coding Artifact Reduction Using Edge Map Guided Adaptive and Fuzzy Filter

Coding Artifact Reduction Using Edge Map Guided Adaptive and Fuzzy Filter MEL A MITSUBISHI ELECTIC ESEACH LABOATOY http://www.merl.com Codng Artfact educton Usng Edge Map Guded Adaptve and Fuzzy Flter Hao-Song Kong Yao Ne Anthony Vetro Hufang Sun Kenneth E. Barner T-2004-056

More information

A Topology-aware Random Walk

A Topology-aware Random Walk A Topology-aware Random Walk Inkwan Yu, Rchard Newman Dept. of CISE, Unversty of Florda, Ganesvlle, Florda, USA Abstract When a graph can be decomposed nto clusters of well connected subgraphs, t s possble

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

Scan Conversion & Shading

Scan Conversion & Shading Scan Converson & Shadng Thomas Funkhouser Prnceton Unversty C0S 426, Fall 1999 3D Renderng Ppelne (for drect llumnaton) 3D Prmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng

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

Octree Subdivision Using Coplanar Criterion for Hierarchical Point Simplification

Octree Subdivision Using Coplanar Criterion for Hierarchical Point Simplification Octree Subdvson Usng Coplanar Crteron for Herarchcal Pont Smplfcaton Pa-Feng Lee 1, Chen-Hsng Chang 1, Jun-Lng Tseng 2, Bn-Shyan Jong 3, and Tsong-Wuu Ln 4 1 Dept. of Electronc Engneerng, Chung Yuan Chrstan

More information

Constructing Minimum Connected Dominating Set: Algorithmic approach

Constructing Minimum Connected Dominating Set: Algorithmic approach Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected

More information

Scan Conversion & Shading

Scan Conversion & Shading 1 3D Renderng Ppelne (for drect llumnaton) 2 Scan Converson & Shadng Adam Fnkelsten Prnceton Unversty C0S 426, Fall 2001 3DPrmtves 3D Modelng Coordnates Modelng Transformaton 3D World Coordnates Lghtng

More information

Edge Detection in Noisy Images Using the Support Vector Machines

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

A high precision collaborative vision measurement of gear chamfering profile

A high precision collaborative vision measurement of gear chamfering profile Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) A hgh precson collaboratve vson measurement of gear chamferng profle Conglng Zhou, a, Zengpu Xu, b, Chunmng

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

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Vectorization of Image Outlines Using Rational Spline and Genetic Algorithm

Vectorization of Image Outlines Using Rational Spline and Genetic Algorithm 01 Internatonal Conference on Image, Vson and Computng (ICIVC 01) IPCSIT vol. 50 (01) (01) IACSIT Press, Sngapore DOI: 10.776/IPCSIT.01.V50.4 Vectorzaton of Image Outlnes Usng Ratonal Splne and Genetc

More information