Reverse Engineering of the Digital Curve Outlines using Genetic Algorithm
|
|
- Georgiana Cunningham
- 6 years ago
- Views:
Transcription
1 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 of dgtzed, h prnted electronc planar obects, s proposed. It vectorzes the generc shapes by recoverng ther outlnes. The ratonal quadratc functons are used for curve fttng a heurstc technque of genetc algorthm s appled to fnd optmal values of shape parameters n the descrpton of ratonal functons. The proposed scheme s fully automated vectorzes the outlnes of planar mages n a reverse engneerng way. Keywords Ratonal functon, reverse engneerng, genetc algorthm, mages. I I. INTRODUCTION N the last two decades reorentaton of tradtonal artfcal ntellgence methods has been notced toward the soft computng technques. Ths development allows us to solve dffcult problems related to robotcs, computer vson, speech recognton machne translaton. Accordng to Zadeh [3], soft computng technques are characterzed by tolerance of mprecson, uncertanty parallel truth to acheve tractablty, robustness low soluton cost. Soft computng technques such as fuzzy logc (FL), neural networks (NN), genetc algorthm (GA), smulated annealng (SA), ant colony optmzaton (ACO), partcle swarm optmzaton (PSO) have receved a lot of attenton of researchers due to ther potentals to deal wth hghly nonlnear, multdmensonal, ll-behaved complex engneerng problems [4]. Genetc Algorthm (GA) [8], an evolutonary technque, gves us a method to perform romzed global search n a soluton space. In ths space, a populaton of cdate solutons, called chromosomes, s evaluated by a ftness functon n terms of ts performance. The best cdates evolve pass some of ther genetc characterstcs to ther offsprngs, who form the next generaton of potental solutons. The process of reverse engneerng of planar obects comprses of the steps lke: extractng data from boundary of the shapes, fndng the corner ponts usng some technque fnally fttng curve to these corner ponts usng ratonal quadratc functons GA. Ths paper utlzes genetc algorthm M. Sarfraz s wth the Department of Informaton Scence, Kuwat Unversty, Adalya Campus, P.O. Box 5969, Safat 3060, KUWAIT (phone: , e-mal:prof.m.sarfraz@gmal.com). M. Z. Hussan s wth the Department of Mathematcs, Unversty of the Punab, Lahore, Pakstan (e-mal: M. Irshad s wth the Department of Mathematcs, Unversty of the Punab, Lahore, Pakstan (e-mal: msbah09@gmal.com). technque for recoverng the outlnes of planar mages n a reverse engneerng way. Reverse engneerng s qute a modern research feld whch deals wth dverse actvtes. Its scentfc perspectve s generally related to computer scence heren to computer aded geometrc desgn (CAGD). Reverse engneerng of shapes s the process of representng an exstng obect geometrcally n form of computer aded desgn (CAD) model. A good reverse engneerng system not only creates a CAD model of the obect, but t also helps explorng understatng the structure of the obect. Generatng computer aded desgn (CAD) model from scanned dgtal data s used n contour stylng whch needs to adopt some curve or surface approxmaton scheme. Reverse engneerng of planar obects s referred to the process of fttng an optmal curve to the data extracted from the boundary of the btmap mage [0,, 4, 5, 6]. Curve fttng s frequently used n reverse engneerng to reproduce curves from measured ponts. It s always essental to provde new curve-fttng algorthms to acqure curves that satsfy dfferent condtons. Fttng curves to the data extracted by generc planar shapes s the problem whch s greatly worked on durng last two decades. Stll there s a room for researchers n ths feld due to ts applcatons n dverse felds ts dem n the ndustry. There are several advantages of curved representaton of planar obects. For example, transformatons lke scalng, shearng, translaton, rotaton clppng can be appled on the obects very easly. Varous outlne approxmaton technques can be found n the lterature n whch dfferent splne models have been used by the researchers lke Be zer splnes [6], B-splnes [9], Hermte nterpolaton [8] ratonal cubc nterpolaton [9]. There are several other outlne capturng technques [3,, 3, 0-3, 9, 6, 4, 5, 7, 8] avalable n the current lterature most of them are based on least-squares ft [, 3, 0] error mnmzaton [3, 9, ]. Sarfraz et al. [] n ther outlne capturng scheme, calculated the rato between two ntermedate control ponts used ths to estmate ther poston. Ths caused reducton of computaton n subsequent phases of approxmaton. Few other technques nclude use of control parameters [8], genetc algorthms [3], wavelets [9]. In ths work ratonal quadratc functons (concs) are used for curve fttng usng genetc algorthm. The paper s organzed n a way that the frst second step of the proposed scheme, outlne estmaton corner
2 Issue, Volume 7, 03 detecton method, are descrbed n Secton. Revew of ratonal cubc ratonal quadratc functons s gven n Secton 3. Secton 4 explans the proposed scheme whch s demonstrated wth examples n Secton 5. The paper s concluded n Secton 6. II. CONTOUR EXTRACTION AND SEGMENTATION Frst step n reverse engneerng of planar obects s to extract data from the boundary of the btmap mage or a generc shape, shown n Fg. (a). Capturng boundary or outlne representaton of an obect s a way to preserve the complete shape of an obect. The obects n an mage can also be represented by the nteror of shape. Chan codng for boundary approxmaton encodng was ntally proposed by Freeman [7], whch has drawn sgnfcant attenton over last three decades. Chan codes represent the drecton of the mage help to attan the geometrc data from outlne of the mage. Extracted boundary of the btmap mage gven n Fg. (a) s gven n Fg. (b). (a) (b) (c) Fg. (a) btmap mage of a plane, (b) detected boundary of the mage (c) detected corner ponts from the boundary detected boundary ponts for dfferent mages s gven n Table. Detected corners of the boundary shown n Fg. (b), can be seen n Fg. (c). III. RATIONAL QUADRATIC FUNCTIONS In ths secton pecewse ratonal quadratc functons are presented used for curve fttng whch s an alternate of the ratonal cubc presented n Secton 3.. The ratonal quadratc possesses C contnuty A. C Ratonal cubc functon A pecewse ratonal cubc parametrc functon P C [ t, t + ], wth shape parameters v 0, =,..., n, s used for curve fttng to the corner ponts detected from the boundary of the btmap mage, the ratonal cubc functon s defned for t [ t, t + ], =,..., n, as follows 3 3 F ( θ) + vv ( θ) θ + vw ( θ) θ + F + θ P( t) = P ( t) = 3 3 ( θ ) + v ( θ ) θ + v ( θ ) θ + θ () where F F + are two corner ponts (gven control ponts) of the th segment of the boundary wth h = t t,. V h D = F v v + h D W = F () where D, =,..., n + are the frst dervatve values at the knots t, =,..., n +. Table. Detals of Dgtal Contours Corner ponts. Image Name # of contours # of contour ponts # of ntal corner ponts Fork Plane Fsh Segmentaton of obect boundary before curve fttng s very mportant for two reasons. Frstly, t reduces boundary s complexty smplfes the fttng process. Secondly, each shape conssts of natural break ponts (lke four corners of a rectangle) qualty of approxmaton can be mproved f boundary s subdvded nto smaller peces at these ponts. These are normally the dscontnuous ponts to whch we do not want to apply any smoothng lke to capture them as such. These ponts can be determned by a sutable corner detector. Researchers have used varous corner detecton algorthms for outlne capturng [,, 5, 7, 30]. The method proposed n [5] s used n ths paper. Number of contour ponts Fg. Demonstraton of ratonal cubc functon () It s to be noted that v, =,..., n, are used to control the shape of the curve. Effect of these shape parameters on the curve s shown n Fg. Fg.. Moreover, for v = 3, =,..., n, () represents cubc Hermte nterpolaton t can be consdered as default case of ratonal cubc (). If
3 Issue, Volume 7, 03 v, then the ratonal cubc functon () converges to lnear nterpolant gven by L ( t) = ( ) F + F (3) θ θ + whch means that the ncrease n v pulls the curve towards F F + n the nterval [ t, t + ] the nterpolant s lnear as shown n Fg.. For v 0 Equaton () can be wrtten n the form P ( t; v ) = R ( θ; v ) F + R ( θ; v ) V + R ( θ; v ) W + R ( θ ; v ) F + (4) where V W are gven n Equaton () R ( θ ; v ), = 0,,,3 are ratonal Bernsten-Bezer weght functons such that C = 0 R ( θ; v ) = B. Ratonal quadratc functon Consder the general ratonal quadratc, gven as Fg. 3. V ˆ ˆ ˆ ˆ ( θ) + rz ( θ ) θ + W θ P( t) = P ( t) = ˆ ˆ ˆ ˆ ( θ) + r ( θ ) θ + θ where V, Z such that conc passes through (5) W are the control ponts for th segment V Z affects the shape of the conc. for th segment. W the pont r s the shape parameter F ( θ ) + rv ( θ) θ + Z θ P( t) = P ( t) = ( θ ) + ( θ ) θ + θ The other conc whch passes through les n the convex hull of F +, W r Z Z s gven by Z ( θ ) + rw ( θ ) θ + F θ (6) F + t + ( ) = P ( t) = ( θ ) + r ( θ ) θ + θ P t (7) (a) (b) (c) Fg. 3 Demonstraton of ratonal quadratc functon In order to have an alternate quadratc representaton for cubc defned n Secton 3., each segment of pecewse ratonal cubc curve should be dealt ndvdually so that t could be represented by two segments of ratonal quadratc. Ths process wll be done n a way that one conc passes through F Z. Smlarly, the other conc nterpolates Z F +. Consder the frst conc whch passes through t les n the convex hull of F, V Z. F Z Fg. 4 (a) demonstraton of conc (6), (b) demonstraton of conc (7), (c) combned vew of both the concs (6) (7). Followng propertes should be satsfed by concs (6) (7) to be C. h D V = F + r h D + W = F + r V + W F + F h Z D D + = = + + 4r ( ) 3
4 Issue, Volume 7, 03 It s to be noted that, for r =, =,..., n, denomnators for ratonal quadratc (6) (7) become () ratonal quadratc can be wrtten as: P( t) = P ( t) = F ( θ ) + V ( θ ) θ + Z θ (8) P ( t) = P ( t) = Z ( θ ) + W ( θ ) θ + F θ (9) + Ths s the default case of ratonal quadratc. Both the concs (6) (7) are demonstrated n Fg. 4(a) Fg. 4(b) respectvely whereas Fg. 4(c) depcts combne vew of both the concs (6) (7). Fg. 5 represents combned vew of ratonal cubc () the concs (6), (7) for dfferent values of r v, t can be noted that the ratonal 3r cubc () concdes wth concs (6) (7) f v =. Fgs. 5(a) 5(b) show default vew of ratonal quadratc ratonal cubc respectvely. Fg. 5(c) gves the combne vew of both the default ratonal functons. Fg. 5(d), (e) (f) represent combned vew of concs for r = 4 ratonal cubc for v = 6, combned vew of concs for r = 6 ratonal cubc for v = 9 combned vew of concs for r = 8 ratonal cubc for v = respectvely. (a) (b) (c) (d) (e) (f) Fg. 5 (a) default vew of cons, (b) default vew of ratonal cubc, (c) combned vew of concs ratonal cubc for default cases, (d) combned vew of concs for r = 4 ratonal cubc for v = 6, (e) combned vew of concs for r = 6 ratonal cubc for v = 9, (f) combned vew of concs for r = 8 ratonal cubc for v = A. Parameterzaton Number of parameterzaton technques can be found n lterature for nstance unform parameterzaton, lnear or chord length parameterzaton, parabolc parameterzaton cubc parameterzaton. In ths paper, chord length parameterzaton s used to estmate the parametrc value t assocated wth each pont. It can be observed that θ s n normalzed form vares from 0 to. Consequently, n our case, h s always equal to. B. Estmaton of Tangent Vectors A dstance based choce of tangent vectors s defned as: For open curves: D ' s at F ' s 4
5 Issue, Volume 7, 03 ( ) ( ) ( ) ( ) ( ) ( )( ) D0 = F F0 F F0 Dn = Fn Fn Fn Fn D = a F F a F + F, =,,..., n For close curves: F = Fn, Fn + = F D = a ( F F ) ( a )( F + F ), = 0,,..., n where F + F a =, = 0,,..., n. F F + F F + (a) (b) (c) (d) (e) (f) (g) (h) () Fg. 6 Demonstraton of proposed scheme (a) btmap mage of plane, (b) detected boundary of the mage n (a), (c) corners detected from the boundary, (d) default concs ftted to the corners along wth boundary, (e) st teraton of concs ftted through GA, (f) nd teraton of concs ftted through GA, (g) 3 rd teraton of concs ftted through GA, (h) 4 th teraton of concs ftted through GA, () 5 th teraton of concs ftted through GA. IV. OPTIMAL RATIONAL QUADRATIC FUNCTIONS Ths Secton descrbes the process of evaluatng optmal quadratc functons usng GA [8]. Genetc Algorthm formulaton of the curve fttng problem dscussed n ths paper s also elaborated here. Suppose, for =,..., n, the data segments (, ) P = x y, =,,..., m be the gven data segments.,,, Then the squared sums S ' s of dstance between P, ' s ther correspondng parametrc ponts P( t )' s on the curve are m determned as S = P ( u, ) P,, =,..., n where u s = are parameterzed n reference to chord length parameterzaton. Conc : When conc represented by the ratonal quadratc (6) s consdered, the squared sum S would be defned as m S = P( u ) P, =,..., n,, = 5
6 Issue, Volume 7, 03 where P( u, ) s defned as n (6). Conc : Smlarly for conc represented by the ratonal quadratc (7), the squared sum S would be defned as: where m =,, = S P ( u ) P, =,..., n P ( u ) s defned as n (7)., (a) (b) (c) (d) (e) (f) (g) (h) () Fg. 7 Demonstraton of proposed scheme (a) btmap mage of fork, (b) detected boundary of the mage n (a), (c) corners detected from the boundary, (d) default concs ftted to the corners along wth boundary, (e) st teraton of concs ftted through GA, (f) nd teraton of concs ftted through GA, (g) 3 rd teraton of concs ftted through GA, (h) 4 th teraton of concs ftted through GA, () 6 th teraton of concs ftted through GA. Table. Number of corner ponts together wth number of ntermedate ponts for teratons, 3 of GA. Image Name # of ntal corner ponts # of ntermedate ponts n cubc nterpolaton wth threshold value 3 Fnal Itr. Itr. Itr.3 tr. Total tme elapsed Fork sec Plane sec Fsh sec Now to fnd optmal curve to gven data, such values of parameters r s, are requred so that the sums S ' s are mnmal. Genetc Algorthm s used to optmze ths value for the ftted curve. Romly chosen values of r are needed to ntalze the process. Successve applcaton of search operatons lke selecton, crossover mutaton to ths populaton gves optmal values of r s. A. Intalzton Once we have the btmap mage of a character, the boundary 6
7 Issue, Volume 7, 03 of the mage can be extracted usng the method descrbed n Secton. After the boundary ponts of the mage are found, the next step s to detect corner ponts to dvde the boundary of the mage nto n segments as explaned n Secton. Each of these segments s then approxmated by nterpolatng quadratc functons (6) (7) descrbed n Secton 3.. (a) (b) (c) (d) (e) (f) (g) (h) () Fg. 8 Demonstraton of proposed scheme (a) btmap mage of fsh, (b) detected boundary of the mage n (a), (c) corners detected from the boundary, (d) default concs ftted to the corners along wth boundary, (e) st teraton of concs ftted through GA, (f) nd teraton of concs ftted through GA, (g) 3 rd teraton of concs ftted through GA, (h) 4 th teraton of concs ftted through GA, () 5 th teraton of concs ftted through GA. B. Curve Fttng After an ntal approxmaton for the segment s obtaned, Genetc Algorthm helps to obtan better approxmatons to acheve optmal soluton. The tangent vectors at knots are estmated by the method descrbed n Secton 3.4. C. Breakng Segment For some segments, the best ft obtaned through teratve mprovement, may not be satsfactory. In that case, we subdvde the segment nto smaller segments at ponts where the dstance between the boundary parametrc curve exceeds some predefned threshold. Such ponts are termed as ntermedate ponts. A new parametrc curve s ftted for each new segment as shown n Fgs. 6(f-h), Fgs. 7(f-h) Fgs. 8(f-h). Table gves detals of number of ntermedate ponts acheved durng dfferent teraton of Genetc Algorthm appled n process of curve fttng. D. Algorthm All the steps of computng the desred outlne curve manpulaton can be summarzed nto the followng algorthm: Step. Input the data ponts. Step. Subdvde the data, by detectng corner ponts usng the method mentoned n Secton. Step 3. Compute the dervatve values at the corner ponts by usng formula gven n Secton 3.4. Step 4. Ft the ratonal quadratc functons, of Secton 3, to the corner ponts found n Step. Step 5. If the curve, acheved n Step 4, s optmal then go to Step 7, else fnd the approprate break/ntermedate ponts (ponts wth hghest devaton) n the undesred curve peces. Compute 7
8 Issue, Volume 7, 03 the best optmal values of the shape parameters r s. Ft ratonal quadratc functons n Secton 3 to these ntermedate ponts. Step 6. If the curve, acheved n Step 5, s optmal then go to Step 7, else add more ntermedate ponts (ponts wth hghest devaton) go to Step 3. Step 7. Stop. Algorthm together wth corner ponts boundary, (f), (g), (h) () depct ftted outlne for nd, 3 rd, 4 th fnal (5 th ) teratons respectvely usng Genetc Algorthm together wth corner ponts, breakponts boundary. Smlarly, the automatc algorthm has been mplemented on the Fork Fg. 7(a) to produce Fgs. 7(b-) n a smlar manner as those n Fg. 6. However, the last teraton n Fg.7() has appeared to be the 6 th one n ths case. The Fsh mage, n Fg, 8(a), has also been attempted for the algorthm mplementaton. The output appeared, n Fgs. 8(b-), n a smlar way as n Fgs. 6(b-). Fg. 9 Graph of mnmum cost for plane showng mxed behavour. Fg. Graph of mnmum cost for plane showng mx behavour. Fg. 0 Graph of mnmum cost for plane showng decreasng behavour. V. DEMONSTRATION Curve fttng scheme, proposed n Secton 4, has been mplemented on dfferent mages of a plane (Fg. 6(a)), a fork (Fg. 7(a)), a Fsh (Fg. 8(a)). In Fg. 6 ((a) represents orgnal mage, (b) shows outlne of the mage, (c) demonstrates corner ponts, (d) presents ftted Hermte curve to the corners along wth boundary of the mage, (e) gves ftted outlne to the corners for st teraton usng Genetc Fg. Stoppng cretera met by GA for mage of plane. Some analytcal study has also been made for the performance of the devsed algorthm. Fg. 9, Fg. 0 Fg. represent mnmum cost durng dfferent generatons of GA for the mage of plane. Fgs. -3 gve the percentage of stoppng crtera met by GA for the mages of plane fsh 8
9 Issue, Volume 7, 03 respectvely the parameters used whle applyng GA are gven n Table 3. Fg. 3 Stoppng cretera met by GA for mage of fsh. Table 3. Parameters of GA. Sr. No. Name Values Populaton sze 5 Genome length 5 3 Selecton rate Mutaton rate 0.0 VI. CONCLUSION The reverse engneerng technque of planar obects s presented whch uses concs for curve fttng genetc algorthm to fnd the optmal values of parameters n the descrpton of concs. Two ratonal quadratc functons are mplemented n the replacement of a ratonal cubc. Intal rom populaton of parameters s requred for the proposed scheme to get started then the algorthm assures the values of parameters whch provde the optmal ft to the boundary of the btmap mages of planar shapes. The authors are nterested to proceed further extend the scheme to vectorze 3D shapes. Ths work s n progress wth the authors. REFERENCES [] G. Avraham, V. Pratt, Sub-pxel edge detecton n character dgtsaton, Raster Imagng Dgtal Typography II, 99, pp [] H. L. Beus, S. S. H. Tu, An mproved corner detecton algorthm based on chan coded plane curves, Pattern Recognton, vol. 0, 987, pp [3] A. C. Cabrell, U. M. Molter, Automatc representaton of bnary mages, IEEE Transacton on Pattern Analyss Machne Intellgence. vol., no., 990, pp [4] M. Chrasekaran, M. Muraldhar, M. Krshna, U. S. Dxt, Applcaton of soft computng technques n machnng performance predcton optmzaton: a lterature revew, The Internatonal Journal of Advanced Manufacturng Technology, vol. 46, 00, pp [5] D. Chetrkov, S. Zsabo, A smple effcent algorthm for detecton of hgh curvature ponts n planar curves, Proceedngs of the 3rd Workshop of Austran Pattern Recognton Group, 999, pp [6] L. Davs, Shape matchng usng relaxaton technques, IEEE Transactons on Pattern Analyss Machne Intellgence, Vol., No., 979, p [7] H. Freeman, On the encodng of arbtrary geometrc confguratons, IEEE Transactons on Electronc Computer, vol. 0, no., 96,pp [8] D. E. Goldberg, Genetc algorthms n search optmzaton machne learnng, Addson Wesley, Readng, MA., 989. [9] G. E. Hölzle, Knot placement for pecewse polynomal approxmaton of curves, Computer Aded Desgn, vol. 5, no. 5, 983, pp [0] Z. J. Hou, G. W. We, A new approach to edge detecton, Pattern Recognton, vol. 35, no. 7, 00, pp [] K. Itoh, Y. Ohno, A curve fttng algorthm for character fonts, Electronc Publshng, vol. 6, no. 3, 993, pp [] S. Krkpatrck, Jr. C. D. Gelatt, M. P. Vecch, Optmzaton by Smulated Annealng, Scence, vol. 0, no. 4598, 983, pp [3] M. Plass, M. Stone, Curve-fttng wth pecewse parametrc cubcs, Computer Graphcs, vol. 7, no. 3, 983, pp [4] M. Sarfraz, M. A. Khan, An automatc algorthm for approxmatng boundary of btmap characters, Future Generaton Computng Systems, vol. 0, no. 8, (004), pp [5] M. Sarfraz, Some algorthms for curve desgn automatc outlne capturng of mages, Internatonal Journal of Image Graphcs vol. 4, no., 004, pp [6] M. Sarfraz, A. Rasheed, A Romzed Knot Inserton Algorthm for Outlne Capture of Planar Images usng Cubc Splne, The Proceedngs of The th ACM Symposum on Appled Computng, Seoul, Korea, March 5, 007, pp [7] M. Sarfraz, M. N. Haque, M. A. Khan, Capturng outlnes of D Images, Proceedngs of nternatonal conference on magng scence, systems, technology, Las Vegas, Nevada, USA, June 6-9, 000, pp [8] M. Sarfraz, M. F. A. Razzak, An algorthm for automatc capturng of font outlnes, Computers Graphcs, vol. 6, no. 5, 00, pp [9] M. Sarfraz, M. Khan, Towards automaton of capturng outlnes of Arabc fonts, Proceedngs of the thrd KFUPM workshop on nformaton computer scence: software development for the new mllennum, Saud Araba, October 3, 000, pp [0] M. Sarfraz, M. A. Khan, Automatc outlne capture of Arabc fonts, Informaton Scences, vol. 40, no. 3 4, 00, pp [] M. Sarfraz, M. A. Khan, An automatc algorthm for approxmatng boundary of btmap characters, Future Generaton Computer Systems, vol. 0, 004, pp [] M. Sarfraz, M. R. Asm, A. Masood, Capturng outlnes usng cubc Be zer curves, Proceedngs of the IEEE nternatonal conference on nformaton communcaton technologes: from theory to applcaton, Aprl 9-3, 004, pp [3] M. Sarfraz, S. A. Raza, Capturng outlne of fonts usng genetc algorthm splnes, The proceedngs of IEEE nternatonal conference on nformaton vsualzaton-iv-uk, July 5-7, 00, pp [4] M. Sarfraz, M. Ryazuddn, M. H. Bag, Capturng planar shapes by approxmatng ther outlnes, Journal of Computatonal Appled Mathematcs, vol. 89, 005, pp [5] M. Sarfraz, S. A. Raza, Vsualzaton of data wth splne fttng: a tool wth a genetc approach, Proceedngs of nternatonal conference on magng scence, systems, technology, Las Vegas, Nevada, USA, June 4-7, 00, p [6] M. Sarfraz, A. Masood, M. R. Asm, A new approach to corner detecton, Computer vson graphcs, vol. 3, 006, p [7] P. J. Schneder, An algorthm for automatcally fttng dgtzed curves, Graphcs Gems, 990, pp
10 Issue, Volume 7, 03 [8] F. A. Sohel, G. C. Karmakar, L. S. Dooley, Arknstall J. Enhanced Be zer curve models ncorporatng local nformaton, Proceedngs of IEEE Internatonal Conference on Acoustcs, Speech, Sgnal Processng, USA, March 8-3, 005, pp [9] Y. Y. Tang, F. Yang, J. Lu, Basc processes of chnese character based on cubc B-splne wavelet transform, IEEE Transactons on Pattern Analyss Machne Intellgence, vol. 3, no., 00, p [30] C. H. Teh, R. T. Chn, On the detecton of domnant ponts on dgtal curves, IEEE Transactons on Pattern Analyss Machne Intellgence, vol., no. 8, 989, pp [3] L. A. Zadeh, Fuzzy Logc Soft Computng: Issues, Contentons Perspectves, Internatonal Conference on Fuzzy Logc, Neural Nets Soft Computng, Izuka, Japan, 994, pp. -. M. Sarfraz s a Professor n Kuwat Unversty, Kuwat. He receved hs Ph.D. from Brunel Unversty, UK, n 990. Hs research nterests nclude Computer Graphcs, CAD/CAM, Pattern Recognton, Computer Vson, Image Processng, Soft Computng. He s currently workng on varous proects related to academa ndustry. He has been keynote/nvted speaker at varous platforms around the globe. He has advsed/supervsed more than 50 students for ther MSc PhD theses. He s the Char of the Informaton Scence Department, Kuwat Unversty. He has publshed more than 50 publcatons n the form of varous Books, Book Chapters, ournal papers conference papers. He s member of varous professonal socetes ncludng IEEE, ACM, IVS, IACSIT, ISOSS. He s a Char, member of the Internatonal Advsory Commttees Organzng Commttees of varous nternatonal conferences, Symposums Workshops. He s the revewer, for many nternatonal Journals, Conferences, meetngs, workshops around the world. He s the Edtor-n-Chef of the Internatonal Journal of Computer Vson Image Processng. He s also Edtor/Guest Edtor of varous Internatonal Conference Proceedngs, Books, Journals. He has acheved varous awards n educaton, research, admnstratve servces. M. Z. Hussan s a Professor n Punab Unversty, Lahore, Pakstan. He receved hs Ph.D. from Punab Unversty, Pakstan, n 00. Hs research nterests nclude Computatonal Mathematcs, Computer Graphcs, CAGD, CAD/CAM, Image Processng Soft Computng. He has advsed/supervsed more than 30 students for ther M.Phl. PhD theses. He has publshed more than 50 publcatons n the form of ournal conference papers. M. Irshad s a Ph.D. student n Punab Unversty, Lahore, Pakstan. She receved her M.Phl. from Punab Unversty, Pakstan, n 006. Her research nterests nclude Computatonal Mathematcs, Computer Graphcs, CAGD, CAD/CAM, Image Processng, Soft Computng. She has publshed more than 6 publcatons n the form of ournal conference papers. 0
Vectorization of Image Outlines Using Rational Spline and Genetic Algorithm
01 Internatonal Conference on Image, Vson and Computng (ICIVC 01) IPCSIT vol. 50 (01) (01) IACSIT Press, Sngapore DOI: 10.776/IPCSIT.01.V50.4 Vectorzaton of Image Outlnes Usng Ratonal Splne and Genetc
More 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 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 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 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 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 information2-Dimensional Image Representation. Using Beta-Spline
Appled Mathematcal cences, Vol. 7, 03, no. 9, 4559-4569 HIKARI Ltd, www.m-hkar.com http://dx.do.org/0.988/ams.03.3359 -Dmensonal Image Representaton Usng Beta-plne Norm Abdul Had Faculty of Computer and
More informationMeta-heuristics for Multidimensional Knapsack Problems
2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,
More 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 informationInvariant Shape Object Recognition Using B-Spline, Cardinal Spline, and Genetic Algorithm
Proceedngs of the 5th WSEAS Int. Conf. on Sgnal Processng, Robotcs and Automaton, Madrd, Span, February 5-7, 6 (pp4-45) Invarant Shape Obect Recognton Usng B-Splne, Cardnal Splne, and Genetc Algorthm PISIT
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationA 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 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 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 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 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 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 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 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 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 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 informationMaximum Variance Combined with Adaptive Genetic Algorithm for Infrared Image Segmentation
Internatonal Conference on Logstcs Engneerng, Management and Computer Scence (LEMCS 5) Maxmum Varance Combned wth Adaptve Genetc Algorthm for Infrared Image Segmentaton Huxuan Fu College of Automaton Harbn
More 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 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 informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationMulti-objective Design Optimization of MCM Placement
Proceedngs of the 5th WSEAS Int. Conf. on Instrumentaton, Measurement, Crcuts and Systems, Hangzhou, Chna, Aprl 6-8, 26 (pp56-6) Mult-objectve Desgn Optmzaton of MCM Placement Chng-Ma Ko ab, Yu-Jung Huang
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 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 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 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 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 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 informationAn Image Fusion Approach Based on Segmentation Region
Rong Wang, L-Qun Gao, Shu Yang, Yu-Hua Cha, and Yan-Chun Lu An Image Fuson Approach Based On Segmentaton Regon An Image Fuson Approach Based on Segmentaton Regon Rong Wang, L-Qun Gao, Shu Yang 3, Yu-Hua
More informationThe Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole
Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng
More informationA 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 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 informationCracking of the Merkle Hellman Cryptosystem Using Genetic Algorithm
Crackng of the Merkle Hellman Cryptosystem Usng Genetc Algorthm Zurab Kochladze 1 * & Lal Besela 2 1 Ivane Javakhshvl Tbls State Unversty, 1, I.Chavchavadze av 1, 0128, Tbls, Georga 2 Sokhum State Unversty,
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 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 informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationA new paradigm of fuzzy control point in space curve
MATEMATIKA, 2016, Volume 32, Number 2, 153 159 c Penerbt UTM Press All rghts reserved A new paradgm of fuzzy control pont n space curve 1 Abd Fatah Wahab, 2 Mohd Sallehuddn Husan and 3 Mohammad Izat Emr
More informationCourse Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms
Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques
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 informationStraight Line Detection Based on Particle Swarm Optimization
Sensors & ransducers 013 b IFSA http://www.sensorsportal.com Straght Lne Detecton Based on Partcle Swarm Optmzaton Shengzhou XU, Jun IE College of computer scence, South-Central Unverst for Natonaltes,
More informationComplexity Analysis of Problem-Dimension Using PSO
Proceedngs of the 7th WSEAS Internatonal Conference on Evolutonary Computng, Cavtat, Croata, June -4, 6 (pp45-5) Complexty Analyss of Problem-Dmenson Usng PSO BUTHAINAH S. AL-KAZEMI AND SAMI J. HABIB,
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 informationComparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments
Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,
More informationAn Improved Image Segmentation Algorithm Based on the Otsu Method
3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,
More 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 informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More 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 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 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 informationNovel Fuzzy logic Based Edge Detection Technique
Novel Fuzzy logc Based Edge Detecton Technque Aborsade, D.O Department of Electroncs Engneerng, adoke Akntola Unversty of Tech., Ogbomoso. Oyo-state. doaborsade@yahoo.com Abstract Ths paper s based on
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 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 informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationImage Alignment CSC 767
Image Algnment CSC 767 Image algnment Image from http://graphcs.cs.cmu.edu/courses/15-463/2010_fall/ Image algnment: Applcatons Panorama sttchng Image algnment: Applcatons Recognton of object nstances
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 informationMulti-stable Perception. Necker Cube
Mult-stable Percepton Necker Cube Spnnng dancer lluson, Nobuuk Kaahara Fttng and Algnment Computer Vson Szelsk 6.1 James Has Acknowledgment: Man sldes from Derek Hoem, Lana Lazebnk, and Grauman&Lebe 2008
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 informationVol. 5, No. 3 March 2014 ISSN Journal of Emerging Trends in Computing and Information Sciences CIS Journal. All rights reserved.
Journal of Emergng Trends n Computng and Informaton Scences 009-03 CIS Journal. All rghts reserved. http://www.csjournal.org Unhealthy Detecton n Lvestock Texture Images usng Subsampled Contourlet Transform
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 informationConstrained Shape Modification of B-Spline curves
Constraned Shape Modfcaton of B-Splne curves Mukul Tul, N. Venkata Reddy and Anupam Saxena Indan Insttute of Technology Kanpur, mukult@tk.ac.n, nvr@tk.ac.n, anupams@tk.ac.n ABSTRACT Ths paper proposes
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationEnhanced AMBTC for Image Compression using Block Classification and Interpolation
Internatonal Journal of Computer Applcatons (0975 8887) Volume 5 No.0, August 0 Enhanced AMBTC for Image Compresson usng Block Classfcaton and Interpolaton S. Vmala Dept. of Comp. Scence Mother Teresa
More informationAn efficient method to build panoramic image mosaics
An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract
More informationShape Representation Robust to the Sketching Order Using Distance Map and Direction Histogram
Shape Representaton Robust to the Sketchng Order Usng Dstance Map and Drecton Hstogram Department of Computer Scence Yonse Unversty Kwon Yun CONTENTS Revew Topc Proposed Method System Overvew Sketch Normalzaton
More informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More informationSolving two-person zero-sum game by Matlab
Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by
More informationSimulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010
Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement
More informationOptimal Design of Nonlinear Fuzzy Model by Means of Independent Fuzzy Scatter Partition
Optmal Desgn of onlnear Fuzzy Model by Means of Independent Fuzzy Scatter Partton Keon-Jun Park, Hyung-Kl Kang and Yong-Kab Km *, Department of Informaton and Communcaton Engneerng, Wonkwang Unversty,
More informationAvailable online at Available online at Advanced in Control Engineering and Information Science
Avalable onlne at wwwscencedrectcom Avalable onlne at wwwscencedrectcom Proceda Proceda Engneerng Engneerng 00 (2011) 15000 000 (2011) 1642 1646 Proceda Engneerng wwwelsevercom/locate/proceda Advanced
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 informationClustering Algorithm Combining CPSO with K-Means Chunqin Gu 1, a, Qian Tao 2, b
Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) Clusterng Algorthm Combnng CPSO wth K-Means Chunqn Gu, a, Qan Tao, b Department of Informaton Scence, Zhongka
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More 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 informationOutline. Discriminative classifiers for image recognition. Where in the World? A nearest neighbor recognition example 4/14/2011. CS 376 Lecture 22 1
4/14/011 Outlne Dscrmnatve classfers for mage recognton Wednesday, Aprl 13 Krsten Grauman UT-Austn Last tme: wndow-based generc obect detecton basc ppelne face detecton wth boostng as case study Today:
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 informationCollaboratively Regularized Nearest Points for Set Based Recognition
Academc Center for Computng and Meda Studes, Kyoto Unversty Collaboratvely Regularzed Nearest Ponts for Set Based Recognton Yang Wu, Mchhko Mnoh, Masayuk Mukunok Kyoto Unversty 9/1/013 BMVC 013 @ Brstol,
More informationResolving Ambiguity in Depth Extraction for Motion Capture using Genetic Algorithm
Resolvng Ambguty n Depth Extracton for Moton Capture usng Genetc Algorthm Yn Yee Wa, Ch Kn Chow, Tong Lee Computer Vson and Image Processng Laboratory Dept. of Electronc Engneerng The Chnese Unversty of
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationRefinement to the Chamfer matching for a center-on fit
Refnement to the Chamfer matchng for a center-on ft Jngyng Chen Paul Tan Terence Goh Sngapore Technologes Dynamcs 249 Jalan Boon Lay Sngapore 69523 Abstract Matchng s a central problem n mage analyss and
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 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 informationUsing Fuzzy Logic to Enhance the Large Size Remote Sensing Images
Internatonal Journal of Informaton and Electroncs Engneerng Vol. 5 No. 6 November 015 Usng Fuzzy Logc to Enhance the Large Sze Remote Sensng Images Trung Nguyen Tu Huy Ngo Hoang and Thoa Vu Van Abstract
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 informationUnsupervised Learning and Clustering
Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned
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 informationFace Recognition University at Buffalo CSE666 Lecture Slides Resources:
Face Recognton Unversty at Buffalo CSE666 Lecture Sldes Resources: http://www.face-rec.org/algorthms/ Overvew of face recognton algorthms Correlaton - Pxel based correspondence between two face mages Structural
More 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 informationTHE PULL-PUSH ALGORITHM REVISITED
THE PULL-PUSH ALGORITHM REVISITED Improvements, Computaton of Pont Denstes, and GPU Implementaton Martn Kraus Computer Graphcs & Vsualzaton Group, Technsche Unverstät München, Boltzmannstraße 3, 85748
More informationGA-Based Learning Algorithms to Identify Fuzzy Rules for Fuzzy Neural Networks
Seventh Internatonal Conference on Intellgent Systems Desgn and Applcatons GA-Based Learnng Algorthms to Identfy Fuzzy Rules for Fuzzy Neural Networks K Almejall, K Dahal, Member IEEE, and A Hossan, Member
More informationPerformance Evaluation of an ANFIS Based Power System Stabilizer Applied in Multi-Machine Power Systems
Performance Evaluaton of an ANFIS Based Power System Stablzer Appled n Mult-Machne Power Systems A. A GHARAVEISI 1,2 A.DARABI 3 M. MONADI 4 A. KHAJEH-ZADEH 5 M. RASHIDI-NEJAD 1,2,5 1. Shahd Bahonar Unversty
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 informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationOptimum Synthesis of Mechanisms For Path Generation Using a New Curvature Based Deflection Based Objective Function
Proceedngs of the 6th WSEAS Internatonal Conference on Smulaton, Modellng and Optmzaton, Lsbon, Portugal, September -4, 6 67 Optmum Synthess of Mechansms For Path Generaton Usng a ew Curvature Based Deflecton
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 informationAlgorithm for Human Skin Detection Using Fuzzy Logic
Algorthm for Human Skn Detecton Usng Fuzzy Logc Mrtunjay Ra, R. K. Yadav, Gaurav Snha Department of Electroncs & Communcaton Engneerng JRE Group of Insttutons, Greater Noda, Inda er.mrtunjayra@gmal.com
More information