IMRT workflow. Optimization and Inverse planning. Intensity distribution IMRT IMRT. Dose optimization for IMRT. Bram van Asselen

Size: px
Start display at page:

Download "IMRT workflow. Optimization and Inverse planning. Intensity distribution IMRT IMRT. Dose optimization for IMRT. Bram van Asselen"

Transcription

1 IMRT workflow Otmzaton and Inverse lannng 69 Gy Bram van Asselen IMRT Intensty dstrbuton Webb 003: IMRT s the delvery of radaton to the atent va felds that have non-unform radaton fluence Purose: Fnd a set of modulated fluences that roduce a requred dose dstrbuton How do you get the fluence/ntensty dstrbuton? Forward Inverse Webb 003 IMRT Dose otmzaton for IMRT Forward aroach to dose otmzaton:. Derve a number of segments based on atent anatomy n beams-eye vew. Otmze the weght of these segments to acheve a requred dose dstrbuton Webb 003

2 MLC technque Beaumont Inverse lannng rocess Defnton of geometrcal arameters Selecton of beams Secfcaton of organ arameter Otmzaton Evaluaton Delverable lan Kestn et al, IJROB 48, , 000 Dose otmzaton for IMRT Ray tracng Inverse aroach to dose otmzaton:. Decomose a feld nto small fluence elements (bxels) and otmze ther weghts Dose dstrbuton Fluence ma Source From each fluence bxel a ray s traced through some voxels n the volume Dose otmzaton for IMRT Why nverse lannng? Inverse aroach to dose otmzaton:. The fluence s rearranged nto a seres of oen felds that aroxmate the otmzed fluence as closely as ossble Too many ossbltes to exlore smle 0x0 feld: 00 bxels of cm ) gantry, collmator, table orentatons Segments Fluence lttle chance of arrvng at otmum treatment by traland-error

3 Otmzaton What consttutes a good lan? Summarze the qualty of a lan n a sngle number: the cost functon Try to fnd the treatment lan wth the lowest value of the cost functon Verfy, f ths ndeed reresents the best lan How do we recognze f an otmal / accetable lan s found, what crtera secfy t s qualty? (.e. ts dstance from the otmum lan) Dose rescrton dose dstrbuton DVH bologcal arameters Physcal lmtatons, delverablty Comlexty of lan Tme Mathematcal framework: Beamlets Beamlets Beamlet : d (r), w D( r ) w d ( r ) w d ( r ) D( r ) w d ( r ) w d ( r ) 3 3 Beamlet : d (r), w Dose voxels Beamlet : d (r), w Beamlet : d (r), w Beamlet 3: d 3 (r), w 3 Beamlet 3: d 3 (r), w 3 r r D ( r) d ( r) w Mathematcal framework What s Inverse lannng? A dose dstrbuton D A set of weghts w for each of the fluence bxels M reresents the fractonal dose er unt beamweght (the dose model) The dose dstrbuton s lnked to the fluence weghts by D M w Assume D s the desred rescrbed dose: D M w Invert M to fnd the soluton for the bxel weghts w : " " D w M D M Problems: M - can t always be found w may have negatve elements, because of scatter contrbuton Recever Sender 3

4 Soluton What s a cost functon? Assume D s the desred rescrbed dose and w the requred bxel weghts : D M w A costfuncton s a mathematcal evaluaton of the treatment dose dstrbuton (wrt the desred dose dstrbuton) Costfunct on f D D What we want s to derve D b the best achevable dose and w b corresondng beamlet weghts: D M b w b How do we know D b s good enough comared wth D? Ideally, s should nclude all of our knowledge of radotheray: hyscal as well as bologcal dosmetrc requerements C-M Charle Ma, Fox Chase Cancer Center USA Cost functons Costfuncton - examle In rncle the cost functon C can have any form. Convergence s only guaranteed f C has only one mnmum If the cost functon sn t well behaved, the otmzaton may become nstable In each ont the dfference between calculated dose D and rescrbed dose D s weghted by a cost functon C D D D D C( w ) Target D M w Crtcal organ M w D M w D C( w ) Target Crtcal organ Otmzaton of the treatment lan Smle workflow teratve otmzaton Many dfferent costfunctons Many ways to otmze the treatment lan for a gven objectve functon Each lannng system has one or more otmzaton algorthms. Start wth emty beams. Offer grans of beam weght to each beam element n random order 3. cost s calculated 4. when cost s lower acceted, else rejected 4

