Stone Images Retrieval Based on Color Histogram

Size: px
Start display at page:

Download "Stone Images Retrieval Based on Color Histogram"

Transcription

1 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 for its retrieval ad idexig i this paper. Cross color histogram, aular color histogram, ad agular color histogram are respectively combied with HSV color space to accord with huma s visual uiformity. I HSV color space, H, S, V three compoets carry o ueual iterval uatizatio to improve retrieval precisio ad efficiecy, ad the differet weight values are give ad adjusted to differet color chael. Stoe images are sorted accordig to their similarity i retrieval results. Experimets showed that cross color histogram i HSV color space has excellet performace o stoe images retrieval. I. INTRODUCTION Alog with the developmet of multimedia techology ad the arrival of iformatio age, image iformatio resources have icreased rapidly. Traditioal image database retrieval based o keywords or descriptive text is o loger eough. Therefore, cotet-based image retrieval is proposed to extract images visual feature by computers, icludig color, texture, shape, positio of the objects ad their iterrelatioship, etc. Amog them color is perhaps the most direct ad distiguishig visual feature; it is also ivariat to traslatio ad rotatio. So far, color histogram is the most widely used color descriptor i cotet based retrieval research. Several methods based o color histogram have bee proposed i image retrieval. They are maily divided ito two types: global feature idex ad local feature idex. The techology of global feature idex [4] was first proposed by Swai ad Ballad, the mai idea of which is to aalyze each color s statistical freuecy i a image. However, with this way, the special iformatio of colors is ot preserved. Pass ad Zabih defie the cocept of color coheret vector (CCV) ad use it to segmet a color histogram ito two parts. A pixel is called coheret if its coected compoet is over a certai value while the opposite is called o-coheret. A CCV of a image is the statistical ratio of each color s coheret ad o-coheret pixels; this way, the special iformatio is preserved to a certai degree. Typical local feature idex icludes color histogram based o represetative colors, which splits a image ito several parts ad selects a represetative color for each part. Stricker ad Damai cosider that the ceter of a image as the most sigificat part. They partitio a image ito 5 fuzzy regios, ad the extract the first three momets of the color distributio for each regio. With the method of local feature idex, the special distributio of a image is cosidered coupled with color. Take together, there are already several techiues researched for the retrieval of color images. For stoe images, color is also cosidered as a typical feature for retrieval ad idexig. Colors distribute evely i a stoe image, furthermore, the image has o defiite objects ad ca t be distiguished as backgroud ad foregroud. I this paper, the color space is firstly trasformed from RGB ito HSV color space, uatized with proper uatizatio parameters, ad the three algorithms are used for the stoes image retrieval: cross color histogram, aular color histogram, ad agular color histogram. Accordig to the results of experimets, aalyses ad comparisos are made to their retrieval effect. II. COLOR-SPACE CONVERSION HSV color space is color space model desiged for huma visio cosideratio. Hue, saturatio ad value are used to describe colors i this color space. They ca preferably reflect huma perceptio ad idetificatio of color images. I HSV color space, hue is distiguished by differet color, such as red, gree, which is measured by agle raged i 0~360 saturatio refers to the cocetratio of color which is measured by percetage; value refers to a image s lumiace which is measured by percetage as well [3]. This is illustrated i Figure. V Gree (20 ) Blue (240 ) 0 Red (0 ) Fig..HSV color space model. For a true color image, color histogram after color-space coversio will still have high dimesio. Therefore, i order to reduce calculatio time ad ehace retrieval efficiecy, proper uatizatio is ecessary. I this paper, the three compoets H, S, V are uatized i ueual iterval respectively accordig to huma s visual resolvig power ad subjective perceptio. H S /09/$ IEEE Authorized licesed use limited to: Rochester Istitute of Techology. Dowloaded o December 4, 2009 at 0:46 from IEEE Xplore. Restrictios apply.

