Locating Lake and Enclosed Islands in SRTM DEM Data Using Boundaries Obtained from Landsat Imagery via Geodesic Active Contour Model

Size: px
Start display at page:

Download "Locating Lake and Enclosed Islands in SRTM DEM Data Using Boundaries Obtained from Landsat Imagery via Geodesic Active Contour Model"

Transcription

1 Locatig Lake ad Eclosed slads i STM DEM Data Usig oudaries Obtaied from Ladsat magery via eodesic Active Cotour Model SHEN Chaomi Joit Laboratory for magig Sciece & Techology, ad Dept of Computer Sciece East Chia Normal Uiversity Shaghai 0006,.. Chia cmshe@cs.ecu.edu.c FAN Jisog School of Mathematics ad formatio Sciece, Wezhou Uiversity, Wezhou, Zhejiag rovice 35000,.. Chia ad Dept of Mathematics, East Chia Normal Uiversity Shaghai 0006,.. Chia fjs@wzu.edu.c Lig Dept of Mathematics, East Chia Normal Uiversity Shaghai 0006,.. Chia pligzh@eyou.com Abstract: The Shuttle adar Topography Missio STM Digital Elevatio Model DEM data over a lake with more tha 000 islads i Chia are studied. DEM data may have missig data or be iaccurate over waterbodies because of mirror effect. Thus, locatig the shorelies of the lake ad eclosed islads from DEM data is o-trivial. We achieve this by overlayig the boudary derived from Ladsat imagery of same area. the Ladsat image, the delieatio of iterior ad eterior boudaries of the lake is coducted by the method of modified geodesic cotour model. the Ladsat image, the boudary delieatio procedure begis by studyig the properties of piels the lake area. This is doe by choosig sample piels visually from the lake area. ricipal compoet aalysis is the applied to these sample piels ad the iterval estimatio of piel values of the lake is obtaied. The delieatio of shorelies is a evolutio process ad the evolutio equatio is derived accordig to the theory of active cotour model as well as the properties of the lake piels. We costruct a iitial cotour iside lake ad the start evolutio accordig to the evolutio equatio. The iitial cotour epads accordig to the gradiet ad color iformatio at the locatio of cotour. The active cotour procedure termiates whe it meets the iterior ad eterior boudaries of the lake, returig the shorelies. The result is satisfactory. The the shorelies are overlaid to DEM data accordig to latitude ad logitude. Keywords: STM, DEM, Ladsat, geodesic active cotour model.. troductio The Shuttle adar Topography Missio STM is a joit project betwee the Natioal eospatial-telligece Agecy NA ad the Natioal Aeroautics ad Space Admiistratio NASA []. The STM Digital Elevatio Model DEM data were calculated from the data acquired by the space shuttle Edeavour i February 000. The DEM data studied here are i a resolutio of 3 arc secods approimately 90 m. DEM data have may useful applicatios. From DEM data, we ca easily distiguish features such as moutai ad plai areas by elevatio values. this paper, we wat to locate shorelies from STM DEM data. Locatig shorelies would ot be a difficult task if the DEM data were absolutely accurate. Sice a lake surface is almost flat, the DEM data values of the lake surface ca be assumed to be same. Thus, i the DEM data plae, a area of costat elevatio should be easily foud ad the boudary of this area would be the shorelie. ut i the real case, DEM data may have errors accordig to NASA, the vertical accuracy is 6 m, ad i lake areas, a lot of data are missig because of mirror effect ad some DEM values would be higher tha the values of real lake surface due to the

2 cotributio of higher elevatio of islads i the lake. Therefore, a area of costat elevatio correspodig to the lake areas does ot eist. Thus, other method ad iformatio are eeded to retrieve shorelies. this paper, we retrieve shorelies from a Ladsat image of same area ad overlay the Ladsat-retrieved shorelies oto the DEM data. The STM DEM data are from U.S. eological Survey USS [], ad the Ladsat data are from lobal Lad Cover Facility LCF, Uiversity of Marylad []. We will first delieate shorelies from the Ladsat image usig the method of modified geodesic cotour model, ad the overlay the Ladsat-derived shorelies to DEM data accordig to latitude / logitude. Thus we ca locate shorelies i DEM data. The descriptio ad implemetatio of the shorelie delieatio algorithm is the mai part of this paper. The study area is Qiadao Lake i Zhejiag rovice, Chia. Figure Fig.. Locatio of study area the red dot idicates the locatio of Qiadao Lake i Chia Sectio describes the geeral iformatio of Qiadao Lake area. The correspodig Ladsat image ad STM DEM data are show ad some features of these data are discussed. Sectio 3 has two parts. The first part describes how to delieate shorelies i Ladsat image. Sectio 3. discusses geeral active models ad why they are ot applicable to our case. Sectio 3. describes our improved geodesic active cotour model. The secod part describes how to overlay the derived cotour to DEM data. Sectio 4 shows the result of the delieated cotour from the Ladsat image ad the DEM data with cotour overlaid. Sectio 5 cocludes the paper ad discusses the limitatios as well as future work.. eeral iformatio of study area ad correspodig Ladsat ad DEM images Fig. Map of Qiadao Lake light blue idicates lake; the red arrow idicates the locatio of dam Our study area is Qiadao Lake. Chiese, Qiadao Lake meas a lake with 000 islads. Actually this is a reservoir built i the 960s. The area of the reservoir is aroud 580 km, the volume is aroud 7.84 billio m 3, ad the average depth is 34 m if the water level is 08 m. There are 078 islads each is bigger tha 500 m iside the reservoir [3]. The average water level of the reservoir is aroud 98 m. The map of this reservoir is show i Figure. The reservoir is show i light blue i the map, ad the red arrow idicates the locatio of dam. The dam top is at 5 m above sea level ad the legth of the dam is 465 m. elow the dam is a river called Xi a iver. Now this reservoir is usually called Qiadao Lake. Figure 3 shows the sceery of Qiadao Lake. Figure 3a shows the lake ad islads. The eposed soil yellow i the figure is caused by to the risig ad fallig of the water level. Thus there is o vegetatio i this area. Figure 3b shows the dam.