5 Inverse otmzaton methods Gradent decent method Comuter smulated annealng Fltered back-rojecton Iteratve methods based on gradent descent algorthms Standard n commercal lannng systems Mnmum of the cost functon: best achevable dose dstrbuton Gradent descent algorthm Dose otmzaton The gradent of C s C( w) D D M w D C( w ) Target D D Target: 70 Gy OAR: 30 Gy modulate ntensty for sarng OAR Smlest form s: w k w k Target M D D k Dose otmzaton Dose otmzaton Two beams: modulate ntensty for sarng OAR modulate ntensty to mrove homogenety NB: AP s not fully blocked n center 5

6 Conventonal otmzaton rocess Qualty of dose model n otmzaton Fluence otmzaton Create leaf sequence Create delverable ntenstes Delverable dose calculaton Delverable lan No leaf ostons Leaf sequencer Accurate dose algorthm How to reconcle a fast and stable otmzaton wth accuracy? Use smle dose algorthm n otmzaton Recalculate wth correct model What f fnal dose calculaton shows an unaccetable lan? Drect aerture otmzaton Qualty of dose model n otmzaton Adjust fluence Intal Fluence Create leaf sequence Create delverable ntenstes Dose calculaton Evaluate lan objectve OK Leaf sequencer Soluton (RaySearch module n Pnnacle and Masterlan) Use smle dose algorthm n otmzaton Calculate after N teratons (tycally 5 to 0) dose wth accurate dose model Save the fluence Subtract the dose from the rescrton Otmze remanng fluence to match dose dfference wth smle model Otmzed fluence Qualty of dose model n otmzaton Remarks Soluton (CMS Monaco) Use reasonable dose algorthm n otmzaton Recalculate the otmal lan wth accurate dose model Allow for or otmzaton stes to mrove the lan, usng the accurate dose model Dscretzaton Smooth beams 6

7 Dscretzaton Dscretzaton The radaton oncologst draws ths contour But the otmzaton rogram sees ths: Smooth beams Smooth beams The ntensty dstrbuton tend to have local fluctuaton, more modulaton results n more comlex delvery Increase of delvery tme More MU needed More leaf travel More suscetble to treatment uncertantes Summary The dfference between actual and rescrbed dose s rojected onto the fluence ma A costfuncton s used to evaluated the otmzed dose dstrbuton relatve to the desred dose dstrbuton The costfuncton s used to otmze the dose dstrbuton Drect aerture otmzaton ncludes machne arameters n the otmzaton 7

Outline. Seamless Image Stitching in the Gradient Domain. Related Approaches. Image Stitching. Introduction Related Work

Outline. Seamless Image Stitching in the Gradient Domain. Related Approaches. Image Stitching. Introduction Related Work Outlne Seamless Image Sttchng n the Gradent Doman Anat Levn, Assaf Zomet, Shmuel Peleg and Yar Wess ECCV 004 Presenter: Pn Wu Oct 007 Introducton Related Work GIST: Gradent-doman Image Sttchng GIST GIST

More information

Application of Genetic Algorithms in Graph Theory and Optimization. Qiaoyan Yang, Qinghong Zeng

Application of Genetic Algorithms in Graph Theory and Optimization. Qiaoyan Yang, Qinghong Zeng 3rd Internatonal Conference on Materals Engneerng, Manufacturng Technology and Control (ICMEMTC 206) Alcaton of Genetc Algorthms n Grah Theory and Otmzaton Qaoyan Yang, Qnghong Zeng College of Mathematcs,

More information

CS229 Class Project: Fusion arc treatment planning strategy by adaptive learning cost function based beam selection Ho Jin Kim

CS229 Class Project: Fusion arc treatment planning strategy by adaptive learning cost function based beam selection Ho Jin Kim CS229 Class Project: Fuson arc treatment plannng strategy by adaptve learnng cost functon based beam selecton Ho Jn Km (eekhj87@stanford.edu) Abstract Current therapeutc modaltes n radaton therapy such

More information

Available online at ScienceDirect. Procedia Computer Science 94 (2016 )

Available online at  ScienceDirect. Procedia Computer Science 94 (2016 ) Avalable onlne at www.scencedrect.com ScenceDrect Proceda Comuter Scence 94 (2016 ) 176 182 The 13th Internatonal Conference on Moble Systems and Pervasve Comutng (MobSPC 2016) An Effcent QoS-aware Web

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Transactions on Visualization and Computer Graphics. Sketching of Mirror-symmetric Shapes. Figure 1: Sketching of a symmetric shape.