2 0 h [ 36, 360]»ò[ 0, 20] h [ 2, 40] 2 h [ 4, 75] 3 h [ 76, 55] H = () 4 h [ 56, 90] 5 h [ 9, 270] 6 h [ 27, 295] 7 h [ 296, 35] 0 s [ 0, 0. 2] S = s ( 0. 2, 0. 7] (2) 2 s ( 0. 7, ] 0 v [ 0, 0. 2] V = v ( 0. 2, 0. 7] (3) 2 v ( 0. 7, ] Now the color space is partitioed ito 833=72 color eigevalues. Followig the above uatizatio levels, the three compoets of color ca be weighted respectively ad trasformed ito a oe-dimesio vector L = HQ Q + SQ + V (4) s v v Here Q s ad Q v refer to the uatizatio levels of S ad V. Take Qs=3, Qv =3, the formula ca be expressed as L = 9H + 3 S + V (5) This way, the weight value ca fully capture the images color iformatio. Moreover, it reduces the ifluece of a image s lumiace. For the oe-dimesio vector L, it rages from 0 to 7. Color histogram is created by statistics of the 72 color eigevalues. III. THREE ALGORITHMS BASED ON HISTOGRAM Cross color histogram [4] is first proposed by Swai ad Ballad. It is a oe-dimesio discrete fuctio expressed as k H( k) = k = 0,,... l (6) N I the formula, k represets the umber of pixels while the eigevalue is k, while N is the total umber of pixels i a image. l refers to the umber of eigevalues after uatizatio, ad also it is the elemet umber of vector L. Let H Q ad H D be the color histograms of ueried image Q ad target image D, the similarity matchig betwee the two images is: PQD (, ) = l k = 0 [ H k H k Q D ] mi ( ), ( ) l k = 0 H ( k) Formula 7 describes the proportio of the histogram of the cross part i that of the ueried image. It is illustrated i Figure 2. Q (7) H Fig. 2.Cross color histogram. The calculatio procedure is simple whe usig the method of cross color histogram. It is also isesitive to scale, traslatio ad rotatio. However, global histogram ca t capture the special distributio of colors. Retrieval effect is limited whe two images have similar colors but totally differet distributio. So, color histogram icludig the special iformatio is also adapted ito the stoe image retrieval. Accordig to Aibig Rao s aular ad agular histograms [5], the distributio of colors i a image ca be well described. Let p ij CR be a image of size CR where p ij is the color of pixel(i,j). Set {(, ) ; } U = x y x R y C, BB,... B are the, 2 M eigevalues after uatizatio with M color bis. Let {(, ) (, ), } S = x y x y U p B for M, the xy M U = S = subset of bi B, is the set of pixels whose color is i the th bi. Now cosider the histogram subset S as a geometric distributio o the 2-D plae for each color bi B. let C = ( x, y ) be the cetroid of S, where x ad y are defied as follows x = x y = y S ( x, y) s S ( x, y) s (8) The the radius of S is defied as r max ( = x x ) 2 + ( y y ) 2 (9) x,y S Give a umber N, divided the radius ito N parts evely, ad the draw N cocetric circles with ueried image Q 0 7 l kr N target image D as the radius for each k N to form N aular regios. Each regio, from ier to outside, is defied as R, R,..., R.Vector 2 N ( R, R,..., R ) is called the aular distributio 2 N desity. This is illustrated i Figure 3. Authorized licesed use limited to: Rochester Istitute of Techology. Dowloaded o December 4, 2009 at 0:46 from IEEE Xplore. Restrictios apply.