3 Fig. 3a Sceery of Qiadao Lake Fig. 3b Dam Height of top: 5 m; Legth: 465 m Figure 4 shows the correspodig Ladsat image Orbit umber: path 9, row 040; Date: ; ad combiatio: 74, Courtesy of USS. Figure 5 shows the DEM data of same area Courtesy of USS. Figure 5a shows the origial DEM data. Compared with Figure 4, it ca be observed that a lot of data are missig i lake area. The arrow i Figure 5a idicates the locatio of the dam. The DEM values of the Xi a iver below the dam are sigificatly lower tha the lake area. The reaso is that this is the river area below the dam. Sice Figure 5a cotais may missig data, various iterpolatio methods are used to fill those gaps. Figure 5b shows such a result. This was implemeted by remote sesig software ENV. Fig. 4 Ladsat image of Qiadao Lake area The DEM values i the lake area are ot costat i both Figure 5a ad Figure 5b, ad i some places those values are obviously wrog. Thus it is hard to get shorelies directly from this DEM data. o data m m Fig. 5a DEM data with missig values Fig. 5b DEM data after iterpolatio processed by ENV The red arrow idicates the locatio of the dam So our task is: with the help of Figure 4, locatig iterior ad eterior boudary of Lake i Figure 5b.

4 3. Descriptio o how to delieate iterior ad eterior shorelies We first discuss the mathematical problem cocered i delieatig iterior ad eterior shorelies i Figure 4. Mathematically, our problem is to fid a solutio o how to delieate the boudaries of Objects Of terest OO. oughly speakig, there are two categories of methods for delieatig boudaries of objects: edge detectio methods ad active cotour methods. The first category is ot suitable for our case because edge detectio methods have two disadvatages: the detected edges may ot be cotiuous, ad the detected edges may cotai may u-wated poits. Therefore, we adapt a method from the secod category. Our method is a geodesic active cotour method developed from the sake algorithm. 3. From sake algorithm to the level set method The sake algorithm is a active cotour method to delieate the boudary of objects, proposed by Kass et al. [4]. The mai idea is as follows: ive a iitial cotour i a image, a correspodig eergy ca be defied. f the cotour chages, the eergy will chage accordigly. Whe the eergy reaches its miimum, the correspodig cotour is regarded as the boudary of objects. egardig our case, the sake algorithm has oe problem: it ca ot hadle chages i topology. For eample, if the iitial cotour is a circle, o matter how to evolve, it ca ot evolve to two circles. Thus, the sake algorithm is oly applicable to detectig the edges of objects with kow topology. The topology of the lake is ukow before processig, thus we ca ot assume the topology of the lake is the same as that of the iitial cotour. esides the problem of topology, for a give iitial cotour, say, the boudary of the image, it shriks durig the evolutio. Whe the cotour reaches the eterior shorelie, it will termiate evolutio. Thus, the sake algorithm ca ot the detect iterior shorelies. For these two reasos, the sake algorithm is ot applicable to our case. The level set method is a improved cotour evolutio method due to J. Sethia ad S. Osher [5]. etter tha the sake algorithm, it ca hadle the topology chage i evolutio. The mai idea of the level set method is to fid a family of surfaces z φ, y, t, where, y are image coordiates, t is time, such that the itersectios of these surfaces ad z 0 are the evolvig cotours. For a give time t, φ, y, t 0 is the cotour i the, y plae. Thus, φ, y,0 0 represets the iitial cotour ad φ, y, t 0 teds to the desired cotour of objects. The evolvig level set fuctio z φ, y, t ca be obtaied by solvig its correspodig partial differetial equatios. ut eve the level set method caot solve our problem directly. The evolved cotour may stop at some o-shorelie poits. The reaso is as follows. level set theory, the poits where the evolved curve should stop marchig o is cotrolled by a stoppig fuctio, a fuctio defied at every image poit. The stoppig fuctio idicates the speed of evolutio at that poit. f the value of the stoppig fuctio is very big, it meas the curve will pass that poit with that speed alog a certai directio. f the speed is reachig 0, it meas the curve will stop at that poit. So a good stoppig fuctio is crucial i the evolutio process. ut a usual stoppig fuctio may ot be good eough i our case. Usually, the stoppig fuctio is defied as the decreasig fuctio of the gradiet ad oly depeds o gradiet, i.e., at the locatio where the gradiet is big, the stoppig fuctio is small, which meas the evolutio teds to stop at that locatio. So the evolutio curve of level set method may stop at the place where the gradiet is big, but that place may ot be OO at all. So what we wat is: the curve should oly stop at the boudary of OO. At other places, o matter how big the gradiet is, the curve should ot stop. Thus the color iformatio of the OO should be cosidered, i.e., the properties of the OO piels should be studied. Sectio 3., we will discuss how to determie the properties of OO piels. There is aother problem i the level set method. t is similar to the problem metioed for the sake algorithm: whe the evolved curve meets the eterior boudary, it will termiate evolutio. Assume that the iitial curve is the image boudary, after several evolutios, it successfully arrives at the eterior boudary of the lake. We wat it shrik agai ad also fid the iterior shorelie. ut sice the stoppig fuctio reaches 0 at the eterior shorelie, the curve will ot march o. Thus, the iterior boudary ca ot be detected. The Cha-Vese model proposed by Cha ad Vese ca be used to solve this problem [6]. ut i our case, we ca avoid this by givig a iitial cotour iside the lake, the let it