Transactions on Visualization and Computer Graphics. Sketching of Mirror-symmetric Shapes. Figure 1: Sketching of a symmetric shape. Page of 0 Transactons on Vsualzaton and omuter Grahcs 0 0 0 Abstract Sketchng of Mrror-symmetrc Shaes For Peer Revew Only Ths aer resents a system to create mrror-symmetrc surfaces from sketches. The system

More information

Point Cloud Surface Representations

Point Cloud Surface Representations Pont Cloud Surface Reresentatons Mark Pauly 2003 see also EG2003 course on Pont-based Comuter Grahcs avalable at: htt://grahcs.stanford.edu/~maauly/pdfs/pontbasedcomutergrahcs_eg03.df Paers Hoe, DeRose,

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

Image Segmentation. Image Segmentation

Image Segmentation. Image Segmentation Image Segmentaton REGION ORIENTED SEGMENTATION Let R reresent the entre mage regon. Segmentaton may be vewed as a rocess that arttons R nto n subregons, R, R,, Rn,such that n= R = R.e., the every xel must

More information

Dijkstra s Single Source Algorithm. All-Pairs Shortest Paths. Dynamic Programming Solution. Performance. Decision Sequence.

Dijkstra s Single Source Algorithm. All-Pairs Shortest Paths. Dynamic Programming Solution. Performance. Decision Sequence. All-Pars Shortest Paths Gven an n-vertex drected weghted graph, fnd a shortest path from vertex to vertex for each of the n vertex pars (,). Dstra s Sngle Source Algorthm Use Dstra s algorthm n tmes, once

More information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton

More information

Recognition of Identifiers from Shipping Container Images Using Fuzzy Binarization and Enhanced Fuzzy Neural Network

Recognition of Identifiers from Shipping Container Images Using Fuzzy Binarization and Enhanced Fuzzy Neural Network Recognton of Identfers from Shng Contaner Images Usng uzzy Bnarzaton and Enhanced uzzy Neural Networ Kwang-Bae Km Det. of Comuter Engneerng, Slla Unversty, Korea gbm@slla.ac.r Abstract. In ths aer, we

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Dijkstra s Single Source Algorithm. All-Pairs Shortest Paths. Dynamic Programming Solution. Performance

Dijkstra s Single Source Algorithm. All-Pairs Shortest Paths. Dynamic Programming Solution. Performance All-Pars Shortest Paths Gven an n-vertex drected weghted graph, fnd a shortest path from vertex to vertex for each of the n vertex pars (,). Dkstra s Sngle Source Algorthm Use Dkstra s algorthm n tmes,

More information

An efficient method to build panoramic image mosaics

An efficient method to build panoramic image mosaics An effcent method to buld panoramc mage mosacs Pattern Recognton Letters vol. 4 003 Dae-Hyun Km Yong-In Yoon Jong-Soo Cho School of Electrcal Engneerng and Computer Scence Kyungpook Natonal Unv. Abstract

More information

Active Contours/Snakes

Active Contours/Snakes Actve Contours/Snakes Erkut Erdem Acknowledgement: The sldes are adapted from the sldes prepared by K. Grauman of Unversty of Texas at Austn Fttng: Edges vs. boundares Edges useful sgnal to ndcate occludng

More information

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like: Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A

More information

Fitting: Deformable contours April 26 th, 2018

Fitting: Deformable contours April 26 th, 2018 4/6/08 Fttng: Deformable contours Aprl 6 th, 08 Yong Jae Lee UC Davs Recap so far: Groupng and Fttng Goal: move from array of pxel values (or flter outputs) to a collecton of regons, objects, and shapes.

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

Human Action Recognition Using Discriminative Models in the Learned Hierarchical Manifold Space

Human Action Recognition Using Discriminative Models in the Learned Hierarchical Manifold Space Human Acton Recognton Usng Dscrmnatve Models n the Learned Herarchcal Manfold Sace Le Han, We Lang*, nxao Wu and Yunde Ja School of Comuter Scence and Technology, Beng Insttute of Technology 5 South Zhongguancun

More information

LOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit

LOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit LOOP ANALYSS The second systematic technique to determine all currents and voltages in a circuit T S DUAL TO NODE ANALYSS - T FRST DETERMNES ALL CURRENTS N A CRCUT AND THEN T USES OHM S LAW TO COMPUTE

More information

