MICROARRAY IMAGE GRIDDING USING GRID LINE REFINEMENT TECHNIQUE

Size: px
Start display at page:

Download "MICROARRAY IMAGE GRIDDING USING GRID LINE REFINEMENT TECHNIQUE"

Transcription

1 DOI: /ijivp MICROARRAY IMAGE GRIDDING USING GRID LINE REFINEMENT TECHNIQUE V.G. Biju 1 an P. Mythili 2 School of Engineering, Cochin University of Science an Technology, Inia 1 bvgpillai@gmail.com, 2 mythili@cusat.ac.in Abstract An important stage in microarray image analysis is griing. Microarray image griing is one to locate sub arrays in a microarray image an fin co-orinates of spots within each sub array. For accurate ientification of spots, most of the propose griing methos require human intervention. In this paper a fully automatic griing metho which enhances spot intensity in the preprocessing step as per a histogram base threshol metho is use. The griing step fins co-orinates of spots from horizontal an vertical profile of the image. To correct errors ue to the gri line placement, a gri line refinement technique is propose. The algorithm is applie on ifferent image atabases an results are compare base on spot etection accuracy an time. An average spot etection accuracy of 95.06% epicts the propose metho s flexibility an accuracy in fining the spot co-orinates for ifferent atabase images. Keywors: cdna Microarray, Griing, Image Processing, Spot Detection, Gri Line Refinement 1. INTRODUCTION Complementary DNA (cdna) microarrays are part of a rapily eveloping technology in molecular biology, allowing one to measure simultaneously the activity of thousans of biomolecules in the cell uner ifferent experimental conitions. Novelty in the fiel of biotechnology allows monitoring of expression levels of thousans of genes simultaneously. Microarray image is a powerful tool in many biotechnological applications such as cancer research, chromosomal abnormalities, artery iseases, rug iscovery an isease iagnosis. Enormous improvement of technology in last ecae makes it possible to simultaneously ientify an quantify thousans of genes by their gene expression [1]-[4]. Analysis of cdna microarray images inclue mainly three steps namely, griing, segmentation an intensity extraction. The griing process is usually ivie into two main steps, sub array griing an spot etection. Most of the existing griing algorithms are semiautomatic requiring human intervention an parameter presetting. Each spot is associate with a gene which contains the pixels that inicate the level of expression of that particular gene. Improper griing will affect image analysis in extracting intensity values from each spot that represents gene expression level. Over the past ecae several software packages such as ScanAlyze [5], GenePix Instruments [6], Quant Array [7], Spot Finer [8], ImaGene [9] an Dapple [10] were evelope. For most of these packages parameters nee to be preset manually an sometimes human intervention was necessary to locate the exact spot centers. Jung an Cho [11] propose a graph base gri approach for griing of microarray images. A rawback of this algorithm was that it requires input parameters such as number of rows an columns of sub arrays an spots within each sub array in an image. Deng an Duan [12] propose an axis projection base approach for griing an it requires user intervention in orer to manually ajust the gri location. A variety of methoologies have been propose to solve rotation an misalignment problems [13], [14]. Branle et al. [15] utilize iscrete Raon transform for this purpose. Zacharia an Maroulis [16] propose a Genetic algorithm (GA) base metho which accurately etermines line segments, constituting borers between ajacent blocks or spots. It oes not require any input parameters or human intervention but was time consuming. L. Ruea an I. Rezaeian [17] propose a fully automatic approach for microarray griing. The metho first fins location of sub arrays of the entire image an then fins coorinates of spots in each sub arrays. The metho etects an corrects rotation in the image by applying affine transform. Gui-Fang S et al. [18] presente a fully automatic griing technique base on improve Otsu threshol metho for locating each spot, co-orinates in the microarray image. A preprocessing algorithm was applie for noise reuction an then griing algorithm was applie. In orer to reuce the error after the initial gri line placement, the gri lines were optimize by a heuristic technique with the help of estimating the istribution of the spots. In this paper a fully automatic griing algorithm which improves spot etection accuracy an computational efficiency irrespective of microarray image atabase is propose. The metho first etects an corrects image tilt an then enhances image spot intensity in the preprocessing step using a histogram base threshol. Griing step fins co-orinates of spots from the horizontal an vertical profile of the image. The propose gri line refinement technique further improves griing. 2. THE PROPOSED METHOD Microarray image analysis involves mainly three steps namely Griing, Segmentation Intensity extraction an Quantification. The propose metho eals with microarray image griing. Fig.1 shows the block iagram of propose metho. The metho first checks an corrects tilt in the image. This process is important because the tilt in the image makes the whole griing process ineffective. The secon step preprocessing, helps to perform griing process effectively. The thir step griing fins co-orinates of sub arrays in an image an also spot co-orinates within the sub array. Finally, gri line refinement metho, corrects the gri line placement errors. Imperfect spot griing will affect the forthcoming steps 1010