5 epad. Durig the epasio, whe the cotour reaches the iterior boudaries islads, it will delieate the islads ad goes o, util it reaches the eterior boudary. 3. Our algorithm of delieatig boudaries of OO Our algorithm is preseted i Sectio 3.. order to delieatig iterior ad eterior shorelies i the Ladsat image, followig problems should be solved.. determie the properties of lake piels ad give out a criterio whether a piel is i lake area;. give the stoppig fuctio at each poit i the image. The stoppig fuctio should be small if ad oly if the piel is i lake area ad the gradiet is big; 3. give the evolutio equatio; 4. give the umerical solutio of the evolutio equatio. what follows, assume the image, is a color image uless stated. f,, the image also ca be epressed by, where is a vector deoted by,,,, roperties of the lake piels ad iterval estimatio to the lake piels As stated i Sectio 3., we will choose the epasio method, i.e., the iitial cotour is iside the lake ad will epad util reachig the shorelies. Thus whe the curve evolves to a ew poit, the speed ad directio at that poit must be give. side the lake area, the speed should be big so that the algorithm ca be efficiet, ad at the boudary the speed should be reachig zero. So we eed to give out a criterio to distiguish whether a poit is i lake area or ot. To achieve this, the properties of the lake piels should be studied. This is doe by choosig some sample poits from the lake, ad the the properties of lake populatio are estimated from these samples. Thus, we first discuss the properties of the piels i lake area. Sice the image is displayed i ed, ree, lue for short combiatio, we wat to set up a criterio that describes whether a poit is i lake area usig a discrimiatio fuctio of,, ad. For eample, oe simple criterio might be: a poit is regarded as i lake area if ad oly if [ a, b ], [ a, b ] ad 3 [ a 3, b3 ], where a i, b i, i,, 3 are itegers. The criterio should be as precise as possible, i.e., type error omissio ad type error commissio should be avoided. t is quite ituitive that the above metioed rectagular parallelepiped may ot best describe the lake area. For eample, poits i the lake area may cocetrate alog certai lie i co-ordiates. Thus, usig a rectagular parallelepiped criterio i co-ordiates will defiitely cause type error, which could be avoided by usig rectagular parallelepiped criterio i a ew co-ordiate system with the cocetratio lie as the ew X-ais. So if there eists a coordiate system better tha co-ordiate system, so that i that ew system the discrimiatio fuctio is simple ad precise, that co-ordiate system should be used. ricipal Compoet Aalysis CA is a way to fid out this kid of ew system. For the detail of CA, please refer to [7]. The mai procedures of CA are as follows.,, we choose sample piels,, 3, L,,, 3 from the lake. Therefore, X ij is a 3 matri. Let X ij 3 be the ormalized matri of X. f the * correlatio coefficiet matri of X is deoted by ρ ρij 3 3, the the correspodig eigevectors of ρ are aes of the ew co-ordiate system. Assume the eigevalues are λ,λ ad λ 3 λ λ λ3. Correspodig eigevectors are ω, ω, ω3, where ω i i,, 3 is a colum. The a poit i, i, i3 i the co-ordiate system ca be writte as p i, pi, pi3 i the ew co-ordiate system, i.e., if let p ij 3, the X ω, ω, ω3. f a vector is deoted by a a, a, a3 i the ew co-ordiate system, the a i is called the i-th pricipal compoet of a i,, 3. The percetage of cotributio of the i-th pricipal compoet to the total sample variace is λi ei,,, 3 λ λ λ i, 3 which measures the importace of the i-th pricipal compoet. f the percetage of cotributio of the first pricipal compoet e is big eough, the iformatio from,, ca be mostly eplaied by the first pricipal compoet. So