A NEW HEURISTIC APPROACH FOR DEMAND RESPONSIVE TRANSPORTATION SYSTEMS

A NEW HEURISTIC APPROACH FOR DEMAND RESPONSIVE TRANSPORTATION SYSTEMS A NEW HEURISTIC APPROACH FOR DEMAND RESPONSIVE TRANSPORTATION SYSTEMS Ru Jorge Gomes Faculdade de Engenhara da Unversdade do Porto Rua Dr. Roberto Fras, 4200-465 Porto, Portugal rjgomes@fe.u.t Jorge Pnho

More information

Automated Beam Placement for Breast Radiotherapy Using A. Support Vector Machine Based Algorithm

Automated Beam Placement for Breast Radiotherapy Using A. Support Vector Machine Based Algorithm Automated Beam Placement for Breast Radotherapy Usng A Support Vector Machne Based Algorthm 5 Xuan Zhao 1, Dewen Kong 1, Gabor Jozsef, Ph.D. 2, Jenghwa Chang, Ph.D. 2, Edward K. Wong, Ph.D. 3, Slva C.

More information

AP PHYSICS B 2008 SCORING GUIDELINES

AP PHYSICS B 2008 SCORING GUIDELINES AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for

More information

Lecture Note 08 EECS 4101/5101 Instructor: Andy Mirzaian. All Nearest Neighbors: The Lifting Method

Lecture Note 08 EECS 4101/5101 Instructor: Andy Mirzaian. All Nearest Neighbors: The Lifting Method Lecture Note 08 EECS 4101/5101 Instructor: Andy Mrzaan Introducton All Nearest Neghbors: The Lftng Method Suose we are gven aset P ={ 1, 2,..., n }of n onts n the lane. The gven coordnates of the -th ont

More information

MODULE - 9 LECTURE NOTES 1 FUZZY OPTIMIZATION

MODULE - 9 LECTURE NOTES 1 FUZZY OPTIMIZATION Water Resources Systems Plannng an Management: vance Tocs Fuzzy Otmzaton MODULE - 9 LECTURE NOTES FUZZY OPTIMIZTION INTRODUCTION The moels scusse so far are crs an recse n nature. The term crs means chotonomous.e.,

More information

Multi-stable Perception. Necker Cube

Multi-stable Perception. Necker Cube Mult-stable Percepton Necker Cube Spnnng dancer lluson, Nobuuk Kaahara Fttng and Algnment Computer Vson Szelsk 6.1 James Has Acknowledgment: Man sldes from Derek Hoem, Lana Lazebnk, and Grauman&Lebe 2008

More information

Global Illumination: Radiosity

Global Illumination: Radiosity Last Tme? Global Illumnaton: Radosty Planar Shadows Shadow Maps An early applcaton of radatve heat transfer n stables. Projectve Texture Shadows (Texture Mappng) Shadow Volumes (Stencl Buffer) Schedule

More information

SOFT COMPUTING OPTIMIZER FOR INTELLIGENT CONTROL SYSTEMS DESIGN: THE STRUCTURE AND APPLICATIONS

SOFT COMPUTING OPTIMIZER FOR INTELLIGENT CONTROL SYSTEMS DESIGN: THE STRUCTURE AND APPLICATIONS SOFT COMPUTING OPTIMIZER FOR INTELLIGENT CONTROL SYSTEMS DESIGN: THE STRUCTURE AND APPLICATIONS Sergey A. PANFILOV, Ludmla V. LITVINTSEVA, Ilya S. ULYANOV, Kazuk TAKAHASHI, Sergue V. ULYANOV YAMAHA Motor

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

Unsupervised Learning

Unsupervised Learning Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

Fitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros.

Fitting & Matching. Lecture 4 Prof. Bregler. Slides from: S. Lazebnik, S. Seitz, M. Pollefeys, A. Effros. Fttng & Matchng Lecture 4 Prof. Bregler Sldes from: S. Lazebnk, S. Setz, M. Pollefeys, A. Effros. How do we buld panorama? We need to match (algn) mages Matchng wth Features Detect feature ponts n both

More information

A new Algorithm for Lossless Compression applied to two-dimensional Static Images

A new Algorithm for Lossless Compression applied to two-dimensional Static Images A new Algorthm for Lossless Comresson aled to two-dmensonal Statc Images JUAN IGNACIO LARRAURI Deartment of Technology Industral Unversty of Deusto Avda. Unversdades, 4. 48007 Blbao SPAIN larrau@deusto.es

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