2 ISSN: (ONLINE) ICTACT JOURNAL ON IMAGE AND VIDEO PROCESSING, MAY 2015, VOLUME: 05, ISSUE: 04 such as spot segmentation, gene expression calculation an biological conclusion. So, perfect griing is a prime step in microarray image analysis. Microarray Image Fig.1. Block iagram of the propose metho 2.1 IMAGE TILT DETECTION AND CORRECTION A tilt present in microarray image ecreases the griing efficiency. Hence any tilt in the microarray image has to be rectifie before griing process. Image tilt can be calculate in two stages 1) Tilt ientification an 2) Tilt angle calculation. Tilts in the images are observe in two ifferent irections, with respect to the x an y axes. To fin the tilt angle in the image, Raon transform is applie. The Raon transform, transforms microarray image into a new image plane with parameters an t. Each point in new image plane accumulates all information corresponing to a line in original image with angle an raius t. When Raon transform localizes a local maximum near an angle 0 an aroun a slice t 0, it means the original image has a line in position ( 0, t 0 ) [19], [20]. Applying Raon transform to an image A(x,y), for a given set of angles can be thought of as computing projection of the image along given angles. The resulting projection is the sum of intensities of the pixels in each irection, i.e. an integral line. Result is a straightene image R(,). R, Ax, y xcos y sin xy where, is efine as (1) = xcos + ysin (2) where, (0) is Dirac elta function an is the perpenicular istance of a line from the origin an θ is angle between line an y-axis. 2.2 PREPROCESSING Real cdna microarray image contains a number of sub arrays, an each sub array contains large number of spots arrange in rows an columns. In the pre-processing stage, the given image is first converte to grayscale. A histogram base threshol is use to replace image backgroun with zero intensity value an enhance spot intensity by using a scaling factor. The eges of spots are etecte using canny ege etection. Morphological operations such as ilation an erosion are one after filling spots. Meian filtering is one to remove isolate noisy pixels. 2.3 GRIDDING Image tilt etection an correction Preprocessing Griing Propose gri line refinement The aim of griing is to fin the sub array locations in the image an then the spot location co-orinates within the sub array. The griing is use to etect each spot location from the image. To fin the location of spots, coorinates of each spot is necessary. Consier a microarray image A having p rows an q columns of sub arrays an each sub array with m rows an n columns of spots. The first step in griing fins vertical an horizontal sub array location co-orinates V an H, V = [V 1, V 2 V q+1 ] an H = [H 1, H 2 H p+1 ]. Secon step fins spot location co-orinates within each sub arrays v an h, where v = [v 1, v 2 v n+1 ] an h = [h 1, h 2 h m+1 ], m+1 an n+1 represents total number of horizontal an vertical grilines require to separate each spot within a sub array. S = {S ij }, where S is a sub array in image. S ij represents intensity values of each pixel in a sub array an i = 1,, a an j = 1,,b where a b represents the sub array size. The area between ajacent horizontal an vertical vectors h i+1 -h i an v i+1 -v i elimit the area corresponing to a spot. To obtain the co-orinates, horizontal an vertical intensity profile of the preprocesse image is first compute using Eq.(3) an Eq.(4) respectively. 1 h a 1 v b a i 1 b j 1 I i, j I i, j The horizontal an vertical intensity profiles are converte to a binary signal, the signals are inverte an autocorrelation of the signals are compute. The peak location coorinates of the auto correlate signals are estimate an are use as the horizontal an vertical co-orinate of gri lines. The slope of intensity signals, gives the perioicity of spots in the image. The spot layout is calculate from the perioicity of spot in horizontal an vertical irections. The horizontal an vertical start an en lines are compute using a histogram base threshol. An ieal microarray image has uniform spot size, inter spot istance, an alignment throughout the image. In real microarray images, spot size, inter spot istance an alignment of spots vary with image atabases. Noise artifacts an eformation of images, which affect griing also vary with image atabases. The existing griline optimization or gri line refinement techniques are not able to gri all atabase images successfully. Hence a more flexible an accurate gri line refinement metho is suggeste. 2.4 GRID LINE REFINEMENT In practical images, gri line placement errors are ue to reunant lines, missing lines an misplacement of lines. A sub array image with spot layout m n requires m+1 horizontal an n+1vertical gri lines. The occurrence of an increase or ecreases of griline are cases of reunant or missing gri lines respectively. Gri lines place insie the spots are cases of misplace lines, provie the require number of lines in both horizontal an vertical irections are satisfie. A gri line refinement metho is propose in this paper to etect an correct the errors mentione above. Two parameters nee to be compute for etecting the errors. 1) Spacing between horizontal an vertical gri lines h (k) an v (l). (3) (4) 1011

