Fast oriented bounding box optimization on the rotation group SO(3, R)
|
|
- Constance Campbell
- 6 years ago
- Views:
Transcription
1 Fast oriented bounding box optimization on the rotation group SO(3, R) Chia-Tche Chang 1, Bastien Gorissen 2,3 and Samuel Melchior 1,2 1 Department of Mathematical Engineering (INMA), Université catholique de Louvain 2 Department of Mechanical Engineering (MEMA), Université catholique de Louvain 3 CENAERO November 30th, 2012 C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 1
2 The problem: minimum-volume OBB Coming up next... The problem: minimum-volume OBB Exact methods in 2D and 3D Classical approaches for the 3D case Our goal Bringing optimization into the game How to solve an optimization problem? Results Conclusion C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 2
3 The problem: minimum-volume OBB The problem Given a set of n points X in 3D, find the minimum-volume arbitrarily oriented bounding box enclosing X. Collision detection, intersection tests, object representation, data approximation... (BV trees... ) C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 3
4 The problem: minimum-volume OBB Exact methods in 2D and 3D In 2D: the rotating calipers method A minimum-area rectangle circumscribing a convex polygon has at least one side flush with an edge of the polygon. C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 4
5 The problem: minimum-volume OBB Exact methods in 2D and 3D In 2D: the rotating calipers method A minimum-area rectangle circumscribing a convex polygon has at least one side flush with an edge of the polygon. Compute the convex hull: O(n log n) conv(x ) C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 4
6 The problem: minimum-volume OBB Exact methods in 2D and 3D In 2D: the rotating calipers method A minimum-area rectangle circumscribing a convex polygon has at least one side flush with an edge of the polygon. Compute the convex hull: O(n log n) Loop on all edges: O(n) easy and efficient conv(x ) C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 4
7 The problem: minimum-volume OBB Exact methods in 2D and 3D In 3D: generalization of the rotating calipers? A minimum-volume box circumscribing a convex polyhedron has at least one face flush with a face of the polyhedron? C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 5
8 The problem: minimum-volume OBB Exact methods in 2D and 3D In 3D: generalization of the rotating calipers? A minimum-volume box circumscribing a convex polyhedron has at least one face two adjacent faces flush with a face edges of the polyhedron. [O Rourke, 1985] C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 5
9 The problem: minimum-volume OBB Exact methods in 2D and 3D In 3D: generalization of the rotating calipers? A minimum-volume box circumscribing a convex polyhedron has at least one face two adjacent faces flush with a face edges of the polyhedron. [O Rourke, 1985] Problem: Loop on all pairs of edges and rotate the box while keeping edges flush O(n 3 ) time complexity... C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 5
10 The problem: minimum-volume OBB Classical approaches for the 3D case In practice... O Rourke s algorithm is too slow (cubic time) use faster but inexact methods: C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 6
11 The problem: minimum-volume OBB Classical approaches for the 3D case In practice... O Rourke s algorithm is too slow (cubic time) use faster but inexact methods: PCA-based methods (covariance matrix): very fast and easy to compute but may be very inaccurate C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 6
12 The problem: minimum-volume OBB Classical approaches for the 3D case In practice... O Rourke s algorithm is too slow (cubic time) use faster but inexact methods: PCA-based methods (covariance matrix): very fast and easy to compute but may be very inaccurate Brute-force all orientations with a small angle increment: large computation time and/or low accuracy C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 6
13 The problem: minimum-volume OBB Classical approaches for the 3D case In practice... O Rourke s algorithm is too slow (cubic time) use faster but inexact methods: PCA-based methods (covariance matrix): very fast and easy to compute but may be very inaccurate Brute-force all orientations with a small angle increment: large computation time and/or low accuracy Brute-force a well-chosen set of orientations: may sometimes have (very) good accuracy but still too slow C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 6
14 The problem: minimum-volume OBB Classical approaches for the 3D case In practice... O Rourke s algorithm is too slow (cubic time) use faster but inexact methods: PCA-based methods (covariance matrix): very fast and easy to compute but may be very inaccurate Brute-force all orientations with a small angle increment: large computation time and/or low accuracy Brute-force a well-chosen set of orientations: may sometimes have (very) good accuracy but still too slow Guaranteed quality approximation methods: same problem... C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 6
15 The problem: minimum-volume OBB Our goal What do we want? Goal: Very good accuracy: find an optimal OBB in (nearly?) all cases If a suboptimal solution is returned, it should be close to the best one Computational cost has to be low C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 7
16 The problem: minimum-volume OBB Our goal What do we want? Goal: Very good accuracy: find an optimal OBB in (nearly?) all cases If a suboptimal solution is returned, it should be close to the best one Computational cost has to be low Our approach: iterative algorithm based on optimization methods C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 7
17 Bringing optimization into the game Coming up next... The problem: minimum-volume OBB Bringing optimization into the game OBB fitting as an optimization problem Requirements Going hybrid How to solve an optimization problem? Results Conclusion C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 8
18 Bringing optimization into the game OBB fitting as an optimization problem A first, direct, formulation min over size, position, orientation so that the volume of the bounding box all the points are in the box C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 9
19 Bringing optimization into the game OBB fitting as an optimization problem A first, direct, formulation min over R 3, position, orientation so that the volume of the bounding box all the points are in the box = ( ξ, η, ζ ) denotes the dimensions of the OBB, C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 9
20 Bringing optimization into the game OBB fitting as an optimization problem A first, direct, formulation min over R 3, position, orientation so that ξ η ζ all the points are in the box = ( ξ, η, ζ ) denotes the dimensions of the OBB, C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 9
21 Bringing optimization into the game OBB fitting as an optimization problem A first, direct, formulation min over R 3, position, orientation so that ξ η ζ 1 all the rotated and 2 centered points 1 2 = ( ξ, η, ζ ) denotes the dimensions of the OBB, C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 9
22 Bringing optimization into the game OBB fitting as an optimization problem A first, direct, formulation min over R 3,Ξ R 3, orientation so that ξ η ζ 1 2 all the rotated points Ξ 1 2 = ( ξ, η, ζ ) denotes the dimensions of the OBB, Ξ is the center of the OBB. C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 9
23 Bringing optimization into the game OBB fitting as an optimization problem A first, direct, formulation min over R 3,Ξ R 3,R SO(3,R) so that ξ η ζ 1 2 R(all the points) Ξ 1 2 = ( ξ, η, ζ ) denotes the dimensions of the OBB, Ξ is the center of the OBB. R SO(3, R) is a rotation matrix, C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 9
24 Bringing optimization into the game OBB fitting as an optimization problem A first, direct, formulation min over R 3,Ξ R 3,R SO(3,R) so that ξ η ζ 1 2 R(all the points) Ξ 1 2 = ( ξ, η, ζ ) denotes the dimensions of the OBB, Ξ is the center of the OBB. R SO(3, R) is a rotation matrix, SO(3, R) = { R R 3 3 R T R = I = RR T, det(r) = 1 }, C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 9
25 Bringing optimization into the game OBB fitting as an optimization problem A first, direct, formulation min over R 3,Ξ R 3,R SO(3,R) ξ η ζ s.t. 1 2 RX i Ξ 1 2 i = 1,..., N = ( ξ, η, ζ ) denotes the dimensions of the OBB, Ξ is the center of the OBB. R SO(3, R) is a rotation matrix, SO(3, R) = { R R 3 3 R T R = I = RR T, det(r) = 1 }, X = {X i i = 1,..., N } is the considered set of points C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 9
26 Bringing optimization into the game OBB fitting as an optimization problem A first, direct, formulation min R 3,Ξ R 3,R SO(3,R) ξ η ζ s.t. 1 2 RX i Ξ 1 2 i = 1,..., N = ( ξ, η, ζ ) denotes the dimensions of the OBB, Ξ is the center of the OBB. R SO(3, R) is a rotation matrix, SO(3, R) = { R R 3 3 R T R = I = RR T, det(r) = 1 }, X = {X i i = 1,..., N } is the considered set of points Smooth but constrained optimization problem C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 9
27 Bringing optimization into the game OBB fitting as an optimization problem Unconstrained formulation min R SO(3,R) ( min R 3,Ξ R 3 ξ η ζ } s.t. 1 2 RX i Ξ 1 2 i = 1,..., N {{ } f (R) ) C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 10
28 Bringing optimization into the game OBB fitting as an optimization problem Unconstrained formulation min R SO(3,R) ( min R 3,Ξ R 3 ξ η ζ } s.t. 1 2 RX i Ξ 1 2 i = 1,..., N {{ } f (R) ) The objective function f (R) is simply the volume of the AABB of X rotated by R C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 10
29 Bringing optimization into the game OBB fitting as an optimization problem Unconstrained formulation min R SO(3,R) ( min R 3,Ξ R 3 ξ η ζ } s.t. 1 2 RX i Ξ 1 2 i = 1,..., N {{ } f (R) ) The objective function f (R) is simply the volume of the AABB of X rotated by R Unconstrained but non-differentiable optimization problem C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 10
30 Bringing optimization into the game Requirements Solving this problem requires... C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 11
31 Bringing optimization into the game Requirements Solving this problem requires a derivative-free method f (R) is not differentiable everywhere... C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 11
32 Bringing optimization into the game Requirements Solving this problem requires a derivative-free method... a global search technique f (R) has many local minima... C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 11
33 Bringing optimization into the game Requirements Solving this problem requires a derivative-free method... a global search technique... a fast convergence rate That was the point! C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 11
34 Bringing optimization into the game Going hybrid Our idea: using an hybrid method 1. Use a global exploration component: genetic algorithm (GA) C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 12
35 Bringing optimization into the game Going hybrid Our idea: using an hybrid method 1. Use a global exploration component: genetic algorithm (GA) 2. Speed up convergence using a local exploitation algorithm Nelder-Mead simplex algorithm (NM) C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 12
36 Bringing optimization into the game Going hybrid Our idea: using an hybrid method 1. Use a global exploration component: genetic algorithm (GA) 2. Speed up convergence using a local exploitation algorithm Nelder-Mead simplex algorithm (NM) GA alone would be very slow to converge (GA more suitable for discrete search spaces) NM alone would be stuck in local minima (even with restarts) C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 12
37 How to solve an optimization problem? Coming up next... The problem: minimum-volume OBB Bringing optimization into the game How to solve an optimization problem? Genetic algorithms (GA) The Nelder-Mead algorithm (NM) HYBBRID: let s mix GA and NM together! Results Conclusion C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 13
38 How to solve an optimization problem? Genetic algorithms (GA) Global exploration: genetic algorithms Stochastic population-based evolutionary method (original variant proposed by Holland in the 1970s) Population-based: keep a large set of candidates at each iteration Evolutionary: generate new candidates by combining current ones depending on their performance C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 14
39 How to solve an optimization problem? Genetic algorithms (GA) The general framework Start with a set of candidates (population) and a performance function (fitness function) C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 15
40 How to solve an optimization problem? Genetic algorithms (GA) The general framework Start with a set of candidates (population) and a performance function (fitness function) At each generation: Selection: parents are selected depending on their fitness C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 15
41 How to solve an optimization problem? Genetic algorithms (GA) The general framework Start with a set of candidates (population) and a performance function (fitness function) At each generation: Selection: parents are selected depending on their fitness Crossover: selected parents produce offsprings C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 15
42 How to solve an optimization problem? Genetic algorithms (GA) The general framework Start with a set of candidates (population) and a performance function (fitness function) At each generation: Selection: parents are selected depending on their fitness Crossover: selected parents produce offsprings Mutation: offsprings can be subject to mutations (random modification, gradient step, SA step,...) C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 15
43 How to solve an optimization problem? The Nelder-Mead algorithm (NM) The Nelder-Mead simplex algorithm Derivative-free simplicial optimization method (original algorithm proposed by Nelder & Mead in 1965) Simplex (in R n ) = set of n + 1 affinely independent points n = 2 : triangle n = 3 : tetrahedron... C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 16
44 How to solve an optimization problem? The Nelder-Mead algorithm (NM) Ideas of the algorithm (details omitted) Reflection Expansion Contraction Reduction Four main ways to move/transform the simplex depending on the performance of its vertices: affine combinations C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 17
45 How to solve an optimization problem? The Nelder-Mead algorithm (NM) Nelder-Mead and the six-hump camel back... 2 Current objective = The initial simplex C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 18
46 How to solve an optimization problem? The Nelder-Mead algorithm (NM) Nelder-Mead and the six-hump camel back... 2 Current objective = Iteration 1: contraction C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 18
47 How to solve an optimization problem? The Nelder-Mead algorithm (NM) Nelder-Mead and the six-hump camel back... 2 Current objective = Iteration 2: reflection C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 18
48 How to solve an optimization problem? The Nelder-Mead algorithm (NM) Nelder-Mead and the six-hump camel back... 2 Current objective = Iteration 3: contraction C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 18
49 How to solve an optimization problem? The Nelder-Mead algorithm (NM) Nelder-Mead and the six-hump camel back... 2 Current objective = Iteration 4: contraction C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 18
50 How to solve an optimization problem? The Nelder-Mead algorithm (NM) Nelder-Mead and the six-hump camel back... 2 Current objective = Iteration 5: contraction C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 18
51 How to solve an optimization problem? The Nelder-Mead algorithm (NM) Nelder-Mead and the six-hump camel back... 2 Current objective = Iteration 6: reduction C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 18
52 How to solve an optimization problem? The Nelder-Mead algorithm (NM) Nelder-Mead and the six-hump camel back... 2 Current objective = Iteration 7: contraction C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 18
53 How to solve an optimization problem? The Nelder-Mead algorithm (NM) Nelder-Mead and the six-hump camel back... 2 Current objective = Some more iterations... C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 18
54 How to solve an optimization problem? The Nelder-Mead algorithm (NM) Nelder-Mead and the six-hump camel back... 2 Current objective = Some more iterations... C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 18
55 How to solve an optimization problem? The Nelder-Mead algorithm (NM) Nelder-Mead and the six-hump camel back... 2 Current objective = The final result C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 18
56 How to solve an optimization problem? HYBBRID: let s mix GA and NM together! Mixing NM and GA together (simplified version) Population of M simplices (simplex = set of 4 rotation matrices) Fitness function f (R) (volume of corresponding OBB) C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 19
57 How to solve an optimization problem? HYBBRID: let s mix GA and NM together! Mixing NM and GA together (simplified version) Population of M simplices (simplex = set of 4 rotation matrices) Fitness function f (R) (volume of corresponding OBB) Selection: Evaluate fitness of all simplices, keep best 50% C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 19
58 How to solve an optimization problem? HYBBRID: let s mix GA and NM together! Mixing NM and GA together (simplified version) Population of M simplices (simplex = set of 4 rotation matrices) Fitness function f (R) (volume of corresponding OBB) Selection: Evaluate fitness of all simplices, keep best 50% Crossover I: Create M 2 offsprings by mixing vertices: A 1 B 1 C 1 D 1 A 2 B 2 C 2 D 2 A i1 B i2 C i3 D i4, i k {1, 2} C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 19
59 How to solve an optimization problem? HYBBRID: let s mix GA and NM together! Mixing NM and GA together (simplified version) Population of M simplices (simplex = set of 4 rotation matrices) Fitness function f (R) (volume of corresponding OBB) Selection: Evaluate fitness of all simplices, keep best 50% Crossover I: Create M 2 offsprings by mixing vertices: A 1 B 1 C 1 D 1 A 2 B 2 C 2 D 2 A i1 B i2 C i3 D i4, i k {1, 2} Crossover II: Create M 2 offsprings by affinely combine vertices: A 1 B 1 C 1 D 1 A 2 B 2 C 2 D 2 A 3 B 3 C 3 D 3 with A 3 = λa 1 + (1 λ)a 2 C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 19
60 How to solve an optimization problem? HYBBRID: let s mix GA and NM together! Mixing NM and GA together (simplified version) Population of M simplices (simplex = set of 4 rotation matrices) Fitness function f (R) (volume of corresponding OBB) Selection: Evaluate fitness of all simplices, keep best 50% Crossover I: Create M 2 offsprings by mixing vertices: A 1 B 1 C 1 D 1 A 2 B 2 C 2 D 2 A i1 B i2 C i3 D i4, i k {1, 2} Crossover II: Create M 2 offsprings by affinely combine vertices: A 1 B 1 C 1 D 1 A 2 B 2 C 2 D 2 A 3 B 3 C 3 D 3 with A 3 = λa 1 + (1 λ)a 2 Mutation: Apply K Nelder-Mead iterations on each offspring C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 19
61 How to solve an optimization problem? HYBBRID: let s mix GA and NM together! HYBBRID Nelder-Mead algorithm Genetic algorithm on the special orthogonal group SO(3) to solve the optimal OBB problem C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 20
62 How to solve an optimization problem? HYBBRID: let s mix GA and NM together! HYBBRID Nelder-Mead algorithm Genetic algorithm on the special orthogonal group SO(3) to solve the optimal OBB problem = HYbrid Bounding Box Rotation IDentification algorithm C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 20
63 Results Coming up next... The problem: minimum-volume OBB Bringing optimization into the game How to solve an optimization problem? Results Behaviour of HYBBRID Comparison to other algorithms Conclusion C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 21
64 Results Behaviour of HYBBRID Behavior of HYBBRID All algorithms tested on a benchmark set of 300 objects (Gamma db) Implementations done in MATLAB (built-in functions are used) C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 22
65 Results Behaviour of HYBBRID Behavior of HYBBRID: yes, it works! All algorithms tested on a benchmark set of 300 objects (Gamma db) Implementations done in MATLAB (built-in functions are used) 100 Tolerance = 1e Performance [%] Population size = Population size = Population size = 40 3 Population size = Computation time [s] Error is less than in 90%+ of the cases! C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 22
66 Results Behaviour of HYBBRID How does it scale? 15 Computation time [s] Number of vertices on the convex hull Experimental results show a roughly linear complexity! C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 23
67 Results Comparison to other algorithms Comparison to other iterative approaches Failure rate [%] Random search (60000 trials) Relative error tolerance Trying random orientations does not work... C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 24
68 Results Comparison to other algorithms Comparison to other iterative approaches Failure rate [%] fmincon, Euler angles (15 restarts) fmincon, Rotation matrix (15 restarts) Random search (60000 trials) Relative error tolerance Constrained smooth opti: success rate 40% but mainly AABBs... C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 24
69 Results Comparison to other algorithms Comparison to other iterative approaches Failure rate [%] Nelder Mead (30 restarts) fmincon, Euler angles (15 restarts) fmincon, Rotation matrix (15 restarts) Random search (60000 trials) Relative error tolerance Unconstrained non-diff. opti, random initializations: much better results! C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 24
70 Results Comparison to other algorithms Comparison to other iterative approaches HYBBRID (M=50, K=30) Nelder Mead (30 restarts) fmincon, Euler angles (15 restarts) fmincon, Rotation matrix (15 restarts) Random search (60000 trials) Failure rate [%] Relative error tolerance HYBBRID: combining potential solutions does improve the success rate! C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 24
71 Results Comparison to other algorithms Comparison to other algorithms First, let s ignore the computational cost and look at the failure rates AABB AABB with post processing Failure rate [%] Relative error tolerance A reference point: the simple AABB C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 25
72 Results Comparison to other algorithms Comparison to other algorithms First, let s ignore the computational cost and look at the failure rates AABB AABB with post processing Min PCA with post processing Continuous PCA with post processing Failure rate [%] Relative error tolerance PCA-based methods: limited accuracy C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 25
73 Results Comparison to other algorithms Comparison to other algorithms First, let s ignore the computational cost and look at the failure rates AABB AABB with post processing Min PCA with post processing Continuous PCA with post processing All Pairs Korsawe (fast variant) Korsawe (slow variant) Failure rate [%] Relative error tolerance Brute-forcing on a set of orientations may be OK... if well chosen! C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 25
74 Results Comparison to other algorithms Comparison to other algorithms First, let s ignore the computational cost and look at the failure rates AABB AABB with post processing Min PCA with post processing Continuous PCA with post processing All Pairs Korsawe (fast variant) Korsawe (slow variant) Barequet & Har Peled s GridSearchMinVolBbx (d=60) Failure rate [%] Relative error tolerance Guaranteed approximation algorithms: limited by computational resources C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 25
75 Results Comparison to other algorithms Comparison to other algorithms First, let s ignore the computational cost and look at the failure rates AABB AABB with post processing Min PCA with post processing Continuous PCA with post processing All Pairs Korsawe (fast variant) Korsawe (slow variant) Barequet & Har Peled s GridSearchMinVolBbx (d=60) HYBBRID(M=50, K=30) Failure rate [%] Relative error tolerance HYBBRID: more accurate than these other methods C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 25
76 Results Comparison to other algorithms Comparison to other algorithms What are the computation times? (Tolerance: 10 3 ) Performance [%] Failure rate [%] Computation time [s] Relative error tolerance AABB PCA Continuous PCA Brute-force on a set of orientations O Rourke s exact algorithm Guaranteed approximation HYBBRID C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 26
77 Results Comparison to other algorithms Comparison to other algorithms What are the computation times? (Tolerance: 10 6 ) Performance [%] Failure rate [%] Computation time [s] Relative error tolerance AABB PCA Continuous PCA Brute-force on a set of orientations O Rourke s exact algorithm Guaranteed approximation HYBBRID C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 26
78 Conclusion Coming up next... The problem: minimum-volume OBB Bringing optimization into the game How to solve an optimization problem? Results Conclusion C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 27
79 Conclusion Conclusion HYBBRID: Nelder-Mead Genetic algorithm able to approximate optimal OBBs using optimization on SO(3) C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 28
80 Conclusion Conclusion HYBBRID: Nelder-Mead Genetic algorithm able to approximate optimal OBBs using optimization on SO(3) More accurate and/or faster than other algorithms C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 28
81 Conclusion Conclusion HYBBRID: Nelder-Mead Genetic algorithm able to approximate optimal OBBs using optimization on SO(3) More accurate and/or faster than other algorithms Still has room for improvements... C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 28
82 Conclusion Conclusion HYBBRID: Nelder-Mead Genetic algorithm able to approximate optimal OBBs using optimization on SO(3) More accurate and/or faster than other algorithms Still has room for improvements... Thank you for your attention! C.-T. Chang et al. Fast oriented bounding box optimization on the rotation group SO(3, R) 28
Fast oriented bounding box optimization on the rotation group
Fast oriented bounding box optimization on the rotation group SO(3, R) CHIA-TCHE CHANG 1, BASTIEN GORISSEN,3 and SAMUEL MELCHIOR 1, 1 Université catholique de Louvain, Department of Mathematical Engineering
More informationOriented Bounding Box Computation Using Particle Swarm Optimization
Oriented Bounding Box Computation Using Particle Swarm Optimization Pierre B. Borckmans, P.-A. Absil Department of Mathematical Engineering, Université catholique de Louvain, B-1348 Louvain-la-Neuve, Belgium
More informationDynamic Collision Detection
Distance Computation Between Non-Convex Polyhedra June 17, 2002 Applications Dynamic Collision Detection Applications Dynamic Collision Detection Evaluating Safety Tolerances Applications Dynamic Collision
More informationMinimum Bounding Boxes for Regular Cross-Polytopes
Minimum Bounding Boxes for Regular Cross-Polytopes Salman Shahid Michigan State University shahids1@cse.msu.edu Dr. Sakti Pramanik Michigan State University pramanik@cse.msu.edu Dr. Charles B. Owen Michigan
More informationIntroduction. Optimization
Introduction to Optimization Amy Langville SAMSI Undergraduate Workshop N.C. State University SAMSI 6/1/05 GOAL: minimize f(x 1, x 2, x 3, x 4, x 5 ) = x 2 1.5x 2x 3 + x 4 /x 5 PRIZE: $1 million # of independent
More informationModern Methods of Data Analysis - WS 07/08
Modern Methods of Data Analysis Lecture XV (04.02.08) Contents: Function Minimization (see E. Lohrmann & V. Blobel) Optimization Problem Set of n independent variables Sometimes in addition some constraints
More informationData Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University
Data Mining Chapter 8: Search and Optimization Methods Fall 2011 Ming Li Department of Computer Science and Technology Nanjing University Search & Optimization Search and Optimization method deals with
More informationToday. Golden section, discussion of error Newton s method. Newton s method, steepest descent, conjugate gradient
Optimization Last time Root finding: definition, motivation Algorithms: Bisection, false position, secant, Newton-Raphson Convergence & tradeoffs Example applications of Newton s method Root finding in
More informationCollision Detection with Bounding Volume Hierarchies
Simulation in Computer Graphics Collision Detection with Bounding Volume Hierarchies Matthias Teschner Computer Science Department University of Freiburg Outline introduction bounding volumes BV hierarchies
More informationChapter 14 Global Search Algorithms
Chapter 14 Global Search Algorithms An Introduction to Optimization Spring, 2015 Wei-Ta Chu 1 Introduction We discuss various search methods that attempts to search throughout the entire feasible set.
More informationTopological Machining Fixture Layout Synthesis Using Genetic Algorithms
Topological Machining Fixture Layout Synthesis Using Genetic Algorithms Necmettin Kaya Uludag University, Mechanical Eng. Department, Bursa, Turkey Ferruh Öztürk Uludag University, Mechanical Eng. Department,
More informationDevelopment of optimization methods for Volvo fuel economy simulation. Master s thesis in Signal and Systems RAFAEL KLÜPPEL SMIJTINK
Development of optimization methods for Volvo fuel economy simulation. Master s thesis in Signal and Systems RAFAEL KLÜPPEL SMIJTINK 1 Development of optimization methods for Volvo fuel economy simulation.
More informationLecture 4. Convexity Robust cost functions Optimizing non-convex functions. 3B1B Optimization Michaelmas 2017 A. Zisserman
Lecture 4 3B1B Optimization Michaelmas 2017 A. Zisserman Convexity Robust cost functions Optimizing non-convex functions grid search branch and bound simulated annealing evolutionary optimization The Optimization
More informationHAM: A HYBRID ALGORITHM PREDICTION BASED MODEL FOR ELECTRICITY DEMAND
HAM: A HYBRID ALGORITHM PREDICTION BASED MODEL FOR ELECTRICITY DEMAND 1 WAHAB MUSA, 2 SALMAWATY TANSA 1 Assoc. Prof., Department of Electrical Engineering, UNIVERSITAS NEGERI GORONTALO 2 Lektor., Department
More informationIntroduction to optimization methods and line search
Introduction to optimization methods and line search Jussi Hakanen Post-doctoral researcher jussi.hakanen@jyu.fi How to find optimal solutions? Trial and error widely used in practice, not efficient and
More informationOptimizing the TracePro Optimization Process
Optimizing the TracePro Optimization Process A TracePro Webinar December 17, 2014 Presenter Presenter Dave Jacobsen Sr. Application Engineer Lambda Research Corporation Moderator Mike Gauvin Vice President
More informationIntroduction to Stochastic Optimization Methods (meta-heuristics) Modern optimization methods 1
Introduction to Stochastic Optimization Methods (meta-heuristics) Modern optimization methods 1 Efficiency of optimization methods Robust method Efficiency Specialized method Enumeration or MC kombinatorial
More informationSimplicial Global Optimization
Simplicial Global Optimization Julius Žilinskas Vilnius University, Lithuania September, 7 http://web.vu.lt/mii/j.zilinskas Global optimization Find f = min x A f (x) and x A, f (x ) = f, where A R n.
More informationEscaping Local Optima: Genetic Algorithm
Artificial Intelligence Escaping Local Optima: Genetic Algorithm Dae-Won Kim School of Computer Science & Engineering Chung-Ang University We re trying to escape local optima To achieve this, we have learned
More informationMarch 19, Heuristics for Optimization. Outline. Problem formulation. Genetic algorithms
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis and Dimensioning II Department of Electronics and Communications Engineering Tampere University of Technology, Tampere, Finland March 19, 2014
More informationAN IMPROVED ITERATIVE METHOD FOR SOLVING GENERAL SYSTEM OF EQUATIONS VIA GENETIC ALGORITHMS
AN IMPROVED ITERATIVE METHOD FOR SOLVING GENERAL SYSTEM OF EQUATIONS VIA GENETIC ALGORITHMS Seyed Abolfazl Shahzadehfazeli 1, Zainab Haji Abootorabi,3 1 Parallel Processing Laboratory, Yazd University,
More informationMATH3016: OPTIMIZATION
MATH3016: OPTIMIZATION Lecturer: Dr Huifu Xu School of Mathematics University of Southampton Highfield SO17 1BJ Southampton Email: h.xu@soton.ac.uk 1 Introduction What is optimization? Optimization is
More informationMATLAB Based Optimization Techniques and Parallel Computing
MATLAB Based Optimization Techniques and Parallel Computing Bratislava June 4, 2009 2009 The MathWorks, Inc. Jörg-M. Sautter Application Engineer The MathWorks Agenda Introduction Local and Smooth Optimization
More informationSimplex of Nelder & Mead Algorithm
Simplex of N & M Simplex of Nelder & Mead Algorithm AKA the Amoeba algorithm In the class of direct search methods Unconstrained (although constraints can be added as part of error function) nonlinear
More informationUsing Genetic Algorithms to optimize ACS-TSP
Using Genetic Algorithms to optimize ACS-TSP Marcin L. Pilat and Tony White School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, K1S 5B6, Canada {mpilat,arpwhite}@scs.carleton.ca
More informationAn Evolutionary Algorithm for Minimizing Multimodal Functions
An Evolutionary Algorithm for Minimizing Multimodal Functions D.G. Sotiropoulos, V.P. Plagianakos and M.N. Vrahatis University of Patras, Department of Mamatics, Division of Computational Mamatics & Informatics,
More informationAn evolutionary annealing-simplex algorithm for global optimisation of water resource systems
FIFTH INTERNATIONAL CONFERENCE ON HYDROINFORMATICS 1-5 July 2002, Cardiff, UK C05 - Evolutionary algorithms in hydroinformatics An evolutionary annealing-simplex algorithm for global optimisation of water
More informationCollision and Proximity Queries
Collision and Proximity Queries Dinesh Manocha (based on slides from Ming Lin) COMP790-058 Fall 2013 Geometric Proximity Queries l Given two object, how would you check: If they intersect with each other
More informationUsing Bounding Volume Hierarchies Efficient Collision Detection for Several Hundreds of Objects
Part 7: Collision Detection Virtuelle Realität Wintersemester 2007/08 Prof. Bernhard Jung Overview Bounding Volumes Separating Axis Theorem Using Bounding Volume Hierarchies Efficient Collision Detection
More informationCHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM
20 CHAPTER 2 CONVENTIONAL AND NON-CONVENTIONAL TECHNIQUES TO SOLVE ORPD PROBLEM 2.1 CLASSIFICATION OF CONVENTIONAL TECHNIQUES Classical optimization methods can be classified into two distinct groups:
More informationFast Computation of Tight Fitting Oriented Bounding Boxes
1 Fast Computation of Tight Fitting Oriented Bounding Boxes Thomas Larsson Linus Källberg Mälardalen University, Sweden 1.1 Introduction Bounding shapes, or containers, are frequently used to speed up
More informationA Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery
A Steady-State Genetic Algorithm for Traveling Salesman Problem with Pickup and Delivery Monika Sharma 1, Deepak Sharma 2 1 Research Scholar Department of Computer Science and Engineering, NNSS SGI Samalkha,
More informationCollision Detection. Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering
RBE 550 MOTION PLANNING BASED ON DR. DMITRY BERENSON S RBE 550 Collision Detection Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering http://users.wpi.edu/~zli11 Euler Angle RBE
More informationIntroduction to unconstrained optimization - derivative-free methods
Introduction to unconstrained optimization - derivative-free methods Jussi Hakanen Post-doctoral researcher Office: AgC426.3 jussi.hakanen@jyu.fi Learning outcomes To understand the basic principles of
More informationMathematical Programming and Research Methods (Part II)
Mathematical Programming and Research Methods (Part II) 4. Convexity and Optimization Massimiliano Pontil (based on previous lecture by Andreas Argyriou) 1 Today s Plan Convex sets and functions Types
More informationCHAPTER 6 ORTHOGONAL PARTICLE SWARM OPTIMIZATION
131 CHAPTER 6 ORTHOGONAL PARTICLE SWARM OPTIMIZATION 6.1 INTRODUCTION The Orthogonal arrays are helpful in guiding the heuristic algorithms to obtain a good solution when applied to NP-hard problems. This
More informationNOVEL HYBRID GENETIC ALGORITHM WITH HMM BASED IRIS RECOGNITION
NOVEL HYBRID GENETIC ALGORITHM WITH HMM BASED IRIS RECOGNITION * Prof. Dr. Ban Ahmed Mitras ** Ammar Saad Abdul-Jabbar * Dept. of Operation Research & Intelligent Techniques ** Dept. of Mathematics. College
More informationOPTIMIZATION METHODS. For more information visit: or send an to:
OPTIMIZATION METHODS modefrontier is a registered product of ESTECO srl Copyright ESTECO srl 1999-2007 For more information visit: www.esteco.com or send an e-mail to: modefrontier@esteco.com NEOS Optimization
More informationArtificial Intelligence
Artificial Intelligence Information Systems and Machine Learning Lab (ISMLL) Tomáš Horváth 10 rd November, 2010 Informed Search and Exploration Example (again) Informed strategy we use a problem-specific
More informationCollision Detection II. These slides are mainly from Ming Lin s course notes at UNC Chapel Hill
Collision Detection II These slides are mainly from Ming Lin s course notes at UNC Chapel Hill http://www.cs.unc.edu/~lin/comp259-s06/ Some Possible Approaches Geometric methods Algebraic techniques Hierarchical
More informationDelaunay-based Derivative-free Optimization via Global Surrogate. Pooriya Beyhaghi, Daniele Cavaglieri and Thomas Bewley
Delaunay-based Derivative-free Optimization via Global Surrogate Pooriya Beyhaghi, Daniele Cavaglieri and Thomas Bewley May 23, 2014 Delaunay-based Derivative-free Optimization via Global Surrogate Pooriya
More informationContents. I Basics 1. Copyright by SIAM. Unauthorized reproduction of this article is prohibited.
page v Preface xiii I Basics 1 1 Optimization Models 3 1.1 Introduction... 3 1.2 Optimization: An Informal Introduction... 4 1.3 Linear Equations... 7 1.4 Linear Optimization... 10 Exercises... 12 1.5
More information3D Transformations. CS 4620 Lecture 10. Cornell CS4620 Fall 2014 Lecture Steve Marschner (with previous instructors James/Bala)
3D Transformations CS 4620 Lecture 10 1 Translation 2 Scaling 3 Rotation about z axis 4 Rotation about x axis 5 Rotation about y axis 6 Properties of Matrices Translations: linear part is the identity
More informationAlgoritmi di Ottimizzazione: Parte A Aspetti generali e algoritmi classici
Identificazione e Controllo Intelligente Algoritmi di Ottimizzazione: Parte A Aspetti generali e algoritmi classici David Naso A.A. 2006-2007 Identificazione e Controllo Intelligente 1 Search and optimization
More informationREAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION. Nedim TUTKUN
REAL-CODED GENETIC ALGORITHMS CONSTRAINED OPTIMIZATION Nedim TUTKUN nedimtutkun@gmail.com Outlines Unconstrained Optimization Ackley s Function GA Approach for Ackley s Function Nonlinear Programming Penalty
More informationEvolutionary Computation Algorithms for Cryptanalysis: A Study
Evolutionary Computation Algorithms for Cryptanalysis: A Study Poonam Garg Information Technology and Management Dept. Institute of Management Technology Ghaziabad, India pgarg@imt.edu Abstract The cryptanalysis
More informationNumerical Optimization
Numerical Optimization Quantitative Macroeconomics Raül Santaeulàlia-Llopis MOVE-UAB and Barcelona GSE Fall 2018 Raül Santaeulàlia-Llopis (MOVE-UAB,BGSE) QM: Numerical Optimization Fall 2018 1 / 46 1 Introduction
More informationLocal Search (Greedy Descent): Maintain an assignment of a value to each variable. Repeat:
Local Search Local Search (Greedy Descent): Maintain an assignment of a value to each variable. Repeat: Select a variable to change Select a new value for that variable Until a satisfying assignment is
More informationAn Introduction to Evolutionary Algorithms
An Introduction to Evolutionary Algorithms Karthik Sindhya, PhD Postdoctoral Researcher Industrial Optimization Group Department of Mathematical Information Technology Karthik.sindhya@jyu.fi http://users.jyu.fi/~kasindhy/
More informationTrajectory Optimization
Trajectory Optimization Jane Li Assistant Professor Mechanical Engineering & Robotics Engineering http://users.wpi.edu/~zli11 Recap We heard about RRT*, a sampling-based planning in high-dimensional cost
More informationIntroduction to Optimization
Introduction to Optimization Approximation Algorithms and Heuristics November 21, 2016 École Centrale Paris, Châtenay-Malabry, France Dimo Brockhoff Inria Saclay Ile-de-France 2 Exercise: The Knapsack
More informationLocalSolver 4.0: novelties and benchmarks
LocalSolver 4.0: novelties and benchmarks Thierry Benoist Julien Darlay Bertrand Estellon Frédéric Gardi Romain Megel www.localsolver.com 1/18 LocalSolver 3.1 Solver for combinatorial optimization Simple
More informationClassical Gradient Methods
Classical Gradient Methods Note simultaneous course at AMSI (math) summer school: Nonlin. Optimization Methods (see http://wwwmaths.anu.edu.au/events/amsiss05/) Recommended textbook (Springer Verlag, 1999):
More information1. Introduction. 2. Motivation and Problem Definition. Volume 8 Issue 2, February Susmita Mohapatra
Pattern Recall Analysis of the Hopfield Neural Network with a Genetic Algorithm Susmita Mohapatra Department of Computer Science, Utkal University, India Abstract: This paper is focused on the implementation
More informationInitializing the Particle Swarm Optimizer Using the Nonlinear Simplex Method
Initializing the Particle Swarm Optimizer Using the Nonlinear Simplex Method K.E. PARSOPOULOS, M.N. VRAHATIS Department of Mathematics University of Patras University of Patras Artificial Intelligence
More informationA Two-Stage Stochastic Programming Approach for Location-Allocation Models in Uncertain Environments
A Two-Stage Stochastic Programming Approach for Location-Allocation in Uncertain Environments Markus Kaiser, Kathrin Klamroth Optimization & Approximation Department of Mathematics University of Wuppertal
More informationA Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2
Chapter 5 A Genetic Algorithm for Graph Matching using Graph Node Characteristics 1 2 Graph Matching has attracted the exploration of applying new computing paradigms because of the large number of applications
More informationModel Parameter Estimation
Model Parameter Estimation Shan He School for Computational Science University of Birmingham Module 06-23836: Computational Modelling with MATLAB Outline Outline of Topics Concepts about model parameter
More informationCHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES
CHAPTER 6 HYBRID AI BASED IMAGE CLASSIFICATION TECHNIQUES 6.1 INTRODUCTION The exploration of applications of ANN for image classification has yielded satisfactory results. But, the scope for improving
More informationCollision Detection. These slides are mainly from Ming Lin s course notes at UNC Chapel Hill
Collision Detection These slides are mainly from Ming Lin s course notes at UNC Chapel Hill http://www.cs.unc.edu/~lin/comp259-s06/ Computer Animation ILE5030 Computer Animation and Special Effects 2 Haptic
More informationGlobal optimisation techniques in water resources management
XXVI General Assembly of European Geophysical Society Nice, France, 6-30 March 001 HSC/ Water Resources Engineering: Hydroinformatics Global optimisation techniques in water resources management Andreas
More informationArtificial Intelligence
Artificial Intelligence Informed Search and Exploration Chapter 4 (4.3 4.6) Searching: So Far We ve discussed how to build goal-based and utility-based agents that search to solve problems We ve also presented
More informationIntroduction to Genetic Algorithms
Advanced Topics in Image Analysis and Machine Learning Introduction to Genetic Algorithms Week 3 Faculty of Information Science and Engineering Ritsumeikan University Today s class outline Genetic Algorithms
More informationApplication of Emerging Metaheuristics in Power System Field
Application of Emerging Metaheuristics in Power System Field Dr.ir. J.L. Rueda Torres 26 th June 2015 1 Outline 1. Problem complexity 2. Why metaheuristics? 3. Emerging algorithms 4. Applications 2 1 Problem
More informationACONM: A hybrid of Ant Colony Optimization and Nelder-Mead Simplex Search
ACONM: A hybrid of Ant Colony Optimization and Nelder-Mead Simplex Search N. Arun & V.Ravi* Assistant Professor Institute for Development and Research in Banking Technology (IDRBT), Castle Hills Road #1,
More informationMeta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic Algorithm and Particle Swarm Optimization
2017 2 nd International Electrical Engineering Conference (IEEC 2017) May. 19 th -20 th, 2017 at IEP Centre, Karachi, Pakistan Meta- Heuristic based Optimization Algorithms: A Comparative Study of Genetic
More informationTHE DEVELOPMENT OF THE POTENTIAL AND ACADMIC PROGRAMMES OF WROCLAW UNIVERISTY OF TECHNOLOGY METAHEURISTICS
METAHEURISTICS 1. Objectives The goals of the laboratory workshop are as follows: to learn basic properties of evolutionary computation techniques and other metaheuristics for solving various global optimization
More informationJane Li. Assistant Professor Mechanical Engineering Department, Robotic Engineering Program Worcester Polytechnic Institute
Jane Li Assistant Professor Mechanical Engineering Department, Robotic Engineering Program Worcester Polytechnic Institute (3 pts) How to generate Delaunay Triangulation? (3 pts) Explain the difference
More informationBounding Volume Hierarchies
Tutorial: Real-Time Collision Detection for Dynamic Virtual Environments Bounding Volume Hierarchies Stefan Kimmerle WSI/GRIS University of Tübingen Outline Introduction Bounding Volume Types Hierarchy
More informationA Genetic Algorithm for Minimum Tetrahedralization of a Convex Polyhedron
A Genetic Algorithm for Minimum Tetrahedralization of a Convex Polyhedron Kiat-Choong Chen Ian Hsieh Cao An Wang Abstract A minimum tetrahedralization of a convex polyhedron is a partition of the convex
More informationMinimum-Volume Box Containing a Set of Points
Minimum-Volume Box Containing a Set of Points David Eberly, Geometric Tools, Redmond WA 98052 https://www.geometrictools.com/ This work is licensed under the Creative Commons Attribution 4.0 International
More informationEfficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions Author: Gill Barequet and Sariel Har-Peled Presenter: An Nguyen The Problem Input: a set S of points in R 3,
More informationTracking Minimum Distances between Curved Objects with Parametric Surfaces in Real Time
Tracking Minimum Distances between Curved Objects with Parametric Surfaces in Real Time Zhihua Zou, Jing Xiao Department of Computer Science University of North Carolina Charlotte zzou28@yahoo.com, xiao@uncc.edu
More informationVectorization Using Stochastic Local Search
Vectorization Using Stochastic Local Search Byron Knoll CPSC303, University of British Columbia March 29, 2009 Abstract: Stochastic local search can be used for the process of vectorization. In this project,
More informationOptimization in MATLAB Seth DeLand
Optimization in MATLAB Seth DeLand 4 The MathWorks, Inc. Topics Intro Using gradient-based solvers Optimization in Comp. Finance toolboxes Global optimization Speeding up your optimizations Optimization
More informationCutLeader Nesting Technology
CutLeader Technology algorithm is the soul of nesting software. For example knapsack algorithm, Pair technology, are able to get a better nesting result. The former is the approximate optimization algorithm;
More informationGenetic Algorithms Variations and Implementation Issues
Genetic Algorithms Variations and Implementation Issues CS 431 Advanced Topics in AI Classic Genetic Algorithms GAs as proposed by Holland had the following properties: Randomly generated population Binary
More informationAn Interface-fitted Mesh Generator and Polytopal Element Methods for Elliptic Interface Problems
An Interface-fitted Mesh Generator and Polytopal Element Methods for Elliptic Interface Problems Long Chen University of California, Irvine chenlong@math.uci.edu Joint work with: Huayi Wei (Xiangtan University),
More informationArtificial Intelligence
Artificial Intelligence Information Systems and Machine Learning Lab (ISMLL) Tomáš Horváth 16 rd November, 2011 Informed Search and Exploration Example (again) Informed strategy we use a problem-specific
More informationOffspring Generation Method using Delaunay Triangulation for Real-Coded Genetic Algorithms
Offspring Generation Method using Delaunay Triangulation for Real-Coded Genetic Algorithms Hisashi Shimosaka 1, Tomoyuki Hiroyasu 2, and Mitsunori Miki 2 1 Graduate School of Engineering, Doshisha University,
More informationLuo, W., and Li, Y. (2016) Benchmarking Heuristic Search and Optimisation Algorithms in Matlab. In: 22nd International Conference on Automation and Computing (ICAC), 2016, University of Essex, Colchester,
More informationUnidimensional Search for solving continuous high-dimensional optimization problems
2009 Ninth International Conference on Intelligent Systems Design and Applications Unidimensional Search for solving continuous high-dimensional optimization problems Vincent Gardeux, Rachid Chelouah,
More informationNumerical Optimization: Introduction and gradient-based methods
Numerical Optimization: Introduction and gradient-based methods Master 2 Recherche LRI Apprentissage Statistique et Optimisation Anne Auger Inria Saclay-Ile-de-France November 2011 http://tao.lri.fr/tiki-index.php?page=courses
More informationGEOMETRIC TOOLS FOR COMPUTER GRAPHICS
GEOMETRIC TOOLS FOR COMPUTER GRAPHICS PHILIP J. SCHNEIDER DAVID H. EBERLY MORGAN KAUFMANN PUBLISHERS A N I M P R I N T O F E L S E V I E R S C I E N C E A M S T E R D A M B O S T O N L O N D O N N E W
More informationA Genetic Algorithm Framework
Fast, good, cheap. Pick any two. The Project Triangle 3 A Genetic Algorithm Framework In this chapter, we develop a genetic algorithm based framework to address the problem of designing optimal networks
More informationCS281 Section 3: Practical Optimization
CS281 Section 3: Practical Optimization David Duvenaud and Dougal Maclaurin Most parameter estimation problems in machine learning cannot be solved in closed form, so we often have to resort to numerical
More informationHYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS
HYBRID GENETIC ALGORITHM WITH GREAT DELUGE TO SOLVE CONSTRAINED OPTIMIZATION PROBLEMS NABEEL AL-MILLI Financial and Business Administration and Computer Science Department Zarqa University College Al-Balqa'
More informationCPSC / Sonny Chan - University of Calgary. Collision Detection II
CPSC 599.86 / 601.86 Sonny Chan - University of Calgary Collision Detection II Outline Broad phase collision detection: - Problem definition and motivation - Bounding volume hierarchies - Spatial partitioning
More informationExploiting a database to predict the in-flight stability of the F-16
Exploiting a database to predict the in-flight stability of the F-16 David Amsallem and Julien Cortial December 12, 2008 1 Introduction Among the critical phenomena that have to be taken into account when
More informationy
The Unfit tutorial By Dr Martin Buist Initial version: November 2013 Unfit version: 2 or later This tutorial will show you how to write your own cost function for Unfit using your own model and data. Here
More informationCS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension
CS 372: Computational Geometry Lecture 10 Linear Programming in Fixed Dimension Antoine Vigneron King Abdullah University of Science and Technology November 7, 2012 Antoine Vigneron (KAUST) CS 372 Lecture
More informationLecture 8 Object Descriptors
Lecture 8 Object Descriptors Azadeh Fakhrzadeh Centre for Image Analysis Swedish University of Agricultural Sciences Uppsala University 2 Reading instructions Chapter 11.1 11.4 in G-W Azadeh Fakhrzadeh
More informationInternational Journal of Digital Application & Contemporary research Website: (Volume 1, Issue 7, February 2013)
Performance Analysis of GA and PSO over Economic Load Dispatch Problem Sakshi Rajpoot sakshirajpoot1988@gmail.com Dr. Sandeep Bhongade sandeepbhongade@rediffmail.com Abstract Economic Load dispatch problem
More information5. Computational Geometry, Benchmarks and Algorithms for Rectangular and Irregular Packing. 6. Meta-heuristic Algorithms and Rectangular Packing
1. Introduction 2. Cutting and Packing Problems 3. Optimisation Techniques 4. Automated Packing Techniques 5. Computational Geometry, Benchmarks and Algorithms for Rectangular and Irregular Packing 6.
More informationPORTFOLIO OPTIMISATION
PORTFOLIO OPTIMISATION N. STCHEDROFF Abstract. Portfolio optimisation is computationally intensive and has potential for performance improvement. This paper examines the effects of evaluating large numbers
More informationA penalty based filters method in direct search optimization
A penalty based filters method in direct search optimization ALDINA CORREIA CIICESI/ESTG P.PORTO Felgueiras PORTUGAL aic@estg.ipp.pt JOÃO MATIAS CM-UTAD Vila Real PORTUGAL j matias@utad.pt PEDRO MESTRE
More informationSung-Eui Yoon ( 윤성의 )
Path Planning for Point Robots Sung-Eui Yoon ( 윤성의 ) Course URL: http://sglab.kaist.ac.kr/~sungeui/mpa Class Objectives Motion planning framework Classic motion planning approaches 2 3 Configuration Space:
More information1. CONVEX POLYGONS. Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D.
1. CONVEX POLYGONS Definition. A shape D in the plane is convex if every line drawn between two points in D is entirely inside D. Convex 6 gon Another convex 6 gon Not convex Question. Why is the third
More informationThe movement of the dimmer firefly i towards the brighter firefly j in terms of the dimmer one s updated location is determined by the following equat
An Improved Firefly Algorithm for Optimization Problems Amarita Ritthipakdee 1, Arit Thammano, Nol Premasathian 3, and Bunyarit Uyyanonvara 4 Abstract Optimization problem is one of the most difficult
More informationComputational Geometry. Algorithm Design (10) Computational Geometry. Convex Hull. Areas in Computational Geometry
Computational Geometry Algorithm Design (10) Computational Geometry Graduate School of Engineering Takashi Chikayama Algorithms formulated as geometry problems Broad application areas Computer Graphics,
More information