The ray density estimation of a CT system by a supervised learning algorithm

The ray density estimation of a CT system by a supervised learning algorithm Te ray densty estaton of a CT syste by a suervsed learnng algort Nae : Jongduk Baek Student ID : 5459 Toc y toc s to fnd te ray densty of a new CT syste by usng te learnng algort Background Snce te develoent

More information

Fuzzy Multi Objective Transportation Model. Based on New Ranking Index on. Generalized LR Fuzzy Numbers

Fuzzy Multi Objective Transportation Model. Based on New Ranking Index on. Generalized LR Fuzzy Numbers Aled Mathematcal Scences, Vol 8, 4, no 8, 6849-6879 HIKARI Ltd, wwwm-hkarcom htt://dxdoorg/988/ams4486 Fuzzy Mult Obectve Transortaton Model Based on New Rankng Index on Generalzed LR Fuzzy Numbers Y L

More information

Airport Engineering Lectures

Airport Engineering Lectures Basc Concepts I-4 Landng & Take-off Operatons Landng & Take-off Operatons 1. Landng. 2. Take Off. Runway Length Regulaton Requrements (FAR 25 & 21) 1 I-5 Runway Length Factors affectng R/W length Components:

More information

Skew Estimation in Document Images Based on an Energy Minimization Framework

Skew Estimation in Document Images Based on an Energy Minimization Framework Skew Estmaton n Document Images Based on an Energy Mnmzaton Framework Youbao Tang 1, Xangqan u 1, e Bu 2, and Hongyang ang 3 1 School of Comuter Scence and Technology, Harbn Insttute of Technology, Harbn,

More information

Optimized Query Planning of Continuous Aggregation Queries in Dynamic Data Dissemination Networks

Optimized Query Planning of Continuous Aggregation Queries in Dynamic Data Dissemination Networks WWW 007 / Trac: Performance and Scalablty Sesson: Scalable Systems for Dynamc Content Otmzed Query Plannng of Contnuous Aggregaton Queres n Dynamc Data Dssemnaton Networs Rajeev Guta IBM Inda Research

More information

Monaco VMAT. The Next Generation in IMRT/VMAT Planning. Paulo Mathias Customer Support TPS Application

Monaco VMAT. The Next Generation in IMRT/VMAT Planning. Paulo Mathias Customer Support TPS Application Monaco VMAT The Next Generation in IMRT/VMAT Planning Paulo Mathias Customer Support TPS Application 11.05.2011 Background What is Monaco? Advanced IMRT/VMAT treatment planning system from Elekta Software

More information

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,

More information

Very simple computational domains can be discretized using boundary-fitted structured meshes (also called grids)

Very simple computational domains can be discretized using boundary-fitted structured meshes (also called grids) Structured meshes Very smple computatonal domans can be dscretzed usng boundary-ftted structured meshes (also called grds) The grd lnes of a Cartesan mesh are parallel to one another Structured meshes

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010

Simulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010 Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement

More information

TIME-EFFICIENT NURBS CURVE EVALUATION ALGORITHMS

TIME-EFFICIENT NURBS CURVE EVALUATION ALGORITHMS TIME-EFFICIENT NURBS CURVE EVALUATION ALGORITHMS Kestuts Jankauskas Kaunas Unversty of Technology, Deartment of Multmeda Engneerng, Studentu st. 5, LT-5368 Kaunas, Lthuana, kestuts.jankauskas@ktu.lt Abstract:

More information

A MULTILEVEL DECISION MAKING MODEL FOR THE SUPPLIER SELECTION PROBLEM IN A FUZZY SITUATION

A MULTILEVEL DECISION MAKING MODEL FOR THE SUPPLIER SELECTION PROBLEM IN A FUZZY SITUATION OPERATIONS RESEARCH AND DECISIONS No. 4 2017 DOI: 10.5277/ord170401 Ahmad Yusuf ADHAMI 1 Syed Mohd MUNEEB 1 Mohammad Asm NOMANI 2 A MULTILEVEL DECISION MAKING MODEL FOR THE SUPPLIER SELECTION PROBLEM IN

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Unsupervised Learning and Clustering

Unsupervised Learning and Clustering Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

Uncertainty operations with Statool. Jianzhong Zhang. A thesis submitted to the graduate faculty