3 2) Mean horizontal an vertical gri line spacing istance h an v. The parameters, h (k) an v (l), h an using Eq. (5), Eq.(6), Eq.(7) an Eq.(8). v are compute h (k) = h l (k+1)-h l (k) kє[1, m+1] (5) v (l) = v l (l+1)-v l (l) lє[1,n+1] (6) 1 m 1 h k1 k h (7) m 1 1 n 1 v l1 l v (8) n 1 where, h l an v l enotes horizontal an vertical gri lines vectors an k an l enote the gri line number. Reunant line or misplace gri line is etecte in (k+1) th an (l+1) th location if Eq.(9) an Eq.(10) are satisfie respectively. k h 0. 8h (9) l v 0. 8v (10) The gri line vectors are upate by eleting the (k+1) th an (l+1) th line as follows: h l = [h l (1:k) h l (k+2:en)] v l = [v l (1:l) v l (l+2:en)] Missing gri lines are etecte in (k+1) th an (l+1) th location if Eq.(11) an Eq.(12) are satisfie respectively. k h 1. 5h (11) l v 1. 5v (12) Error can be correcte by upating horizontal an vertical gri line vectors by inserting gri lines in (k+1) th an (l+1) th location as follows. h k 1 hl k 0. 9h l l 1 vl l 0. 9v l v tempx = h(k+1:en) tempy = v(l+1:en) h l = [h l (1:k) h l (k+1) tempx] v l = [v l (1:l) v l (l+1) tempy] where, tempx an tempy are temporary variables use to place the missing line co-orinate. The above mentione threshol values are obtaine using trial an error metho by applying the algorithm on ifferent atabase images. 3. DATABASE USED The algorithm is teste with six ifferent image atabase to valiate accuracy an flexibility of propose metho in microarray image griing. Spots in an image vary in iameter, spacing an alignment in both horizontal an vertical irection. The scanning resolution of an image is also ifferent. Database1 inclues thirteen images selecte from UNC microarray image atabase, with experiment IDs to uner Cell line as category an rug treatment as sub category. Each image consists of 32 sub arrays an each sub array have 625 spots. Database2 inclues images selecte from Stanfor microarray ata base (SMD), with experiment IDs 20385, 20387, 20391, 20392, an by selecting Hormone treatment as category an Transcription factors as subcategory. Each image consists of 32 sub arrays an each sub array have 270 spots. Database3 inclues fourteen microarray images selecte from Computational Cancer Genomics (CCG) group of the Swiss Institute of Bioinformatics (SIB) ( Experiment IDs of images are 661 to 667. Each image inclues 4 sub arrays an each sub array with ifferent spot numbers, which varies from 42 to 49. Database4 inclues images ownloae from following website aress ( projects/magic/magic.html,derisi). Database4 inclues images from channels 1 an 2 with experiment IDs 1302, 1303, 1309 to Each image contains four microarray sub arrays an each sub array contains 1,600 spots. Database5 contains two real images with 36 sub arrays an each sub array with 210 spots. The images can be ownloae from the University of California, San Francisco (UCSF, ata). Database6 inclues images from Gene Expression Omnibus. Images are ownloae from website Thirteen images are ownloae corresponing to channels 1 an 2 with experiment IDsGSM15898, GSM16101, GSM16389, GSM16391, GSM17137, GSM17186, GSM17190 an GSM Each sub array has 182 spots. 4. RESULTS AND DISCUSSION 4.1 IMAGE TILT DETECTION AND CORRECTION To make the whole griing process effective, microarray image tilt etection an correction are important. To etect microarray image tilt an angle calculation Raon transform is use. To fin the accuracy of Raon transform in estimating tilt angle of real microarray images, an artificially tilte microarray sub array image with several angles in both clock wise an counter clockwise irections are use. The tilte angles are estimate by applying Raon transform. The result shows that the angle estimate by the transform is same as that of the artificially tilte angle. So this can be applie successfully for the real microarray tilte images for estimating the unknown angle. Fig.2(a) shows a microarray image tilte by an angle 5 egree an Fig.2(b) shows the correcte image after estimating the angle using Raon transform. 1012

4 ISSN: (ONLINE) ICTACT JOURNAL ON IMAGE AND VIDEO PROCESSING, MAY 2015, VOLUME: 05, ISSUE: 04 Table.1. Percentage spot etection accuracy obtaine for genetic algorithm base metho; maximum between class variance base metho an propose metho Data Base Genetic algorithm base metho Maximum between class variance base metho Propose metho Incorrect Marginal Perfect Incorrect Marginal Perfect Incorrect Marginal Perfect UNC SMD SIB Dersi UCSF GEO marginal gri line placement. Arrow pointe vertical gri lines in Fig.3(a) shows marginal griline placement in the metho. From Fig.3(a) it is also observe that in this metho the bottom ege gri line is missing. Error in maximum between class variance base metho is mainly ue to incorrect griline placement. Arrow pointe vertical an horizontal gri lines in Fig.3(b) support this contention. The propose metho shows an improvement of 1.41% spot etection accuracy for atabase2 images compare to other two methos. The griing results of three methos for an image from atabase2 are shown in Fig.4(a-c). The arrow pointe vertical gri lines in Fig.4(a) an Fig.4(b) show examples of marginal gri line placement obtaine using first two methos for an image from atabase2. From Fig.(4b) it is also observe that in maximum between class variance metho the bottom horizontal ege gri line is missing. Fig.2(a) Fig.2(b) Fig 2(a). Tilte microarray image by a 5 egree angle, 2(b). Correcte image using raon transform 4.2 PERFORMANCE OF THE PROPOSED METHOD The performance of the propose metho is teste with six ifferent image atabase. The images from each atabase vary in image resolution, sub array layout, spot layout an spot resolution. Propose metho is compare with two existing metho such as genetic algorithm base metho [16] an maximum between class variance metho [18]. Percentage spot etection accuracy obtaine for gri lines which separate spots incorrectly, marginally an perfectly for all the six atabases are shown in Table.1. The Table.1 shows that the propose metho has an improvement of 2.54% spot etection accuracy compare to other methos for atabase1 images. Griing results obtaine for an image from atabase1 using genetic algorithm base metho; maximum between class variance base metho an propose metho are shown in Fig.3(a-c) respectively. In genetic algorithm base metho the error in griing is mainly ue to Fig.3(a) Fig.3(b) 1013

5 Fig.3(c) Fig.3(a-c). Griing result obtaine using genetic algorithm base metho, maximum between class variance metho an the propose metho for a sub array image from atabase1 For atabase3 images, the perfectly grie spots, spot etection accuracy is less than 90% for all the three methos. In this atabase the image spot iameter is less than inter spot istance which result in incorrect an marginal gri line placement errors. As the number of spots in a sub array is less than 50, a single instance of incorrect placement of griline will consierably affect spot etection accuracy measure. Griing results from a atabase3 image using the above three methos are shown in Fig.5(a-c). From Table.1 spot etection accuracy obtaine for atabase3 images shows an improvement of 4 % for the propose metho compare to other methos. The arrow pointe vertical gri lines in Fig.5(a) show examples of incorrect an marginal griline placement error for genetic algorithm base metho. Fig.5(a) Fig.4(a) Fig.5(b) Fig.4(b) Fig.4(c) Fig.4(a-c). Griing results obtaine using genetic algorithm base metho, maximum between class variance metho an the propose metho for a sub array image from atabase2 Fig.5(c) Fig.5(a-c). Griing result obtaine using genetic algorithm base metho, maximum between class variance an the propose metho for a sub array image from atabase3 1014

6 ISSN: (ONLINE) ICTACT JOURNAL ON IMAGE AND VIDEO PROCESSING, MAY 2015, VOLUME: 05, ISSUE: 04 Results in Table.1 for atabase4 images shows an improvement of 1.38 % spot etection accuracy for the propose metho compare to other methos. In this image atabase image spot layout an spot resolution is (1600 spots in a sub array) an 8 8 respectively which result in spots of smaller size in the sub array. So some high noisy images in the atabase give incorrect griing an marginal griing error an hence the average spot etection accuracy is less than 95% for all the methos. For atabase5 images the propose metho shows an improvement of 0.96% spot etection accuracy compare to other methos. Incorrect gri line placement error occurs for images in this atabase ue to improperly aligne spots in some rows of the image. Fig.6(a) The Table.1 shows an improvement of 1.87% spot etection accuracy for the propose metho compare to other methos. Fig.6(a-c) show griing result of a atabase6 image using genetic algorithm base metho, maximum between class variance base metho an the propose metho respectively. Arrow pointe horizontal gri lines in Fig.6(a) shows reunant gri lines in non spot area for genetic algorithm base metho. The average spot etection accuracy obtaine for all the six image atabases using genetic algorithm base metho, maximum between class variance base metho an the propose metho are %, 92.55% an % respectively. The propose metho shows an overall improvement of 2.51%. Performance of all three methos are evaluate on Intel core i3 processor with 2 GB RAM. Sub array images use are from six ataset of ifferent imensions. Table.2 shows the average time taken for etecting a spot from a set of images in a atabase. The propose metho is compare with genetic algorithm base metho an maximum between class variance base metho on a time scale. Time elapse for spot etection is compute by fining ratio of total time taken for griing a sub array image to total number of spots in sub array. In a microarray image, the number of spots in a sub array are large. So a small improvement in time taken in secons for the propose metho compare to maximum between class variance base metho is feasible. Spot etection accuracy an spee of the propose metho compare to other two existing methos shows improve flexibility an accuracy of the propose metho in microarray griing. Table.2. Average processing time for spot etection (secons) Fig.6(b) Database Genetic algorithm base metho Maximum between class variance base metho Propose metho UNC SMD SIB Dersi UCSF GEO CONCLUSION Fig.6(c) Fig. 6(a-c). Griing result obtaine using genetic algorithm base metho, maximum between class variance an the propose metho for a sub array image from atabase6 In this paper a gri line error correction metho base on a refinement technique is propose. The metho is teste with microarray images rawn from six ifferent image atasets of varying resolution. Result shows that the propose metho improves the spot etection accuracy irrespective of microarray image resolution, sub array lay out, spot lay out an inter spot istance without ajusting any other parameters. The spot etection time of the metho is also compare with other methos. The overall result obtaine on real microarray images shows that the propose metho is a goo choice compare to genetic algorithm an maximum between class variance base metho in microarray image griing. 1015

7 REFERENCES [1] Y. H. Yang, M. J. Buckley, S. Duoit an T. P. Spee, Comparison of methos for image analysis on cdna microarray ata, Journal of Computational an Graphical Statistics, Vol. 11, No. 1, pp , [2] A. Lehmussola, P. Ruusuvuori an O. Yli-Harja, Evaluating the performance of microarray segmentation algorithms, Bioinformatics, Vol. 22, No. 23, pp , [3] A. N. Jain, T. A. Tokuyasu, A. M. Snijers, R. Segraves, D. G. Albertson an D. Pinkel, Fully automatic quantification of microarray image ata, Genome research, Vol. 12, No. 2, pp , [4] J. Angulo an J. Serra, Automatic analysis of na microarray images using mathematical morphology, Bioinformatics, Vol. 19, No. 5, pp , [5] M. Eisen, Scanalyze User manual, Technical Report, [6] I. Axon Instruments, Genepix 4000a Users manual, Axon Instruments Inc, [7] G. Luminomics, Quantarray analysis software, Operators manual, GSI Luminomics, [8] P. Hege, R. Qi, K. Abernathy, C. Gay, S. Dharap, R. Gaspar, J. E. Hughes, E. Snesru, N. Lee an J. Quackenbush, A concise guie to cdna microarray analysis, Biotechniques, Vol. 29, No. 3, pp , [9] I. ImaGene, ImaGene 6.1 user manual, [10] J. Buhler, T. Ieker an D. Haynor, Dapple: improve techniques for fining spots on DNA microarrays, Technical Report, pp , [11] H. Y. Jung an H.-G. Cho, An automatic block an spot inexing with k-nearest neighbors graph for microarray image analysis, Bioinformatics, Vol. 18, No. Suppl 2, pp. S141-S151, [12] N. Deng an H. Duan, The automatic griing algorithm base on projection for microvirray image, Proceeings of IEEE International Conference on Intelligent Mechatronics an Automation, pp , [13] P. Bajcsy, Griline: automatic gri alignment DNA microarray scans, IEEE Transactions on Image Processing, Vol. 13, No. 1, pp , [14] M. Steinfath, W. Wruck, H. Seiel, H. Lehrach, U. Raelof an J. OBrien, Automate image analysis for array hybriization experiments, Bioinformatics, Vol. 17, No. 7, pp , [15] N. Branle, H. Bischof an H. Lapp, Robust DNA microarray image analysis, Machine Vision an Applications, Vol. 15, No.1, pp , [16] E. Zacharia an D. Maroulis, An original genetic approach to the fully automatic griing of microarray images, IEEE Transactions on Meical Imaging, Vol. 27, No. 6, pp , [17] L. Ruea an I. Rezaeian, A fully automatic griing metho for cna microarray images, BMC Bioinformatics, Vol. 12, No. 113, p. 1-17, [18] G.-F. Shao, F. Yang, Q. Zhang, Q.-F. Zhou, an L. K. Luo, Using the maximum between-class variance for automatic griing of cna microarray images, IEEE/ACM Transactions on Computational Biology an Bioinformatics, Vol. 10, No. 1, pp , [19] O. R. Terraes an E. Valveny, Raon transform for linear symbol representation, Proceeings Seventh IEEE International Conference on of Document Analysis an Recognition, pp , [20] G. Beylkin, Discrete raon transform, IEEE Transactions on Acoustics, Speech an Signal Processing, Vol. ASSP- 35, No. 2, pp ,

Image Segmentation using K-means clustering and Thresholding

Image Segmentation using K-means clustering and Thresholding Image Segmentation using Kmeans clustering an Thresholing Preeti Panwar 1, Girhar Gopal 2, Rakesh Kumar 3 1M.Tech Stuent, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra,

More information

Automatic Techniques for Gridding cdna Microarray Images

Automatic Techniques for Gridding cdna Microarray Images Automatic Techniques for Gridding cda Microarray Images aima Kaabouch, Member, IEEE, and Hamid Shahbazkia Department of Electrical Engineering, University of orth Dakota Grand Forks, D 58202-765 2 University

More information

cdna Microarray Genome Image Processing Using Fixed Spot Position

cdna Microarray Genome Image Processing Using Fixed Spot Position American Journal of Applied Sciences 3 (2): 1730-1734, 2006 ISSN 1546-9239 2006 Science Publications cdna Microarray Genome Image Processing Using Fixed Spot Position Basim Alhadidi, Hussam Nawwaf Fakhouri

More information

Calculation on diffraction aperture of cube corner retroreflector

Calculation on diffraction aperture of cube corner retroreflector November 10, 008 / Vol., No. 11 / CHINESE OPTICS LETTERS 8 Calculation on iffraction aperture of cube corner retroreflector Song Li (Ó Ø, Bei Tang (», an Hui Zhou ( ï School of Electronic Information,

More information

Online Appendix to: Generalizing Database Forensics

Online Appendix to: Generalizing Database Forensics Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that

More information

Figure 1: Schematic of an SEM [source: ]

Figure 1: Schematic of an SEM [source:   ] EECI Course: -9 May 1 by R. Sanfelice Hybri Control Systems Eelco van Horssen E.P.v.Horssen@tue.nl Project: Scanning Electron Microscopy Introuction In Scanning Electron Microscopy (SEM) a (bunle) beam

More information

Fast Fractal Image Compression using PSO Based Optimization Techniques

Fast Fractal Image Compression using PSO Based Optimization Techniques Fast Fractal Compression using PSO Base Optimization Techniques A.Krishnamoorthy Visiting faculty Department Of ECE University College of Engineering panruti rishpci89@gmail.com S.Buvaneswari Visiting

More information

Fast Window Based Stereo Matching for 3D Scene Reconstruction

Fast Window Based Stereo Matching for 3D Scene Reconstruction The International Arab Journal of Information Technology, Vol. 0, No. 3, May 203 209 Fast Winow Base Stereo Matching for 3D Scene Reconstruction Mohamma Mozammel Chowhury an Mohamma AL-Amin Bhuiyan Department

More information

MICROARRAY IMAGE SEGMENTATION USING CLUSTERING METHODS

MICROARRAY IMAGE SEGMENTATION USING CLUSTERING METHODS Mathematical and Computational Applications, Vol. 5, No. 2, pp. 240-247, 200. Association for Scientific Research MICROARRAY IMAGE SEGMENTATION USING CLUSTERING METHODS Volkan Uslan and Đhsan Ömür Bucak

More information

New Version of Davies-Bouldin Index for Clustering Validation Based on Cylindrical Distance

New Version of Davies-Bouldin Index for Clustering Validation Based on Cylindrical Distance New Version of Davies-Boulin Inex for lustering Valiation Base on ylinrical Distance Juan arlos Roas Thomas Faculta e Informática Universia omplutense e Mari Mari, España correoroas@gmail.com Abstract

More information

EFFICIENT STEREO MATCHING BASED ON A NEW CONFIDENCE METRIC. Won-Hee Lee, Yumi Kim, and Jong Beom Ra

EFFICIENT STEREO MATCHING BASED ON A NEW CONFIDENCE METRIC. Won-Hee Lee, Yumi Kim, and Jong Beom Ra th European Signal Processing Conference (EUSIPCO ) Bucharest, omania, August 7-3, EFFICIENT STEEO MATCHING BASED ON A NEW CONFIDENCE METIC Won-Hee Lee, Yumi Kim, an Jong Beom a Department of Electrical

More information

Classical Mechanics Examples (Lagrange Multipliers)

Classical Mechanics Examples (Lagrange Multipliers) Classical Mechanics Examples (Lagrange Multipliers) Dipan Kumar Ghosh Physics Department, Inian Institute of Technology Bombay Powai, Mumbai 400076 September 3, 015 1 Introuction We have seen that the

More information

AN INVESTIGATION OF FOCUSING AND ANGULAR TECHNIQUES FOR VOLUMETRIC IMAGES BY USING THE 2D CIRCULAR ULTRASONIC PHASED ARRAY

AN INVESTIGATION OF FOCUSING AND ANGULAR TECHNIQUES FOR VOLUMETRIC IMAGES BY USING THE 2D CIRCULAR ULTRASONIC PHASED ARRAY AN INVESTIGATION OF FOCUSING AND ANGULAR TECHNIQUES FOR VOLUMETRIC IMAGES BY USING THE D CIRCULAR ULTRASONIC PHASED ARRAY S. Monal Lonon South Bank University; Engineering an Design 103 Borough Roa, Lonon

More information

Section 19. Thin Prisms

Section 19. Thin Prisms Section 9 Thin Prisms 9- OPTI-50 Optical Design an Instrumentation I opyright 08 John E. Greivenkamp Thin Prism Deviation Thin prisms introuce small angular beam eviations an are useful as alignment evices.

More information

Section 20. Thin Prisms

Section 20. Thin Prisms OPTI-0/0 Geometrical an Instrumental Optics opyright 08 John E. Greivenkamp 0- Section 0 Thin Prisms Thin Prism Deviation Thin prisms introuce small angular beam eviations an are useful as alignment evices.

More information

Particle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem

Particle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base

More information

Automated cdna Microarray Segmentation using Independent Component Analysis Algorithm

Automated cdna Microarray Segmentation using Independent Component Analysis Algorithm [ Applied Medical Informatics Original Research Vol. 37, No. 3 /2015, pp: 21-30 Automated cdna Microarray Segmentation using Independent Component Analysis Algorithm Elahe AMINIAN 1, Shayan YAZDANI 2,

More information

Robust Camera Calibration for an Autonomous Underwater Vehicle

Robust Camera Calibration for an Autonomous Underwater Vehicle obust Camera Calibration for an Autonomous Unerwater Vehicle Matthew Bryant, Davi Wettergreen *, Samer Aballah, Alexaner Zelinsky obotic Systems Laboratory Department of Engineering, FEIT Department of

More information

Object Recognition Using Colour, Shape and Affine Invariant Ratios

Object Recognition Using Colour, Shape and Affine Invariant Ratios Object Recognition Using Colour, Shape an Affine Invariant Ratios Paul A. Walcott Centre for Information Engineering City University, Lonon EC1V 0HB, Englan P.A.Walcott@city.ac.uk Abstract This paper escribes

More information

Comparative Study of Projection/Back-projection Schemes in Cryo-EM Tomography

Comparative Study of Projection/Back-projection Schemes in Cryo-EM Tomography Comparative Stuy of Projection/Back-projection Schemes in Cryo-EM Tomography Yu Liu an Jong Chul Ye Department of BioSystems Korea Avance Institute of Science an Technology, Daejeon, Korea ABSTRACT In

More information

Data Mining: Clustering

Data Mining: Clustering Bi-Clustering COMP 790-90 Seminar Spring 011 Data Mining: Clustering k t 1 K-means clustering minimizes Where ist ( x, c i t i c t ) ist ( x m j 1 ( x ij i, c c t ) tj ) Clustering by Pattern Similarity

More information

Classifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means

Classifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu

More information

NEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES WITH THE USE OF THE IPAN99 ALGORITHM 1. INTRODUCTION 2.

NEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES WITH THE USE OF THE IPAN99 ALGORITHM 1. INTRODUCTION 2. JOURNAL OF MEDICAL INFORMATICS & TECHNOLOGIES Vol. 13/009, ISSN 164-6037 Krzysztof WRÓBEL, Rafał DOROZ * fingerprint, reference point, IPAN99 NEW METHOD FOR FINDING A REFERENCE POINT IN FINGERPRINT IMAGES

More information

A PSO Optimized Layered Approach for Parametric Clustering on Weather Dataset

A PSO Optimized Layered Approach for Parametric Clustering on Weather Dataset Vol.3, Issue.1, Jan-Feb. 013 pp-504-508 ISSN: 49-6645 A PSO Optimize Layere Approach for Parametric Clustering on Weather Dataset Shikha Verma, 1 Kiran Jyoti 1 Stuent, Guru Nanak Dev Engineering College

More information

Cluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters

Cluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters Available online at www.scienceirect.com Proceia Engineering 4 (011 ) 34 38 011 International Conference on Avances in Engineering Cluster Center Initialization Metho for K-means Algorithm Over Data Sets

More information

A multiple wavelength unwrapping algorithm for digital fringe profilometry based on spatial shift estimation

A multiple wavelength unwrapping algorithm for digital fringe profilometry based on spatial shift estimation University of Wollongong Research Online Faculty of Engineering an Information Sciences - Papers: Part A Faculty of Engineering an Information Sciences 214 A multiple wavelength unwrapping algorithm for

More information

THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE

THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:

More information

A half-scan error reduction based algorithm for cone-beam CT

A half-scan error reduction based algorithm for cone-beam CT Journal of X-Ray Science an Technology 12 (2004) 73 82 73 IOS Press A half-scan error reuction base algorithm for cone-beam CT Kai Zeng a, Zhiqiang Chen a, Li Zhang a an Ge Wang a,b a Department of Engineering

More information

Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks

Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks 01 01 01 01 01 00 01 01 Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks Mihaela Carei, Yinying Yang, an Jie Wu Department of Computer Science an Engineering Floria Atlantic University

More information

Skyline Community Search in Multi-valued Networks

Skyline Community Search in Multi-valued Networks Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h

More information

Bends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways

Bends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways Ben, Jogs, An Wiggles for Railroa Tracks an Vehicle Guie Ways Louis T. Klauer Jr., PhD, PE. Work Soft 833 Galer Dr. Newtown Square, PA 19073 lklauer@wsof.com Preprint, June 4, 00 Copyright 00 by Louis

More information

Dual Arm Robot Research Report

Dual Arm Robot Research Report Dual Arm Robot Research Report Analytical Inverse Kinematics Solution for Moularize Dual-Arm Robot With offset at shouler an wrist Motivation an Abstract Generally, an inustrial manipulator such as PUMA

More information

A new fuzzy visual servoing with application to robot manipulator

A new fuzzy visual servoing with application to robot manipulator 2005 American Control Conference June 8-10, 2005. Portlan, OR, USA FrA09.4 A new fuzzy visual servoing with application to robot manipulator Marco A. Moreno-Armenariz, Wen Yu Abstract Many stereo vision

More information

Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien

Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama an Hayato Ohwaa Faculty of Sci. an Tech. Tokyo University of Science, 2641 Yamazaki, Noa-shi, CHIBA, 278-8510, Japan hiroyuki@rs.noa.tus.ac.jp,

More information

Exercises of PIV. incomplete draft, version 0.0. October 2009

Exercises of PIV. incomplete draft, version 0.0. October 2009 Exercises of PIV incomplete raft, version 0.0 October 2009 1 Images Images are signals efine in 2D or 3D omains. They can be vector value (e.g., color images), real (monocromatic images), complex or binary

More information

A Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition

A Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition ITERATIOAL JOURAL OF MATHEMATICS AD COMPUTERS I SIMULATIO A eural etwork Moel Base on Graph Matching an Annealing :Application to Han-Written Digits Recognition Kyunghee Lee Abstract We present a neural

More information

Texture Recognition with combined GLCM, Wavelet and Rotated Wavelet Features

Texture Recognition with combined GLCM, Wavelet and Rotated Wavelet Features International Journal of Computer an Electrical Engineering, Vol.3, No., February, 793-863 Texture Recognition with combine GLCM, Wavelet an Rotate Wavelet Features Dipankar Hazra Abstract Aim of this

More information

Feature Extraction and Rule Classification Algorithm of Digital Mammography based on Rough Set Theory

Feature Extraction and Rule Classification Algorithm of Digital Mammography based on Rough Set Theory Feature Extraction an Rule Classification Algorithm of Digital Mammography base on Rough Set Theory Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative

More information

An Unsupervised and Fully-Automated Image Analysis Method for cdna Microarrays

An Unsupervised and Fully-Automated Image Analysis Method for cdna Microarrays An Unsupervised and Fully-Automated Image Analysis Method for cdna Microarrays E. Zacharia, D. Maroulis Dept. of Informatics and telecommunication, University of Athens, Greece rtsimage@di.uoa.gr Abstract

More information

Shift-map Image Registration

Shift-map Image Registration Shift-map Image Registration Svärm, Linus; Stranmark, Petter Unpublishe: 2010-01-01 Link to publication Citation for publishe version (APA): Svärm, L., & Stranmark, P. (2010). Shift-map Image Registration.

More information

10. WAVE OPTICS ONE MARK QUESTIONS

10. WAVE OPTICS ONE MARK QUESTIONS 1 10. WAVE OPTICS ONE MARK QUESTIONS 1. Define wavefront.. What is the shape of wavefront obtaine from a point source at a (i) small istance (ii) large istance? 3. Uner what conitions a cylinrical wavefront

More information

Short-term prediction of photovoltaic power based on GWPA - BP neural network model

Short-term prediction of photovoltaic power based on GWPA - BP neural network model Short-term preiction of photovoltaic power base on GWPA - BP neural networ moel Jian Di an Shanshan Meng School of orth China Electric Power University, Baoing. China Abstract In recent years, ue to China's

More information

Rough Set Approach for Classification of Breast Cancer Mammogram Images

Rough Set Approach for Classification of Breast Cancer Mammogram Images Rough Set Approach for Classification of Breast Cancer Mammogram Images Aboul Ella Hassanien Jafar M. H. Ali. Kuwait University, Faculty of Aministrative Science, Quantitative Methos an Information Systems

More information

5th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2015)

5th International Conference on Advanced Design and Manufacturing Engineering (ICADME 2015) 5th International Conference on Avance Design an Manufacturing Engineering (ICADME 25) Research on motion characteristics an application of multi egree of freeom mechanism base on R-W metho Xiao-guang

More information

ScienceDirect. Fuzzy clustering algorithms for cdna microarray image spots segmentation.

ScienceDirect. Fuzzy clustering algorithms for cdna microarray image spots segmentation. Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 46 (2015 ) 417 424 International Conference on Information and Communication Technologies (ICICT 2014) Fuzzy clustering

More information

Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks

Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks 0 0 0 0 0 0 0 0 on-uniform Sensor Deployment in Mobile Wireless Sensor etworks Mihaela Carei, Yinying Yang, an Jie Wu Department of Computer Science an Engineering Floria Atlantic University Boca Raton,

More information

SECTION 2. Objectives. Identify appropriate coordinate systems for solving problems with vectors.

SECTION 2. Objectives. Identify appropriate coordinate systems for solving problems with vectors. SECTION 2 Plan an Prepare Preview Vocabular Scientific Meaning The wor simultaneous is use for phenomena that occur together at the same time. Ask stuents to list some simultaneous phenomena, such as the

More information

Advanced method of NC programming for 5-axis machining

Advanced method of NC programming for 5-axis machining Available online at www.scienceirect.com Proceia CIRP (0 ) 0 07 5 th CIRP Conference on High Performance Cutting 0 Avance metho of NC programming for 5-axis machining Sergej N. Grigoriev a, A.A. Kutin

More information

THE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM

THE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM International Journal of Physics an Mathematical Sciences ISSN: 2277-2111 (Online) 2016 Vol. 6 (1) January-March, pp. 24-6/Mao an Shi. THE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM Hua Mao

More information

Study of Network Optimization Method Based on ACL

Study of Network Optimization Method Based on ACL Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department

More information

Multilevel Linear Dimensionality Reduction using Hypergraphs for Data Analysis

Multilevel Linear Dimensionality Reduction using Hypergraphs for Data Analysis Multilevel Linear Dimensionality Reuction using Hypergraphs for Data Analysis Haw-ren Fang Department of Computer Science an Engineering University of Minnesota; Minneapolis, MN 55455 hrfang@csumneu ABSTRACT

More information

TEST-05(Solution) TOPIC: OPTICS COMPLETE

TEST-05(Solution) TOPIC: OPTICS COMPLETE Q. boy is walking uner an incline mirror at a constant velocity V m/s along the x-axis as shown in figure. If the mirror is incline at an angle with the horizontal then what is the velocity of the image?

More information

Multi-camera tracking algorithm study based on information fusion

Multi-camera tracking algorithm study based on information fusion International Conference on Avance Electronic Science an Technolog (AEST 016) Multi-camera tracking algorithm stu base on information fusion a Guoqiang Wang, Shangfu Li an Xue Wen School of Electronic

More information

Estimating Velocity Fields on a Freeway from Low Resolution Video

Estimating Velocity Fields on a Freeway from Low Resolution Video Estimating Velocity Fiels on a Freeway from Low Resolution Vieo Young Cho Department of Statistics University of California, Berkeley Berkeley, CA 94720-3860 Email: young@stat.berkeley.eu John Rice Department

More information

APPLYING GENETIC ALGORITHM IN QUERY IMPROVEMENT PROBLEM. Abdelmgeid A. Aly

APPLYING GENETIC ALGORITHM IN QUERY IMPROVEMENT PROBLEM. Abdelmgeid A. Aly International Journal "Information Technologies an Knowlege" Vol. / 2007 309 [Project MINERVAEUROPE] Project MINERVAEUROPE: Ministerial Network for Valorising Activities in igitalisation -

More information

Refinement of scene depth from stereo camera ego-motion parameters

Refinement of scene depth from stereo camera ego-motion parameters Refinement of scene epth from stereo camera ego-motion parameters Piotr Skulimowski, Pawel Strumillo An algorithm for refinement of isparity (epth) map from stereoscopic sequences is propose. The metho

More information

A Framework for Dialogue Detection in Movies

A Framework for Dialogue Detection in Movies A Framework for Dialogue Detection in Movies Margarita Kotti, Constantine Kotropoulos, Bartosz Ziólko, Ioannis Pitas, an Vassiliki Moschou Department of Informatics, Aristotle University of Thessaloniki

More information

A FUZZY FRAMEWORK FOR SEGMENTATION, FEATURE MATCHING AND RETRIEVAL OF BRAIN MR IMAGES

A FUZZY FRAMEWORK FOR SEGMENTATION, FEATURE MATCHING AND RETRIEVAL OF BRAIN MR IMAGES A FUZZY FRAMEWORK FOR SEGMENTATION, FEATURE MATCHING AND RETRIEVAL OF BRAIN MR IMAGES Archana.S 1 an Srihar.S 2 1 Department of Information Science an Technology, College of Engineering, Guiny archana.santhira@gmail.com

More information

FINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD

FINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD Warsaw University of Technology Faculty of Physics Physics Laboratory I P Joanna Konwerska-Hrabowska 6 FINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD.

More information

Questions? Post on piazza, or Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)!

Questions? Post on piazza, or  Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)! EE122 Fall 2013 HW3 Instructions Recor your answers in a file calle hw3.pf. Make sure to write your name an SID at the top of your assignment. For each problem, clearly inicate your final answer, bol an

More information

AnyTraffic Labeled Routing

AnyTraffic Labeled Routing AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,

More information

Loop Scheduling and Partitions for Hiding Memory Latencies

Loop Scheduling and Partitions for Hiding Memory Latencies Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:

More information

Evolutionary Optimisation Methods for Template Based Image Registration

Evolutionary Optimisation Methods for Template Based Image Registration Evolutionary Optimisation Methos for Template Base Image Registration Lukasz A Machowski, Tshilizi Marwala School of Electrical an Information Engineering University of Witwatersran, Johannesburg, South

More information

Research Article Inviscid Uniform Shear Flow past a Smooth Concave Body

Research Article Inviscid Uniform Shear Flow past a Smooth Concave Body International Engineering Mathematics Volume 04, Article ID 46593, 7 pages http://x.oi.org/0.55/04/46593 Research Article Invisci Uniform Shear Flow past a Smooth Concave Boy Abullah Mura Department of

More information

A Spectral Clustering Approach to Optimally Combining Numerical Vectors with a Modular Network

A Spectral Clustering Approach to Optimally Combining Numerical Vectors with a Modular Network A Spectral Clustering Approach to Optimally Combining Numerical Vectors with a Moular Networ Motoi Shiga Bioinformatics Center Kyoto University Goasho Uji 6-, Japan shiga@uicryotouacjp Ichigau Taigawa

More information

DEVELOPMENT OF DamageCALC APPLICATION FOR AUTOMATIC CALCULATION OF THE DAMAGE INDICATOR

DEVELOPMENT OF DamageCALC APPLICATION FOR AUTOMATIC CALCULATION OF THE DAMAGE INDICATOR Mechanical Testing an Diagnosis ISSN 2247 9635, 2012 (II), Volume 4, 28-36 DEVELOPMENT OF DamageCALC APPLICATION FOR AUTOMATIC CALCULATION OF THE DAMAGE INDICATOR Valentina GOLUBOVIĆ-BUGARSKI, Branislav

More information

Generalized Edge Coloring for Channel Assignment in Wireless Networks

Generalized Edge Coloring for Channel Assignment in Wireless Networks Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science

More information

1 Surprises in high dimensions

1 Surprises in high dimensions 1 Surprises in high imensions Our intuition about space is base on two an three imensions an can often be misleaing in high imensions. It is instructive to analyze the shape an properties of some basic

More information

A T-Step Ahead Constrained Optimal Target Detection Algorithm for a Multi Sensor Surveillance System

A T-Step Ahead Constrained Optimal Target Detection Algorithm for a Multi Sensor Surveillance System A T-Step Ahea Constraine Optimal Target Detection Algorithm for a Multi Sensor Surveillance System K Mahava Krishna Henry Hexmoor an Shravan Sogani International Institute of Information Technology CSCE

More information

Adjacency Matrix Based Full-Text Indexing Models

Adjacency Matrix Based Full-Text Indexing Models 1000-9825/2002/13(10)1933-10 2002 Journal of Software Vol.13, No.10 Ajacency Matrix Base Full-Text Inexing Moels ZHOU Shui-geng 1, HU Yun-fa 2, GUAN Ji-hong 3 1 (Department of Computer Science an Engineering,

More information

An Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources

An Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract

More information

Transient analysis of wave propagation in 3D soil by using the scaled boundary finite element method

Transient analysis of wave propagation in 3D soil by using the scaled boundary finite element method Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite

More information

Distributed Decomposition Over Hyperspherical Domains

Distributed Decomposition Over Hyperspherical Domains Distribute Decomposition Over Hyperspherical Domains Aron Ahmaia 1, Davi Keyes 1, Davi Melville 2, Alan Rosenbluth 2, Kehan Tian 2 1 Department of Applie Physics an Applie Mathematics, Columbia University,

More information

4.2 Implicit Differentiation

4.2 Implicit Differentiation 6 Chapter 4 More Derivatives 4. Implicit Differentiation What ou will learn about... Implicitl Define Functions Lenses, Tangents, an Normal Lines Derivatives of Higher Orer Rational Powers of Differentiable

More information

MORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks

MORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks : a Movement-Base Routing Algorithm for Vehicle A Hoc Networks Fabrizio Granelli, Senior Member, Giulia Boato, Member, an Dzmitry Kliazovich, Stuent Member Abstract Recent interest in car-to-car communications

More information

A Duality Based Approach for Realtime TV-L 1 Optical Flow

A Duality Based Approach for Realtime TV-L 1 Optical Flow A Duality Base Approach for Realtime TV-L 1 Optical Flow C. Zach 1, T. Pock 2, an H. Bischof 2 1 VRVis Research Center 2 Institute for Computer Graphics an Vision, TU Graz Abstract. Variational methos

More information

Research Article Circle Plus Partial Helical Scan Scheme for a Flat Panel Detector-Based Cone Beam Breast X-Ray CT

Research Article Circle Plus Partial Helical Scan Scheme for a Flat Panel Detector-Based Cone Beam Breast X-Ray CT Hinawi Publishing Corporation International Journal of Biomeical Imaging Volume 2009, Article ID 637867, 11 pages oi:10.1155/2009/637867 Research Article Circle Plus Partial Helical Scan Scheme for a Flat

More information

PDE-BASED INTERPOLATION METHOD FOR OPTICALLY VISUALIZED SOUND FIELD. Kohei Yatabe and Yasuhiro Oikawa

PDE-BASED INTERPOLATION METHOD FOR OPTICALLY VISUALIZED SOUND FIELD. Kohei Yatabe and Yasuhiro Oikawa 4 IEEE International Conference on Acoustic, Speech an Signal Processing (ICASSP) PDE-BASED INTERPOLATION METHOD FOR OPTICALLY VISUALIZED SOUND FIELD Kohei Yatabe an Yasuhiro Oikawa Department of Intermeia

More information

Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks

Queueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication

More information

An Investigation in the Use of Vehicle Reidentification for Deriving Travel Time and Travel Time Distributions

An Investigation in the Use of Vehicle Reidentification for Deriving Travel Time and Travel Time Distributions An Investigation in the Use of Vehicle Reientification for Deriving Travel Time an Travel Time Distributions Carlos Sun Department of Civil an Environmental Engineering, University of Missouri-Columbia,

More information

Super-resolution Frame Reconstruction Using Subpixel Motion Estimation

Super-resolution Frame Reconstruction Using Subpixel Motion Estimation Super-resolution Frame Reconstruction Using Subpixel Motion Estimation ABSTRACT When vieo ata is use for forensic analysis, it may transpire that the level of etail available is insufficient. This is particularly

More information

Genetic Fuzzy Logic Control Technique for a Mobile Robot Tracking a Moving Target

Genetic Fuzzy Logic Control Technique for a Mobile Robot Tracking a Moving Target .IJCSI.org 67 Genetic Fuzzy Logic Control Technique for a Mobile Robot Tracking a Moving Target Karim Benbouaballah an Zhu Qi-an College of Automation, Harbin Engineering University Harbin, 151, China

More information

Bayesian localization microscopy reveals nanoscale podosome dynamics

Bayesian localization microscopy reveals nanoscale podosome dynamics Nature Methos Bayesian localization microscopy reveals nanoscale poosome ynamics Susan Cox, Ewar Rosten, James Monypenny, Tijana Jovanovic-Talisman, Dylan T Burnette, Jennifer Lippincott-Schwartz, Gareth

More information

Human recognition based on ear shape images using PCA-Wavelets and different classification methods

Human recognition based on ear shape images using PCA-Wavelets and different classification methods Meical Devices an Diagnostic Engineering Review Article ISSN: 2399-6854 Human recognition base on ear shape images using PCA-Wavelets an ifferent classification methos Ali Mahmou Mayya1* an Mariam Mohamma

More information

Shift-map Image Registration

Shift-map Image Registration Shift-map Image Registration Linus Svärm Petter Stranmark Centre for Mathematical Sciences, Lun University {linus,petter}@maths.lth.se Abstract Shift-map image processing is a new framework base on energy

More information

Random Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation

Random Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation DEIM Forum 2018 I4-4 Abstract Ranom Clustering for Multiple Sampling Units to Spee Up Run-time Sample Generation uzuru OKAJIMA an Koichi MARUAMA NEC Solution Innovators, Lt. 1-18-7 Shinkiba, Koto-ku, Tokyo,

More information

A Classification of 3R Orthogonal Manipulators by the Topology of their Workspace

A Classification of 3R Orthogonal Manipulators by the Topology of their Workspace A Classification of R Orthogonal Manipulators by the Topology of their Workspace Maher aili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S.

More information

Module13:Interference-I Lecture 13: Interference-I

Module13:Interference-I Lecture 13: Interference-I Moule3:Interference-I Lecture 3: Interference-I Consier a situation where we superpose two waves. Naively, we woul expect the intensity (energy ensity or flux) of the resultant to be the sum of the iniviual

More information

Computer Graphics Chapter 7 Three-Dimensional Viewing Viewing

Computer Graphics Chapter 7 Three-Dimensional Viewing Viewing Computer Graphics Chapter 7 Three-Dimensional Viewing Outline Overview of Three-Dimensional Viewing Concepts The Three-Dimensional Viewing Pipeline Three-Dimensional Viewing-Coorinate Parameters Transformation

More information

Solutions to Tutorial 1 (Week 8)

Solutions to Tutorial 1 (Week 8) The University of Syney School of Mathematics an Statistics Solutions to Tutorial 1 (Week 8) MATH2069/2969: Discrete Mathematics an Graph Theory Semester 1, 2018 1. In each part, etermine whether the two

More information

Dense Disparity Estimation in Ego-motion Reduced Search Space

Dense Disparity Estimation in Ego-motion Reduced Search Space Dense Disparity Estimation in Ego-motion Reuce Search Space Luka Fućek, Ivan Marković, Igor Cvišić, Ivan Petrović University of Zagreb, Faculty of Electrical Engineering an Computing, Croatia (e-mail:

More information

Keywords Data compression, image processing, NCD, Kolmogorov complexity, JPEG, ZIP

Keywords Data compression, image processing, NCD, Kolmogorov complexity, JPEG, ZIP Volume 3, Issue 7, July 203 ISSN: 2277 28X International Journal of Avance Research in Computer Science an Software Engineering Research Paper Available online at: wwwijarcssecom Compression Techniques

More information

Performance Modelling of Necklace Hypercubes

Performance Modelling of Necklace Hypercubes erformance Moelling of ecklace ypercubes. Meraji,,. arbazi-aza,, A. atooghy, IM chool of Computer cience & harif University of Technology, Tehran, Iran {meraji, patooghy}@ce.sharif.eu, aza@ipm.ir a Abstract

More information

Kinematic Analysis of a Family of 3R Manipulators

Kinematic Analysis of a Family of 3R Manipulators Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,

More information

Threshold Based Data Aggregation Algorithm To Detect Rainfall Induced Landslides

Threshold Based Data Aggregation Algorithm To Detect Rainfall Induced Landslides Threshol Base Data Aggregation Algorithm To Detect Rainfall Inuce Lanslies Maneesha V. Ramesh P. V. Ushakumari Department of Computer Science Department of Mathematics Amrita School of Engineering Amrita

More information

Real Time On Board Stereo Camera Pose through Image Registration*

Real Time On Board Stereo Camera Pose through Image Registration* 28 IEEE Intelligent Vehicles Symposium Einhoven University of Technology Einhoven, The Netherlans, June 4-6, 28 Real Time On Boar Stereo Camera Pose through Image Registration* Fai Dornaika French National

More information

Data Mining: Concepts and Techniques. Chapter 7. Cluster Analysis. Examples of Clustering Applications. What is Cluster Analysis?

Data Mining: Concepts and Techniques. Chapter 7. Cluster Analysis. Examples of Clustering Applications. What is Cluster Analysis? Data Mining: Concepts an Techniques Chapter Jiawei Han Department of Computer Science University of Illinois at Urbana-Champaign www.cs.uiuc.eu/~hanj Jiawei Han an Micheline Kamber, All rights reserve

More information

DNA microarrays [1] are used to measure the expression

DNA microarrays [1] are used to measure the expression IEEE TRANSACTIONS ON MEDICAL IMAGING, VOL. 24, NO. 7, JULY 2005 901 Mixture Model Analysis of DNA Microarray Images K. Blekas*, Member, IEEE, N. P. Galatsanos, Senior Member, IEEE, A. Likas, Senior Member,

More information

arxiv: v2 [math.co] 5 Jun 2018

arxiv: v2 [math.co] 5 Jun 2018 Some useful lemmas on the ege Szege inex arxiv:1805.06578v [math.co] 5 Jun 018 Shengjie He 1 1. Department of Mathematics, Beijing Jiaotong University, Beijing, 100044, China Abstract The ege Szege inex

More information

Investigation into a new incremental forming process using an adjustable punch set for the manufacture of a doubly curved sheet metal

Investigation into a new incremental forming process using an adjustable punch set for the manufacture of a doubly curved sheet metal 991 Investigation into a new incremental forming process using an ajustable punch set for the manufacture of a oubly curve sheet metal S J Yoon an D Y Yang* Department of Mechanical Engineering, Korea

More information