6 we could oly cosider the first pricipal compoet. what follows, we costruct a iterval i ω ais by the method of iterval estimatio. The iterval should cover almost all samples by iterval estimatio. Lettig i i i i p S p,, we ca use a studet's t-distributio with degrees of freedom to costruct a cofidece iterval, α α t S t S with degree of cofidece α, where α t is the t-value with degrees of freedom ad 0 < < α. The above procedures ca be summarized as: Every piel i the image is trasformed from co-ordiates to a ew co-ordiates via CA. The first compoet i the ew co-ordiates is called first pricipal compoet ad cotais most importat iformatio. f the value of first pricipal compoet is withi the cofidece iterval, the piel is regarded i the lake area with a cofidece of α. Thus for a give piel, we could defie a fuctio γ, which describes whether this poit is i the area or ot. Supposig that the cofidece iterval obtaied by CA is [ ] b a,, ad the value of the first pricipal compoet is ~ u, the γ is defied by others. 0, ~ b u a γ This iformatio is used i the costructio of stoppig fuctio below. 3.. Stoppig fuctio We shall defie our stoppig fuctio ow. A stoppig fuctio is a decreasig fuctio of gradiet. Usually, it oly depeds o gradiet, regardless of other image iformatio. For eample, for a grey image, K g σ is a typical stoppig fuctio, where 0 > K is a cotrast factor, σ σ σ 4 ep is a aussia filter with a parameter σ, is the gradiet operator, ad * is the covolutio operator. This kid of stoppig fuctio has disadvatages metioed i 3. ad it is oly for grey images. We wat to defie a ew stoppig fuctio for color images. A good stoppig fuctio should be small if ad oly if two coditios are satisfied: the poit is i lake area, ad that poit has a big gradiet. color images, the cocept of gradiet is replaced by the largest eigevalue Λ of the followig matri, where, ad represets the piel s value of red, gree ad blue after aussia covolutio respectively; i i, etc. For the detailed defiitio of Λ, please refer to [8, 9]. Our stoppig fuctio is Λ g γ.

7 t ca be verified that satisfies the two coditios metioed Evolutio equatio Let C r t be the evolvig curve at time t, i.e., φ, t 0 be the implicit represetatio of C r t. For our model i its level set formulatio, the partial differetial equatio of φ, t should satisfy: φ φ φ div g ν g φ, t φ φ,0 φ0, where g is defied i, ν is a costat called balloo force, ad φ 0 is the iitial curve i our case, the iitial curve is iside the lake. The balloo force idicates whether the cotour will shrik or epad. Whe the balloo force is less tha 0, the cotour will epad Numerical solutio of the evolutio equatio order to solve umerically, the Additive Operator Splittig AOS umerical method is used. The AOS scheme is a ucoditioally stable umerical scheme for oliear diffusio i image processig see [0] for detail. The iterated formula of is k k k φ [ E τ Al φ ] φ τνg 3 l {, } where τ is the time step, E is a idetity matri, ad A k l φ is a matri correspodig to derivatives alog the l-th coordiate ais for the detailed defiitio of A φ k please refer to [0]. l The eact solutios {, } of φ, 0 should be real umbers. ut, because of the discreteess of grid poits, we eed to fid the iteger solutios of φ, 0. Fidig the iteger solutios of φ, 0 ca be doe by comparig every piel, with its 8-eighborhood piels. f we defie if φ, 0 sig,, the else., is regarded as the solutio of φ, 0 if ad oly if 8 sig, sig y, y 0, y, y 8eighbor of,, i.e., the sig of φ, chages i the 8-eighborhood of Thus, the cotour φ, 0 is foud. For the detailed descriptio for our algorithm of modified geodesic active cotour model, please refer to []. 3.3 Overlayig delieated shorelies to DEM data Sectio 3. describes the method of delieatig shorelies i the Ladsat image. this sectio the delieated shorelies are overlaid to DEM data. Sice the Ladsat image has geographical iformatio, the latitude/logitude of every piel i the delieated shorelies is kow. Therefore the delieated shorelies ca be overlaid to DEM data accordig to latitude/ logitude.

8 4. esults Figure 5 shows the delieatio result i the Ladsat image. Fig. 5 Delieated terior ad eterior boudaries show i red Figure 6 shows the delieatio result overlaid to the STM DEM data. Fig. 6 DEM data with Ladsat-delieated shorelies overlaid The result is accurate. The cotour epads ad stops eactly at the locatio of real shorelies. This could be verified by the fact that the cotour is stopped at the locatio of dam.