Uncertainty operations with Statool. Jianzhong Zhang. A thesis submitted to the graduate faculty Uncertanty oeratons wth Statool by Janzhong Zhang A thess submtted to the graduate faculty n artal fulfllment of the requrements for the degree of MASTER OF SCIECE Maor: Comutng Engneerng Program of Study

More information

On the Two-level Hybrid Clustering Algorithm

On the Two-level Hybrid Clustering Algorithm On the Two-level Clusterng Algorthm ng Yeow Cheu, Chee Keong Kwoh, Zongln Zhou Bonformatcs Research Centre, School of Comuter ngneerng, Nanyang Technologcal Unversty, Sngaore 639798 ezlzhou@ntu.edu.sg

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

Multi-objective Design Optimization of MCM Placement

Multi-objective Design Optimization of MCM Placement Proceedngs of the 5th WSEAS Int. Conf. on Instrumentaton, Measurement, Crcuts and Systems, Hangzhou, Chna, Aprl 6-8, 26 (pp56-6) Mult-objectve Desgn Optmzaton of MCM Placement Chng-Ma Ko ab, Yu-Jung Huang

More information

A High-Accuracy Algorithm for Surface Defect Detection of Steel Based on DAG-SVM

A High-Accuracy Algorithm for Surface Defect Detection of Steel Based on DAG-SVM Sensors & Transducers, Vol. 57, Issue 0, October 203,. 42-48 Sensors & Transducers 203 by IFSA htt://www.sensorsortal.com A Hgh-Accuracy Algorthm for Surface Defect Detecton of Steel Based on DAG-SVM,

More information

Semi-Supervised Biased Maximum Margin Analysis for Interactive Image Retrieval

Semi-Supervised Biased Maximum Margin Analysis for Interactive Image Retrieval IP-06850-00.R3 Sem-Suervsed Based Maxmum Margn Analyss for Interactve Image Retreval Lnng Zhang,, Student Member, IEEE, Lo Wang, Senor Member, IEEE and Wes Ln 3, Senor Member, IEEE School of Electrcal

More information

Greedy Technique - Definition

Greedy Technique - Definition Greedy Technque Greedy Technque - Defnton The greedy method s a general algorthm desgn paradgm, bult on the follong elements: confguratons: dfferent choces, collectons, or values to fnd objectve functon:

More information

Ecient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem

Ecient Computation of the Most Probable Motion from Fuzzy. Moshe Ben-Ezra Shmuel Peleg Michael Werman. The Hebrew University of Jerusalem Ecent Computaton of the Most Probable Moton from Fuzzy Correspondences Moshe Ben-Ezra Shmuel Peleg Mchael Werman Insttute of Computer Scence The Hebrew Unversty of Jerusalem 91904 Jerusalem, Israel Emal:

More information

Comparison of traveltime inversions on a limestone structure

Comparison of traveltime inversions on a limestone structure Comparson of traveltme nversons on a lmestone structure Comparson of traveltme nversons on a lmestone structure Matthew D. Allen and Robert R. Stewart ABSRAC Four traveltme nverson technques were appled

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

Region Segmentation Readings: Chapter 10: 10.1 Additional Materials Provided

Region Segmentation Readings: Chapter 10: 10.1 Additional Materials Provided Regon Segmentaton Readngs: hater 10: 10.1 Addtonal Materals Provded K-means lusterng tet EM lusterng aer Grah Parttonng tet Mean-Shft lusterng aer 1 Image Segmentaton Image segmentaton s the oeraton of

More information

Conditional Speculative Decimal Addition*

Conditional Speculative Decimal Addition* Condtonal Speculatve Decmal Addton Alvaro Vazquez and Elsardo Antelo Dep. of Electronc and Computer Engneerng Unv. of Santago de Compostela, Span Ths work was supported n part by Xunta de Galca under grant

More information

Introduction. 1. Mathematical formulation. 1.1 Standard formulation

Introduction. 1. Mathematical formulation. 1.1 Standard formulation Comact mathematcal formulaton for Grah Parttonng Marc BOULLE France Telecom R&D 2, Avenue Perre Marzn 22300 Lannon France marc.boulle@francetelecom.com Abstract. The grah arttonng roblem conssts of dvdng

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Motivation. Motivation. Monte Carlo. Example: Soft Shadows. Outline. Monte Carlo Algorithms. Advanced Computer Graphics (Fall 2009)