3 Fig. 3.Aular distributio desity. Set A = R for i = 2,,..., M ad j = 2,,..., N. ij ij The a MN matrix A = ( A ) is called aular histogram ij M N of the image which refers to the umber of a certai color i a certai rig. Sice the cetroid ad the aular partitio of each histogram subset are traslatio ad rotatio ivariat, the histogram is tolerat to a small movemet before the image is processed, the Euclidea distace is adopted to calculate the similarity distace which is defied as M N 2 ( ij ij ) d = A B i= j= (0) Notice that whe N=, the matrix represets the global histogram. Similar to the aular partitio, agular partitio itroduces aother type of special color histogram. I order to keep the advatage of traslatio ad rotatio ivariat, a startig directio should be chose at first. Let C = ( x, y ) is the cetroid of S. For each poit ( x, y) S, the startig directio ca be calculated via the followig formula y y ( x, y) = arcta ± () x x Here +, - are to selected depedig o which uadrat the poit is i. The the average directio of the subset S is deoted as ( S ) = (, ) x y (2) S ( x, y) S This average directio is the startig directio of agular partitio. Give a umber N, for each histogram subset S, startig from the average directio ( S ), divided the uit circle cetered at C evely ito N fa-like domais. From the startig directio, the agular domais are amed R, R 2,...R N i tur. Vector ( R, R 2,... R N ) is called agular distributio desity of the subset S. this is illustrated i Figure 4. Fig. 4.Agular distributio desity. It is obvious that agular partitio is also tolerat to the traslatio ad rotatio of images. IV. EXPERIMENTS AND COMPARISONS Special stoe images database is used i this paper. Here graite is chose to extract its color feature. The total umber of graite is 26, with 4 couples of similar colors: red, yellow, grey ad cya. The arragemet is made by experts before experimets. These stoe images are retrieved ad idexed through the above algorithms. The result is ordered accordig to the similarity from miimum to maximum to compare the retrieval effect of each color histogram. At preset, the evaluatio of retrieval effect maily focuses o the accuracy of the result. The stadard of accuracy mostly depeds o precisio ad recall. Precisio refers to the ratio of similar images umber ad the total images umber i the retrieval result. Recall refers to the ratio of similar images umber i the result ad i the database. Let r the images umber i the retrieval result, s is similar images umber of it. The total images umber i the database is. Precisio ad recalls [6] are defied as precisio r = s s recall = (3) The retrieval effect will be better whe the precisio ad recall are higher. Geerally, precisio ad recall are usually tradeoffs. If high precisio is eeded, recall will usually be reduced, ad vice versa. Geerally a good retrieval system is balace the performace betwee precisio ad recall. Partial retrieval results of red graite are i showed i Figure 5, 6, 7. I Figure 5, 6, 7, pictures are amed by this way: idex-score. Idex is the serial umber of images after sortig ad score meas the similarity scorig for each image by experts. Figure 8 is the statistical result of all the images. Authorized licesed use limited to: Rochester Istitute of Techology. Dowloaded o December 4, 2009 at 0:46 from IEEE Xplore. Restrictios apply.

4 Fig. 5.The first four images after sortig by cross color histogram. Fig. 6.The first four images after sortig by aular color histogram. colors Fig. 7.The first four images after sortig by agular color histogram. Cross color histogram Aular color histogrm Agular color histogram s prec rec s prec rec s prec rec red yellow gray cya Fig. 8.Comparisos of precisio ad recall with three differet algorithms ( r=8). Figure 8 lists the results of all the 26 stoe images. Three of the algorithms have good effect for stoe images retrieval accordig to the list. Comparatively, the performace of cross color histogram outperforms the other two. With certai recall Authorized licesed use limited to: Rochester Istitute of Techology. Dowloaded o December 4, 2009 at 0:46 from IEEE Xplore. Restrictios apply.

5 rate, precisio has better effect. Moreover, the sortig of similarity by experimets ad experts matches well. V. CONCLUSIONS Due to the special color feature of stoe images, which have evely distributed colors ad o defiite objects, three color histograms respectively combied with HSV color space is adopted for retrieval ad idexig i this paper. With the advatage of visual uiformity i HSV color space, global ad local feature are both extracted from the stoe images. Experimets show that, with a lower dimesio ad less computig load, the cross color histogram i HSV color space has better effect for stoe images. I later work, i order to improve the retrieval precisio more, the texture feature of stoe images will be cosidered coupled with its color feature. REFERENCES [] M.J.Swai ad D.H.Ballard, Color Idexig, Iteratioal Joural of Computer Visio, 99, Vol. 7, No., pp.-32. [2] G. Pass ad R. Zabih, Histogram Refiemet for Cotet-Based Image Retrieval, IEEE Workshop o Applicatios of Computer Visio, pp , December 996. [3] X. Y. Li, Y. X. Zhuag ad Y.H. Pa, The Techiue ad Systems of Cotet-Based Image Retrieval, Joural of computer research ad developmet, 200, Vol. 38, No. 3, pp [4] C. Y. Wu, X.Y. Tai ad J.Y. Zhao, Image Retrieval Based o Color Feature, Computer applicatios, 2004, Vol. 24, No. 6, pp [5] A.B. Rao, R. K. Srihari ad Z. F. Zhag, Spatial Color Histograms for Cotet-Based Image Retrieval, Proceedig of IEEE Iteratioal Coferece o tools with artificial Itelligece, November, 999, pp [6] X.J. Zhag, Research o color feature based image retrieval. Master degree thesis, Liaoig techical uiversity, Authorized licesed use limited to: Rochester Istitute of Techology. Dowloaded o December 4, 2009 at 0:46 from IEEE Xplore. Restrictios apply.

