A Hierarchical Skeleton-based Implicit Model
|
|
- Ilene Nichols
- 6 years ago
- Views:
Transcription
1 A Herarchcal Skeleton-based Imlct Model MARCELO DE GOMENSORO MALHEIROS WU, SHIN-TING Gruo de Comutação de Imagens (GCI-DCA-FEEC) Unversdade Estadual de Camnas (UNICAMP) Abstract. Imlct modelng s a recent trend n Comuter Grahcs and a varety of skeleton-based models has been roosed. In ths aer e resent a herarchcal frameork that can encomass a de range of these varants, rovdng a more flexble ay for defnng the shae of mlct obects. We also derve a ne decay functon, hch s comutatonally chea. 1 Introducton Imlct modelng s a recent trend n the feld of Comuter Grahcs that bulds geometrcal obects on the bass of mlct mathematcal functons. We are nterested n a secfc modelng technque, here the mlct obects are defned by skeletons. Informally, a skeleton s a set of rmtves that are combned to defne the shae of an obect. The skeleton-based aroach rovdes a very flexble ay to construct mlct obects, hch can be altered by smly changng ther rmtves. It can also be used n comlement th arametrc methods to enrch the modelng doman. Partcularly, skeletons are attractve to model a de range of real obects, manly organclke shaes (for examle, arts of the human body or anmals) and lquds [7]. These models can also be drectly anmated [8]. The most dely used technques based on the skeleton aroach are blobs [1], metaballs [6], and soft obects [7, 8]. Wth these technques, obects are secfed n terms of dstance measures to a set of onts. These technques are all smlar, and dffer on the dstance functon used. Several varants of these technques ere roosed n order to mrove ether the reresentatvty or the controllablty of the skeleton-based models [3, 5]. Snce each of these models offer some dstnctve features, t s desrable to have ther functonaltes ntegrated n order to facltate the modelng of comlex shaes. In ths aer e roose a frameork that can encomass a de range of skeleton-based models. A skeleton s defned herarchcally usng an n-ary tree structure, here the leaf nodes reresent any rmtve and the nternal nodes denote ntermedate results from a combnaton of ther chld nodes. Syntactcally, there s no restrcton on ether the knds of rmtves or the tyes of combnng oeratons. For our shae secfcaton, e consder the defnton of an mlct obect as the comoston of three geometrcally meanngful classes of functons shae, decay, andblendng functons. Ths aer s organzed as follos. We begn th the basc concets and notatons used to descrbe skeleton-based mlct obects, then e dscuss the related revous ork. Next e resent our roosed herarchcal model. Then e descrbe our mlementaton and some results. We conclude th a dscusson of future ork. 2 Skeleton-based Modelng Ths secton summarzes some basc concets related to skeleton-based modelng. For further detals, e suggest the reference [5]. In the follong dscusson, e denote onts by boldface loer case letters, transformatons by boldface catals and scalars by talcs. Subscrts denote members of a set of obects, hle suerscrts denote artcular levels n a herarchy, beng 0 the tomost one. For examle, Tx corresonds to the transformaton T of the ont x, andf (n) s the -th scalar functon belongng to the n-th deth level. Gven a scalar functon F : R m! R, hch mas m-dmensonal onts to real values, and a real value c, the set of onts x 2 R m that satsfy F (x) =c s sad to be an mlct obect. In fact, ths ont set corresonds to the level set of F assocated to c. Generally, skeleton-based models are bult from a set of scalar functons f (x), combned through elldefned oeratons knon as blends. The resultng functon F defnes a man scalar feld n R m. Once defned the value c, the set of scalar functons s called the skeleton of the mlct obect. For ractcal uroses, the functons used to defne the man scalar feld should satsfy some smoothness
2 condtons, lke beng contnuously dfferentable. Moreover, these functons tycally have the follong roerty: ther values decrease as the dstance to a gven reference ont ncreases. These functons defne felds th concentrc level sets. Therefore, e may say that each of them contrbutes th shercal-shaed felds to the man scalar feld. Because of the ay the functons ere defned, ther nfluence on the resultng feld s mostly concentrated n the neghborhood of. The usual blendng oeraton emloyed to combne those functons s a eghted sum. Note that f the functons are carefully chosen, then the resultng obect s bounded. 3 Prevous Work Skeleton-based mlct modelng as ntroduced by Blnn [1], motvated by the need to dslay electron densty mas of molecular structures. He used a ont set as skeleton, summng the contrbutons due to a Gaussan dstance functon for each ont. A varaton of the revous model as later develoed n [6], usng a ecese quadratc olynomal nstead of an exonental functon. Dfferently from Blnn s model, the dstance functon as defned n such a ay that the contrbuton of a gven ont droed to zero after a certan dstance. Ths alloed more effcent comutaton of the scalar feld because only the contrbutons of the onts thn a redefned dstance ere needed. Wyvll et al. [7] roosed a smlar model, th a cubc olynomal over the Eucldean dstance. There as an exlct arameter that controlled the radus of nfluence of each ont. These orks ere lmted to ont sets and lnear blends. Later, Bloomenthal and Shoemake [3] roosed curve segments as references for the dstance functon (generalzed cylnders), and a convoluton blend to combne them. An extensve survey of skeleton rmtves and blendng technques can be found n [5]. Bloomenthal and Wyvll [2] dscussed technques to mrove the effcency of dslay methods for mlct surfaces, hch together th control flexblty are essental for an nteractve desgn envronment. 4 Herarchcal Skeletons In ths secton our frameork s resented. Although e restrcted the dscusson to mlct surfaces n R 3, t can be easly generalzed to any dmenson. 4.1 Motvaton Careful analyss of revous skeleton-based models led us to conclude that e can get a large set of varants ether by modfyng the rmtves or by alterng the blendng functon. For the rmtves e can also dstngush to terms: the Eucldean dstance from x 2 R 3 to a reference ont, curve, or surface, hch accounts for the level set shae (that s, a shae functon); and the decay functon, hch forces the contrbuton of each reference entty to dro to an nsgnfcant value at a certan dstance from t. From the dscusson made n [2], e can say that there are bascally three searate ays to nteractvely control an mlctly defned obect: defnton and manulaton of the shae functon; defnton and adustment of the decay functon; and defnton and manulaton of the blendng functon. These statements are the bass of our frameork. 4.2 Structure The scalar feld defned by F s the result of a blendng oeraton on a set of scalar felds. Each one of these felds may be, n ts turn, comosed of other felds, and so on. Ths naturally leads to a tree structure, hose leaf nodes corresond to rmtve felds. Each nternal node at the n-th deth level reresents a scalar feld resultng from the combnaton of the felds belo t (Fg. 1). In the rest of ths aer, e ll refer to these leaf nodes as rmtve nodes and to the nternal nodes as blend nodes. f 1 T f 1 (1) f 2 T F f 1 (3) T f (1) 2 T T T f 3 T T f 2 (3) Fgure 1: Skeleton structure. f 4
3 A tree structure makes ossble the selectve combnaton of the rmtves, and s not lmted to ust one tye of blendng oeraton as n the usual technques. Furthermore, t smlfes the nteractve manulaton of comlex obects, because the user can searate the model nto subtrees and ork th only one at a tme. The man scalar feld, hch defnes the mlct obect, s gven by F (x) =f (0) 1 (x): We may dro the subscrt 1 because F s the unque feld at the tomost level, hch s the tree root node. The ntermedate scalar felds assocated to the other nodes are smly called comonent felds. We defne each feld n ts artcular doman. Ths allos the choce of a convenent reference system for each feld. There s a transformaton T (n) that relates a feld doman and ts arent doman. When combnng to or more scalar felds, e have to take ths transformaton nto account n order to assure that the combnaton occurs under the same reference system [5]. Gven a ont x n the arent coordnate system, the assocated feld value s comuted by the combnaton of ts chld feld values. After the arorate transformaton T (n) of x nto each -th chld feld doman, the chld feld values are obtaned by alyng f (n) on these transformed onts. Note that T (n) s not lmted to be a rgd moton: e also allo scalng and shearng transformatons. Wth ths, e can alter the resultng shae contrbuton of a artcular scalar feld. For examle, to ellsodal-shaed felds can be obtaned from to shercal ones by a scalng transformaton (Fg. 2). Fgure 2: Oeratng on the doman of the rmtves. 4.3 Blendng Oeratons The lnear blend s the most commonly used blendng oeraton for skeleton models, here the contrbutons of a set of functons are combned through a eghted sum. We generalze ths dea by assocatng a eght to each comonent feld f, ndeendently of the blendng functon. That s, a blendng oeraton combnes the values f (n) nstead of f (n). The eght can gve a flexble control over the nfluence of each comonent feld. For examle, a lnear blendng oeraton at the ont x may be exressed by f (n) (x) =X f (n1) ([T (n1) ],1 x); (1) here stands for ts -th comonent functon. In ths case, may assume zero and even negatve values, so that the corresondng feld has resectvely no and subtractve effects. In Fg. 3, the three rmtves n the to ro have eght 1. Belo, the eght of the left rmtve s set to 2, hle the rght one has a -2 value. Fgure 3: Influence of the eght. Although not strctly a blend, another useful combnng oeraton s the unon. Ths oeraton takes the maxmum of the feld contrbutons n a gven locaton, that s, f (n) (x) = max f f (n1) ([T (n1) ],1 x)g: Note that ths oeraton may ntroduce frst order dscontnutes on the surface, allong us to create shar corners on t. 4.4 Prmtve Felds Dfferng from blend nodes, a rmtve node reresents a feld defned by f (n) = d s ;
4 here the functons s and d are called shae and decay, resectvely Shae Functon As already exlaned, the shae functon defnes a scalar feld n R 3 and accounts for the form of the rmtve. Because each feld s defned n ts on doman, the oston, the sze, and the orentaton of any rmtve can be arbtrary. Hence, e may alays choose a convenent reference system to defne t. For examle, a shercal rmtve, centered at the orgn and th nfluence radus gven by r, can be exressed by kxk s (x) = ; (3) r here x 2 R 3. The scalar r s a user-defned arameter of ths rmtve 1. Note that ths feld has value 1 at onts belongng to the surface of a shere th radus r and centered at the orgn Decay Functon Usually, the feld gven by a shae functon ncreases as e move aay from the rmtve. Thus e need to aly the decay functon, to force that the feld contrbuton goes toard zero th the augment of dstance. In ths ay, local (or seudo-local) control of the model s ensured. Wyvll et al. [7] derved a decay functon smlarly shaed to the one roosed by Blnn [1], th the advantage of drong to zero outsde ts range of nfluence. Ther functon requred three addtons and fve multlcatons. Based on the same rncle aled by Wyvll et al., e derved another smlar functon, also th lmted nfluence. The addtonal advantage reles on the fact that our functon s smler, requrng feer oeratons. We obtaned ths functon by mosng that d (0) = d (1) = 0, nstead of requrng that d (0:5) = 0:5. Thus, our decay functon s gven by d (t) = 8< : 1; f t 0,(t, 1) 3 ; f 0 <t<1 0; otherse : (4) Observe that the result of the comoston d s, gven resectvely by equatons (4) and (3), s a ecese monotonc and non-ncreasng functon, hose value vanshes after a dstance greater than or equal to r from the orgn (see Fg. 4). 1 In fact, ths arameter s redundant, because the same effect could be obtaned by alyng a unform scalng transformaton on the doman of a shercal rmtve th untary radus. Ths s left n the rototye as a convenence. 1 Value 0 0 r Dstance Fgure 4: Shercal rmtve feld functon. 5 Imlementaton Snce the mlct obect s recursvely defned from rmtve felds, an adequate data structure for ts reresentaton s an n-ary tree. In ths tree, the leaf nodes denote the rmtve feld functons and the nternal nodes reresent the blendng functons, hch are used to combne the functon values of ts chld nodes. Each node contans a homogeneous transformaton matrx T that relates ts doman coordnate system to the one from ts arent. It also contans a eght that affects the contrbuton of the node to the arent scalar feld. We develoed a C class hch mlements ths data structure. The methods rovded by ths class ere desgned amng nteractve manulaton on the mlct obects, as lsted n the follong: Methods to create and destroy rmtve nodes. There are also methods to ndvdually query and modfy the arameters of ther shae and decay functons. Methods to create and destroy blend nodes. Ther arameters can be quered and modfed (ncludng the eght ), and the blendng oeratons can also be changed. Methods to modfy the transformaton matrx T beteen a node and ts arent. Methods to manulate the tree structure (e.g., get root node, query arent, query chld, remove subtree, etc). A method to query and modfy the current level set value c of the man scalar feld. A method to evaluate the man scalar feld at a gven ont, returnng both the scalar value and the assocated gradent vector. We used abstract classes for defnng rmtve felds and blendng oeratons. Hence, ne rmtves and ne
5 blends can be easly ntegrated by dervng secalzed classes. We have already mlemented the rmtve functon shon n Fg. 4 and the oeratons gven by the equatons (1) and. Several authors [2, 4] have observed that resentng an mlct obect as a samle of onts offers greatly mroved seed relatve to olygonzaton. Moreover, use of arorate deth-cueng roves to be very effectve for vsualzng clouds of onts n sace. Snce e are nterested on the rad rototyng of the mlct obect, e oted for vsualzng the mlct obect as a set of artcles. We used the algorthm resented by Fgueredo and Gomes [4] to lace these artcles on the surface of the mlct obect. Roughly seakng, ther algorthm randomly scatters artcles n R 3 and uses a modfed gradent vector feld to force them to mgrate to the surface of the obect. For the renderng e used the OenGL grahcs lbrary. The deth cue as obtaned by usng ts fog feature. 6 Results A model of a hand as bult from a set of 17 rmtves, hose outlnes and relatve ostons are shon n Fg. 5. The resultng model s resented n Fg. 6, beng vsualzed by 3200 artcles lyng at the obect surface. f4a f3a f3b f4b f5a f5b f1b f1a f2b f2a Fgure 5: Outlnes of the rmtves. Frst the alm as bult, usng 7 rmtves, flattened from ther orgnal shercal shaes. Then each fnger as modeled searately, as a subtree th to rmtves. Next, the fngers ere ostoned relatve to the alm, as f they ere sngle rmtves. Only lnear blendng oeratons ere used (denoted by ), th untary eght for each rmtve (Fg. 7). Fg. 8 exemlfes a modfcaton of ths hand, here the fngers are slghtly moved aart from each other. Due to the herarchcal structure, to acheve ths effect e ust need to aly rotatons to the corresondng subtree root nodes: f1, f2, f3, f4,andf5. Fgure 6: Imlct model of a hand. 4 f5 6 f4 5 f3 f1b f1 1 f2a f2b 2 3 f1a F f3a f3b f4a f4b f5a f5b 7 f2 Fgure 7: Structure of the hand. The next examle demonstrates the use of to combnng oeratons lnear blend and unon n the same mlct obect. The obect shon on the to of Fg. 9 s made of 3 rmtves, th ts corresondng tree structure sketched belo t. The rmtves labelled g1a and g1b are combned through a unon oeraton (ndcated by U ), makng the subtree labelled g1. Ths subtree s then combned th the horzontal rmtve g2 through a lnear blend, thus yeldng the fnal obect. Observe the dfferent connectons beteen the rmtves. The use of a unon oeraton leads to a shar corner (A), hle the lnear blend gves a smooth ont (B or C).
6 Fgure 8: Modfed hand. 7 Conclusons We resented a frameork that not only encomasses several exstng skeleton-based models but also allos ther extenson. The roosed herarchcal structure rovdes adequate defnton and manulaton semantcs for comlex obects. Our goal has been to suort modelng of comlex mlct obects n an nteractve desgn envronment. In ths aer e addressed only the modelng roblem, but e beleve that t can be the underlyng structure for nteractve systems. Observe that the control flexblty s accomlshed by the set of arameters nvolved n the defnton of the model, hch allo a vast range of ntutve geometrc varatons. Regardng to the modelng roblem, to contrbutons are orth to be mentoned. Frst, e derved a comutatonally chea decay functon. Then, e have used geometrcal transformatons on the functon doman to mrove the modelng flexblty. As future ork, e lan to exlore the nteractvty oer of the roosed frameork. 8 Acknoledgments We sh to thank Marcos K. Agulera and the referees for ther helful suggestons on the mrovement of ths aer. We also thank CNPq for the fnancal suort. References [1] Blnn, J. F., A Generalzaton of Algebrac Surface Drang, ACM Transactons on Grahcs, 1(3), A B C g1 g2 F g1a g1b U Fgure 9: Examle of multle blends. [2] Bloomenthal, J. and Wyvll, B., Interactve Technques for Imlct Modelng, Comuter Grahcs (1990 Sym. on Interactve 3D Grahcs), 24, [3] Bloomenthal, J. and Shoemake, K., Convoluton Surfaces, Comuter Grahcs, 25(4), [4] de Fgueredo, L. H. and Gomes, J., Samlng Imlct Obects th Physcally-based Partcle Systems, Comuter & Grahcs, 20(3), [5] Gomes, J. and Velho, L., Imlct Obects n Comuter Grahcs, IMPA, [6] Nshmura, H., Hra, M., Kaa, T., Kaata, T., Shrakaa, I., and Omura, K., Obect Modelng by Dstrbuton Functon and a Method of Image Generaton, Jaan Electroncs Communcaton Conference 85, [7] Wyvll, B., McPheeters, C., and Wyvll, G., Data Structure for Soft Obects, TheVsual Comuter, 2(4), [8] Wyvll, B., McPheeters, C., and Wyvll, G., Anmatng Soft Obects, The Vsual Comuter, 2(4), 1986.
TIME-EFFICIENT NURBS CURVE EVALUATION ALGORITHMS
TIME-EFFICIENT NURBS CURVE EVALUATION ALGORITHMS Kestuts Jankauskas Kaunas Unversty of Technology, Deartment of Multmeda Engneerng, Studentu st. 5, LT-5368 Kaunas, Lthuana, kestuts.jankauskas@ktu.lt Abstract:
More informationTransactions on Visualization and Computer Graphics. Sketching of Mirror-symmetric Shapes. Figure 1: Sketching of a symmetric shape.
Page of 0 Transactons on Vsualzaton and omuter Grahcs 0 0 0 Abstract Sketchng of Mrror-symmetrc Shaes For Peer Revew Only Ths aer resents a system to create mrror-symmetrc surfaces from sketches. The system
More informationTHE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY
Proceedngs of the 20 Internatonal Conference on Machne Learnng and Cybernetcs, Guln, 0-3 July, 20 THE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY JUN-HAI ZHAI, NA LI, MENG-YAO
More informationPoint Cloud Surface Representations
Pont Cloud Surface Reresentatons Mark Pauly 2003 see also EG2003 course on Pont-based Comuter Grahcs avalable at: htt://grahcs.stanford.edu/~maauly/pdfs/pontbasedcomutergrahcs_eg03.df Paers Hoe, DeRose,
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationA note on Schema Equivalence
note on Schema Equvalence.H.M. ter Hofstede and H.. Proer and Th.P. van der Wede E.Proer@acm.org PUBLISHED S:.H.M. ter Hofstede, H.. Proer, and Th.P. van der Wede. Note on Schema Equvalence. Techncal Reort
More informationBayesian Networks: Independencies and Inference. What Independencies does a Bayes Net Model?
Bayesan Networks: Indeendences and Inference Scott Daves and Andrew Moore Note to other teachers and users of these sldes. Andrew and Scott would be delghted f you found ths source materal useful n gvng
More informationIMRT workflow. Optimization and Inverse planning. Intensity distribution IMRT IMRT. Dose optimization for IMRT. Bram van Asselen
IMRT workflow Otmzaton and Inverse lannng 69 Gy Bram van Asselen IMRT Intensty dstrbuton Webb 003: IMRT s the delvery of radaton to the atent va felds that have non-unform radaton fluence Purose: Fnd a
More informationIntroduction. Basic idea of subdivision. History of subdivision schemes. Subdivision Schemes in Interactive Surface Design
Subdvson Schemes n Interactve Surface Desgn Introducton Hstory of subdvson. What s subdvson? Why subdvson? Hstory of subdvson schemes Stage I: Create smooth curves from arbtrary mesh de Rham, 947. Chan,
More informationRational Ruled surfaces construction by interpolating dual unit vectors representing lines
Ratonal Ruled surfaces constructon by nterolatng dual unt vectors reresentng lnes Stavros G. Paageorgou Robotcs Grou, Deartment of Mechancal and Aeronautcal Engneerng, Unversty of Patras 265 Patra, Greece
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More informationApplication of Genetic Algorithms in Graph Theory and Optimization. Qiaoyan Yang, Qinghong Zeng
3rd Internatonal Conference on Materals Engneerng, Manufacturng Technology and Control (ICMEMTC 206) Alcaton of Genetc Algorthms n Grah Theory and Otmzaton Qaoyan Yang, Qnghong Zeng College of Mathematcs,
More informationContour Error of the 3-DoF Hydraulic Translational Parallel Manipulator. Ryszard Dindorf 1,a, Piotr Wos 2,b
Advanced Materals Research Vol. 874 (2014) 57-62 Onlne avalable snce 2014/Jan/08 at www.scentfc.net (2014) rans ech Publcatons, Swtzerland do:10.4028/www.scentfc.net/amr.874.57 Contour Error of the 3-DoF
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More 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 informationOutline. Seamless Image Stitching in the Gradient Domain. Related Approaches. Image Stitching. Introduction Related Work
Outlne Seamless Image Sttchng n the Gradent Doman Anat Levn, Assaf Zomet, Shmuel Peleg and Yar Wess ECCV 004 Presenter: Pn Wu Oct 007 Introducton Related Work GIST: Gradent-doman Image Sttchng GIST GIST
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationActive 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 informationLecture Note 08 EECS 4101/5101 Instructor: Andy Mirzaian. All Nearest Neighbors: The Lifting Method
Lecture Note 08 EECS 4101/5101 Instructor: Andy Mrzaan Introducton All Nearest Neghbors: The Lftng Method Suose we are gven aset P ={ 1, 2,..., n }of n onts n the lane. The gven coordnates of the -th ont
More informationModeling, Manipulating, and Visualizing Continuous Volumetric Data: A Novel Spline-based Approach
Modelng, Manpulatng, and Vsualzng Contnuous Volumetrc Data: A Novel Splne-based Approach Jng Hua Center for Vsual Computng, Department of Computer Scence SUNY at Stony Brook Talk Outlne Introducton and
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationImage Segmentation. Image Segmentation
Image Segmentaton REGION ORIENTED SEGMENTATION Let R reresent the entre mage regon. Segmentaton may be vewed as a rocess that arttons R nto n subregons, R, R,, Rn,such that n= R = R.e., the every xel must
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More 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 informationBroadcast Time Synchronization Algorithm for Wireless Sensor Networks Chaonong Xu 1)2)3), Lei Zhao 1)2), Yongjun Xu 1)2) and Xiaowei Li 1)2)
Broadcast Tme Synchronzaton Algorthm for Wreless Sensor Networs Chaonong Xu )2)3), Le Zhao )2), Yongun Xu )2) and Xaowe L )2) ) Key Laboratory of Comuter Archtecture, Insttute of Comutng Technology Chnese
More informationRegion Segmentation Readings: Chapter 10: 10.1 Additional Materials Provided
Regon Segmentaton Readngs: hater 10: 10.1 Addtonal Materals Provded K-means lusterng tet EM lusterng aer Grah Parttonng tet Mean-Shft lusterng aer 1 Image Segmentaton Image segmentaton s the oeraton of
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationSemi-Supervised Biased Maximum Margin Analysis for Interactive Image Retrieval
IP-06850-00.R3 Sem-Suervsed Based Maxmum Margn Analyss for Interactve Image Retreval Lnng Zhang,, Student Member, IEEE, Lo Wang, Senor Member, IEEE and Wes Ln 3, Senor Member, IEEE School of Electrcal
More informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
More informationSupport Vector Machines. CS534 - Machine Learning
Support Vector Machnes CS534 - Machne Learnng Perceptron Revsted: Lnear Separators Bnar classfcaton can be veed as the task of separatng classes n feature space: b > 0 b 0 b < 0 f() sgn( b) Lnear Separators
More informationHuman Action Recognition Using Discriminative Models in the Learned Hierarchical Manifold Space
Human Acton Recognton Usng Dscrmnatve Models n the Learned Herarchcal Manfold Sace Le Han, We Lang*, nxao Wu and Yunde Ja School of Comuter Scence and Technology, Beng Insttute of Technology 5 South Zhongguancun
More informationSolving Optimization Problems on Orthogonal Ray Graphs
Solvng Otmzaton Problems on Orthogonal Ray Grahs Steven Chalck 1, Phl Kndermann 2, Faban L 2, Alexander Wolff 2 1 Insttut für Mathematk, TU Berln, Germany chalck@math.tu-berln.de 2 Lehrstuhl für Informatk
More informationOntology based data warehouses federation management system
Ontolog based data warehouses federaton management sstem Naoual MOUHNI 1, Abderrafaa EL KALAY 2 1 Deartment of mathematcs and comuter scences, Unverst Cad Aad, Facult of scences and technologes Marrakesh,
More informationType-2 Fuzzy Non-uniform Rational B-spline Model with Type-2 Fuzzy Data
Malaysan Journal of Mathematcal Scences 11(S) Aprl : 35 46 (2017) Specal Issue: The 2nd Internatonal Conference and Workshop on Mathematcal Analyss (ICWOMA 2016) MALAYSIAN JOURNAL OF MATHEMATICAL SCIENCES
More informationVisual Hull Rendering with Multi-view Stereo Refinement
Vsual Hull Renderng wth Mult-vew Stereo Refnement Yang Lu ynglu@ucdavs.edu George Chen george-qan.chen@st.com Nelson Max max@llnl.gov Chrstan Hofsetz chofsetz@ucdavs.edu Peter McGunness eter.mcgunness@st.com
More informationAnalytical Performance Analysis of Network- Processor-Based Application Designs
Analytcal Performance Analyss of Networ- Processor-Based Alcaton Desgns e Lu BMC Software Inc. Waltham, MA e Wang Unversty of Massachusetts Lowell, MA Abstract Networ rocessors (NP) are desgned to rovde
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 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 informationOn Some Entertaining Applications of the Concept of Set in Computer Science Course
On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,
More informationEducational Semantic Networks and their Applications
BUIU Unverstăţ Petrol Gaze dn Ploeşt Vol. X o. /008 77-85 Sera atematcă - Informatcă - Fzcă ducatonal Semantc etwors and ther Alcatons Gabrela ose vu Ionţă Unverstatea Petrol-Gaze dn Ploeşt Bd. Bucureşt
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE
Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton
More 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 informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationMotivation. Motivation. Monte Carlo. Example: Soft Shadows. Outline. Monte Carlo Algorithms. Advanced Computer Graphics (Fall 2009)
Advanced Comuter Grahcs Fall 29 CS 294, Renderng Lecture 4: Monte Carlo Integraton Rav Ramamoorth htt://nst.eecs.berkeley.edu/~cs294-3/a9 Motvaton Renderng = ntegraton Relectance equaton: Integrate over
More informationHarmonic Coordinates for Character Articulation PIXAR
Harmonc Coordnates for Character Artculaton PIXAR Pushkar Josh Mark Meyer Tony DeRose Bran Green Tom Sanock We have a complex source mesh nsde of a smpler cage mesh We want vertex deformatons appled to
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationHigh-Boost Mesh Filtering for 3-D Shape Enhancement
Hgh-Boost Mesh Flterng for 3-D Shape Enhancement Hrokazu Yagou Λ Alexander Belyaev y Damng We z Λ y z ; ; Shape Modelng Laboratory, Unversty of Azu, Azu-Wakamatsu 965-8580 Japan y Computer Graphcs Group,
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationOn the Two-level Hybrid Clustering Algorithm
On the Two-level Clusterng Algorthm ng Yeow Cheu, Chee Keong Kwoh, Zongln Zhou Bonformatcs Research Centre, School of Comuter ngneerng, Nanyang Technologcal Unversty, Sngaore 639798 ezlzhou@ntu.edu.sg
More informationGentle Early Detection Algorithm
Gentle Early etecton Algorthm Hussen Abdel-jaber 1, Mahmoud Abdeljaber 2, Hussen Abu Mansour 1, Malak El-Amr 1 1 Faculty of Comuter Studes, eartment of Informaton Technology and Comutng, Arab Oen Unversty,
More informationCS246: Mining Massive Datasets Jure Leskovec, Stanford University
CS46: Mnng Massve Datasets Jure Leskovec, Stanford Unversty http://cs46.stanford.edu /19/013 Jure Leskovec, Stanford CS46: Mnng Massve Datasets, http://cs46.stanford.edu Perceptron: y = sgn( x Ho to fnd
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationView-Dependent Multiresolution Representation for a Height Map
Internatonal Journal of Innovaton, Management and echnology, Vol. 4, No. 1, February 013 Vew-Deendent Multresoluton Reresentaton for a Heght Ma Yong H. Chung, Won K. Hwam, Dae S. Chang, Jung-Ju Cho, and
More informationGreedy Technique - Definition
Greedy Technque Greedy Technque - Defnton The greedy method s a general algorthm desgn paradgm, bult on the follong elements: confguratons: dfferent choces, collectons, or values to fnd objectve functon:
More informationFitting: 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 informationUser 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 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 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 informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More 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 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 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 informationIndex Terms-Software effort estimation, principle component analysis, datasets, neural networks, and radial basis functions.
ISO 9001:2008 Certfed Internatonal Journal of Engneerng and Innovatve Technology (IJEIT The Effect of Dmensonalty Reducton on the Performance of Software Cost Estmaton Models Ryadh A.K. Mehd College of
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationAn Improved Face Recognition Technique Based on Modular Multi-directional Two-dimensional Principle Component Analysis Approach
301 JOURNAL OF SOFWARE, VOL. 9, NO. 1, DECEMBER 014 An Imroved Face Recognton echnque Based on Modular Mult-drectonal wo-dmensonal Prncle Comonent Analyss Aroach Deartment of Deartment of Xaoqng Dong Physcs
More informationOverview. CSC 2400: Computer Systems. Pointers in C. Pointers - Variables that hold memory addresses - Using pointers to do call-by-reference in C
CSC 2400: Comuter Systems Ponters n C Overvew Ponters - Varables that hold memory addresses - Usng onters to do call-by-reference n C Ponters vs. Arrays - Array names are constant onters Ponters and Strngs
More informationHybrid Non-Blind Color Image Watermarking
Hybrd Non-Blnd Color Image Watermarkng Ms C.N.Sujatha 1, Dr. P. Satyanarayana 2 1 Assocate Professor, Dept. of ECE, SNIST, Yamnampet, Ghatkesar Hyderabad-501301, Telangana 2 Professor, Dept. of ECE, AITS,
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More 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 informationAvailable online at ScienceDirect. Procedia Computer Science 94 (2016 )
Avalable onlne at www.scencedrect.com ScenceDrect Proceda Comuter Scence 94 (2016 ) 176 182 The 13th Internatonal Conference on Moble Systems and Pervasve Comutng (MobSPC 2016) An Effcent QoS-aware Web
More informationParametric Fault Simulation and Test Vector Generation
Parametrc Fault mulaton and Test Vector Generaton Khaled aab, am Ben-Hamda, and Bozena Kamnska Fluence Technology, 87 W Creeksde Place, Beaverton, OR, 978 Abstract Process varaton has forever been the
More informationModule 6: FEM for Plates and Shells Lecture 6: Finite Element Analysis of Shell
Module 6: FEM for Plates and Shells Lecture 6: Fnte Element Analyss of Shell 3 6.6. Introducton A shell s a curved surface, whch by vrtue of ther shape can wthstand both membrane and bendng forces. A shell
More informationThe ray density estimation of a CT system by a supervised learning algorithm
Te ray densty estaton of a CT syste by a suervsed learnng algort Nae : Jongduk Baek Student ID : 5459 Toc y toc s to fnd te ray densty of a new CT syste by usng te learnng algort Background Snce te develoent
More informationEnvironmental Modelling & Software
Envronmental Modellng & Software 90 (2017) 68e77 Contents lsts avalable at ScenceDrect Envronmental Modellng & Software ournal homeage: www.elsever.com/locate/envsoft Addng satal flexblty to source-recetor
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 informationA Structure Preserving Database Encryption Scheme
A Structure Preservng Database Encryton Scheme Yuval Elovc, Ronen Wasenberg, Erez Shmuel, and Ehud Gudes Ben-Guron Unversty of the Negev, Faculty of Engneerng, Deartment of Informaton Systems Engneerng,
More informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationRecognition of Identifiers from Shipping Container Images Using Fuzzy Binarization and Enhanced Fuzzy Neural Network
Recognton of Identfers from Shng Contaner Images Usng uzzy Bnarzaton and Enhanced uzzy Neural Networ Kwang-Bae Km Det. of Comuter Engneerng, Slla Unversty, Korea gbm@slla.ac.r Abstract. In ths aer, we
More informationSegmenting Hands of Arbitrary Color
f zhuxj, Fnger Men u for W earable Comuters Segmentng Hands of Arbtrary Color Xaojn Zhu Je Yang Alex Wabel Interactve Systems Laboratores School of Comuter Scence Carnege Mellon Unversty ttsburgh, A 523
More informationRisk Assessment Using Functional Modeling based on Object Behavior and Interaction
Rsk Assessment Usng Functonal Modelng based on Object Behavor and Interacton Akekacha Tangsuksant, Nakornth Promoon Software Engneerng Lab, Center of Ecellence n Software Engneerng Deartment of Comuter
More information12/2/2009. Announcements. Parametric / Non-parametric. Case-Based Reasoning. Nearest-Neighbor on Images. Nearest-Neighbor Classification
Introducton to Artfcal Intellgence V22.0472-001 Fall 2009 Lecture 24: Nearest-Neghbors & Support Vector Machnes Rob Fergus Dept of Computer Scence, Courant Insttute, NYU Sldes from Danel Yeung, John DeNero
More informationOptimized Query Planning of Continuous Aggregation Queries in Dynamic Data Dissemination Networks
WWW 007 / Trac: Performance and Scalablty Sesson: Scalable Systems for Dynamc Content Otmzed Query Plannng of Contnuous Aggregaton Queres n Dynamc Data Dssemnaton Networs Rajeev Guta IBM Inda Research
More informationc 2009 Society for Industrial and Applied Mathematics
SIAM J. MATRIX ANAL. APPL. Vol. 31, No. 3, pp. 1382 1411 c 2009 Socety for Industral and Appled Mathematcs SUPERFAST MULTIFRONTAL METHOD FOR LARGE STRUCTURED LINEAR SYSTEMS OF EQUATIONS JIANLIN XIA, SHIVKUMAR
More informationDiscriminative classifiers for object classification. Last time
Dscrmnatve classfers for object classfcaton Thursday, Nov 12 Krsten Grauman UT Austn Last tme Supervsed classfcaton Loss and rsk, kbayes rule Skn color detecton example Sldng ndo detecton Classfers, boostng
More informationSCALABLE AND VISUALIZATION-ORIENTED CLUSTERING FOR EXPLORATORY SPATIAL ANALYSIS
SCALABLE AND VISUALIZATION-ORIENTED CLUSTERING FOR EXPLORATORY SPATIAL ANALYSIS J.H.Guan, F.B.Zhu, F.L.Ban a School of Computer, Spatal Informaton & Dgtal Engneerng Center, Wuhan Unversty, Wuhan, 430079,
More informationSkew Estimation in Document Images Based on an Energy Minimization Framework
Skew Estmaton n Document Images Based on an Energy Mnmzaton Framework Youbao Tang 1, Xangqan u 1, e Bu 2, and Hongyang ang 3 1 School of Comuter Scence and Technology, Harbn Insttute of Technology, Harbn,
More informationA Geometric Approach for Multi-Degree Spline
L X, Huang ZJ, Lu Z. A geometrc approach for mult-degree splne. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 27(4): 84 850 July 202. DOI 0.007/s390-02-268-2 A Geometrc Approach for Mult-Degree Splne Xn L
More informationReal-time Motion Capture System Using One Video Camera Based on Color and Edge Distribution
Real-tme Moton Capture System Usng One Vdeo Camera Based on Color and Edge Dstrbuton YOSHIAKI AKAZAWA, YOSHIHIRO OKADA, AND KOICHI NIIJIMA Graduate School of Informaton Scence and Electrcal Engneerng,
More informationReal-time Joint Tracking of a Hand Manipulating an Object from RGB-D Input
Real-tme Jont Tracng of a Hand Manpulatng an Object from RGB-D Input Srnath Srdhar 1 Franzsa Mueller 1 Mchael Zollhöfer 1 Dan Casas 1 Antt Oulasvrta 2 Chrstan Theobalt 1 1 Max Planc Insttute for Informatcs
More informationOptimal Workload-based Weighted Wavelet Synopses
Optmal Workload-based Weghted Wavelet Synopses Yoss Matas School of Computer Scence Tel Avv Unversty Tel Avv 69978, Israel matas@tau.ac.l Danel Urel School of Computer Scence Tel Avv Unversty Tel Avv 69978,
More 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 informationIndirect Volume Rendering
Indrect Volume Renderng Balázs Csébalv Deartment o Control Engneerng and Inormaton Technology Budaest Unversty o Technology and Economcs Classcaton o vsualzaton algorthms Drect Volume Renderng DVR: The
More informationRELATIVE CAMERA POSE ESTIMATION METHOD USING OPTIMIZATION ON THE MANIFOLD
he Internatonal Archves of the Photogrammetry, Remote Sensng Satal Informaton Scences, Volume XLII-1/W1, 017 ISPRS Hannover Worsho: HRIGI 17 CMR 17 ISA 17 EuroCOW 17, 6 9 June 017, Hannover, Germany RELAIVE
More informationOverview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION
Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup
More informationResearch Article Quasi-Bézier Curves with Shape Parameters
Hndaw Publshng Corporaton Appled Mathematcs Volume 3, Artcle ID 739, 9 pages http://dxdoorg/55/3/739 Research Artcle Quas-Bézer Curves wth Shape Parameters Jun Chen Faculty of Scence, Nngbo Unversty of
More 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 information