9 5. Coclusio The Shuttle adar Topography Missio STM Digital Elevatio Model DEM data over a Qiadao Lake area i Chia are studied. Our aim is to locate shorelies from the DEM data. order to achieve this, firstly the iterior ad eterior shorelies of the lake are delieated from Ladsat data of the same area via the method of modified geodesic cotour model. The the shorelies are overlaid to DEM data accordig to latitude/logitude. The mai part of this paper describes the algorithm of delieatig iterior ad eterior boudaries of the lake. The properties of lake piels are studied ad a criterio whether a piel is i lake area is give; Our stoppig fuctio for the evolutio curve at each poit i the image is costructed. The evolutio equatio ad the umerical solutio of the equatio are give. The delieatio result is satisfactory. The the shorelies are overlaid to DEM data accordig to latitude ad logitude. Ackowledgemet The authors would like to thak U.S. eological Survey USS for providig the STM DEM data ad lobal Lad Cover Facility LCF, Uiversity of Marylad for providig the Ladsat imagery. The authors also would like to thak Christia Melsheimer for discussio. efereces [] UL: Shuttle adar Topography Missio Homepage. Available at: [] UL: lobal Lad Cover Facility Homepage. Available at: [3] UL: formatio of Qiadao Lake. Available at: [4] Kass, M., Witki, A., ad Terzopoulos, D., 988. Sakes: Active cotour models, teratioal Joural of Computer Visio, vol., [5] Osher, S., Sethia, J.A., 988. Frots propagatig with curvature-depedet speed: Algorithms based o Hamilto Jacobi formulatios. Joural of Computatioal hysics, 79, -49. [6] Cha, T., Vese, L., 00. Active cotour without edges for vector-valued image, Joural of Visual Commuicatio ad mage epresetatio, Vol., [7] Aderso, T. W., 984. A itroductio to multivariate statistical aalysis d Editio, Wiley, New York. [8] Soche, N., Kimmel,., ad Malladi,., 988. A geeral framework for low level visio, EEE Tras. mage rocessig, vol. 7, [9] oldeberg,., Kimmel,., ivli, E., ad udzsky, M., 00. Fast geodesic active cotours, EEE Tras. mage rocessig, vol. 0, [0] Kühe,., Weickert, J., eier, M., ad Effelsberg, W., 00. Fast implicit active cotour models, DAM 00, LNCS 449, [] i, L., Fa, J.S., ad She, C.M., 005. Segmetatio for objects of iterest with modified geodesic active cotour, preprit.

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

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

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)

MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting) MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give

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

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals

UNIT 4 Section 8 Estimating Population Parameters using Confidence Intervals UNIT 4 Sectio 8 Estimatig Populatio Parameters usig Cofidece Itervals To make ifereces about a populatio that caot be surveyed etirely, sample statistics ca be take from a SRS of the populatio ad used

More information

Section 7.2: Direction Fields and Euler s Methods

Section 7.2: Direction Fields and Euler s Methods Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will

More information

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana

The Closest Line to a Data Set in the Plane. David Gurney Southeastern Louisiana University Hammond, Louisiana The Closest Lie to a Data Set i the Plae David Gurey Southeaster Louisiaa Uiversity Hammod, Louisiaa ABSTRACT This paper looks at three differet measures of distace betwee a lie ad a data set i the plae:

More information

Handwriting Stroke Extraction Using a New XYTC Transform

Handwriting Stroke Extraction Using a New XYTC Transform Hadwritig Stroke Etractio Usig a New XYTC Trasform Gilles F. Houle 1, Kateria Bliova 1 ad M. Shridhar 1 Computer Scieces Corporatio Uiversity Michiga-Dearbor Abstract: The fudametal represetatio of hadwritig

More 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

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

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

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

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

4. Levelset or Geometric Active Contour

4. Levelset or Geometric Active Contour 32 4. Levelset or Geometric Active Cotour The sake algorithm is a heavily ivestigated segmetatio method, but there are some limitatios: it is difficult to let the active cotour adapt to the topology. This

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

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

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More 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

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to

More information

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem

Exact Minimum Lower Bound Algorithm for Traveling Salesman Problem Exact Miimum Lower Boud Algorithm for Travelig Salesma Problem Mohamed Eleiche GeoTiba Systems mohamed.eleiche@gmail.com Abstract The miimum-travel-cost algorithm is a dyamic programmig algorithm to compute

More information

EVALUATION OF TRIGONOMETRIC FUNCTIONS

EVALUATION OF TRIGONOMETRIC FUNCTIONS EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special

More information

Recursive Estimation