3D Model Retrieval Method Based on Sample Prediction

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 information

New HSL Distance Based Colour Clustering Algorithm

New 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 information

An Image Retrieval Method Based on Hu Invariant Moment and Improved Annular Histogram

An 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 information

Performance Plus Software Parameter Definitions

Performance 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 information

A Novel Feature Extraction Algorithm for Haar Local Binary Pattern Texture Based on Human Vision System

A 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 information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern 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 information

New Fuzzy Color Clustering Algorithm Based on hsl Similarity

New 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 information

Harris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c

Harris 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 information

A New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method

A 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 information

The isoperimetric problem on the hypercube

The 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 information

Evaluation scheme for Tracking in AMI

Evaluation 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 information

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve

Analysis of Server Resource Consumption of Meteorological Satellite Application System Based on Contour Curve Advaces i Computer, Sigals ad Systems (2018) 2: 19-25 Clausius Scietific Press, Caada Aalysis of Server Resource Cosumptio of Meteorological Satellite Applicatio System Based o Cotour Curve Xiagag Zhao

More information

Cubic Polynomial Curves with a Shape Parameter

Cubic 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 information

An Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem

An 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 information

World Scientific Research Journal (WSRJ) ISSN: Research on Fresnel Lens Optical Receiving Antenna in Indoor Visible

World Scientific Research Journal (WSRJ) ISSN: Research on Fresnel Lens Optical Receiving Antenna in Indoor Visible World Scietific Research Joural (WSRJ) ISSN: 2472-3703 www.wsr-j.org Research o Fresel Les Optical Receivig Atea i Idoor Visible Light Commuicatio Zhihua Du College of Electroics Egieerig, Chogqig Uiversity

More information

Mobile terminal 3D image reconstruction program development based on Android Lin Qinhua

Mobile 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 information

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov

Sorting in Linear Time. Data Structures and Algorithms Andrei Bulatov Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio

More information

Journal of Chemical and Pharmaceutical Research, 2013, 5(12): Research Article

Journal 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 information

Image Segmentation EEE 508

Image 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 information

Optimization for framework design of new product introduction management system Ma Ying, Wu Hongcui

Optimization 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 information

Vision & Perception. Simple model: simple reflectance/illumination model. image: x(n 1,n 2 )=i(n 1,n 2 )r(n 1,n 2 ) 0 < r(n 1,n 2 ) < 1

Vision & Perception. Simple model: simple reflectance/illumination model. image: x(n 1,n 2 )=i(n 1,n 2 )r(n 1,n 2 ) 0 < r(n 1,n 2 ) < 1 Visio & Perceptio Simple model: simple reflectace/illumiatio model Eye illumiatio source i( 1, 2 ) image: x( 1, 2 )=i( 1, 2 )r( 1, 2 ) reflectace term r( 1, 2 ) where 0 < i( 1, 2 ) < 0 < r( 1, 2 ) < 1

More information

Accuracy Improvement in Camera Calibration

Accuracy 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 information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 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 information

The identification of key quality characteristics based on FAHP