Motivation. Motivation. Monte Carlo. Example: Soft Shadows. Outline. Monte Carlo Algorithms. Advanced Computer Graphics (Fall 2009) Advanced Comuter Grahcs Fall 29 CS 294, Renderng Lecture 4: Monte Carlo Integraton Rav Ramamoorth htt://nst.eecs.berkeley.edu/~cs294-3/a9 Motvaton Renderng = ntegraton Relectance equaton: Integrate over

More information

IMRT site-specific procedure: Prostate (CHHiP)

IMRT site-specific procedure: Prostate (CHHiP) IMRT site-specific procedure: Prostate (CHHiP) Scope: To provide site specific instructions for the planning of CHHIP IMRT patients Responsibilities: Radiotherapy Physicists, HPC Registered Therapy Radiographers

More information

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15

CS434a/541a: Pattern Recognition Prof. Olga Veksler. Lecture 15 CS434a/541a: Pattern Recognton Prof. Olga Veksler Lecture 15 Today New Topc: Unsupervsed Learnng Supervsed vs. unsupervsed learnng Unsupervsed learnng Net Tme: parametrc unsupervsed learnng Today: nonparametrc

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

AVO Modeling of Monochromatic Spherical Waves: Comparison to Band-Limited Waves

AVO Modeling of Monochromatic Spherical Waves: Comparison to Band-Limited Waves AVO Modelng of Monochromatc Sphercal Waves: Comparson to Band-Lmted Waves Charles Ursenbach* Unversty of Calgary, Calgary, AB, Canada ursenbach@crewes.org and Arnm Haase Unversty of Calgary, Calgary, AB,

More information

Expectation Maximization (EM). Mixtures of Gaussians. Learning probability distribution

Expectation Maximization (EM). Mixtures of Gaussians. Learning probability distribution S 2750 Macne Learnng Lecture 7 ectaton Mamzaton M. Mtures of Gaussans. Mos auskrect mos@cs.tt.edu 5329 Sennott Square S 2750 Macne Learnng Learnng robabty dstrbuton Basc earnng settngs: A set of random

More information

THE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY

THE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY Proceedngs of the 20 Internatonal Conference on Machne Learnng and Cybernetcs, Guln, 0-3 July, 20 THE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY JUN-HAI ZHAI, NA LI, MENG-YAO

More information

Announcements. Supervised Learning

Announcements. Supervised Learning Announcements See Chapter 5 of Duda, Hart, and Stork. Tutoral by Burge lnked to on web page. Supervsed Learnng Classfcaton wth labeled eamples. Images vectors n hgh-d space. Supervsed Learnng Labeled eamples

More information

REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES

REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES REFRACTIVE INDEX SELECTION FOR POWDER MIXTURES Laser dffracton s one of the most wdely used methods for partcle sze analyss of mcron and submcron sze powders and dspersons. It s quck and easy and provdes

More information

NGPM -- A NSGA-II Program in Matlab

NGPM -- A NSGA-II Program in Matlab Verson 1.4 LIN Song Aerospace Structural Dynamcs Research Laboratory College of Astronautcs, Northwestern Polytechncal Unversty, Chna Emal: lsssswc@163.com 2011-07-26 Contents Contents... 1. Introducton...

More information

C2 Training: June 8 9, Combining effect sizes across studies. Create a set of independent effect sizes. Introduction to meta-analysis

C2 Training: June 8 9, Combining effect sizes across studies. Create a set of independent effect sizes. Introduction to meta-analysis C2 Tranng: June 8 9, 2010 Introducton to meta-analyss The Campbell Collaboraton www.campbellcollaboraton.org Combnng effect szes across studes Compute effect szes wthn each study Create a set of ndependent

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Model-Based Pose Estimation by Consensus

Model-Based Pose Estimation by Consensus Model-Based Pose Estmaton by Consensus Anne Jorstad 1, Phlppe Burlna, I-Jeng Wang, Denns Lucarell, Danel DeMenthon 1 Appled Mathematcs and Scentfc Computaton, Unversty of Maryland College Park Johns Hopkns

More information

The Evaluation and Correction of the Reconstructed NURBS Surface Smoothing and Accuracy

The Evaluation and Correction of the Reconstructed NURBS Surface Smoothing and Accuracy Sensors & Transducers 2013 by IFSA http://www.sensorsportal.com The Evaluaton and Correcton of the Reconstructed NURBS Surface Smoothng and Accuracy Shgang WANG, Janzhou ZHANG, Yong YAN School of Mechatroncs

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

ACCURATE BIT ALLOCATION AND RATE CONTROL FOR DCT DOMAIN VIDEO TRANSCODING