Recursive Estimation Recursive Estimatio Raffaello D Adrea Sprig 2 Problem Set: Probability Review Last updated: February 28, 2 Notes: Notatio: Uless otherwise oted, x, y, ad z deote radom variables, f x (x) (or the short

More information

Force Network Analysis using Complementary Energy

Force Network Analysis using Complementary Energy orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,

More information

Assignment 5; Due Friday, February 10

Assignment 5; Due Friday, February 10 Assigmet 5; Due Friday, February 10 17.9b The set X is just two circles joied at a poit, ad the set X is a grid i the plae, without the iteriors of the small squares. The picture below shows that the iteriors

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More 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

Project 2.5 Improved Euler Implementation

Project 2.5 Improved Euler Implementation Project 2.5 Improved Euler Implemetatio Figure 2.5.10 i the text lists TI-85 ad BASIC programs implemetig the improved Euler method to approximate the solutio of the iitial value problem dy dx = x+ y,

More information

Higher-order iterative methods free from second derivative for solving nonlinear equations

Higher-order iterative methods free from second derivative for solving nonlinear equations Iteratioal Joural of the Phsical Scieces Vol 6(8, pp 887-89, 8 April, Available olie at http://wwwacademicjouralsorg/ijps DOI: 5897/IJPS45 ISSN 99-95 Academic Jourals Full Legth Research Paper Higher-order

More information

Texture Image Segmentation Using Without Re-initialization Geodesic Active Contour Model

Texture Image Segmentation Using Without Re-initialization Geodesic Active Contour Model Texture Image Segmetatio Usig Without Re-iitializatio Geodesic Active Cotour Model Kaibi Wag Biazhag Yu Departmet of Electroic ad Iformatio Egieerig, Northwester Polytechical Uiversity, Xi a 71007, Shaaxi

More information

Normals. In OpenGL the normal vector is part of the state Set by glnormal*()

Normals. In OpenGL the normal vector is part of the state Set by glnormal*() Ray Tracig 1 Normals OpeG the ormal vector is part of the state Set by glnormal*() -glnormal3f(x, y, z); -glnormal3fv(p); Usually we wat to set the ormal to have uit legth so cosie calculatios are correct

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

Intro to Scientific Computing: Solutions

Intro to Scientific Computing: Solutions Itro to Scietific Computig: Solutios Dr. David M. Goulet. How may steps does it take to separate 3 objects ito groups of 4? We start with 5 objects ad apply 3 steps of the algorithm to reduce the pile

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

Our Learning Problem, Again

Our Learning Problem, Again Noparametric Desity Estimatio Matthew Stoe CS 520, Sprig 2000 Lecture 6 Our Learig Problem, Agai Use traiig data to estimate ukow probabilities ad probability desity fuctios So far, we have depeded o describig

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

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved. Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

Lecture 2: Spectra of Graphs

Lecture 2: Spectra of Graphs Spectral Graph Theory ad Applicatios WS 20/202 Lecture 2: Spectra of Graphs Lecturer: Thomas Sauerwald & He Su Our goal is to use the properties of the adjacecy/laplacia matrix of graphs to first uderstad

More information

Module 8-7: Pascal s Triangle and the Binomial Theorem

Module 8-7: Pascal s Triangle and the Binomial Theorem Module 8-7: Pascal s Triagle ad the Biomial Theorem Gregory V. Bard April 5, 017 A Note about Notatio Just to recall, all of the followig mea the same thig: ( 7 7C 4 C4 7 7C4 5 4 ad they are (all proouced

More information

6.854J / J Advanced Algorithms Fall 2008

6.854J / J Advanced Algorithms Fall 2008 MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms

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

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION

AN OPTIMIZATION NETWORK FOR MATRIX INVERSION 397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio

More information

Numerical Methods Lecture 6 - Curve Fitting Techniques

Numerical Methods Lecture 6 - Curve Fitting Techniques Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio

More information

Optimal Mapped Mesh on the Circle

Optimal Mapped Mesh on the Circle Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad

More information

Second-Order Domain Decomposition Method for Three-Dimensional Hyperbolic Problems

Second-Order Domain Decomposition Method for Three-Dimensional Hyperbolic Problems Iteratioal Mathematical Forum, Vol. 8, 013, o. 7, 311-317 Secod-Order Domai Decompositio Method for Three-Dimesioal Hyperbolic Problems Youbae Ju Departmet of Applied Mathematics Kumoh Natioal Istitute

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

Math Section 2.2 Polynomial Functions

Math Section 2.2 Polynomial Functions Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably

More information

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD)

FINITE DIFFERENCE TIME DOMAIN METHOD (FDTD) FINIT DIFFRNC TIM DOMAIN MTOD (FDTD) The FDTD method, proposed b Yee, 1966, is aother umerical method, used widel for the solutio of M problems. It is used to solve ope-regio scatterig, radiatio, diffusio,

More information

Descriptive Statistics Summary Lists

Descriptive Statistics Summary Lists Chapter 209 Descriptive Statistics Summary Lists Itroductio This procedure is used to summarize cotiuous data. Large volumes of such data may be easily summarized i statistical lists of meas, couts, stadard

More information

The number n of subintervals times the length h of subintervals gives length of interval (b-a).

The number n of subintervals times the length h of subintervals gives length of interval (b-a). Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's

More information

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0 Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity

More 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

BASED ON ITERATIVE ERROR-CORRECTION

BASED ON ITERATIVE ERROR-CORRECTION A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity

More information

RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE

RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE RESEARCH ON AUTOMATIC INSPECTION TECHNIQUE OF REAL-TIME RADIOGRAPHY FOR TURBINE-BLADE Z.G. Zhou, S. Zhao, ad Z.G. A School of Mechaical Egieerig ad Automatio, Beijig Uiversity of Aeroautics ad Astroautics,

More 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

INSCRIBED CIRCLE OF GENERAL SEMI-REGULAR POLYGON AND SOME OF ITS FEATURES

INSCRIBED CIRCLE OF GENERAL SEMI-REGULAR POLYGON AND SOME OF ITS FEATURES INTERNATIONAL JOURNAL OF GEOMETRY Vol. 2 (2013), No. 1, 5-22 INSCRIBED CIRCLE OF GENERAL SEMI-REGULAR POLYGON AND SOME OF ITS FEATURES NENAD U. STOJANOVIĆ Abstract. If above each side of a regular polygo

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

Characterizing graphs of maximum principal ratio

Characterizing graphs of maximum principal ratio Characterizig graphs of maximum pricipal ratio Michael Tait ad Josh Tobi November 9, 05 Abstract The pricipal ratio of a coected graph, deoted γg, is the ratio of the maximum ad miimum etries of its first

More information

Computational Geometry

Computational Geometry Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed

More information

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS

FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS FREQUENCY ESTIMATION OF INTERNET PACKET STREAMS WITH LIMITED SPACE: UPPER AND LOWER BOUNDS Prosejit Bose Evagelos Kraakis Pat Mori Yihui Tag School of Computer Sciece, Carleto Uiversity {jit,kraakis,mori,y

More information

Parametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015

Parametric curves. Reading. Parametric polynomial curves. Mathematical curve representation. Brian Curless CSE 457 Spring 2015 Readig Required: Agel 0.-0.3, 0.5., 0.6-0.7, 0.9 Parametric curves Bria Curless CSE 457 Sprig 05 Optioal Bartels, Beatty, ad Barsy. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig,

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

Perhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where

Perhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where ON MAXIMUM CHORDAL SUBGRAPH * Paul Erdos Mathematical Istitute of the Hugaria Academy of Scieces ad Reu Laskar Clemso Uiversity 1. Let G() deote a udirected graph, with vertices ad V(G) deote the vertex

More information

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig

More information

OCR Statistics 1. Working with data. Section 3: Measures of spread

OCR Statistics 1. Working with data. Section 3: Measures of spread Notes ad Eamples OCR Statistics 1 Workig with data Sectio 3: Measures of spread Just as there are several differet measures of cetral tedec (averages), there are a variet of statistical measures of spread.

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

Effect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions

Effect of control points distribution on the orthorectification accuracy of an Ikonos II image through rational polynomial functions Effect of cotrol poits distributio o the orthorectificatio accuracy of a Ikoos II image through ratioal polyomial fuctios Marcela do Valle Machado 1, Mauro Homem Atues 1 ad Paula Debiasi 1 1 Federal Rural

More 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

Parabolic Path to a Best Best-Fit Line:

Parabolic Path to a Best Best-Fit Line: Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be

More information

BOOLEAN MATHEMATICS: GENERAL THEORY

BOOLEAN MATHEMATICS: GENERAL THEORY CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.

More information

Elementary Educational Computer

Elementary Educational Computer Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified

More information

A Polynomial Interval Shortest-Route Algorithm for Acyclic Network

A Polynomial Interval Shortest-Route Algorithm for Acyclic Network A Polyomial Iterval Shortest-Route Algorithm for Acyclic Network Hossai M Akter Key words: Iterval; iterval shortest-route problem; iterval algorithm; ucertaity Abstract A method ad algorithm is preseted

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

CONTINUI TY. JEE-Mathematics. Illustration 1 : Solution : Illustration 2 : 1. CONTINUOUS FUNCTIONS :

CONTINUI TY. JEE-Mathematics. Illustration 1 : Solution : Illustration 2 : 1. CONTINUOUS FUNCTIONS : J-Mathematics. CONTINUOUS FUNCTIONS : CONTINUI TY A fuctio for which a small chage i the idepedet variable causes oly a small chage ad ot a sudde jump i the depedet variable are called cotiuous fuctios.

More information

Package popkorn. R topics documented: February 20, Type Package

Package popkorn. R topics documented: February 20, Type Package Type Pacage Pacage popkor February 20, 2015 Title For iterval estimatio of mea of selected populatios Versio 0.3-0 Date 2014-07-04 Author Vi Gopal, Claudio Fuetes Maitaier Vi Gopal Depeds

More information

A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS

A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS Pak. J. Statist. 017 Vol. 33(), 411-418 A MODIFIED APPROACH FOR ESTIMATING PROCESS CAPABILITY INDICES USING IMPROVED ESTIMATORS Seem Şaha Vahaplar 1 ad Özlem Ege Oruç Departmet of Statistics, Dokuz Eylül

More information

New Results on Energy of Graphs of Small Order

New Results on Energy of Graphs of Small Order Global Joural of Pure ad Applied Mathematics. ISSN 0973-1768 Volume 13, Number 7 (2017), pp. 2837-2848 Research Idia Publicatios http://www.ripublicatio.com New Results o Eergy of Graphs of Small Order

More 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

Appendix A. Use of Operators in ARPS

Appendix A. Use of Operators in ARPS A Appedix A. Use of Operators i ARPS The methodology for solvig the equatios of hydrodyamics i either differetial or itegral form usig grid-poit techiques (fiite differece, fiite volume, fiite elemet)

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

Position Determination of a Robot End-Effector Using a 6D-Measurement System Based on the Two-View Vision

Position Determination of a Robot End-Effector Using a 6D-Measurement System Based on the Two-View Vision Ope Joural of Applied Scieces, 203, 3, 393-403 Published Olie November 203 (http://www.scirp.org/joural/ojapps) http://d.doi.org/0.4236/ojapps.203.37049 Positio Determiatio of a Robot Ed-Effector Usig

More information

Solution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions:

Solution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions: CS 604 Data Structures Midterm Sprig, 00 VIRG INIA POLYTECHNIC INSTITUTE AND STATE U T PROSI M UNI VERSI TY Istructios: Prit your ame i the space provided below. This examiatio is closed book ad closed

More information

Reading. Parametric curves. Mathematical curve representation. Curves before computers. Required: Angel , , , 11.9.

Reading. Parametric curves. Mathematical curve representation. Curves before computers. Required: Angel , , , 11.9. Readig Required: Agel.-.3,.5.,.6-.7,.9. Optioal Parametric curves Bartels, Beatty, ad Barsky. A Itroductio to Splies for use i Computer Graphics ad Geometric Modelig, 987. Fari. Curves ad Surfaces for

More information

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS

EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS EM375 STATISTICS AND MEASUREMENT UNCERTAINTY LEAST SQUARES LINEAR REGRESSION ANALYSIS I this uit of the course we ivestigate fittig a straight lie to measured (x, y) data pairs. The equatio we wat to fit

More information

Image Analysis. Segmentation by Fitting a Model

Image Analysis. Segmentation by Fitting a Model Image Aalysis Segmetatio by Fittig a Model Christophoros Nikou cikou@cs.uoi.gr Images take from: D. Forsyth ad J. Poce. Computer Visio: A Moder Approach, Pretice Hall, 2003. Computer Visio course by Svetlaa

More information

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19

CIS 121 Data Structures and Algorithms with Java Spring Stacks, Queues, and Heaps Monday, February 18 / Tuesday, February 19 CIS Data Structures ad Algorithms with Java Sprig 09 Stacks, Queues, ad Heaps Moday, February 8 / Tuesday, February 9 Stacks ad Queues Recall the stack ad queue ADTs (abstract data types from lecture.

More information

CMPT 125 Assignment 2 Solutions

CMPT 125 Assignment 2 Solutions CMPT 25 Assigmet 2 Solutios Questio (20 marks total) a) Let s cosider a iteger array of size 0. (0 marks, each part is 2 marks) it a[0]; I. How would you assig a poiter, called pa, to store the address

More information

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics ENGI 44 Probability ad Statistics Faculty of Egieerig ad Applied Sciece Problem Set Descriptive Statistics. If, i the set of values {,, 3, 4, 5, 6, 7 } a error causes the value 5 to be replaced by 50,

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

More information

Chapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 5. Functions for All Subtasks. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 5 Fuctios for All Subtasks Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 5.1 void Fuctios 5.2 Call-By-Referece Parameters 5.3 Usig Procedural Abstractio 5.4 Testig ad Debuggig

More information

c-dominating Sets for Families of Graphs

c-dominating Sets for Families of Graphs c-domiatig Sets for Families of Graphs Kelsie Syder Mathematics Uiversity of Mary Washigto April 6, 011 1 Abstract The topic of domiatio i graphs has a rich history, begiig with chess ethusiasts i the

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

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

Solving Fuzzy Assignment Problem Using Fourier Elimination Method

Solving Fuzzy Assignment Problem Using Fourier Elimination Method Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio

More information

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network

Adaptive Resource Allocation for Electric Environmental Pollution through the Control Network Available olie at www.sciecedirect.com Eergy Procedia 6 (202) 60 64 202 Iteratioal Coferece o Future Eergy, Eviromet, ad Materials Adaptive Resource Allocatio for Electric Evirometal Pollutio through the

More information

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA

Creating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by

More information

Evaluation of the Software Industry Competitiveness in Jilin Province Based on Factor Analysis

Evaluation of the Software Industry Competitiveness in Jilin Province Based on Factor Analysis BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 14, No 4 Sofia 2014 Prit ISSN: 1311-9702; Olie ISSN: 1314-4081 DOI: 10.1515/cait-2014-0008 Evaluatio of the Software Idustry

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

Visualization of Gauss-Bonnet Theorem

Visualization of Gauss-Bonnet Theorem Visualizatio of Gauss-Boet Theorem Yoichi Maeda maeda@keyaki.cc.u-tokai.ac.jp Departmet of Mathematics Tokai Uiversity Japa Abstract: The sum of exteral agles of a polygo is always costat, π. There are

More 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