Constrained Shape Modification of B-Spline curves
|
|
- Arline Chandler
- 5 years ago
- Views:
Transcription
1 Constraned Shape Modfcaton of B-Splne curves Mukul Tul, N. Venkata Reddy and Anupam Saxena Indan Insttute of Technology Kanpur, ABSTRACT Ths paper proposes a methodology to change the shape of a B-Splne curve locally. Present algorthm modfes the exstng B-Splne curve and makes t pass through a gven pont P, constraned to le n regon R, wth lmted devaton from the orgnal curve. Proposed methodology splts the curve nto atmost three segments based on the curvature of the curve and then modfes only one segment usng knot nserton and control pont ncluson. Keywords: B-Splne curve; Knot Inserton; Curve splttng.. INTRODUCTION A B-Splne curve C(u) s defned by control ponts (also known as de-boor ponts) and the knot vector u, u,..., } as U { 2 u p + n n C( u) N, p( u) where p s the degree of the curve, n s the number of control ponts and N, p ( u) are the splne bass functons [4] defned over a knot vector U. Durng the past few decades, B-splne curves have ganed popularty n shape modelng and geometrc desgn []. Beyond creatng these types of curves, modfcaton of the exstng ones s also of great mportance. B-splne curves offer a unfed mathematcal formulaton for representng not only free-form curves, but also standard analytcal shapes. Through the manpulaton of control ponts, degree and knots, a user can desgn varety of shapes usng B-splne formulatons. In a system that uses B-Splne curves as shape desgn tool, one can mplement many algorthms such as poston and dervatve evaluatons, knot nserton [2], knot deleton and degree elevaton [4]. Based on these fundamental algorthms, one can perform geometrc modelng and processng. B-Splne follows a representaton based on control ponts and knots, and weghts n case of ratonal B-Splne curves. A desgner can modfy a local curve segment by teratvely movng a control pont, changng the knots or modfyng the weghts assocated wth the control ponts. To ths end, Pegl [3] presented a method for modfyng shape of a ratonal B-Splne curve by relocatng ponts on the curve. The modfcaton s realzed by repostonng one or more control ponts. Pegl and Tller [4] dscussed n detal curve wrappng, flattenng, bendng and twstng usng the same approach. In addton, Au and Yuen [5] nvestgated how the shape of a NURBS curve changes when the weghts and locaton of the control ponts are modfed smultaneously. A drawback that the above mentoned methods have s that they are not automatc. A desgner should predefne the control pont to be shfted or the correspondng weght to be changed to provde the desred shape modfcaton. Workng on the nteractve scheme for curve modfcaton, Fowler and Barter [6] had presented constraned based manpulaton of curve of arbtrary degree. A drect modfcaton of free form curve by dsplacement functons was proposed n [7], whch comprses of degree elevaton and control pont repostonng. Besdes the most basc tool for shape modfcaton, control pont or weght modfcaton, one can work on knot alteraton. Juhasz and Hoffmann [8] showed that modfcaton of a knot of B-Splne curve of degree p generates a one parameter famly of curves. The famly has an envelop whch s also a B-Splne curve wth the same control polygon and degree p-. The theoretcal results have been appled n [8] to modfy the shape of a cubc B-Splne curve. The approach used determnes three consecutve knots by fttng a curve of a parabolc famly based on the ()
2 desred constrants. The procedure enables a local shape modfcaton but s, however, restrcted to cubc B-Splne curves only. Some other aspects of knot modfcaton have also been studed by Lyche and Morken [9], where the effect of knot varaton s examned from numercal pont of vew. The choce of knot value n curve approxmaton and nterpolaton has also been nvestgated n several papers, the recently publshed [0] and references theren. There are not many attempts n the area of knot alteraton to get the desred shape change. The man reason for ths s the non ntutve nature of curve change by knot alteraton. The problem arses because wth each dfferent placement of knots one can derve a new set of control ponts, whch can exactly get the same curve []. Ths problem s further compounded by the fact that the estmaton of knot value s a non lnear process. Czuczor et al. [2] and Mamc et al. [3] used optmzaton procedures to overcome the problem faced n knot vector alteraton. The use of optmzaton s computatonally expensve. Present work s an attempt to fnd the B-Splne curve wth desred change wthout any teraton nvolved. The most effectve shape control tool of B-Splne curves s control pont repostonng. A remarkable advantage of knot modfcaton over control pont repostonng s that the modfed curve always remans n the regon determned by the convex hull of the orgnal curve. Thus, the knot based method s preferred f one wants the curve n that regon or when fne tunng n the curve s requred [8]. Present work nvolves modfyng the shape of an exstng B-Splne curve wth the shape preservng constrant and less devaton from the orgnal curve. The approach uses both knot vector alteraton by ntroducng new knots usng knot nserton [4] and control pont ncluson. Unlke the approach of fttng a B-Splne curve to the gven data [5], ths method works at makng the curve change locally. The B-Splne curve fttng problem s to produce a B-Splne curve to approxmate a target curve wthn a pre-specfed tolerance. Ths fttng technque uses an energy functon and then mnmzes t to fnd the new poston of the control ponts. On the contrary, the present work modfes the curve locally, by splttng t nto parts and then acheves the desred shape change wthout any optmzaton nvolved. 2. PROBLEM DESCRIPTION The man am of the present work s to make a B-Splne curve C(u) pass through a prescrbed pont P (Fg..) whch les n a constraned regon R (descrbed later n ths secton). The other objectve of ths work s to preserve the curve shape and to have lmted devaton from the orgnal curve. The shape of the curve s assumed to be preserved f the modfed curve has the same number of feature ponts as the orgnal curve. Fg.. Problem defnton, orgnal curve and the modfed curve Every curve has certan features that defne the shape of that curve, namely, maxma and mnma of curvature and sudden changes n the curvatures. These ponts are defned n the present work as feature ponts F. To fnd these feature ponts, dscrete curvatures [6] at regular nterval on the curve are evaluated. These feature ponts are dentfed usng fne and rough checkng technque proposed by Lu et al. [6]. Feature ponts are ntrnsc to the curve and are used n secton 3 to fnd the ends of the splt segment. To have lmted devaton from the
3 orgnal curve the shape modfcaton s performed locally, only n the curve segment between the splt ends (secton 3). The proposed algorthm for constraned shape modfcaton works when pont P s present wthn a constraned regon R as shown n Fg.2(b). To modfy the curve, the essental step s to fnd the value of knot to be nserted n the exstng knot vector usng the concept of knot nserton and mappng knots on the control polylne as dscussed by Sederberg [4]. Fg.2(a).Fndng the knot value to be nserted, 2(b). Hashed regon R 2. Admssble regon R for pont P Let P,P +, P + 2 be three consecutve control ponts of a degree p B-Splne curve (Eqn. ().). Consder knots u u, u u U. Defne, + + p, + p+ ( u+ u ) + + ( u+ p u+ ) u + p u and + ( u u + p+ + p) + ( + p + ) u + p+ to be the ponts on the polygonal leg L+{P+,P} and L+2{P+2,P+}, as shown n Fg.2. Here V and V+ correspond to the mapped postons of knot u+ on L+ and u+p on L+2 respectvely. The regon R has three boundares, two formed by the control polylne and one by the parabola wth startng and endng ponts as V and V Algorthm for Constraned shape modfcaton The gven B-Splne curve s made to pass through a pont P R by nsertng a knot u n U, such that one of the newly formed control polylne {Qj-Qj} [4], passes through pont P (Fg.2(a).). Note that Qj- and Qj are the mapped postons of knot u on the polygonal legs L+ and L+2 respectvely. The steps nvolved n constraned shape modfcaton are: The value of knot u s found such that P α ( u) + ( α) ( u) where α [0,]. Usng knot nserton [4], new control ponts are found. Pont P s ncluded n the control pont set as a control pont of multplcty p-2. The use of knot nserton reduces the sze of the convex hull and brngs t nearer to the curve keepng the curve unchanged. The reducton n convex hull sze lmts the local devaton of the curve n a smaller regon (Fg..). A B-Splne curve s monotone f the control polygon s monotone and s convex f t s convex. The present algorthm fnds a control polygon by nsertng knot u, whch mantans the convexty. Next, ncluson of pont P as control pont does not change the convexty of newly formed control polygon, snce the polygon remans the same wth the reducton n convex hull sze. As there s no change n the convexty of the polygon, the shape of the modfed curve s preserved. Procedure of fndng new control ponts, a set of Qj such that P les on the polylne and ncludng P as a control pont of multplcty p-2 makes one the newly formed polylne tangent to the modfed curve at P. Ths produces a smooth curve. It can be seen n Fg.3(a) that polylne Q+Q+2 forms a tangent to the curve at P. There wll be a formaton of + u u + u + (2)
4 (a). Orgnal curve (), modfed curve usng knot nserton (2) (b) Formaton of Knk n curve (3) and wthout knot nserton (3). Fg. 3. Constraned shape modfcaton knk n the curve f the curve s modfed by drectly ncludng P as a control pont of multplcty p-2 wthout knot nserton, as shown for curve (3) n Fg.3.(b). 3. DETERMINATION OF SPLIT SEGMENT Modfcaton of the B-Splne curve affects the shape of the curve n p- convex hull [4]. To lmt the shape change to further smaller regon, the curve s splt nto atmost three segments dependng on the postons of pont P n space. The shape of the segment nearest to the pont P s changed. Feature ponts defned n secton 2 are used for the purpose of fndng the approprate postons of the splt ends. An ntrnsc local shape modfcaton method s developed usng these feature ponts. 3. Determnaton of Crtcal Feature ponts To determne the segment to be modfed, the shortest dstance of the pont P from the orgnal B-Splne curve s evaluated. Fg.4 shows a part of a B-Splne curve and pont P. The feature ponts F -3to F+2 are marked on the curve. Pont Q * denotes the pont on the curve nearest to pont P and let D be the dstance between them. Let d,+ denote the length of the curve between two consecutve feature ponts, F and F+. Ths length controls the placement of the feature ponts on the curve. It s clear that the curve wll have frequent changes n curvature f d,+ s small as compared to a large value of d,+. Consder that pont Q * les on the segment F F+, the length of segment F Q * and Q * F+ are denoted as l and l+ respectvely. Fg.4. Feature ponts on the curve
5 5 Let d m mn( l, l+ ) and l < l+ I m + otherwse (3) Thus denotes the feature pont nearest to pont P. In order to preserve the shape of the curve, t s mportant F to preserve the features n the neghborhood of the desred pont P. defned as crtcal features n ths work. Thus s one of the crtcal features. There could be a need to nclude more features as crtcal features to provde a F smooth transton of the curve at the ends of the splt segment. It can be observed n curve () of Fg.5 that ncluson of only one feature as crtcal feature may lead to an abrupt change n curve shape at splt ends. Curve (2) also shown n the same fgure, wth three crtcal feature ponts, shows a smooth transton of the modfed curve to the other segments at the splt ends. In order to determne the other crtcal features, feature ponts present n the neghborhood of P are dentfed usng a threshold dstance parameter ã() defned as 3 ( d ) ~ 2, + d, + a( ) (4) max( d,, d, + ) 2 + mn( d,, d, + ) Ths length parameter relates the relatve dstance between the neghborng features. To estmate the upper bound of ã(), consder d,+>d-,, 3 3 ( d ) ( ) ( ) ~ 2, + d, + d 2, + d, + d 2, + d, + ~ a( ) a( ) < ( d, +, ), greater than 3 greater than 2 d. d d, Based on the length parameter and the dstances d-, and d,+ there can be two cases: If d,+- d-, <ã() d,+ d-,, ths s defned as Case A Else f d,+- d-, ã() one of the two lengths, d,+ or d-, s small as compared to other, ths s defned as Case B For d,+d-, d,+- d-, 0 and ã() d-,, ths ndcates Case A. On the other hand f d,+>>d-, d,+- d, 3 d-, d,+. In Eqn.(4) usng lm 0, ã() s obtaned as d, and snce d,+>>d-,, the set of values of d, + 2 d-, and d,+ belong to Case B. Two examples consdered valdate the use of the above stated condtons. It can be observed from Fg.4 that lengths d-2,- and d-, belong to case A whle d-, and d,+ belong to case B. It can also be seen that d,+ and d+,+2 belong to case A (here the two dstances are almost equal n sze but large as compared to any of the dstances d-2,- or d-,). Thus case A can be further dvded nto two sub cases; case A wth almost equal but large lengths (d,+ and d+,+2) and case A2 wth almost equal but small lengths (d-2,- and d-,). In order to dentfy the neghborng crtcal feature ponts, three consecutve feature ponts and F FI m F + are consdered and the case to whch they belong s determned. The procedure carred out based on the case s explaned next. Case A: In ths case snce the lengths between the feature ponts s large, only F s consdered as the crtcal feature pont. Other feature pont may or may not get ncluded n the splt segment dependng on the mnmum dstance of pont P from the curve. If the dstance D s large there s a possblty that the algorthm mght nclude more feature ponts whle computng the splt length to avod sudden change n the curve. In fndng the splt ends, the splttng s performed at some dstance away from the extreme crtcal features. To make sure that the features at the ends are also preserved, t s mportant to fnd ths dstance. Ths dstance s dentfed by a length parameter defned as d d (5) I, + m, +
6 Fg.5. Need to fnd Crtcal Feature ponts Case B: In ths case one of the lengths and s small. Wthout loss of generalty t can be assumed that d I d, < m, + drecton of the smaller feature length, ths drecton ( F F d I m, I m d I m, I m +. Other crtcal feature ponts for ths case are dentfed by searchng for the features n the d I m, I m (Fg.6.). Through ths, all the features wth small dstance d -, n ) are ncluded as crtcal features. The ncluson termnates whenever a large dstance s encountered. The last feature ncluded s denoted as F end. Fg.6. Fndng Crtcal Feature Ponts n Case B Fg.7. Fndng Crtcal Feature Ponts n Case A2 Algorthm. Let J and Case(J)case for dj-,j and, + d I m I m 2. f {Case(J)B} FJ s ncluded as a crtcal feature pont JJ- Case(J)case for dj-,j and, + d I m I m 3. go to step 2 4. f the condton s no more satsfed IendJ, Fend s the last feature ncluded. 5. Termnate For ths case s defned as
7 7 mn(( d I, I d I, I ), d I, I + ) (6) end end m m m m Case A2: In ths case snce both the dstances are small, the search s extended n both the drectons untl a large length s encountered (Fg.7.). Algorthm (Frst the features before are dentfed) F. Let J- and Case(J)case for dj-,j and d I m, I m 2. f {Case(J)A} FJ s ncluded as a crtcal feature pont JJ- Case(J)case for dj-,j and d I m, I m 3. go to step 2 4. f the condton s no more satsfed, IendLJ, F L s the last feature encountered n the left drecton. 5. go to step 6 (Next the features after are dentfed) F 6. Let J+ and Case(J)case for dj-,j and d I m, m + 7. f {Case(J)A} FJ s ncluded as a crtcal feature pont JJ+ Case(J)case for dj,j+ and, + d I m I m 8. go to step 7 9. f the condton s no more satsfed, IendRJ, F R s the last feature encountered n the rght drecton. 0. Termnate For ths case s defned as d I, I d I, I + d I, I d endl endl m m m m IendR, I I + endr endl IendR The dentfcaton of the crtcal feature ponts gves a rough estmate of the splt length. The curve s splt a small dstance (determned by ) away from the extreme feature ponts ncluded as the crtcal feature. Defne ~, x where x (>2) s a factor that mnmzes the value of splt length. The optmal value of the splt length s evaluated such that both the objectves of lmted devaton and shape preserval are addressed. The shape of the curve s preserved by fndng the crtcal feature ponts that would be affected by the shape change. Lmted devaton s addressed by mnmzng the value of ~. If ~ >dm (Eqn.3.), the maxmum value of x s obtaned as max( x) dm where as f ~ max( d I, I, d ) m m, + d m t s obtaned as max(x) 2 +. mn( d, d, d ),, + m (7) Fg.8. Determnaton of Splt Segment
8 8 3.2 Determnaton of Splt Ends The splttng of the curve s carred out at some dstance from the extreme crtcal feature ponts, evaluated at dl and dr from the left and the rght extreme crtcal features (F L,F R ) respectvely (Fg. 8.). The procedure for obtanng the values of dl and dr s presented below. 2 Defne 2 D D +, DLlength(F L,Q * ) and DRlength(F R,Q * ). m d m Algorthm For left (L) or rght (R) f D< ~ then d( ~ +dm)/2 else d( ~ +Dm)/2 Determnaton of dr and dl completes the splt end dentfcaton. Fg.9. shows the splt ends for dfferent postons of P. Fg.9(a) to (c) ndcates dfferent cases based on the placement of P and the determned splt ends. In Fg.9(d) the curve s splt n only two segments. Ths s observed because one of the splt ends concdes wth the curve end. It s thus ndcatve that placement of pont P s an mportant parameter to decde the curve segment to be modfed. To splt the curve, the parametrc value of the pont at whch the curve has to be splt s evaluated as u *. The parameters correspondng to splt ends are ul * and ur * respectvely. Splt segment s obtaned when the above evaluated parameters (ul *,ur * ) are nserted as knots of multplcty p each n the knot vector U defned n Eqn.(). [4]. 4. RESULTS AND DISCUSSION To llustrate the curve modfcaton strategy nto practce, MATLAB TM s employed to develop the prototype system. The prototype system was developed usng personal computer wth 52 MB RAM. Fg.9. Splt Segment
9 The orgnal curve s splt at the splt ends, evaluated n secton 3.2. Algorthm for constraned shape modfcaton (secton 2.2) s appled to the segment between the splt ends. The splttng procedure explaned n secton 3, decdes the number of segments after splttng. In any gven curve and a gven pont P there could be atmost three segments. The segments n between the splt ends determned s modfed to acheve the desred objectve. Applcaton of constraned shape modfcaton algorthm makes the curve n the splt segment pass through the desred pont. After the shape of the curve segment s modfed, all the segments are combned to obtan the modfed curve. Ths combnng procedure nvolves removal of the knots nserted for splttng the curve (ul *,ur * ) wthout changng the shape of any of the segments [4]. The use of splttng methodology explaned restrcts the devaton of the curve n a smaller regon compared to the devaton whch occurs wthout splttng. Ths s demonstrated n Fg.0. The curve n Fg.0(a) s obtaned after splttng algorthm s appled wth constraned shape modfcaton where as n Fg.0(b) the curve s not splt. Fg.0(c) Fg.0. Intrnsc Local Shape modfcaton and Fg.0(d) show an enlarged vew of the curves. It can be clearly seen from Fg.0(b) and Fg.0(d) that there s an extra devaton n the curve whch s not observed when the curve s frst splt before shape modfcaton (Fg.0(a),(c)). Thus splttng of the curve ads n, shape preservaton and havng lmted devaton from the orgnal curve wthout applyng any optmzaton methods.
10 0 5. CONCLUSION The present work ads n modfyng the shape of the curve by makng t pass through the desred pont wth the objectves of lmted devaton and preservng ts shape. Note that the shape modfcaton algorthm dscussed n secton 2.2 s constraned for P R, whereas the concept of splttng the curve and then modfyng the splt segment s applcable for any pont P. Though the constraned shape algorthm works for a restrcted regon R, t s a sngle step non teratve scheme to make the curve pass through the desred pont. 6. REFERENCES [] G. Farn. Curves and Surfaces for Computer Aded Geometrc Desgn. San Dego: Academc Press, 997. [2] W. Boehm. Insertng new knots n b splne curves. Computer Aded Desgn, 2:99, 980. [3] L. Pegl. Modfyng the shape of ratonal b splnes. part : Curves. Computer Aded Desgn, 2(8):509 58, 989. [4] L. Pegl and W. Tller. The NURBS Book. Sprnger, Berln, Germany, 997. [5] C.K. Au and M.M.F. Yuen. Unfed approach to nurbs curve shape modfcaton. Computer Aded Desgn, 27(2):85 93, 995. [6] B. Fowler and R. Bartels. Constraned based curve manpulaton. IEEE Computer Graphcs Applcaton, 3:43 49, 993. [7] K.W. Chan J.M. Zheng and I. Gbson. A new approach for drect manpulaton of free form curve. Computer Graphcs forum, 7: , 998. [8] I. Juhasz and M. Hoffmann. Constraned shape modfcaton of cubc b splne curves by mean of knots. Computer Aded Desgn, 36: , [9] T. Lyche and K. Morken. The senstvty of splne functon to perturbaton of the knots. BIT, 39: , 999. [0] L. Pegl and W. Tller. Surface approxmaton to scanned data. Vsual Computaton, 6: , [] F. Cohen and J. Wang. Modelng mage curves usng nvarant 3-d object curve models- a path to 3-d recognton and shape estmaton for mage contours. IEEE Transactons on Pattern Analyss and Machne Intellgence, 6(): 2, 995. [2] S. Czuczor B. Aszod and L.S. Kalos. Nurbs farng by knot vector optmzaton. Journal of WSCG, 2(). [3] G. Mamc and M. Bennamoun. Automatc bayesan knot placement for splne fttng. IEEE, ():69 72, 200. [4] J. Zheng Thomas W. Sederberg and X. Song. Knot ntervals and mult degree splnes. Computer Aded Geometrc Desgn, 20: , [5] W. Wang H. Yang and J. Sun. Control pont adjustment for b-splne curve approxmaton. Computer Aded Geometrc Desgn, 36: , [6] Lu GH, Wong YS, Zhang YF, Loh HT. Adaptve farng of dgtzed data ponts wth dscrete curvature. Computer Aded Des 2002, 34:
A 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 informationVectorization 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 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 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 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 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 informationInterpolation of the Irregular Curve Network of Ship Hull Form Using Subdivision Surfaces
7 Interpolaton of the Irregular Curve Network of Shp Hull Form Usng Subdvson Surfaces Kyu-Yeul Lee, Doo-Yeoun Cho and Tae-Wan Km Seoul Natonal Unversty, kylee@snu.ac.kr,whendus@snu.ac.kr,taewan}@snu.ac.kr
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 informationA Newton-Type Method for Constrained Least-Squares Data-Fitting with Easy-to-Control Rational Curves
A Newton-Type Method for Constraned Least-Squares Data-Fttng wth Easy-to-Control Ratonal Curves G. Cascola a, L. Roman b, a Department of Mathematcs, Unversty of Bologna, P.zza d Porta San Donato 5, 4017
More informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More 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 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 informationComputer 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 informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More 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 informationCurve Representation for Outlines of Planar Images using Multilevel Coordinate Search
Curve Representaton for Outlnes of Planar Images usng Multlevel Coordnate Search MHAMMAD SARFRAZ and NAELAH AL-DABBOUS Department of Informaton Scence Kuwat Unversty Adalya Campus, P.O. Box 5969, Safat
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More 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 informationReading. 14. Subdivision curves. Recommended:
eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.-6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton
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 informationNURBS Curve Shape Modification and Fairness Evaluation
NURBS Curve Shape Modfcaton and Farness Evaluaton TETSUZO KURAGANO AND AKIRA YAMAGUCHI Graduate School of Informaton Scence, Mese Unverst 2-590 Nagabuch, Ome-Ct, Toko, 98-8655, JAPAN kuragano@e.mese-u.ac.jp
More informationIntra-Parametric Analysis of a Fuzzy MOLP
Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral
More informationTwo Approaches for Vectorizing Image Outlines
Internatonal Journal of Machne Learnng and Computng, Vol., No. 3, June 0 Two Approaches for Vectorzng Image Outlnes Muhammad Sarfraz, Member, IACSIT Abstract Two approaches, based on lnear and conc splnes,
More informationGSLM 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 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 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 informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More 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 informationReview of approximation techniques
CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated
More informationCS 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 informationTPL-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 informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationFuzzy Filtering Algorithms for Image Processing: Performance Evaluation of Various Approaches
Proceedngs of the Internatonal Conference on Cognton and Recognton Fuzzy Flterng Algorthms for Image Processng: Performance Evaluaton of Varous Approaches Rajoo Pandey and Umesh Ghanekar Department of
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationOutline. Type of Machine Learning. Examples of Application. Unsupervised Learning
Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton
More informationSome Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.
Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,
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 informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationVisual Curvature. 1. Introduction. y C. IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), June 2007
IEEE onf. on omputer Vson and Pattern Recognton (VPR June 7 Vsual urvature HaRong Lu, Longn Jan Lateck, WenYu Lu, Xang Ba HuaZhong Unversty of Scence and Technology, P.R. hna Temple Unversty, US lhrbss@gmal.com,
More informationLS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract
12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,
More informationModelling of curves and surfaces in polar. and Cartesian coordinates. G.Casciola and S.Morigi. Department of Mathematics, University of Bologna, Italy
Modellng of curves and surfaces n polar and Cartesan coordnates G.Cascola and S.Morg Department of Mathematcs, Unversty of Bologna, Italy Abstract A new class of splne curves n polar coordnates has been
More informationTopology Design using LS-TaSC Version 2 and LS-DYNA
Topology Desgn usng LS-TaSC Verson 2 and LS-DYNA Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2, a topology optmzaton tool
More informationSolving Route Planning Using Euler Path Transform
Solvng Route Plannng Usng Euler Path ransform Y-Chong Zeng Insttute of Informaton Scence Academa Snca awan ychongzeng@s.snca.edu.tw Abstract hs paper presents a method to solve route plannng problem n
More informationVectorizing Image Outlines using Spline Computing Approaches with Simulated Annealing
Vectorzng Image Outlnes usng Splne Computng Approaches wth Smulated Annealng MUHAMMAD SARFRAZ Department of Informaton Scence Kuwat Unversty Adalya Campus, P.O. Box 5969, Safat 1060 KUWAIT prof.m.sarfraz@gmal.com
More informationParameterization of Quadrilateral Meshes
Parameterzaton of Quadrlateral Meshes L Lu 1, CaMng Zhang 1,, and Frank Cheng 3 1 School of Computer Scence and Technology, Shandong Unversty, Jnan, Chna Department of Computer Scence and Technology, Shandong
More informationy 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 informationDynamic Voltage Scaling of Supply and Body Bias Exploiting Software Runtime Distribution
Dynamc Voltage Scalng of Supply and Body Bas Explotng Software Runtme Dstrbuton Sungpack Hong EE Department Stanford Unversty Sungjoo Yoo, Byeong Bn, Kyu-Myung Cho, Soo-Kwan Eo Samsung Electroncs Taehwan
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 informationActive Contour Models
Actve Contour Models By Taen Lee A PROJECT submtted to Oregon State Unversty n partal fulfllment of The requrements for the Degree of Master of Scence n Computer Scence Presented September 9 005 Commencement
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
More informationLocal and Global Accessibility Evaluation with Tool Geometry
19 Local and Global Accessblty Evaluaton wth Tool Geometry Jnnan Wang 1, Chell A. Roberts 2 and Scott Danelson 3 1 Arzona State Unversty, wangn@asu.edu 2 Arzona State Unversty, chell.roberts@asu.edu 2
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 informationLECTURE : MANIFOLD LEARNING
LECTURE : MANIFOLD LEARNING Rta Osadchy Some sldes are due to L.Saul, V. C. Raykar, N. Verma Topcs PCA MDS IsoMap LLE EgenMaps Done! Dmensonalty Reducton Data representaton Inputs are real-valued vectors
More 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 informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationRepeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits
Repeater Inserton for Two-Termnal Nets n Three-Dmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI - EPFL, CH-5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract.
More informationSum 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 informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationCubic Spline Interpolation for. Petroleum Engineering Data
Appled Mathematcal Scences, Vol. 8, 014, no. 10, 5083-5098 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.1988/ams.014.4484 Cubc Splne Interpolaton for Petroleum Engneerng Data * Samsul Arffn Abdul Karm
More 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 informationSmoothing Spline ANOVA for variable screening
Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationArray transposition in CUDA shared memory
Array transposton n CUDA shared memory Mke Gles February 19, 2014 Abstract Ths short note s nspred by some code wrtten by Jeremy Appleyard for the transposton of data through shared memory. I had some
More informationWe Two Seismic Interference Attenuation Methods Based on Automatic Detection of Seismic Interference Moveout
We 14 15 Two Sesmc Interference Attenuaton Methods Based on Automatc Detecton of Sesmc Interference Moveout S. Jansen* (Unversty of Oslo), T. Elboth (CGG) & C. Sanchs (CGG) SUMMARY The need for effcent
More informationNon-Split Restrained Dominating Set of an Interval Graph Using an Algorithm
Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,
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 informationAnalysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress
Analyss of 3D Cracks n an Arbtrary Geometry wth Weld Resdual Stress Greg Thorwald, Ph.D. Ted L. Anderson, Ph.D. Structural Relablty Technology, Boulder, CO Abstract Materals contanng flaws lke nclusons
More informationCorner-Based Image Alignment using Pyramid Structure with Gradient Vector Similarity
Journal of Sgnal and Informaton Processng, 013, 4, 114-119 do:10.436/jsp.013.43b00 Publshed Onlne August 013 (http://www.scrp.org/journal/jsp) Corner-Based Image Algnment usng Pyramd Structure wth Gradent
More informationSteps 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 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 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 informationDesign 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 informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationA B-Snake Model Using Statistical and Geometric Information - Applications to Medical Images
A B-Snake Model Usng Statstcal and Geometrc Informaton - Applcatons to Medcal Images Yue Wang, Eam Khwang Teoh and Dnggang Shen 2 School of Electrcal and Electronc Engneerng, Nanyang Technologcal Unversty
More informationInverse Kinematics (part 2) CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Spring 2016
Inverse Knematcs (part 2) CSE169: Computer Anmaton Instructor: Steve Rotenberg UCSD, Sprng 2016 Forward Knematcs We wll use the vector: Φ... 1 2 M to represent the array of M jont DOF values We wll also
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More informationAutomatic selection of reference velocities for recursive depth migration
Automatc selecton of mgraton veloctes Automatc selecton of reference veloctes for recursve depth mgraton Hugh D. Geger and Gary F. Margrave ABSTRACT Wave equaton depth mgraton methods such as phase-shft
More information5 The Primal-Dual Method
5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton
More informationAn Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method
Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and
More informationSimplification 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 informationSummarizing Data using Bottom-k Sketches
Summarzng Data usng Bottom-k Sketches Edth Cohen AT&T Labs Research 8 Park Avenue Florham Park, NJ 7932, USA edth@research.att.com Ham Kaplan School of Computer Scence Tel Avv Unversty Tel Avv, Israel
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 informationComputer Graphics. - Spline and Subdivision Surfaces - Hendrik Lensch. Computer Graphics WS07/08 Spline & Subdivision Surfaces
Computer Graphcs - Splne and Subdvson Surfaces - Hendrk Lensch Overvew Last Tme Image-Based Renderng Today Parametrc Curves Lagrange Interpolaton Hermte Splnes Bezer Splnes DeCasteljau Algorthm Parameterzaton
More informationExplicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements
Explct Formulas and Effcent Algorthm for Moment Computaton of Coupled RC Trees wth Lumped and Dstrbuted Elements Qngan Yu and Ernest S.Kuh Electroncs Research Lab. Unv. of Calforna at Berkeley Berkeley
More informationMotion History Volume for Spatiotemporal Editing of 3D Video in Multi-party Interaction Scenes
IPSJ SIG Techncal Report Moton Hstory Volume for Spatotemporal Edtng of 3D Vdeo n Mult-party Interacton Scenes Qun Sh,a) Shohe Nobuhara,b) Takash Matsuyama,c) Abstract: In ths paper we present a novel
More informationConstructing Minimum Connected Dominating Set: Algorithmic approach
Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected
More 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 informationBackpropagation: In Search of Performance Parameters
Bacpropagaton: In Search of Performance Parameters ANIL KUMAR ENUMULAPALLY, LINGGUO BU, and KHOSROW KAIKHAH, Ph.D. Computer Scence Department Texas State Unversty-San Marcos San Marcos, TX-78666 USA ae049@txstate.edu,
More informationShape Control of the Cubic Trigonometric B-Spline Polynomial Curve with A Shape Parameter
Internatonal Journal of Scences & Appled esearch www.jsar.n Shape Control of the Cubc Trgonometrc B-Splne Polynomal Curve wth A Shape Parameter Urvash Mshra* Department of Mathematcs, Mata Gujr Mahla Mahavdyalaya,
More informationShape Preserving Positive and Convex Data Visualization using Rational Bi-cubic Functions
Shape Preservng Postve and Conve Data Vsualzaton usng Ratonal B-cubc unctons Muhammad Sarfraz Malk Zawwar Hussan 3 Tahra Sumbal Shakh Department of Informaton Scence Adala Campus Kuwat Unverst Kuwat E-mal:
More informationInterpolatory Subdivision Curves with Local Shape Control
Interpolatory Subdvson Curves wth Local Shape Control Carolna Beccar Dept. of Mathematcs Unversty of Padova va G.Belzon 7, 35131 Padova, Italy beccar@math.unpd.t Gulo Cascola Dept. of Mathematcs Unversty
More informationIMAGE FUSION TECHNIQUES
Int. J. Chem. Sc.: 14(S3), 2016, 812-816 ISSN 0972-768X www.sadgurupublcatons.com IMAGE FUSION TECHNIQUES A Short Note P. SUBRAMANIAN *, M. SOWNDARIYA, S. SWATHI and SAINTA MONICA ECE Department, Aarupada
More informationELEC 377 Operating Systems. Week 6 Class 3
ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems
More informationA 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 informationReverse Engineering of the Digital Curve Outlines using Genetic Algorithm
Issue, Volume 7, 03 Reverse Engneerng of the Dgtal Curve Outlnes usng Genetc Algorthm Muhammad Sarfraz, Malk Zawwar Hussan, Msbah Irshad Abstract A scheme, whch conssts of an teratve approach for the recovery
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 information