ACCURATE BIT ALLOCATION AND RATE CONTROL FOR DCT DOMAIN VIDEO TRANSCODING ACCUATE BIT ALLOCATION AND ATE CONTOL FO DCT DOMAIN VIDEO TANSCODING Zhjun Le, Ncolas D. Georganas Multmeda Communcatons esearch Laboratory Unversty of Ottawa, Ottawa, Canada {lezj, georganas}@ mcrlab.uottawa.ca

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

Biostatistics 615/815

Biostatistics 615/815 The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts

More information

Automatic Clustering Using Teaching Learning Based Optimization

Automatic Clustering Using Teaching Learning Based Optimization Aled Mathematcs, 2014, 5, 1202-1211 Publshed Onlne May 2014 n ScRes. htt://www.scr.org/ournal/am htt://dx.do.org/10.4236/am.2014.58111 Automatc Clusterng Usng Teachng Learnng Based Otmzaton M. Ramakrshna

More information

Review of approximation techniques

Review of approximation techniques CHAPTER 2 Revew of appromaton technques 2. Introducton Optmzaton problems n engneerng desgn are characterzed by the followng assocated features: the objectve functon and constrants are mplct functons evaluated

More information

Multiple optimum values

Multiple optimum values 1.204 Lecture 22 Unconstraned nonlnear optmzaton: Amoeba BFGS Lnear programmng: Glpk Multple optmum values A B C G E Z X F Y D X 1 X 2 Fgure by MIT OpenCourseWare. Heurstcs to deal wth multple optma: Start

More information

Risk Assessment Using Functional Modeling based on Object Behavior and Interaction

Risk Assessment Using Functional Modeling based on Object Behavior and Interaction Rsk Assessment Usng Functonal Modelng based on Object Behavor and Interacton Akekacha Tangsuksant, Nakornth Promoon Software Engneerng Lab, Center of Ecellence n Software Engneerng Deartment of Comuter

More information

A Saturation Binary Neural Network for Crossbar Switching Problem

A Saturation Binary Neural Network for Crossbar Switching Problem A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com

More information

Programming in Fortran 90 : 2017/2018

Programming in Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values

More information

Design for Reliability: Case Studies in Manufacturing Process Synthesis

Design for Reliability: Case Studies in Manufacturing Process Synthesis Desgn for Relablty: Case Studes n Manufacturng Process Synthess Y. Lawrence Yao*, and Chao Lu Department of Mechancal Engneerng, Columba Unversty, Mudd Bldg., MC 473, New York, NY 7, USA * Correspondng

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

IX Price and Volume Measures: Specific QNA-ANA Issues

IX Price and Volume Measures: Specific QNA-ANA Issues IX Prce and Volume Measures: Secfc QNA-ANA Issues A. Introducton 9.. Ths chater addresses a selected set of ssues for constructng tme seres of rce and volume measures that are of secfc mortance for the

More information

Multi-view 3D Position Estimation of Sports Players

Multi-view 3D Position Estimation of Sports Players Mult-vew 3D Poston Estmaton of Sports Players Robbe Vos and Wlle Brnk Appled Mathematcs Department of Mathematcal Scences Unversty of Stellenbosch, South Afrca Emal: vosrobbe@gmal.com Abstract The problem

More information

SIGGRAPH Interactive Image Cutout. Interactive Graph Cut. Interactive Graph Cut. Interactive Graph Cut. Hard Constraints. Lazy Snapping.

SIGGRAPH Interactive Image Cutout. Interactive Graph Cut. Interactive Graph Cut. Interactive Graph Cut. Hard Constraints. Lazy Snapping. SIGGRAPH 004 Interactve Image Cutout Lazy Snappng Yn L Jan Sun Ch-Keung Tang Heung-Yeung Shum Mcrosoft Research Asa Hong Kong Unversty Separate an object from ts background Compose the object on another

More information

Research on Kruskal Crossover Genetic Algorithm for Multi- Objective Logistics Distribution Path Optimization

Research on Kruskal Crossover Genetic Algorithm for Multi- Objective Logistics Distribution Path Optimization , pp.367-378 http://dx.do.org/.14257/jmue.215..8.36 Research on Kruskal Crossover Genetc Algorthm for Mult- Objectve Logstcs Dstrbuton Path Optmzaton Yan Zhang 1,2, Xng-y Wu 1 and Oh-kyoung Kwon 2, a,

More information