The identification of key quality characteristics based on FAHP Iteratioal Joural of Research i Egieerig ad Sciece (IJRES ISSN (Olie: 2320-9364, ISSN (Prit: 2320-9356 Volume 3 Issue 6 ǁ Jue 2015 ǁ PP.01-07 The idetificatio of ey quality characteristics based o FAHP

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha 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 information

The measurement of overhead conductor s sag with DLT method

The measurement of overhead conductor s sag with DLT method Advaces i Egieerig Research (AER), volume 7 2d Aual Iteratioal Coferece o Electroics, Electrical Egieerig ad Iformatio Sciece (EEEIS 206) he measuremet of overhead coductor s sag with DL method Fag Ye,

More information

Euclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process

Euclidean 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 information

THIN 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. 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 information

Auto-recognition Method for Pointer-type Meter Based on Binocular Vision

Auto-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 information

Bayesian approach to reliability modelling for a probability of failure on demand parameter

Bayesian 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 information

Application of Decision Tree and Support Vector Machine for Inspecting Bubble Defects on LED Sealing Glue Images

Application 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 information

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work

Sectio 4, a prototype project of settig field weight with AHP method is developed ad the experimetal results are aalyzed. Fially, we coclude our work 200 2d Iteratioal Coferece o Iformatio ad Multimedia Techology (ICIMT 200) IPCSIT vol. 42 (202) (202) IACSIT Press, Sigapore DOI: 0.7763/IPCSIT.202.V42.0 Idex Weight Decisio Based o AHP for Iformatio Retrieval

More information

IMP: Superposer Integrated Morphometrics Package Superposition Tool

IMP: 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 information

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION

DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Proceedigs, 11 th FIG Symposium o Deformatio Measuremets, Satorii, Greece, 2003. DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Michaela Haberler, Heribert Kahme

More information

Title: Robust Registration of Multimodal Remote Sensing Images Based on Structural Similarity.

Title: Robust Registration of Multimodal Remote Sensing Images Based on Structural Similarity. 7 IEEE. Persoal use of this material is permitted. Permissio from IEEE must be obtaied for all other uses, i ay curret or future media, icludig repritig/republishig this material for advertisig or promotioal

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones 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 information

A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON

A 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 information

Algorithms for Disk Covering Problems with the Most Points

Algorithms 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 information

The golden search method: Question 1

The golden search method: Question 1 1. Golde Sectio Search for the Mode of a Fuctio The golde search method: Questio 1 Suppose the last pair of poits at which we have a fuctio evaluatio is x(), y(). The accordig to the method, If f(x())

More information

Neuro Fuzzy Model for Human Face Expression Recognition

Neuro 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 information

Fragments based tracking with adaptive multi-cue integration

Fragments 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 information

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb

( n+1 2 ) , position=(7+1)/2 =4,(median is observation #4) Median=10lb Chapter 3 Descriptive Measures Measures of Ceter (Cetral Tedecy) These measures will tell us where is the ceter of our data or where most typical value of a data set lies Mode the value that occurs most

More information

CHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs

CHAPTER 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 information

Neural Networks A Model of Boolean Functions

Neural 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 information

Automated Extraction of Urban Trees from Mobile LiDAR Point Clouds

Automated 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 information

Fundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le

Fundamentals 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 information

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

are two specific neighboring points, F( x, y)

are 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 information

Using a Dynamic Interval Type-2 Fuzzy Interpolation Method to Improve Modeless Robots Calibrations

Using 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 information

Text Feature Selection based on Feature Dispersion Degree and Feature Concentration Degree

Text 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 information

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters.

SD vs. SD + One of the most important uses of sample statistics is to estimate the corresponding population parameters. SD vs. SD + Oe of the most importat uses of sample statistics is to estimate the correspodig populatio parameters. The mea of a represetative sample is a good estimate of the mea of the populatio that

More information

A Flexible Hierarchical Classification Algorithm for Content Based Image Retrieval

A Flexible Hierarchical Classification Algorithm for Content Based Image Retrieval A Flexible Hierarchical Classificatio Algorithm for Cotet Based Image Retrieval Qiao Liu, Jiagfeg Che, ad Hui Zhag Abstract he goal of paper is to describe a flexible hierarchical classificatio algorithm

More information

Image based Cats and Possums Identification for Intelligent Trapping Systems

Image based Cats and Possums Identification for Intelligent Trapping Systems Volume 159 No, February 017 Image based Cats ad Possums Idetificatio for Itelliget Trappig Systems T. A. S. Achala Perera School of Egieerig Aucklad Uiversity of Techology New Zealad Joh Collis School

More information

Using the Keyboard. Using the Wireless Keyboard. > Using the Keyboard

Using the Keyboard. Using the Wireless Keyboard. > Using the Keyboard 1 A wireless keyboard is supplied with your computer. The wireless keyboard uses a stadard key arragemet with additioal keys that perform specific fuctios. Usig the Wireless Keyboard Two AA alkalie batteries

More information

A Note on Least-norm Solution of Global WireWarping

A 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 information

Lecture 5. Counting Sort / Radix Sort

Lecture 5. Counting Sort / Radix Sort Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018

More information

Fast Fourier Transform (FFT) Algorithms

Fast 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 information

Enhancing Efficiency of Software Fault Tolerance Techniques in Satellite Motion System

Enhancing Efficiency of Software Fault Tolerance Techniques in Satellite Motion System Joural of Iformatio Systems ad Telecommuicatio, Vol. 2, No. 3, July-September 2014 173 Ehacig Efficiecy of Software Fault Tolerace Techiques i Satellite Motio System Hoda Baki Departmet of Electrical ad

More information

Study of Image Retrieval Method Based on Salient Points and Comprehensive Characteristics

Study of Image Retrieval Method Based on Salient Points and Comprehensive Characteristics Sesors & Trasducers 203 by IFSA http://www.sesorsportal.com Study of Image Retrieval Method Based o Saliet Poits ad Comprehesive Characteristics Che Yatia College of Humaities, Chagshu Istitute of Techology,

More information

Improving Template Based Spike Detection

Improving 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 information

Lower Bounds for Sorting

Lower Bounds for Sorting Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig

More information

COMP 558 lecture 6 Sept. 27, 2010

COMP 558 lecture 6 Sept. 27, 2010 Radiometry We have discussed how light travels i straight lies through space. We would like to be able to talk about how bright differet light rays are. Imagie a thi cylidrical tube ad cosider the amout

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement 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 information

The Research Based on Fuzzy Sliding Mode Control for Linear Double. Inverted Pendulum

The Research Based on Fuzzy Sliding Mode Control for Linear Double. Inverted Pendulum Advaced Materials Research Olie: 04-05-3 ISSN: 66-8985, Vols. 96-930, pp 463-467 doi:0.408/www.scietific.et/amr.96-930.463 04 Tras Tech Publicatios, Switzerlad The Research Based o Fuzzy Slidig Mode Cotrol

More information

Operating System Concepts. Operating System Concepts

Operating System Concepts. Operating System Concepts Chapter 4: Mass-Storage Systems Logical Disk Structure Logical Disk Structure Disk Schedulig Disk Maagemet RAID Structure Disk drives are addressed as large -dimesioal arrays of logical blocks, where the

More information

An Efficient Image Rectification Method for Parallel Multi-Camera Arrangement

An Efficient Image Rectification Method for Parallel Multi-Camera Arrangement Y.-S. Kag ad Y.-S. Ho: A Efficiet Image Rectificatio Method for Parallel Multi-Camera Arragemet 141 A Efficiet Image Rectificatio Method for Parallel Multi-Camera Arragemet Yu-Suk Kag ad Yo-Sug Ho, Seior

More information

Lecture Notes 6 Introduction to algorithm analysis CSS 501 Data Structures and Object-Oriented Programming

Lecture 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 information

GPUMP: a Multiple-Precision Integer Library for GPUs

GPUMP: a Multiple-Precision Integer Library for GPUs GPUMP: a Multiple-Precisio Iteger Library for GPUs Kaiyog Zhao ad Xiaowe Chu Departmet of Computer Sciece, Hog Kog Baptist Uiversity Hog Kog, P. R. Chia Email: {kyzhao, chxw}@comp.hkbu.edu.hk Abstract

More information

Our second algorithm. Comp 135 Machine Learning Computer Science Tufts University. Decision Trees. Decision Trees. Decision Trees.

Our second algorithm. Comp 135 Machine Learning Computer Science Tufts University. Decision Trees. Decision Trees. Decision Trees. Comp 135 Machie Learig Computer Sciece Tufts Uiversity Fall 2017 Roi Khardo Some of these slides were adapted from previous slides by Carla Brodley Our secod algorithm Let s look at a simple dataset for

More information

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised

More information

Object based Pseudo-3D Conversion of 2D Videos

Object 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 information

Lenses and imaging. MIT 2.71/ /10/01 wk2-a-1

Lenses and imaging. MIT 2.71/ /10/01 wk2-a-1 Leses ad imagig Huyges priciple ad why we eed imagig istrumets A simple imagig istrumet: the pihole camera Priciple of image formatio usig leses Quatifyig leses: paraial approimatio & matri approach Focusig

More information

An Efficient Algorithm for Graph Bisection of Triangularizations

An 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 information

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1

Eigenimages. Digital Image Processing: Bernd Girod, 2013 Stanford University -- Eigenimages 1 Eigeimages Uitary trasforms Karhue-Loève trasform ad eigeimages Sirovich ad Kirby method Eigefaces for geder recogitio Fisher liear discrimat aalysis Fisherimages ad varyig illumiatio Fisherfaces vs. eigefaces

More information

arxiv: v2 [cs.ds] 24 Mar 2018

arxiv: 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 information

CSCI 5090/7090- Machine Learning. Spring Mehdi Allahyari Georgia Southern University

CSCI 5090/7090- Machine Learning. Spring Mehdi Allahyari Georgia Southern University CSCI 5090/7090- Machie Learig Sprig 018 Mehdi Allahyari Georgia Souther Uiversity Clusterig (slides borrowed from Tom Mitchell, Maria Floria Balca, Ali Borji, Ke Che) 1 Clusterig, Iformal Goals Goal: Automatically

More information

The Counterchanged Crossed Cube Interconnection Network and Its Topology Properties

The 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 information

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network

Probabilistic Fuzzy Time Series Method Based on Artificial Neural Network America Joural of Itelliget Systems 206, 6(2): 42-47 DOI: 0.5923/j.ajis.2060602.02 Probabilistic Fuzzy Time Series Method Based o Artificial Neural Network Erol Egrioglu,*, Ere Bas, Cagdas Haka Aladag

More information

How do we evaluate algorithms?

How do we evaluate algorithms? F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:

More information

Hui Xiao School of Environmental Science, Nanjing Xiaozhuang University, Nanjing , China

Hui 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 information

An Efficient Algorithm for Graph Bisection of Triangularizations

An 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 information

Analysis of Documents Clustering Using Sampled Agglomerative Technique

Analysis of Documents Clustering Using Sampled Agglomerative Technique Aalysis of Documets Clusterig Usig Sampled Agglomerative Techique Omar H. Karam, Ahmed M. Hamad, ad Sheri M. Moussa Abstract I this paper a clusterig algorithm for documets is proposed that adapts a samplig-based

More information

An Algorithm of Mobile Robot Node Location Based on Wireless Sensor Network

An Algorithm of Mobile Robot Node Location Based on Wireless Sensor Network A Algorithm of Mobile Robot Node Locatio Based o Wireless Sesor Network https://doi.org/0.399/ijoe.v3i05.7044 Peg A Nigbo Uiversity of Techology, Zhejiag, Chia eirxvrp2269@26.com Abstract I the wireless

More information

Lecture 18. Optimization in n dimensions

Lecture 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 information

Study on effective detection method for specific data of large database LI Jin-feng

Study on effective detection method for specific data of large database LI Jin-feng Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 205) Study o effective detectio method for specific data of large database LI Ji-feg (Vocatioal College of DogYig, Shadog

More information

A Study on the Performance of Cholesky-Factorization using MPI

A Study on the Performance of Cholesky-Factorization using MPI A Study o the Performace of Cholesky-Factorizatio usig MPI Ha S. Kim Scott B. Bade Departmet of Computer Sciece ad Egieerig Uiversity of Califoria Sa Diego {hskim, bade}@cs.ucsd.edu Abstract Cholesky-factorizatio

More information

1 Graph Sparsfication

1 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 information

Dynamic Programming and Curve Fitting Based Road Boundary Detection

Dynamic 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 information

Derivation of perspective stereo projection matrices with depth, shape and magnification consideration

Derivation of perspective stereo projection matrices with depth, shape and magnification consideration Derivatio of perspective stereo projectio matrices with depth, shape ad magificatio cosideratio Patrick Oberthür Jauary 2014 This essay will show how to costruct a pair of stereoscopic perspective projectio

More information

The following algorithms have been tested as a method of converting an I.F. from 16 to 512 MHz to 31 real 16 MHz USB channels:

The following algorithms have been tested as a method of converting an I.F. from 16 to 512 MHz to 31 real 16 MHz USB channels: DBE Memo#1 MARK 5 MEMO #18 MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS 1886 November 19, 24 Telephoe: 978-692-4764 Fax: 781-981-59 To: From: Mark 5 Developmet Group

More information

Mathematics and Art Activity - Basic Plane Tessellation with GeoGebra

Mathematics and Art Activity - Basic Plane Tessellation with GeoGebra 1 Mathematics ad Art Activity - Basic Plae Tessellatio with GeoGebra Worksheet: Explorig Regular Edge-Edge Tessellatios of the Cartesia Plae ad the Mathematics behid it. Goal: To eable Maths educators

More information

High-Speed Recognition Algorithm Based on BRISK and Saliency Detection for Aerial Images

High-Speed Recognition Algorithm Based on BRISK and Saliency Detection for Aerial Images Research Joural of Applied Scieces, Egieerig ad Techology 5(23): 5469-5473, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scietific Orgaizatio, 2013 Submitted: November 29, 2012 Accepted: Jauary 17,

More information

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis

Analysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems

More information

FAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS

FAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS SIAM J. SCI. COMPUT. Vol. 22, No. 6, pp. 2113 2134 c 21 Society for Idustrial ad Applied Mathematics FAST BIT-REVERSALS ON UNIPROCESSORS AND SHARED-MEMORY MULTIPROCESSORS ZHAO ZHANG AND XIAODONG ZHANG

More information

Cluster Analysis. Andrew Kusiak Intelligent Systems Laboratory

Cluster Analysis. Andrew Kusiak Intelligent Systems Laboratory Cluster Aalysis Adrew Kusiak Itelliget Systems Laboratory 2139 Seamas Ceter The Uiversity of Iowa Iowa City, Iowa 52242-1527 adrew-kusiak@uiowa.edu http://www.icae.uiowa.edu/~akusiak Two geeric modes of

More information

Load balanced Parallel Prime Number Generator with Sieve of Eratosthenes on Cluster Computers *

Load 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 information

USING PHASE AND MAGNITUDE INFORMATION OF THE COMPLEX DIRECTIONAL FILTER BANK FOR TEXTURE SEGMENTATION

USING PHASE AND MAGNITUDE INFORMATION OF THE COMPLEX DIRECTIONAL FILTER BANK FOR TEXTURE SEGMENTATION 6th Europea Sigal Processig Coferece EUSIPCO 008, Lausae, Switzerlad, August 5-9, 008, copyright by EURASIP USING PASE AND MAGNITUDE INFORMATION OF TE COMPLEX DIRECTIONAL FILTER BANK FOR TEXTURE SEGMENTATION

More information

Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region

Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region Optimal Movemet of Mobile Sesors for Barrier Coverage of a Plaar Regio Biay Bhattacharya Mike Burmester Yuzhuag Hu Evagelos Kraakis Qiaosheg Shi Adreas Wiese Abstract Itrusio detectio, area coverage ad

More information

Software Fault Prediction of Unlabeled Program Modules

Software Fault Prediction of Unlabeled Program Modules Software Fault Predictio of Ulabeled Program Modules C. Catal, U. Sevim, ad B. Diri, Member, IAENG Abstract Software metrics ad fault data belogig to a previous software versio are used to build the software

More information

Convex hull ( 凸殻 ) property

Convex hull ( 凸殻 ) property Covex hull ( 凸殻 ) property The covex hull of a set of poits S i dimesios is the itersectio of all covex sets cotaiig S. For N poits P,..., P N, the covex hull C is the give by the expressio The covex hull

More information