A Novel Accurate Algorithm to Ellipse Fitting for Iris Boundary Using Most Iris Edges. Mohammad Reza Mohammadi 1, Abolghasem Raie 2
|
|
- Thomas Ross
- 5 years ago
- Views:
Transcription
1 A Novel Accurate Algorthm to Ellpse Fttng for Irs Boundar Usng Most Irs Edges Mohammad Reza Mohammad 1, Abolghasem Rae 2 1. Department of Electrcal Engneerng, Amrabr Unverst of Technolog, Iran. mrmohammad@aut.ac.r 2. Department of Electrcal Engneerng, Amrabr Unverst of Technolog, Iran. rae@aut.ac.r Abstract: Ellpse fttng for rs boundar s an mportant step n ee gaze estmaton and rs recognton applcatons. In most of the proposed algorthms onl the edge mage s used for ellpse fttng. In these algorthms, the undesred edges ma lead to erroneous rs ellpse. In ths paper, we propose a novel algorthm to ellpse fttng for rs boundar whch uses gra and edge mages smultaneousl. In ths algorthm, edges of ee regon are computed and refned b some proposed constrants. Then, remander segments merge together b an optmzaton process and the best ellpse s ftted for the merged segments. In ths algorthm, most edges of rs boundar are used for ellpse fttng and hence, ts accurac s hgh. The performance of the method has been evaluated on real mages. J Am Sc 2012;8(6): ]. (ISSN: ).. 94 Kewords: Ellpse fttng, Splt ponts, Merge of segments. 1. Introducton In applcatons such as ee gaze estmaton [1-5] and rs recognton [6-9] an mportant step s fttng a shape for rs boundar. In some papers, t s assumed that contour of rs s a crcle (such as [3]). But, as shown n [1], contour of rs n a 2D mage s an ellpse. In [1,2,6] edges of the ee regon mage are computed b smple algorthms and then ellpse fttng algorthms are proposed to appl on t. In [1], wth respect to ee shape and eeld effects, t s assumed that two longest vertcal segments belong to rs boundar. Then, an ellpse s ftted for the pels on these segments b the least square method. Not usng horzontal pels lead to reduced accurac of ths algorthm. Also, n some mages, t s possble that an erroneous segment s selected for rs boundar and the error of the ellpse fttng becomes ver large. An mprovement of Randomzed Hough Transform (RHT) s proposed n [2] to ellpse fttng for rs boundar and n [6] RANSAC algorthm s used for t. A common problem n the presented algorthms s usng onl edge mage to fttng the desred ellpse. In some mages, because of eelds and other edges, the best ftted ellpse to the edge mage s not dentcal to the rs ellpse. To overcome ths problem, t s requred to use gra (or color) mage and edge mage smultaneousl. In ths paper, we propose a new algorthm to ellpse fttng for rs boundar whch utlzes gra and edge mages. In ths algorthm, we compute edges of ee regon and remove splt ponts (defned n secton 3) from t. In addton, we remove some segments, wth respect to rs center, whch cannot belong to the rs boundar. Fnal step s mergng the remanng segments and fttng the best ellpse for them. The remander of ths paper s structured as follows. In Secton 2, we propose a novel algorthm to compute and refne edges of ee regon whch elmnates a lot of undesred ones. In Secton 3, an optmzaton algorthm s ntroduced to merge the remander segments. Epermental results are presented n Secton 4. Fnall, Secton 5 concludes ths paper. 2. Edge Computaton and Refnement In ths secton, we present a novel algorthm for edge computaton and refnement formed from three steps. The frst step s to compute edges. Elmnaton of splt ponts and undesred segments are the net steps dscussed n the remander of ths secton Edge Computaton of Ee Regon Because of the estence of a lot of undesred edges n the ee regon, most of them related to eelds and eelashes, t s requred that the ee regon edges be computed b hgh accurac and be refned. To compute the edges, we use Cann operator n a 2- level pramd. In other words, b Cann operator, edges on low-resoluton mage are computed. Then, edges on hgh-resoluton are computed and edges whch do not have equvalent pel n low-resoluton mage are removed. B ths method, a lot of small edges, most of them related to eelashes, are removed. Fgure 1 shows an eample of edge computaton b ths method. Some pels computed as edge n ee regon mage do not belong to rs boundar (undesred pels). To elmnate a lot of them, we propose new algorthms. Undesred pels are located on segments whch all or parts of them are undesred. Thus, for 758
2 an segment, we compute pels whch are the locaton of the ntersecton of two (or more) dfferent segments. After ths, all pels n a segment are undesred or not. Hence, we elmnate all pels of the segments whch ther probablt to be located on rs boundar s lower than the threshold. These operatons wll be dscussed n the net parts of ths secton. dfferental vector at the pel and the average dfferental vector for some pels before and after the pel to determne splt ponts of tpe 2. The frst parameter conssts of dfferences n dfferental vectors for current and net pels. In dscrete ponts, dfferental vector s obtaned from Equaton (1): df d ˆ d jˆ (1) where d and d can be calculated from Equatons (2) and (3). d 1 d 1 (2) (3) (c) (d) Fgure 1. Edge computaton b Cann operator n a 2-level pramd, man mage, edges of hghresoluton mage, (c) edges of low-resoluton mage, and (d) result of combnaton of two levels Elmnaton of Splt Ponts In the edge mage of ee regon, there are two tpes of splt ponts (Fgure 2). Tpe 1 s the locaton of the ntersecton of two (or more) dfferent segments and tpe 2 s the locaton n whch the end parts of two dfferent segments are dentcal. tpe 1 tpe 2 Fgure 2. Two dfferent tpes of the splt ponts n an edge mage To compute the locaton of tpe 1 splt ponts, we mae the edge mage thn b morphologcal thnnng operator and convolve the result b a 3 3 ones flter. Pels, n the resulted mage, whch have values greater than 2 are the locatons of splt ponts of tpe 1. The man parameter to localze splt ponts of tpe 2 s the change of dfferental vector. The change of dfferental vector n an ellpse cannot be greater than a threshold. So, we use the change of To quantf the changes of dfferental vectors, we use normalzed dot product as Equaton (4): d d d d d d 1 d 1 d d (4) If the number of ponts for an ellpse s large, d should be appromatel 1 for all ponts. But, f the ellpse conssts of onl 20 pels and ts aspect rato s smaller than 2 (equvalent to θ = 60 degrees), the values of d change theoretcall between and Thus, we set T d = 0.8 as threshold of d. Dfferental vector at a pont has hgh senstvt to nose and other errors n the edge detecton phase. Therefore, we use the average dfferental vector as the second parameter. To obtan a good estmaton of the average dfferental vector, we ft a lne n the sense of MSE for ponts before the current pel. B some calculatons, Equaton (5) results the slope of the ftted lne: m 1 l 1 l1 2 l1 l 1 l1 2 l1 (5) where and are coordnates of the prevous ponts. In the same manner, Equaton (6) s obtaned for ponts after the current pel: 759
3 m 2 l 1 l1 2 l1 l 1 l1 2 l1 (6) The amount of dfference between these two slopes s computed b normalzed dot product as n Equaton (7): 1 mm m m1 1m2 (7) If m s close to 1, t means that the average slope changes slowl. Otherwse, the average slope changes rapdl and means that ths pel can be a splt pont of tpe 2. Based on the eperments, f all ponts of the ellpse are greater than 50, selectng 4% of them s suffcent for. Wth ths choce, for ellpses wth an aspect rato smaller than 2, m changes between and So, we select T m = 0.85 as threshold of m. Wth ths descrpton, summar of the algorthm s as follows: For all pels of an segment, value of d s computed from Equaton (4) and compared wth T d. If d < T d, then, value of m s computed from Equaton (7) and compared wth T m. If m < T m, then, a splt pont of tpe 2 has detected. Fgure 3 shows an eample of applng the proposed algorthm for elmnaton of the splt ponts. t as rs center. Two samples of rs center localzaton b ths method are shown n Fgure 4. For a pel located on permeter of an ellpse, the slope s appromatel perpendcular to the lne that connects center of ellpse to t. Moreover, concavt n the pels of an ellpse s appromatel towards the center of the ellpse. So, we ft two parametrc curves of order 3 for and coordnates of the segment. Then, we compute frst and second order dervatves of the ftted curve and choose them to call d t, d t, d 2 t and d 2 t, respectvel: where t = 1: n whle n s the number of pels of the segment. To quantf the frst and second features (perpendculart of the slope to and parallelsm of the concavt b the lne that connects center of ellpse to the pel) we compute normalzed dot product for each pel as Equatons (8) and (9): s d d (8) t1 t t t t s d d (9) 2 2 t 2 t t t t Fnal parameter s calculated from weghted average of s 1 and s 2 as n Equaton (10): 1 n 1 t1 2 t2 n t 1 (10) s s s Accordng to the performed eperments, we choose 1 = 5 and 2 = -1 and set threshold value to - 3. Fgure 4 shows the results of applng ths algorthm on the mages of Fgure 4. Fgure 3. Elmnaton of the splt ponts b the proposed algorthm, an edge mage of ee regon, and elmnaton of splt ponts Elmnaton of Undesred Segments Segments that belong to rs boundar have curvature towards the rs center. Therefore, to elmnate undesred segments, we estmate rs center, then compute the amount of curvature for an segments and compare t b a threshold value. In ths algorthm, accurac of the rs center localzaton s not essental. Thus, we use a smple and fast algorthm for t. In the ee regon, the darest parts belong to pupl and rs regons; therefore, we convolve the mage b a large Gaussan flter and compute the locaton of mnmum value n Fgure 4. Elmnaton of the undesred segments, rs center localzaton b a smple flterng, and remander segments 3. Mergng of the Remander Segments In prevous secton, we computed and refned the edges of ee regon mage. The output of these algorthms s several segments that onl some of them belong to rs boundar. In ths secton, we propose an algorthm to merge the segments that belong to rs boundar. In [1], two longest vertcal edges are selected as rs boundar. The performance of ths method, for heads wthout rotaton, has been 760
4 reported to be approprate. Senstvt to head rotaton and not usng horzontal edges are the man lmtatons of ths method. In ths paper, for mamum usng of rs edges and elmnatng lmtaton of head rotaton, we defne a ftness functon whose optmzaton results the segments that should be merged. In other words, the ftness functon s defned accordng to parameters of each segment. Then, onl segments that mprove the ftness functon merge together. We use four features n the ftness functon as dscussed n net parts. 3.1 Average Dstance from the Ftted Ellpse The frst feature to merge two segments s the average dstance of the ponts n the segments from ther ftted ellpse. Ths feature epresses ellptcal measure of the ponts n the segment. It s mportant that both segments be close to the ftted ellpse. So, we propose Equaton (11) as f 1 : f dff dff 1 2 (11) mn dff 1, dff 2 ma dff, dff Where dff 1 and dff 2 are average dstances of the two segments from the ftted ellpse. For two segments that are located on an ellpse, the value of f 1 wll be 0. Ftted ellpses to four combnatons of two segments are shown n Fgure 5. For these combnatons, values , , and are computed respectvel as f 1 whch epresses hgh performance of ths feature. (c) (d) Fgure 5. Values of f 1 for 4 eamples, , , (c) , and (d) Matchng of the Ftted Ellpse b All Edges The second feature s the percent of ponts n all segments that are close to the ftted ellpse of the segments. In other words, ths feature determnes how man ponts of all segments match wth ths ellpse. So, we propose Equaton (12) as the second feature: f 2 L 1 dff L T (12) where L s the number of all ponts on the segments and dff s the dstance of the th pont from the ftted ellpse. Also, T s a threshold level whose value s 0.5. Fgure 6 shows an edge mage that conssts of 5 segments. Parts to (f) show 5 combnatons (out of 10 possble combnatons) whose f 2 values are , , , and , respectvel. The best value for f 2 s 1; so, the computed values show the hgh performance of ths feature. (c) (d) (e) (f) Fgure 6. Matchng of the ftted ellpse b all edges, an edge mage whch conssts of 5 segments, and to (f) fve combnatons for whch values , , , and are obtaned as f 2 f 1 and f 2 features use onl the edge mage to merge the segments. In man cases these features are suffcent; however, n some cases the best ftted ellpse for the edge mage s not dentcal to the best ftted ellpse to rs boundar. Therefore, we defne the thrd and fourth features whch are based on gra mage of the ee regon Adjacenc to the Eeball Regon An mportant feature of the rs edges s ther adjacenc to the eeball regon. Moreover, eeball s the brghtest regon n the ee mage. So, we can etract eeball regon b a smple thresholdng algorthm and gve hgh scores to the segments whose pels are close to ths regon. We propose (13) as f 3 : f N N (13) 3 j Where N and N j are the percent of ponts n each segment beng close to the ee regon. Fgure 7 shows a sample of computng N. Values , 0, 0, 1 and 0 are computed as N for the 5 segments of ths fgure, respectvel. These values ndcate the robustness of ths feature. 761
5 (c) Fgure 7. Adjacenc to the eeball regon, orgnal mage of ee regon, thresholded mage followed b openng operator to remove small partcles, and (c), fve remander segments whose values of f 3 are , 0, 0, 1 and 0, respectvel Dfference of Irs Color b Other Segments Another mportant feature for rs ellpse s color of pels located nsde and outsde of t. Thus, we defne the rato of average ntenst for around pels of the ftted ellpse located nsde and outsde of t as f4. Around rs boundar, nsde pels are darer than outsde ones; therefore, ths feature can remove segments whose ftted ellpse s not compatble wth ee propertes. Equaton (14) s proposed to compute f4: M f 4 (14) M o where M and M o are the average ntenstes for pels of nsde and outsde of the ftted ellpse. Fgure 8 shows some samples to demonstrate the performance of ths feature. Parts and are the gra mage and edge mage that conssts of 5 segments, respectvel. Parts (c) to (f) are 4 combnatons (out of 10 possble combnatons) for whch the values , , and are computed as ther f 4. So, ths s a good dscrmnatve feature Optmzaton of the Fttng Functon We defne the fttng functon as a weghted sum of the dscussed features. So, Equaton (15) s the fttng functon: f Af Bf Cf Df (15) To optmze f, we merge onl the segments that ncrease the value of f. Wth respect to the mportance of the features and preformed eperments, we choose values -3, 2, 1.5 and -2 for A, B, C and D, respectvel. Implementaton results show that the accurac of ths method s ver hgh and t can manage the estence of man undesred edges. Fgure 10 shows dfferent steps of the proposed algorthm to ellpse fttng for rs boundar n a sample mage. In part (d) of ths fgure, merged segments are shown wth whte color and other segments wth gra color. Also, the ftted ellpse, whose parameters are computed for pels on the merged segments b algorthm of [10], s shown wth blac color. (c) (d) (e) (f) Fgure 8. Performance of the f 4 for some eamples, orgnal mage of ee regon, the edge mage whch conssts of 5 segments, and (c) to (f) four combnatons for whch values , , and are obtaned as f 4 (c) (d) Fgure 9. Dfferent steps of the proposed algorthm for ellpse fttng to rs boundar, orgnal mage of ee regon, edge computaton, (c) edge refnement, and (d) merge of remander segments and the fnal ftted ellpse 4. Epermental Results The man motvaton of ths paper s to propose a new algorthm that, ndependent of head rotaton, uses most of the estng rs edges to ft an accurate ellpse to the rs boundar. To evaluate the proposed algorthm, we get 72 mages from ee regons. For an mage, the number of all edges, the number of rs edges and the number of splt ponts (consstng of pels located on undesred segments) are counted. 762
6 For all mages, from edge pels, 1406 pels are elmnated as splt ponts and 2518 pels are removed as undesred segments. Moreover, pels dentfed as the rs edges. It should be noted that 2417 pels are removed n mergng phase. The error of the proposed algorthm was 112 pels whch erroneousl have been consdered as rs edges and 120 pels whch belong to rs boundar but are not consdered. Thus, FPR and FNR of the proposed algorthm are about 1%. 5. Concluson The man contrbuton of ths stud was the development of an algorthm to accuratel estmate the parameters of the ellpse of the rs boundar. The novel aspect of ths wor was proposng new constrants to splt the edge mage to some segments and proposng new features to merge these segments. One of the future wors s defnng some new features to use n the ftness functon. Moreover, to elmnate the splt ponts we use the change of dfferental vector. To mprove ths algorthm, we can use gra mage features n the future wors. Acnowledgements: The authors would le to epress ther sncere thans to Dr M. R. Eslam Khouzan for ther valuable comments. 6. D. Zhang, A. Jan, and X. L, Modelng Intra-class Varaton for Nondeal Irs Recognton, Advances n Bometrcs, Lecture Notes n Computer Scence, Sprnger Berln / Hedelberg, 2005; Bonne B, Ives R, Etter D, Yngz D. Irs pattern etracton usng bt planes and standard devatons. n Sgnals, Sstems and Computers, Conference Record of the Thrt-Eghth Aslomar Conference on, 2004; Daugman J. New Methods n Irs Recognton. Sstems, Man, and Cbernetcs, Part B: Cbernetcs, IEEE Transactons on, 2007;37(5): Plla J, Patel V, Chellappa R, Ratha N. Secure and Robust Irs Recognton usng Random Projectons and Sparse Representatons. Pattern Analss and Machne Intellgence, IEEE Transactons on, 2011;(99): Ftzgbbon A, Plu M, Fsher R.B. Drect least square fttng of ellpses. Pattern Analss and Machne Intellgence, IEEE Transactons on, 1999; 21(5): /15/2012 References 1. Wang J.G, Sung E, Venateswarlu R. Estmatng the ee gaze from one ee. Comput Vs Image Underst 2005; 98(1): Huang S.C, Wu Y.L, Hung W.C, Tang C.Y. Pont-of-Regard Measurement va Irs Contour wth One Ee from Sngle Image. n Proceedngs of the 2010 IEEE Internatonal Smposum on Multmeda, Lang D.B.B, Lm Ko H, Non-ntrusve ee gaze drecton tracng usng color segmentaton and Hough Transform. n Communcatons and Informaton Technologes, ISCIT '07. Internatonal Smposum on, 2007; Kohlbecher S, Bardnst S, Bartl K, Schneder E, Potsche T, Ablassmeer M. Calbraton-free ee tracng b reconstructon of the pupl ellpse n 3D space. n Proceedngs of the 2008 smposum on Ee tracng research & applcatons, Savannah, Georga, M. R. Mohammad, and A. Rae, Robust Pose- Invarant Ee Gaze Estmaton Usng Geometrcal Features of Irs and Pupl Images, the 20th Iranan Conference on Electrcal Engneerng, ICEE2012,
Multi-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 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 informationAngle-Independent 3D Reconstruction. Ji Zhang Mireille Boutin Daniel Aliaga
Angle-Independent 3D Reconstructon J Zhang Mrelle Boutn Danel Alaga Goal: Structure from Moton To reconstruct the 3D geometry of a scene from a set of pctures (e.g. a move of the scene pont reconstructon
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 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 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 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 informationRobust Vanishing Point Detection for MobileCam-Based Documents
011 Internatonal Conference on Document Analss and Recognton Robust Vanshng Pont Detecton for MobleCam-Based Documents Xu-Cheng Yn, Hong-We Hao Department of Computer Scence School of Computer and Communcaton
More informationLEAST SQUARES. RANSAC. HOUGH TRANSFORM.
LEAS SQUARES. RANSAC. HOUGH RANSFORM. he sldes are from several sources through James Has (Brown); Srnvasa Narasmhan (CMU); Slvo Savarese (U. of Mchgan); Bll Freeman and Antono orralba (MI), ncludng ther
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 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 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 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 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 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 informationAn Object Detection Method based on the Separability Measure using an Optimization Approach
An Object Detecton Method based on the Separablt Measure usng an Optmzaton Approach Edward Y. H. Cho *, Wa Tak Hung 2 Hong Kong Poltechnc Unverst, Hung Hom, Kowloon, Hong Kong E-mal: mahcho@net.polu.edu.hk
More informationTakahiro ISHIKAWA Takahiro Ishikawa Takahiro Ishikawa Takeo KANADE
Takahro ISHIKAWA Takahro Ishkawa Takahro Ishkawa Takeo KANADE Monocular gaze estmaton s usually performed by locatng the pupls, and the nner and outer eye corners n the mage of the drver s head. Of these
More informationA CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN. Department of Statistics, Islamia College, Peshawar, Pakistan 2
Pa. J. Statst. 5 Vol. 3(4), 353-36 A CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN Sajjad Ahmad Khan, Hameed Al, Sadaf Manzoor and Alamgr Department of Statstcs, Islama College,
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 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 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 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 informationSymmetry Integrated Region-based Image Segmentation
Smmetr Integrated Regon-based Image Segmentaton Yu Sun, Br Bhanu Center for Research n Intellgent Sstems, Unverst of Calforna at Rversde, Rversde, CA, 95 sun@ee.ucr.edu, bhanu@crs.ucr.edu Abstract Smmetr
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 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 informationA Methodology for Document Image Dewarping Techniques Performance Evaluation
2009 0 Internatonal Conference on Document Analss and Recognton A Meodolog for Document Image Dewarpng Technques Performance Evaluaton N. Stamatopoulos, B. Gatos, I. Pratkaks Computatonal Intellgence Laborator,
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 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 informationRECONSTRUCTION OF 3D TUBULAR STRUCTURES FROM CONE-BEAM PROJECTIONS
RECONSTRUCTION OF 3D TUBULAR STRUCTURES FROM CONE-BEAM PROJECTIONS Ja L Dept. of Elect. and Comp. Engrg. Oakland Unversty Rochester, MI 48309, USA Laurent Cohen CEREMADE Unversty Pars - Dauphne 75775 Pars
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More 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 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 informationA Range Image Refinement Technique for Multi-view 3D Model Reconstruction
A Range Image Refnement Technque for Mult-vew 3D Model Reconstructon Soon-Yong Park and Mural Subbarao Electrcal and Computer Engneerng State Unversty of New York at Stony Brook, USA E-mal: parksy@ece.sunysb.edu
More informationMulti-view 3D Position Estimation of Sports Players
Mult-vew 3D Poston Estmaton of Sports Players Robbe Vos and Wlle Brnk Appled Mathematcs Department of Mathematcal Scences Unversty of Stellenbosch, South Afrca Emal: vosrobbe@gmal.com Abstract The problem
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 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 informationGeometric Primitive Refinement for Structured Light Cameras
Self Archve Verson Cte ths artcle as: Fuersattel, P., Placht, S., Maer, A. Ress, C - Geometrc Prmtve Refnement for Structured Lght Cameras. Machne Vson and Applcatons 2018) 29: 313. Geometrc Prmtve Refnement
More informationAccurate Feature Extraction and Control Point Correction for Camera Calibration with a Mono-Plane Target
Accurate Feature Etracton and Control Pont Correcton for Camera Calbraton wth a Mono-Plane Target Y. Xao Unversty of Ednburgh yao@nf.ed.ac.uk R.B. Fsher Unversty of Ednburgh rbf@nf.ed.ac.uk Abstract The
More informationR s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More 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 informationA method for real-time implementation of HOG feature extraction
Invted Paper A method for real-tme mplementaton of HO feature etracton LUO Ha-bo 134 YU Xn-rong 1345 LIU Hong-me 5 DIN Qng-ha 6 1. Shenang Insttute of Automaton Chnese Academ of Scences Shenang 110016
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 information2D Raster Graphics. Integer grid Sequential (left-right, top-down) scan. Computer Graphics
2D Graphcs 2D Raster Graphcs Integer grd Sequental (left-rght, top-down scan j Lne drawng A ver mportant operaton used frequentl, block dagrams, bar charts, engneerng drawng, archtecture plans, etc. curves
More informationA Simple and Efficient Goal Programming Model for Computing of Fuzzy Linear Regression Parameters with Considering Outliers
62626262621 Journal of Uncertan Systems Vol.5, No.1, pp.62-71, 211 Onlne at: www.us.org.u A Smple and Effcent Goal Programmng Model for Computng of Fuzzy Lnear Regresson Parameters wth Consderng Outlers
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 informationFitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.
Fttng & Matchng Lecture 4 Prof. Bregler Sldes from: S. Lazebnk, S. Setz, M. Pollefeys, A. Effros. How do we buld panorama? We need to match (algn) mages Matchng wth Features Detect feature ponts n both
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 informationMETRIC ALIGNMENT OF LASER RANGE SCANS AND CALIBRATED IMAGES USING LINEAR STRUCTURES
METRIC ALIGNMENT OF LASER RANGE SCANS AND CALIBRATED IMAGES USING LINEAR STRUCTURES Lorenzo Sorg CIRA the Italan Aerospace Research Centre Computer Vson and Vrtual Realty Lab. Outlne Work goal Work motvaton
More informationPROJECTIVE RECONSTRUCTION OF BUILDING SHAPE FROM SILHOUETTE IMAGES ACQUIRED FROM UNCALIBRATED CAMERAS
PROJECTIVE RECONSTRUCTION OF BUILDING SHAPE FROM SILHOUETTE IMAGES ACQUIRED FROM UNCALIBRATED CAMERAS Po-Lun La and Alper Ylmaz Photogrammetrc Computer Vson Lab Oho State Unversty, Columbus, Oho, USA -la.138@osu.edu,
More information3D Face Reconstruction With Local Feature Refinement
ternatonal Journal of Multmeda and Ubqutous Engneerng Vol.9, No.8 (014), pp.59-7 http://dx.do.org/10.1457/jmue.014.9.8.06 3D Face Reconstructon Wth Local Feature Refnement Rudy Adpranata 1, Kartka Gunad
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationClassification / Regression Support Vector Machines
Classfcaton / Regresson Support Vector Machnes Jeff Howbert Introducton to Machne Learnng Wnter 04 Topcs SVM classfers for lnearly separable classes SVM classfers for non-lnearly separable classes SVM
More informationDistance Calculation from Single Optical Image
17 Internatonal Conference on Mathematcs, Modellng and Smulaton Technologes and Applcatons (MMSTA 17) ISBN: 978-1-6595-53-8 Dstance Calculaton from Sngle Optcal Image Xao-yng DUAN 1,, Yang-je WEI 1,,*
More 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 informationRELATIVE ORIENTATION ESTIMATION OF VIDEO STREAMS FROM A SINGLE PAN-TILT-ZOOM CAMERA. Commission I, WG I/5
RELATIVE ORIENTATION ESTIMATION OF VIDEO STREAMS FROM A SINGLE PAN-TILT-ZOOM CAMERA Taeyoon Lee a, *, Taeung Km a, Gunho Sohn b, James Elder a a Department of Geonformatc Engneerng, Inha Unersty, 253 Yonghyun-dong,
More informationCS 231A Computer Vision Midterm
CS 231A Computer Vson Mdterm Tuesday October 30, 2012 Set 1 Multple Choce (22 ponts) Each queston s worth 2 ponts. To dscourage random guessng, 1 pont wll be deducted for a wrong answer on multple choce
More information3D Modeling Using Multi-View Images. Jinjin Li. A Thesis Presented in Partial Fulfillment of the Requirements for the Degree Master of Science
3D Modelng Usng Mult-Vew Images by Jnjn L A Thess Presented n Partal Fulfllment of the Requrements for the Degree Master of Scence Approved August by the Graduate Supervsory Commttee: Lna J. Karam, Char
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 informationWireless Sensor Network Localization Research
Sensors & Transducers 014 by IFSA Publshng, S L http://wwwsensorsportalcom Wreless Sensor Network Localzaton Research Lang Xn School of Informaton Scence and Engneerng, Hunan Internatonal Economcs Unversty,
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 informationLine-based Camera Movement Estimation by Using Parallel Lines in Omnidirectional Video
01 IEEE Internatonal Conference on Robotcs and Automaton RverCentre, Sant Paul, Mnnesota, USA May 14-18, 01 Lne-based Camera Movement Estmaton by Usng Parallel Lnes n Omndrectonal Vdeo Ryosuke kawansh,
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 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 informationMorphological and Median Adaptive Filters Based on LCBP Rank Filter
Telfor Journal Vol 5 No 2 2013 123 Morphologcal and Medan Adaptve Flters Based on LCBP ank Flter Dragana Prokn Member IEEE and Mlan Prokn Member IEEE Abstract The presented medan and morphologcal (mn and
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 information3D Face Reconstruction With Local Feature Refinement. Abstract
, pp.6-74 http://dx.do.org/0.457/jmue.04.9.8.06 3D Face Reconstructon Wth Local Feature Refnement Rudy Adpranata, Kartka Gunad and Wendy Gunawan 3, formatcs Department, Petra Chrstan Unversty, Surabaya,
More informationEfficient Off-Line Cursive Handwriting Word Recognition
Effcent Off-Lne Cursve Handwrtng Word Recognton B. Gatos, I. Pratkaks, A.L. Kesds, S.J. Perantons To cte ths verson: B. Gatos, I. Pratkaks, A.L. Kesds, S.J. Perantons. Effcent Off-Lne Cursve Handwrtng
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 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 informationIntroduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2
Introducton to Geometrcal Optcs - a D ra tracng Ecel model for sphercal mrrors - Part b George ungu - Ths s a tutoral eplanng the creaton of an eact D ra tracng model for both sphercal concave and sphercal
More informationA Gradient Difference based Technique for Video Text Detection
A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng, Natonal Unversty of Sngapore {shva, phanquyt, tancl }@comp.nus.edu.sg
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 informationImage warping and stitching May 5 th, 2015
Image warpng and sttchng Ma 5 th, 2015 Yong Jae Lee UC Davs PS2 due net Frda Announcements 2 Last tme Interactve segmentaton Feature-based algnment 2D transformatons Affne ft RANSAC 3 1 Algnment problem
More informationA Gradient Difference based Technique for Video Text Detection
2009 10th Internatonal Conference on Document Analyss and Recognton A Gradent Dfference based Technque for Vdeo Text Detecton Palaahnakote Shvakumara, Trung Quy Phan and Chew Lm Tan School of Computng,
More information12. Segmentation. Computer Engineering, i Sejong University. Dongil Han
Computer Vson 1. Segmentaton Computer Engneerng, Sejong Unversty Dongl Han Image Segmentaton t Image segmentaton Subdvdes an mage nto ts consttuent regons or objects - After an mage has been segmented,
More informationA PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION
1 THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Seres A, OF THE ROMANIAN ACADEMY Volume 4, Number 2/2003, pp.000-000 A PATTERN RECOGNITION APPROACH TO IMAGE SEGMENTATION Tudor BARBU Insttute
More informationMOTION BLUR ESTIMATION AT CORNERS
Gacomo Boracch and Vncenzo Caglot Dpartmento d Elettronca e Informazone, Poltecnco d Mlano, Va Ponzo, 34/5-20133 MILANO boracch@elet.polm.t, caglot@elet.polm.t Keywords: Abstract: Pont Spread Functon Parameter
More informationMULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION
MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and
More 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 information3D object recognition with photon-counting integral imaging using independent component analysis
3D object recognton wth photon-countng ntegral magng usng ndependent component analss Cuong Manh Do Department of Electrcal & Computer Engneerng, Unverst of Connectcut, 371 Farfeld Road U-2157, Storrs,
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 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 informationPerspective rectification for mobile phone camera-based documents using a hybrid approach to vanishing point detection
Perspectve rectcaton or moble phone camera-based documents usng a hbrd approach to vanshng pont detecton Xu-Cheng Yn Jun Sun Satosh ao Fujtsu R&D Center Co. td, Bejng, Chna {uchengn; sunjun; nao}@cn.ujtsu.com
More informationChapter 4. Non-Uniform Offsetting and Hollowing by Using Biarcs Fitting for Rapid Prototyping Processes
Chapter 4 Non-Unform Offsettng and Hollowng by Usng Barcs Fttng for Rapd Prototypng Processes Ths chapter presents a new method of Non-Unform offsettng and usng barc fttngs to hollow out sold objects or
More informationA Probabilistic Approach to Detect Urban Regions from Remotely Sensed Images Based on Combination of Local Features
A Probablstc Approach to Detect Urban Regons from Remotely Sensed Images Based on Combnaton of Local Features Berl Sırmaçek German Aerospace Center (DLR) Remote Sensng Technology Insttute Weßlng, 82234,
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 informationDimensionality Reduction and Clustering on Statistical Manifolds
Dmensonalt Reducton and Clusterng on Statstcal Manfolds Sang-Mook Lee and A. Lnn Abbott Vrgna Poltechnc Insttute and State Unverst Blacksburg, VA 24061, USA LSMOOK@vt.edu, abbott@vt.edu Phlp A. Araman
More informationFeature Estimation and Registration of Point Clouds in Reverse Engineering
Amercan Journal of Mechancal and Materals Engneerng 017; 1(4): 83-87 http://www.scencepublshnggroup.com/j/ajmme do: 10.11648/j.ajmme.0170104.15 Feature Estmaton and Regstraton of Pont Clouds n Reverse
More informationPalmprint Feature Extraction Using 2-D Gabor Filters
Palmprnt Feature Extracton Usng 2-D Gabor Flters Wa Kn Kong Davd Zhang and Wenxn L Bometrcs Research Centre Department of Computng The Hong Kong Polytechnc Unversty Kowloon Hong Kong Correspondng author:
More informationVISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
More informationPCA Based Gait Segmentation
Honggu L, Cupng Sh & Xngguo L PCA Based Gat Segmentaton PCA Based Gat Segmentaton Honggu L, Cupng Sh, and Xngguo L 2 Electronc Department, Physcs College, Yangzhou Unversty, 225002 Yangzhou, Chna 2 Department
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 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 informationFingerprint matching based on weighting method and SVM
Fngerprnt matchng based on weghtng method and SVM Ja Ja, Lanhong Ca, Pnyan Lu, Xuhu Lu Key Laboratory of Pervasve Computng (Tsnghua Unversty), Mnstry of Educaton Bejng 100084, P.R.Chna {jaja}@mals.tsnghua.edu.cn
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 informationBiostatistics 615/815
The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts
More informationImage Matching Algorithm based on Feature-point and DAISY Descriptor
JOURNAL OF MULTIMEDIA, VOL. 9, NO. 6, JUNE 2014 829 Image Matchng Algorthm based on Feature-pont and DAISY Descrptor L L School of Busness, Schuan Agrcultural Unversty, Schuan Dujanyan 611830, Chna Abstract
More informationA high precision collaborative vision measurement of gear chamfering profile
Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) A hgh precson collaboratve vson measurement of gear chamferng profle Conglng Zhou, a, Zengpu Xu, b, Chunmng
More informationVanishing Hull. Jinhui Hu, Suya You, Ulrich Neumann University of Southern California {jinhuihu,suyay,
Vanshng Hull Jnhu Hu Suya You Ulrch Neumann Unversty of Southern Calforna {jnhuhusuyay uneumann}@graphcs.usc.edu Abstract Vanshng ponts are valuable n many vson tasks such as orentaton estmaton pose recovery
More informationCONTINUOUSLY DEFORMATION MONITORING OF SUBWAY TUNNEL BASED ON TERRESTRIAL POINT CLOUDS
Internatonal Archves of the Photogrammetr, Remote Sensng and Spatal Informaton Scences, Volume XXXIX-B5, 1 XXII ISPRS Congress, 5 August 1 September 1, Melbourne, Australa CONTINUOUSLY DEFORMATION MONITORING
More information