Medical Image Segmentation of Blood Vessels Based on Clifford Algebra and Voronoi Diagram
|
|
- Jeremy Kennedy
- 5 years ago
- Views:
Transcription
1 Medical Image Segmetatio of Blood Vessels Based o Clifford Algebra ad Vorooi Diagram Zhe Jie Huag, Guo Heg Huag*, Liag Lu Cheg College of Automatio, Guagdog Uiversity of Techology, Guagzhou510006, Guagdog, Chia. *Correspodig author. Tel: ; keviwogdh@126.com Mauscript submitted May 21, 2018; accepted Jue 5, doi: /jsw Abstract: First, a regio growig algorithm based o Clifford algebra is put forward to segmet blood vessels of abdomial aorta. Compared with the traditioal regio growig method, the proposed algorithm is easy to operate ad good at robustess. Furthermore, it is available to segmet both ormal ad abormal blood vessels of abdomial aorta: the seed poit ca keep o growig eve whe there are some isolated poits i regio of blood vessels. The key poit of this algorithm is that: the gray values of eight eighborhood poits are composed as uit feature vectors of curret seed poits, ad the Clifford algebra vector product represetatio will be applied. Secod, for the purpose to segmet thier global abdomial blood vessels rapidly, a ovel segmetatio algorithm of blood vessels based o 2D Vorooi diagram is put forward as a attempt. Experimets demostrate that it is potetial to segmet thier global abdomial blood vessels fast. I the future, this algorithm is potetial to segmet blood vessels i abdomial orgas. Key words: Medical image segmetatio, blood vessels, Clifford algebra, Vorooi diagram 1. Itroductio Recetly, virtual surgeo simulatio becomes more ad more importat to assist surgeo ad perform better therapy treatmet. Research o virtual surgeo simulatio geerally icludes extractio for the Regio of Iterest (ROI), 3D recostructio for medical images; surgeo simulatio ad so o. Therei, for the purpose to reduce the amout of data ad locate lesios, extractig the ROI is very importat, such as blood vessels, tumors ad other orgas segmetatio. There are may methods applied to segmet vessels from differet huma orgas. Segmetatio of vessels maily icludes segmetatio for liver vessels, retial vessels ad cholic vessels etc. May methods were proposed ito this field to segmet vessels of differet orgas. Therei, a algorithm based o a NN scheme for voxel classificatio was applied to segmet retial vessels [1]. However, it could oly be applied to 2D images but 3D image series. Eseault et al. proposed a fast ad fully automatic method based o geometric momets ad Graph Cut techique to segmet liver vessels [2]. However, this algorithm was ot effective to segmet thier vessels ad sesitive to iterpolatio of image slices. Bashar et al put forward a compoet-based structural measure amed Hole Area Idex (HAI) to isolate boe, soft-tissue structures ad segmet thier ad larger vessels [3]. However, pre-ehacemet was ecessary to icorporate some missig thier vessels, ad these ehacemets also ehaced udesired structures. Moreover, level set theory is oe of the most popular methods which are applied to vessels segmetatio. Therei, Hog et al put forward local biary fittig eergy i the hybrid level set method to extract local iformatio o MRA image more accurately, ad it could also be applied o 361 Volume 13, Number 6, Jue 2018
2 CT image [4]. Although it could solve the problem that traditioal hybrid level set could ot produce a satisfactory segmetatio for medical images with high itesity homogeeity, it was oly a solutio to segmet thier vessels. So far, oe of the above solutios could be successful to segmet vessels o low cotrast ad heterogeeous eviromets, especially for elimiatig boes aroud lager vessels. To our best kowledge, there are few methods so far which are applied for the global abdomial vessel extractio without the boes aroud vessels [3]. It is difficult to segmet vessels without boes. Therefore, we propose two ovel algorithms to segmet abdomial vessel. O oe had, 3D regio growig algorithm based o Clifford algebra vector product represetatio is put forward to segmet the blood vessels for abdomial aorta; o the other had, for the purpose to segmet thier global abdomial vessel without major boes ad orgas, aother ovel blood vessel segmetatio algorithm based o 2D Vorooi diagram is also put forward as a attempt. 2. Related Works 2.1. Clifford Algebra Let e0, e1..., e be a orthogoal basis i the liear space over R [5], the Clifford algebra A is a 2 2 associative algebra which is composed by e0, e1..., e, the e e, e e e ee e, e 1, i 1, 2,,. e e e e,1 i j. i j j i Elemets i 1 p 1 A are kow as the Clifford algebra, 0 0 i 0 0 i i i x e, x A, x have the form that 0 A A A A ( h,, h ), 1 h h,1 p, e e 1e 2 e, R. Obviously, A is 2-dimesioal associative p A h h hr A ad o-commutative algebra. If Clifford algebra x has the form x x0 xiei, x is called as Clifford vector. For is x A, Clifford mold of x is defied as xi i 1 x 2 ( ) If. x x e ad i i i 1 multiplicatio, i 1 i i x 2 ( A ) i 1. Especially, the mold of Clifford vector x y y e are two uit Clifford vector, i accordace with the rule of Clifford algebra xy ( x e )( y e ) x y ( x y x y ) e e (1) i i i i i i i j j i i j i 1 i 1 i 1 1 i, j Uder ormal circumstaces, the product of two -dimesioal Clifford vector is o loger a -dimesioal Clifford vector. I other words, the Clifford vector by the -dimesioal liear subspace Clifford multiplicatio is ot closed. x y is deoted by product of x ad y. 1 i, j ( x y x y ) e e i j j i i j, ad it is defied as the outer Theorem Suppose that q 1 ad q 2 are pure uit Clifford algebra, ad the compoets of q 1 ad q 2 are all o-egative. The q1 q2 q1q 2 q1 q Dimesio Vorooi Digram Dirichlet ad Vorooi firstly itroduced this cocept. This cocept was used to research the quadratic form: let quadratic matrix of data be as a ode, ad the scope of ode was reflected by the Euclidea orm. Later, this cocept was kow as Vorooi diagram [6]-[9]. Vorooi firstly studied this structure o the dual ature which was metioed by Descartes. He coected all adjacet odes through lies, ad got a triagular mesh fially. Subsequetly, Delauay studied the triagulatio of two-dimesioal poit set ad obtaied the same triagular mesh. The Delauay studied 362 Volume 13, Number 6, Jue 2018
3 two-dimesioal poit set triagulatio ad obtaied the same triagular mesh what Vorooi got before. Each edge of this triagle mesh was strictly limited what was give by Delauay: there is a roud that goes pass the edge of two edpoits, ad this circle does ot cotai the other poit. Vorooi ad Delauay s results proved the dual graph foud by Vorooi was the triagular mesh costructed by Delauay. Thereupo, the dual graph of Vorooi diagram was also amed as Delauay triagulatio. The priciple of 2D Vorooi diagram classificatio is that [10]: classify the pedig processed area i image by usig 2D, ad iterate util fid out the boudary of the image. I the case of 2D plae, plae is divided ito several areas refer to discrete poits of plae. Therei, there a discrete poit i each area which is a set that most early to the poit. It is defied as: For pi V, 1 2 d( p, x) ( p x ) ( p x ) 2 V { p, p, p}, the Vor( pi ) { x R d( x, pi ) d( x, p j), j i,1 j }. Therei, is the Euclidea distace betwee p p1, p2 ( ) ad x x, x. Besides, Delauay triagulatio ad Vorooi diagram is duality. There is a correspodig Delauay triagulatio to each give 2D Vorooi diagram. The specific relatioship is as follows: i 2D plae, the Vorooi vertex of each 2D Vorooi diagram correspods to a triagle i the Delauay triagulatio, ad this vertex is the circumceter of the triagle i the Delauay triagulatio; each edge i the 2D Vorooi diagram correspods to oe edge i the Delauay triagulatio, ad they will be vertical; each sub-structure for 2D Vorooi diagram correspods to a vertex i the Delauay triagulatio, ad this vertex is the Delauay triagulatio which correspods to the vertex of the sub-structure of Vorooi diagram. 1 2 (b) Fig. 1. 2D Vorooi digram: Delauay triagulatio of 16 poits; (b) correspodig Vorooi divisio. I additio, for image processig, the vertices of the 2D Vorooi diagram are the "skeleto" of a closed coected regio i the image plae. At preset, algorithms based o 2D Vorooi diagram eve 3D Vorooi diagram have bee applied i the field of image segmetatio, fluid simulatio ad so o. 3. Algorithms 3.1. Regio Growig Based o Clifford Algebra I order to go o growig i the blood vessels areas with isolated voxels whe we segmet the blood vessels, a ovel Regio Growig algorithm based o Clifford algebra is put forward to segmet more blood vessels of abdomial aorta. I accordace with Clifford algebra vector product represetatio theorem which was metioed at the previous sectio, if two uit vectors are equal whe ad oly whe their ier product value is 1; if two uit vectors are similar, their ier product will be closer to 1. I 3D data of CT image series, if two adjacet voxels are the same or similar, the ier product betwee the eight-dimesioal feature vectors composed by the gray values of their eight eighborhoods should be equal to 1 or ear to 1. Sum up, the procedure of Regio Growig algorithm based o Clifford algebra is: Step 1, iput k pieces of m cotiguous CT series images (3D volume data, size is m k), ad select the iitial seed poits i target areas. 363 Volume 13, Number 6, Jue 2018
4 Step 2, calculate the gray values of eight eighborhoods of curret seed poit, ad they will compose a eight-dimesioal vector ad be uitized. The the eight-dimesioal uit vector is defied as the eight-dimesioal uit feature vector of curret seed poit, it represets the feature of curret seed poit. The defiitio of eight eighborhoods i Regio Growig algorithm based o Clifford algreba is as Fig. 2. Fig. 2. The defiitio of eight eighborhoods of Regio Growig based o Clifford algebra. Step 3, calculate the uit eight-dimesioal feature vectors of six eighborhoods of curret seed poits, ad fid the eighborhoods whose ier products of feature vector with curret seed poit withi a give iterval which is close to 1 (i this paper, the give iterval is [0.995,1] ). The these eighborhoods will be icorporated ito the curret voxel regio of seed poit, ad become a ew seed poit. Iterate is over whe eighborhood which fulfills the rule caot be foud agai. The workflow chart of this algorithm is as Fig. 3. Etry Iput CT image series.; select iitial seed poits. Calculate Eight-dimesioal feature vectors of curret seed poits The eighborhoods will be the ew seed poits. Yes Is there eighborhood of curret seed poits? Is there ier product i give iterval? Yes, calculate Feature vectors of curret seed poits; feature vector ier product betwee seed poits ad their eighborhoods No No Iteratio is over; output the result. Exit Fig. 3. The flow chart of regio growig based o Clifford algebra. 364 Volume 13, Number 6, Jue 2018
5 Differet from traditioal Regio Growig algorithms which just cosider the gray value of the curret poits, Regio Growig algorithm based o Clifford algebra fully cosiders the feature of eighborhoods of curret poits Vessesl Segmetatio based o 2D Vorooi Digram It has bee lackig a feasible way to segmet the global thier abdomial blood vessels (thier blood vessels are defied as o-aortic vessels whose size are less tha or equal to the size of the third layer of abdomial aorta). I additio, the segmetatio of thier o-aortic abdomial blood vessels is very importat to surgeo of pacreas, splee ad other abdomial orgas. I CT series, it icludes three mai types of the thier abdomial blood vessels: horizotal vessels, diagoal vessels ad vertical vessels. The thier horizotal blood vessels would be rough thi lies i each CT slice; the thier vertical blood vessels would be thi poits i pre CT slice; the thier diagoal blood vessels would be regarded as the combiatio of thi lies ad thi poits i each CT slice. Therefore, at the premise of beig deoised, if thi lies ad poits i each slice ca be segmeted that meas it is possible to segmet the thier abdomial blood vessels. Combied with the Vorooi diagram theory which was metioed previously, a ovel segmetatio algorithm of blood vessels based o 2D Vorooi diagram is desiged specifically for segmetatio of the global thier abdomial blood vessels. The whole procedure will be: Step 1, import the origial CT series oe by oe, ad the Threshold segmetatio is applied as pre-segmetatio, the remaiig are all orgas, blood vessels ad boes. The, import the origial CT series oe by oe agai, ad the traditioal Regio Growig is applied to segmet abdomial aorta. Fially, subtract the results of Threshold segmetatio ad Regio Growig. The remaiig will be voxels of boes, orgas ad thier abdomial blood vessels. Step 2, cosider the edge voxels as samplig poits, ad the iput them as the iitial vertices of algorithm based o two-dimesioal Vorooi diagram. The, execute this algorithm ad the output result is the set of Vorooi vertices. For each closed iterval (ier vessels regio), there exist a cetral axis which coect to the vertices of each Vorooi diagram, ad it ca be see as "skeleto" of two-dimesioal blood vessel images. It is possible that a samplig poit is the itersectio of eclosed areas, so it may correspod to more tha oe axis. Defie the set of cetral axis which correspods to samplig poit P as Q, ad the defie the size of two-dimesioal image by usig the shortest distace from P to Q. Step 3, set the threshold radius, ad the samplig whose distace to cetral axis does ot exceed the threshold will be retaied. Durig actual operatio, the desity of samplig poits is high, so the samplig poit to the distace correspodig to two-dimesioal Vorooi vertex set ca be approximated as the distace betwee the samplig poit ad the cetral axis set. Whe the distace does ot exceed the radius is to keep the samplig poits. After this operatio, the samplig poit set is expressed as R. Step 4, calculate the Delauay triagulatio of R. The triagulatio impacts iside ad outside of the eclosed regio. As the result of a eclosed area iside is eeded, it is ecessary to remove the exteral triagle regio. Through observatio, the triagles i the triagulatio of outside regio, the shape mostly is the sleder-shaped obtuse triagle; however, more acute triagle is iside the eclosed regio, eve if there is a obtuse triagle, its circumcircle radius must ot exceed the radius. Therefore, to calculate the radius of all the circumcircle of the triagle, Threshold filterig, it ca remove the triagular area outside the eclosed area, ad results of the etire algorithms are obtaied fially. 365 Volume 13, Number 6, Jue 2018
6 (b) (c) (d) (e) Fig. 4. The whole process of segmetatio algorithm based o 2D Vorooi diagram: origial image; (b) iitial result of traditioal threshold segmetatio; (c) result of traditioal regio growig; (d) subtractig result betwee results of threshold segmetatio ad regio growig; (e) the fial result of the proposed segmetatio algorithm based o 2D Vorooi diagram. Etry Iput CT image. Threshold segmetatio Subtract ad obtai No abdomial vessels, boes ad orgas Threshold segmetatio Deaulay triagulatio is applied to R; output the result. Exit Threshold radius is give; samplig poits whose distace are ot exceed the threshold radius are retaied as the set R. Fig. 5.The flow chart of Vessel Segmetatio based o Vorooi diagram. I additio, because of the complexity of the eclosed area (several small holes i the iteral of large area), Deaulay triagulatio made mistakes o segmetig part of the backgroud. To solve this problem, sample the voxels iside the triagle by the color iformatio to determie whether it belogs to the foregroud. I egieerig, bitwise operatios are applied to combie with the fillig after Delauay triagulatio with the origial image. 4. Experimetal Results All experimets will be performed i Microsoft Widows7. I this thesis, all experimetal data for 366 Volume 13, Number 6, Jue 2018
7 Abdomial CT images were provided by the Pearl River Hospital from Souther Medical Uiversity, ad the size of each slice of images is The experimetal eviromet is: CPU is Itel Core i7-3517u 1.90GHz CPU, ad RAM is 4GB Regio Growig Based o Clifford Algebra Segmet S50 (365 slices) ad S70 (320 slices) these two sets of data with abdomial aorta respectively by regio growig based o cofidet iterval ad Clifford algebra, ad compare the results. First, segmet the abdomial aorta for S50 ad S70 by the two algorithms, ad the select four iitial seed poits. The iitial seed poits is distributed as Fig. 6. (b) Fig. 6. The distributio of iitial seed poits o S50 ad S70: the iitial seed poits o slice 183rd of S50; (b) the iitial seed poits o slice 161st of S70. The segmetatio results for abdomial aorta from S50 by usig traditioal regio growig based o cofidet iterval ad the proposed segmetatio algorithm based Clifford algebra are show by Fig. 7. (b) (c) (d) (e) (f) Fig. 7. The segmetatio result of abdomial aorta from two algorithms o S50: & (d) the origial images o slice 182d ad 205th; (b) & (e) results from regio growig based o cofidet iterval; (c) & (f) results from the proposed method based o Clifford algebra. 367 Volume 13, Number 6, Jue 2018
8 The segmetatio results for abdomial aorta from S70 by usig regio growig based o Cofidet iterval ad Clifford algebra are show by Fig. 8. (b) (c) (d) (e) (f) Fig. 8. The segmetatio result of abdomial aorta from three algorithms o S70: & (d) the origial images o slice 109th ad 199th; (b) & (e) results from regio growig based o cofidet iterval; (c) & (f) results from the proposed method based o Clifford algebra. The 3D recostructio results o S50 ad S70 which are obtaied after Regio Growig algorithms based o Cofidet iterval ad Clifford algebra are show respectively by Fig. 9 ad 10. (b) Fig. 9. The 3D recostructio results of two algorithms o S50: result from regio growig based o cofidet iterval; (b) result from the proposed method based o Clifford algebra. (b) Fig. 10. The 3D recostructio results of two algorithms o S70: result from regio growig based o cofidet iterval; (b) result from the proposed method based o Clifford algebra. 368 Volume 13, Number 6, Jue 2018
9 The, abdomial o-aorta from S50 with oly oe iitial seed poit will be segmeted by traditioal Regio Growig, Regio Growig based o Cofidet iterval ad Clifford algebra. The iitial seed poit ad results of segmetatio are show by Fig. 11. (b) (c) (d) (e) (f) (g) (h) (i) Fig. 11. Visual compariso o S50: seed poit of S50, slice 1st; (b) & (f) the origial images; (c) & (g) results from traditioal regio growig; (d) & (h) results from regio growig based o cofidet iterval; (e) & (i) results from the proposed method based o Clifford algebra. The 3D recostructio results o abdomial o-aorta from S50 which are extracted after Regio Growig algorithms based o Cofidet iterval ad Clifford algebra are show by Fig. 12. (b) (c) Fig. 12. The 3D recostructio result of three algorithms: result from traditioal regio growig; (b) result from regio growig based o cofidet iterval; (c) result from the proposed method based o Clifford algebra. Afterwards, performace aalysis of segmetatio of Regio Growig algorithm based o traditioal Cofidet iterval ad Clifford algebra o S50 (365 slices, four seed poits), S70 (320 slices, four seed poits) ad S50 (oe seed poit) will be show as the below tables. Table 1. Segmetatio Summary for S50 Part1 Method Rutime Aalysis Cofidet iterval s Fewer vessels were segmeted; boes ad orgas were ot segmeted. Clifford algebra s More vessels were segmeted; boes ad orgas were segmeted. 369 Volume 13, Number 6, Jue 2018
10 Table 2. Segmetatio Summary for S50 Part2 Method Rutime Aalysis Regio growig 68.34s Fewest vessels were segmeted. Cofidet iterval 99.02s Fewer vessels were segmeted. Clifford algebra s Most vessels were segmeted. Table 3. Segmetatio Summary for S70 Method Rutime Aalysis Cofidet iterval s Fewer vessels were segmeted. Clifford algebra s More vessels were segmeted, but part of liver was segmeted. 3D regio growig algorithm based o Clifford algebra vector product represetatio are proposed by this paper, ad experimetal performace data ca be see from the above tables: whe traditioal Regio Growig algorithm ad Regio Growig algorithm based o Cofidece iterval are applied to segmeted abdomial aorta, if it grows to the isolated voxels betwee the regios of vessels, it may ot keep o growig. However, it is ot oly that the curret voxels' gray values are cosidered by 3D regio growig algorithms based o Clifford algebra, but also the eighborhoods of the curret voxels are cosidered. Therefore, o oe had, if there is oly oe breakpoit i the vessel regios, the seed poits ca cotiue to grow ad segmet the blood vessels by these two methods; o the other had, comparig with algorithm based o Clifford algebra, though more layers of abdomial aorta are segmeted by the algorithm based o Clifford algebra tha traditioal Regio Growig, some of o-iterestig regios were be extracted such as other orgas or boes. The reaso is too may eighborhoods are cosidered to compose a feature vector of the seed poits to blur the differeces betwee poits. The seed poits would grow to o-iterestig regios of differet qualities Vessesl Segmetatio Based o 2D Vorooi Digram Compared with traditioal Threshold segmetatio, blood segmetatio algorithm based o 2D Vorooi diagram is applied to segmet thier abdomial blood vessels from first 80 slices of S50 ad S70. The segmetatio results are show by Fig. 13 ad 14. (b) (c) (d) (e) (f) Fig. 13. The segmetatio results of S50 i its first 80 slices: & (d) the origial images; (b) & (e) results from traditioal threshold segmetatio; (c) & (f) results from the proposed segmetatio based o 2D Vorooi diagram. 370 Volume 13, Number 6, Jue 2018
11 (b) (c) (d) (e) (f) Fig. 14. The segmetatio results of S70 i its first 80 slices: & (d) the origial images; (b) & (e) results from traditioal threshold segmetatio; (c) & (f) results from the proposed segmetatio based o 2D Vorooi diagram. The 3D recostructio of the segmetatio results of these algorithms are show by Fig. 15 ad 16. (b) Fig. 15. The recostructio of thier blood vessels of abdomial o-aorta o the first 80 slices of S50. (b) Fig. 16. The recostructio of thier blood vessels of abdomial o-aorta o the first 80 slices of S70. It ca be see from two previous figures: o oe had, more of thier blood vessels of abdomial 371 Volume 13, Number 6, Jue 2018
12 o-aorta excludig mostly boes ad soft tissue by algorithm based o 2D Vorooi diagram, but there will be more discrete poits i the segmetatio results; o the other had, Threshold segmetatio may ot oly segmet fewer thi blood vessels, but also o-iterested orgas. Compared with the 3D Regio Growig algorithm based o Clifford algebra, poorer segmetatio results are got by algorithm based o 2D Vorooi diagram. It eeds to select may iitial seed poits to segmet the global vessels that may waste a lot of time to compute. However, the thier blood vessels of abdomial o-aorta ca be segmeted rapidly by algorithm based o 2D Vorooi diagram. This method is potetial to be applied i cliical practice. Method Rutime Aalysis Threshold 14.25s 2D Vorooi diagram s Table 4. Segmetatio Summary for S50 Fewer thi vessels were segmeted. Orgas ad boes were segmeted. There was ot isolated voxel. More thi vessels were segmeted. Orgas ad boes were almost ot segmeted. But there were may isolated voxels. Table 5. Segmetatio Summary for S70 Algorithm Rutime Aalysis Threshold 18.94s Almost o thi vessel was segmeted. 2D Vorooi diagram s More thi vessels were segmeted. Orgas ad boes were almost ot segmeted. But there were may isolated voxels. A ovel segmetatio algorithm based o 2D Vorooi diagram is proposed to segmet more thi blood vessels of abdomial o-aorta excludig the boes ad soft tissue. However, there will be may discrete poits are segmeted by this algorithm. It is due to that this algorithm is a 2D algorithm that cosiders each slice oe by oe, but cosiders the relatioship betwee each slice. However, Vorooi diagram theory has bee promoted to 3D, thus blood segmetatio algorithm based o 3D Vorooi diagram is potetial to solve this problem i the future. 5. Coclusio Research o the segmetatio of the abdomial blood vessels is focused o 3D medical images. First, existig segmetatio methods applied to abdomial aorta segmetatio are ot good eough. Therefore, a ew algorithm based o hypercomplex-3d regio growig algorithm based o Clifford algebra is applied to segmet abdomial arterial vessels. Compared with traditioal regio growig, Hessia matrix ad geetic algorithm etc., this algorithm is easy to operate ad good at robustess. Therefore, it is available to segmet both ormal ad abormal blood vessels of abdomial aorta: the seed poit ca go o growig, eve whe there are some isolated poits i regio of blood vessels. However, compared with traditioal Regio Growig algorithms, this algorithm is ot fast eough i computig, thus the future work will be focused o algorithm optimizatio or GPU acceleratio. Secod, it has bee lackig a algorithm which ca segmet thier global abdomial blood vessels rapidly. A ovel segmetatio algorithm of blood vessels based o 2D Vorooi diagram is put forward as a attempt. Experimets demostrate that it is valid to segmet thier global abdomial blood vessels by usig this algorithm. However, the algorithm is still i the ifacy, ad has the followig shortcomigs: first, there are some isolated voxels i the segmetatio result. It is all because that segmetatio algorithm of blood vessels based o 2D Vorooi diagram is a 2D method, ad it does ot cosider the relatioship betwee the adjacet slices. Secod, the segmetatio result depeds partly o the pre-segmetatio result from Threshold ad Regio Growig. I future work, we will cotiue to study the blood vessels segmetatio algorithm based o 3D Vorooi diagram. The future work will be to cosider the relatioship betwee the adjacet slices ad remove discrete breakpoits. Besides, this algorithm will also be applied to segmet blood vessels i 372 Volume 13, Number 6, Jue 2018
13 abdomial orgas. Ackowledgmet This work was sposored by Natioal Nature Sciece Foudatio of Chia (grat umber ), Natioal Key R&D Pla of Chia (grat umber 2016YFC ). Refereces [1] Mari, D., Aquio, A., Gegudez-Arias, M. E., & Bravo, J. M. (2011). A ew supervised method for blood vessel segmetatio i retial images by usig gray-level ad momet ivariats-based features. IEEE Trasactios o Medical Imagig, 30, [2] Eseault, S., Lafo, C., & Dilleseger, J. L. (2010). Liver vessels segmetatio usig a hybrid geometrical momets/graph cuts method. IEEE Trasactios o Biomedical Egieerig, 57, [3] Bashar, M. K., Mori, K., & Kobayashi, T. J. (2010). Automatic segmetatio of abdomial blood vessels from cotrasted X-ray CT images. Proceedigs of the 2010 Iteratioal Coferece o Electrical ad Computer Egieerig (pp ). [4] Hog, Q., Li, Q., & Tia, J. (2010). Local hybrid level-set method for MRA image segmetatio. Proceedigs of the 2010 IEEE 10th Iteratioal Coferece o Computer ad Iformatio Techology. (pp ). [5] Gog, Y., Leog, I. T., & Qia, T. (2009). Two itegral operators i Clifford aalysis. Joural of Mathematical Aalysis ad Applicatios, 354, [6] Liu, W., & Li, X. A ew octoio method for edge detectioof color image. Preprited. [7] Okabe, A., Boots, B., & Sugihara, K. (1992). Spatial tessellatios: Cocepts ad applicatios of Vorooi diagrams: Joh Wiley & Sos, Ic. [8] Aurehammer, F. (1991). Vorooi diagrams ad mdash, a survey of a fudametal geometric data structure. ACM Comput. Surv., 23, [9] Reem, D. (2009). A algorithm for computig vorooi diagrams of geeral geerators i geeral ormed spaces. preseted at the Proceedigs of the 2009 Sixth Iteratioal Symposium o Vorooi Diagrams. [10] Vorooi_diagram. Retrieved from Zhejie Huag was bor i Guagdog provice, Chia, i He graduated i automatio from Guagdog Uiversity of Techology i He is a master s studet i school of automatio of Guagdog Uiversity of Techology. His curret research is about digital image processig, deep learig ad computer visio. Guoheg Huag was bor i Guagdog provice, Chia, i He received PhD degree i Macau Uiversity. He is a lecturer ad teaches i Guagdog Uiversity of Techology sice His research iterests iclude deep learig, computer visio ad machie leaig. Liaglu Cheg was bor i Hubei provice, Chia, i 1964, is a Prof. ad doctoral supervisor of Faculty of Automatio, Guagdog Uiversity of Techology. He received PhD degree i Huazhog Uiversity of Sciece ad Techology. His curret research is about computer visio, image data compressio etc. 373 Volume 13, Number 6, Jue 2018
3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationDynamic Programming and Curve Fitting Based Road Boundary Detection
Dyamic Programmig ad Curve Fittig Based Road Boudary Detectio SHYAM PRASAD ADHIKARI, HYONGSUK KIM, Divisio of Electroics ad Iformatio Egieerig Chobuk Natioal Uiversity 664-4 Ga Deokji-Dog Jeoju-City Jeobuk
More informationHarris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c
Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationStone Images Retrieval Based on Color Histogram
Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose
More informationRESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE
RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE Z.G. Zhou, S. Zhao, ad Z.G. A School of Mechaical Egieerig ad Automatio, Beijig Uiversity of Aeroautics ad Astroautics,
More informationare two specific neighboring points, F( x, y)
$33/,&$7,212)7+(6(/)$92,',1* 5$1'20:$/.12,6(5('8&7,21$/*25,7+0,17+(&2/285,0$*(6(*0(17$7,21 %RJGDQ602/.$+HQU\N3$/86'DPLDQ%(5(6.$ 6LOHVLDQ7HFKQLFDO8QLYHUVLW\'HSDUWPHQWRI&RPSXWHU6FLHQFH $NDGHPLFND*OLZLFH32/$1'
More informationGEOMETRIC REVERSE ENGINEERING USING A LASER PROFILE SCANNER MOUNTED ON AN INDUSTRIAL ROBOT
6th Iteratioal DAAAM Baltic Coferece INDUSTRIAL ENGINEERING 24-26 April 2008, Talli, Estoia GEOMETRIC REVERSE ENGINEERING USING A LASER PROFILE SCANNER MOUNTED ON AN INDUSTRIAL ROBOT Rahayem, M.; Kjellader,
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More informationNeuro Fuzzy Model for Human Face Expression Recognition
IOSR Joural of Computer Egieerig (IOSRJCE) ISSN : 2278-0661 Volume 1, Issue 2 (May-Jue 2012), PP 01-06 Neuro Fuzzy Model for Huma Face Expressio Recogitio Mr. Mayur S. Burage 1, Prof. S. V. Dhopte 2 1
More informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationA Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System
A Novel Feature Extractio Algorithm for Haar Local Biary Patter Texture Based o Huma Visio System Liu Tao 1,* 1 Departmet of Electroic Egieerig Shaaxi Eergy Istitute Xiayag, Shaaxi, Chia Abstract The locality
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationPruning and Summarizing the Discovered Time Series Association Rules from Mechanical Sensor Data Qing YANG1,a,*, Shao-Yu WANG1,b, Ting-Ting ZHANG2,c
Advaces i Egieerig Research (AER), volume 131 3rd Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 2017) Pruig ad Summarizig the Discovered Time Series Associatio Rules
More informationAlpha Individual Solutions MAΘ National Convention 2013
Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5
More informationAutomated Extraction of Urban Trees from Mobile LiDAR Point Clouds
Automated Extractio of Urba Trees from Mobile LiDAR Poit Clouds Fa W. a, Cheglu W. a*, ad Joatha L. ab a Fujia Key Laboratory of Sesig ad Computig for Smart City ad the School of Iformatio Sciece ad Egieerig,
More informationPerformance Plus Software Parameter Definitions
Performace Plus+ Software Parameter Defiitios/ Performace Plus Software Parameter Defiitios Chapma Techical Note-TG-5 paramete.doc ev-0-03 Performace Plus+ Software Parameter Defiitios/2 Backgroud ad Defiitios
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationFundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le
Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More informationFuzzy Minimal Solution of Dual Fully Fuzzy Matrix Equations
Iteratioal Coferece o Applied Mathematics, Simulatio ad Modellig (AMSM 2016) Fuzzy Miimal Solutio of Dual Fully Fuzzy Matrix Equatios Dequa Shag1 ad Xiaobi Guo2,* 1 Sciece Courses eachig Departmet, Gasu
More informationVisualization of Gauss-Bonnet Theorem
Visualizatio of Gauss-Boet Theorem Yoichi Maeda maeda@keyaki.cc.u-tokai.ac.jp Departmet of Mathematics Tokai Uiversity Japa Abstract: The sum of exteral agles of a polygo is always costat, π. There are
More informationImproving Information Retrieval System Security via an Optimal Maximal Coding Scheme
Improvig Iformatio Retrieval System Security via a Optimal Maximal Codig Scheme Dogyag Log Departmet of Computer Sciece, City Uiversity of Hog Kog, 8 Tat Chee Aveue Kowloo, Hog Kog SAR, PRC dylog@cs.cityu.edu.hk
More informationMobile terminal 3D image reconstruction program development based on Android Lin Qinhua
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College
More informationEuclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process
Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig
More informationParallel Polygon Approximation Algorithm Targeted at Reconfigurable Multi-Ring Hardware
Parallel Polygo Approximatio Algorithm Targeted at Recofigurable Multi-Rig Hardware M. Arif Wai* ad Hamid R. Arabia** *Califoria State Uiversity Bakersfield, Califoria, USA **Uiversity of Georgia, Georgia,
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe
More informationNew Results on Energy of Graphs of Small Order
Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order
More informationLecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming
Lecture Notes 6 Itroductio to algorithm aalysis CSS 501 Data Structures ad Object-Orieted Programmig Readig for this lecture: Carrao, Chapter 10 To be covered i this lecture: Itroductio to algorithm aalysis
More informationA SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationUNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals
UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationOptimization for framework design of new product introduction management system Ma Ying, Wu Hongcui
2d Iteratioal Coferece o Electrical, Computer Egieerig ad Electroics (ICECEE 2015) Optimizatio for framework desig of ew product itroductio maagemet system Ma Yig, Wu Hogcui Tiaji Electroic Iformatio Vocatioal
More informationForce Network Analysis using Complementary Energy
orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,
More informationHandwriting Stroke Extraction Using a New XYTC Transform
Hadwritig Stroke Etractio Usig a New XYTC Trasform Gilles F. Houle 1, Kateria Bliova 1 ad M. Shridhar 1 Computer Scieces Corporatio Uiversity Michiga-Dearbor Abstract: The fudametal represetatio of hadwritig
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationModule 8-7: Pascal s Triangle and the Binomial Theorem
Module 8-7: Pascal s Triagle ad the Biomial Theorem Gregory V. Bard April 5, 017 A Note about Notatio Just to recall, all of the followig mea the same thig: ( 7 7C 4 C4 7 7C4 5 4 ad they are (all proouced
More informationRoad Boundary Detection in Complex Urban Environment based on Low- Resolution Vision
Road Boudary Detectio i Complex Urba Eviromet based o Low- Resolutio Visio Qighua We, Zehog Yag, Yixu Sog, Peifa Jia State Key Laboratory o Itelliget Techology ad Systems, Tsighua Natioal Laboratory for
More informationHui Xiao School of Environmental Science, Nanjing Xiaozhuang University, Nanjing , China
doi:0.3/00.39.. Cotiuous knn Queries i Dyamic Road Networks Hui Xiao School of Evirometal Sciece, Najig Xiaozhuag Uiversity, Najig 7, Chia Abstract Cotiuous knn queries have bee widely studied i recet
More informationANN WHICH COVERS MLP AND RBF
ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More informationBayesian approach to reliability modelling for a probability of failure on demand parameter
Bayesia approach to reliability modellig for a probability of failure o demad parameter BÖRCSÖK J., SCHAEFER S. Departmet of Computer Architecture ad System Programmig Uiversity Kassel, Wilhelmshöher Allee
More informationAn Image Retrieval Method Based on Hu Invariant Moment and Improved Annular Histogram
http://dx.doi.org/10.5755/j01.eee.0.4.6888 ELEKTROIKA IR ELEKTROTECHIKA ISS 139 115 VOL. 0 O. 4 014 A Image Retrieval Method Based o Hu Ivariat Momet ad Improved Aular Histogram F. Xiag 1 H. Yog 1 S. Dada
More informationarxiv: v2 [cs.ds] 24 Mar 2018
Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves
More informationNew Fuzzy Color Clustering Algorithm Based on hsl Similarity
IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationThe Counterchanged Crossed Cube Interconnection Network and Its Topology Properties
WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology
More informationLoad balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *
Load balaced Parallel Prime umber Geerator with Sieve of Eratosthees o luster omputers * Soowook Hwag*, Kyusik hug**, ad Dogseug Kim* *Departmet of Electrical Egieerig Korea Uiversity Seoul, -, Rep. of
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationOctahedral Graph Scaling
Octahedral Graph Scalig Peter Russell Jauary 1, 2015 Abstract There is presetly o strog iterpretatio for the otio of -vertex graph scalig. This paper presets a ew defiitio for the term i the cotext of
More informationThe Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana
The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:
More informationSome non-existence results on Leech trees
Some o-existece results o Leech trees László A.Székely Hua Wag Yog Zhag Uiversity of South Carolia This paper is dedicated to the memory of Domiique de Cae, who itroduced LAS to Leech trees.. Abstract
More informationEE123 Digital Signal Processing
Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add
More informationCounting Regions in the Plane and More 1
Coutig Regios i the Plae ad More 1 by Zvezdelia Stakova Berkeley Math Circle Itermediate I Group September 016 1. Overarchig Problem Problem 1 Regios i a Circle. The vertices of a polygos are arraged o
More informationApplication of Decision Tree and Support Vector Machine for Inspecting Bubble Defects on LED Sealing Glue Images
66 Applicatio of Decisio Tree ad Support Vector Machie for Ispectig Bubble Defects o LED Sealig Glue Images * Chua-Yu Chag ad Yi-Feg Li Abstract Bubble defect ispectio is a importat step i light-emittig
More informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
More informationEffect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions
Effect of cotrol poits distributio o the orthorectificatio accuracy of a Ikoos II image through ratioal polyomial fuctios Marcela do Valle Machado 1, Mauro Homem Atues 1 ad Paula Debiasi 1 1 Federal Rural
More informationCS 683: Advanced Design and Analysis of Algorithms
CS 683: Advaced Desig ad Aalysis of Algorithms Lecture 6, February 1, 2008 Lecturer: Joh Hopcroft Scribes: Shaomei Wu, Etha Feldma February 7, 2008 1 Threshold for k CNF Satisfiability I the previous lecture,
More informationCounting the Number of Minimum Roman Dominating Functions of a Graph
Coutig the Number of Miimum Roma Domiatig Fuctios of a Graph SHI ZHENG ad KOH KHEE MENG, Natioal Uiversity of Sigapore We provide two algorithms coutig the umber of miimum Roma domiatig fuctios of a graph
More informationRelationship between augmented eccentric connectivity index and some other graph invariants
Iteratioal Joural of Advaced Mathematical Scieces, () (03) 6-3 Sciece Publishig Corporatio wwwsciecepubcocom/idexphp/ijams Relatioship betwee augmeted eccetric coectivity idex ad some other graph ivariats
More informationA Note on Least-norm Solution of Global WireWarping
A Note o Least-orm Solutio of Global WireWarpig Charlie C. L. Wag Departmet of Mechaical ad Automatio Egieerig The Chiese Uiversity of Hog Kog Shati, N.T., Hog Kog E-mail: cwag@mae.cuhk.edu.hk Abstract
More informationJournal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article
Available olie www.jocpr.com Joural of Chemical ad Pharmaceutical Research, 2013, 5(12):745-749 Research Article ISSN : 0975-7384 CODEN(USA) : JCPRC5 K-meas algorithm i the optimal iitial cetroids based
More informationWe are IntechOpen, the first native scientific publisher of Open Access books. International authors and editors. Our authors are among the TOP 1%
We are ItechOpe, the first ative scietific publisher of Ope Access books 3,350 108,000 1.7 M Ope access books available Iteratioal authors ad editors Dowloads Our authors are amog the 151 Coutries delivered
More informationNeural Networks A Model of Boolean Functions
Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D-09596 Freiberg, Germay e-mails: steib@iformatik.tu-freiberg.de
More informationAuto-recognition Method for Pointer-type Meter Based on Binocular Vision
JOURNAL OF COMPUTERS, VOL. 9, NO. 4, APRIL 204 787 Auto-recogitio Method for Poiter-type Meter Based o Biocular Visio Biao Yag School of Istrumet Sciece ad Egieerig, Southeast Uiversity, Najig 20096, Chia
More informationAdaptive Resource Allocation for Electric Environmental Pollution through the Control Network
Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the
More informationPerhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where
ON MAXIMUM CHORDAL SUBGRAPH * Paul Erdos Mathematical Istitute of the Hugaria Academy of Scieces ad Reu Laskar Clemso Uiversity 1. Let G() deote a udirected graph, with vertices ad V(G) deote the vertex
More informationOn (K t e)-saturated Graphs
Noame mauscript No. (will be iserted by the editor O (K t e-saturated Graphs Jessica Fuller Roald J. Gould the date of receipt ad acceptace should be iserted later Abstract Give a graph H, we say a graph
More informationStereo matching approach based on wavelet analysis for 3D reconstruction in neurovision system 1
Stereo matchig approach based o wavelet aalysis or 3D recostructio i eurovisio system Yige Xiog Visio Iteraces & Sys. Lab. (VISLab) CSE Dept.Wright State U. OH 45435 ABSTRACT I this paper a stereo matchig
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More informationObject based Pseudo-3D Conversion of 2D Videos
Object based Pseudo-3D Coversio of 2D Videos J. Jiag 1,2 ad G. Xiao 1 1 Southwest Uiversity; 2 Uiversity of Bradford ABSTRACT: I this paper, we describe a ew algorithm to costruct pseudo-3d videos out
More informationCombination Labelings Of Graphs
Applied Mathematics E-Notes, (0), - c ISSN 0-0 Available free at mirror sites of http://wwwmaththuedutw/ame/ Combiatio Labeligs Of Graphs Pak Chig Li y Received February 0 Abstract Suppose G = (V; E) is
More informationDiego Nehab. n A Transformation For Extracting New Descriptors of Shape. n Locus of points equidistant from contour
Diego Nehab A Trasformatio For Extractig New Descriptors of Shape Locus of poits equidistat from cotour Medial Axis Symmetric Axis Skeleto Shock Graph Shaked 96 1 Shape matchig Aimatio Dimesio reductio
More informationLecture 18. Optimization in n dimensions
Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationUsing a Dynamic Interval Type-2 Fuzzy Interpolation Method to Improve Modeless Robots Calibrations
Joural of Cotrol Sciece ad Egieerig 3 (25) 9-7 doi:.7265/2328-223/25.3. D DAVID PUBLISHING Usig a Dyamic Iterval Type-2 Fuzzy Iterpolatio Method to Improve Modeless Robots Calibratios Yig Bai ad Dali Wag
More informationText Feature Selection based on Feature Dispersion Degree and Feature Concentration Degree
Available olie at www.ijpe-olie.com vol. 13, o. 7, November 017, pp. 1159-1164 DOI: 10.3940/ijpe.17.07.p19.11591164 Text Feature Selectio based o Feature Dispersio Degree ad Feature Cocetratio Degree Zhifeg
More informationMasking based Segmentation of Diseased MRI Images
Maskig based Segmetatio of Diseased MRI Images Aruava De Dept. of Electroics ad Commuicatio Egg. Dr. B.C. Roy Egg College Durgapur,Idia aruavade@yahoo.com Raib Locha Das Dept. Of Electroics ad Commuicatio
More informationTHIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk
THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:
More informationFragments based tracking with adaptive multi-cue integration
Fragmets based tracig with adaptive multi-cue itegratio Abstract Lichua Gu *, Jiaxiao Liu, Chegi Wag School of Computer ad Iformatio, Ahui Agriculture Uiversity, Hefei Ahui, No.130 West Chagiag Road Chia,
More informationPolynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0
Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity
More informationAN OPTIMIZATION NETWORK FOR MATRIX INVERSION
397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio
More information1 Graph Sparsfication
CME 305: Discrete Mathematics ad Algorithms 1 Graph Sparsficatio I this sectio we discuss the approximatio of a graph G(V, E) by a sparse graph H(V, F ) o the same vertex set. I particular, we cosider
More informationLecture 2: Spectra of Graphs
Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad
More informationINTERSECTION CORDIAL LABELING OF GRAPHS
INTERSECTION CORDIAL LABELING OF GRAPHS G Meea, K Nagaraja Departmet of Mathematics, PSR Egieerig College, Sivakasi- 66 4, Virudhuagar(Dist) Tamil Nadu, INDIA meeag9@yahoocoi Departmet of Mathematics,
More informationA study on Interior Domination in Graphs
IOSR Joural of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 219-765X. Volume 12, Issue 2 Ver. VI (Mar. - Apr. 2016), PP 55-59 www.iosrjourals.org A study o Iterior Domiatio i Graphs A. Ato Kisley 1,
More informationOn the Accuracy of Vector Metrics for Quality Assessment in Image Filtering
0th IMEKO TC4 Iteratioal Symposium ad 8th Iteratioal Workshop o ADC Modellig ad Testig Research o Electric ad Electroic Measuremet for the Ecoomic Uptur Beeveto, Italy, September 5-7, 04 O the Accuracy
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More information