An Evolutionary Strategy for Free Form Feature Identification in 3D CAD Models WSCG’07 conference Thomas R. Langerak, Joris. S.M. Vergeest, Huaxin Wang,

Slides:



Advertisements
Similar presentations
Application a hybrid controller to a mobile robot J.-S Chiou, K. -Y. Wang,Simulation Modelling Pratice and Theory Vol. 16 pp (2008) Professor:
Advertisements

Genetic Algorithms Vida Movahedi November Contents What are Genetic Algorithms? From Biology … Evolution … To Genetic Algorithms Demo.
Mathematics SL Internal Assessment: Type II. Portfolio Type I: Investigation (done last year) Type II: Modeling.
ECG Signal processing (2)
CS6800 Advanced Theory of Computation
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
GENETICA The problem-solving approach proposed here, largely based on the previous remarks, is implemented through the computer language GENETICA. GENETICA.
On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy
An Introduction to Sparse Coding, Sparse Sensing, and Optimization Speaker: Wei-Lun Chao Date: Nov. 23, 2011 DISP Lab, Graduate Institute of Communication.
On Constrained Optimization Approach To Object Segmentation Chia Han, Xun Wang, Feng Gao, Zhigang Peng, Xiaokun Li, Lei He, William Wee Artificial Intelligence.
Developments on Shape Optimization at CIMNE October Advanced modelling techniques for aerospace SMEs.
Genetic Algorithms1 COMP305. Part II. Genetic Algorithms.
A Study of Approaches for Object Recognition
Data classification based on tolerant rough set reporter: yanan yean.
Automatic Pose Estimation of 3D Facial Models Yi Sun and Lijun Yin Department of Computer Science State University of New York at Binghamton Binghamton,
Ant Colonies As Logistic Processes Optimizers
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
1 Simulation Modeling and Analysis Verification and Validation.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
Results Comparison with existing approaches on benchmark datasets Evaluation on a uveal melanoma datasetEvaluation on the two-spiral dataset Evaluation.
Results Classification - Comparison with existing approaches on benchmark datasets Survival Analysis – International multi-centre double-blind study Survival.
PhD Thesis. Biometrics Science studying measurements and statistics of biological data Most relevant application: id. recognition 2.
Coordinative Behavior in Evolutionary Multi-agent System by Genetic Algorithm Chuan-Kang Ting – Page: 1 International Graduate School of Dynamic Intelligent.
1 Intelligent Robotics Research Centre (IRRC) Department of Electrical and Computer Systems Engineering Monash University, Australia Visual Perception.
Demetris Kennes. Contents Aims Method(The Model) Genetic Component Cellular Component Evolution Test and results Conclusion Questions?
Evolution and Natural Selection CyberEd Charles Darwin.
A Budget Constrained Scheduling of Workflow Applications on Utility Grids using Genetic Algorithms Jia Yu and Rajkumar Buyya Grid Computing and Distributed.
Using Genetic Programming to Learn Probability Distributions as Mutation Operators with Evolutionary Programming Libin Hong, John Woodward, Ender Ozcan,
Natural Selection pg 81. Charles Darwin – the father of the theory of evolution. Came up with the theory while on a voyage to the Galapagos islands.
17 th Summer School on Image Processing Debrecen, Hungary 2009.
General Tensor Discriminant Analysis and Gabor Features for Gait Recognition by D. Tao, X. Li, and J. Maybank, TPAMI 2007 Presented by Iulian Pruteanu.
1 ENTROPY-BASED CONCEPT SHIFT DETECTION PETER VORBURGER, ABRAHAM BERNSTEIN IEEE ICDM 2006 Speaker: Li HueiJyun Advisor: Koh JiaLing Date:2007/11/6 1.
19.2 Public Exam Questions 6 men and the development of Evolution Theory You can expect 1-3 multiple choice questions from section 19.2.
CS440 Computer Science Seminar Introduction to Evolutionary Computing.
Predictive Design Space Exploration Using Genetically Programmed Response Surfaces Henry Cook Department of Electrical Engineering and Computer Science.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
Fuzzy Genetic Algorithm
How to apply Genetic Algorithms Successfully Prabhas Chongstitvatana Chulalongkorn University 4 February 2013.
G ENETIC A LGORITHMS Ranga Rodrigo March 5,
A Region Based Stereo Matching Algorithm Using Cooperative Optimization Zeng-Fu Wang, Zhi-Gang Zheng University of Science and Technology of China Computer.
Introduction to Evolutionary Computation Prabhas Chongstitvatana Chulalongkorn University WUNCA, Mahidol, 25 January 2011.
Genetic Algorithms CSCI-2300 Introduction to Algorithms
Addressing Non-uniqueness in Source Characterization for Multiple Contaminant Source Scenarios in Water Distribution Systems Jitendra Kumar 1, Emily M.
Alternating-offers Bargaining problems A Co-evolutionary Approach Nanlin Jin, Professor Edward Tsang, Professor Abhinay Muthoo, Tim Gosling, Dr Maria Fasli,
Evolving RBF Networks via GP for Estimating Fitness Values using Surrogate Models Ahmed Kattan Edgar Galvan.
1 Autonomic Computer Systems Evolutionary Computation Pascal Paysan.
Genetic algorithms: A Stochastic Approach for Improving the Current Cadastre Accuracies Anna Shnaidman Uri Shoshani Yerach Doytsher Mapping and Geo-Information.
An Introduction to Genetic Algorithms Lecture 2 November, 2010 Ivan Garibay
General information Theoretic basis of evolutionary computing. The general scheme of evolutionary algorithms General information Theoretic basis of evolutionary.
CAP6938 Neuroevolution and Artificial Embryogeny Evolutionary Comptation Dr. Kenneth Stanley January 23, 2006.
CSCI 631 – Foundations of Computer Vision March 15, 2016 Ashwini Imran Image Stitching.
Level Set Segmentation ~ 9.37 Ki-Chang Kwak.
31 Jan. 2007WSCG 2007, Plzen1/24 诸葛亮 Zhuge, Liang (AD 181 – 234) 料事如神 Predict events like.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Genetic Algorithm(GA)
Navitskaya Katsiaryna Yanka Kupala State University of Grodno Grodno, Belarus Modeling and optimization of multi-agent situation analysis’ procedures in.
1 A genetic algorithm with embedded constraints – An example on the design of robust D-stable IIR filters 潘欣泰 國立高雄大學 資工系.
July 6, 2016Knowledge-Based System, Lecturer # 09 1 Knowledge Based System Lecture #09 Dr. Md. Hasanuzzaman Assistant Professor Department of Computer.
Objective Towards the optimization of rebar quenching system, it is essential to understand the heat flux mechanism and its influence on the temperature.
Evolutionary Technique for Combinatorial Reverse Auctions
Evolving the goal priorities of autonomous agents
Creative Evolution of Flying Objects
Bulgarian Academy of Sciences
Raquel Ramos Pinho, João Manuel R. S. Tavares
Memetic Algorithms.
1: multiple representations
Research Article Title
Lecture 4. Niching and Speciation (1)
Tracking Neurons In A Free-Moving Caenorhabditis Elegans
Presentation transcript:

An Evolutionary Strategy for Free Form Feature Identification in 3D CAD Models WSCG’07 conference Thomas R. Langerak, Joris. S.M. Vergeest, Huaxin Wang, Yu Song January, 31, 2007

2 Contents Introduction Method outline Underlying theoretical model Evolutionary feature recognition An application example Results & Analysis Conclusions and future work

January, 31, Introduction Modern CAD modellers make use of features

January, 31, Introduction Modern CAD modellers make use of features

January, 31, Introduction Modern CAD modellers make use of features Han (2000)

January, 31, Introduction Modern CAD modellers make use of features Han (2000) Laakko & Mäntylä (2000)

January, 31, Introduction Modern CAD modellers make use of features Han (2000) Laakko & Mäntylä (2000) Cavendish (1995)

January, 31, Introduction Modern CAD modellers make use of features Han (2000) Laakko & Mäntylä (2000) Cavendish (1995) Pernot (2003)

January, 31, Introduction Modern CAD modellers make use of features Han (2000) Laakko & Mäntylä (2000) Cavendish (1995) Pernot (2003) Vergeest (2001)

January, 31, Introduction Modern CAD modellers make use of features Feature recognition is needed when: High-order information is not available Translation of the high-order information to another domain is required

January, 31, Method outline Underlying theoretical model Features have a nurbs representation Parameter control occurs through displacement of the control points

January, 31, Method outline Underlying theoretical model Features have a nurbs representation Parameter control occurs through displacement of the control points

January, 31, Method outline Underlying theoretical model Features have a nurbs representation Parameter control occurs through displacement of the control points

January, 31, Method outline Underlying theoretical model Features have a nurbs representation Parameter control occurs through displacement of the control points

January, 31, Method outline Evolutionary feature recognition Feature in a CAD model are recognized using template features A succesful recognition occurs when the ‘distance’ between a template feature and the target shape is minimal

January, 31, Method outline Evolutionary feature recognition Evolutionary computation: treating computational problems as cases of natural evolution “Survival of the fittest” Features can be viewed as organisms, with parameters as ‘genes’

January, 31, Method outline Evolutionary feature recognition Consecutive generations of a feature population are computed, using the shape similarity as a fitness indicator. The populations ‘evolve’ to an optimal solution

January, 31, An application example Bottle Gen #0

January, 31, An application example Bottle Gen #1

January, 31, An application example Bottle Gen #2

January, 31, An application example Bottle Gen #3

January, 31, An application example Bottle Gen #4

January, 31, An application example Bottle Gen #5

January, 31, Results and analysis 2500 tests conducted Target shapes were simulated by instantiating features on a flat surface and distorting them with Gaussian noise. Different values for the feature population size were used

January, 31, Results and analysis Feature type (# of params) Correctly identified Incorrectly identified Not identifiedTotal Plane (6)308 (96%)13 (4%)1 (0%)322 Bump (8)291 (94%)14 (5%)3 (1%)308 Ridge (9)274 (88%)32 (10%)5 (2%)311 Cross (9)324 (96%)8 (2%)4 (1%)336 Step (8)296 (95%)14 (5%)1(0%)311 Wave (10)212 (69%)73 (24%)23 (7%)308 Blend (8)301 (96%)9 (3%)2 (1%)312 Crown (10)284 (97%)4 (1%) 292 Total2290 (92%)167 (7%)43 (2%)2500 Table 1: Result for different feature types

January, 31, Results and analysis Population size/ Selection size Total 5% % % % % Total381 (76.2%)452 (90.4%)468 (93.6%)489 (98.8%)500 (100%)2290 Table 2: Result for different population sizes

January, 31, Conclusions and future work The method is able to identify features in a reasonable time (approx. 2 minutes) The method needs to be validated for more complicated situations. Work is being done to use the method for feature recognition and automatic feature type construction.

January, 31, Thanks and acknowledgements The research project DIT.6240 is supported by the Technology Foundation STW, applied science division of NWO and the technology program of the Ministry of Economic Affairs, The Netherlands. Thank you for listening!