A TABU SEARCH APPROACH TO POLYGONAL APPROXIMATION OF DIGITAL CURVES.

Slides:



Advertisements
Similar presentations
Local optimization technique G.Anuradha. Introduction The evaluation function defines a quality measure score landscape/response surface/fitness landscape.
Advertisements

Data Mining Classification: Alternative Techniques
G5BAIM Artificial Intelligence Methods
Tabu Search Strategy Hachemi Bennaceur 5/1/ iroboapp project, 2013.
Models and Methods for the Judge Assignment Problem Amina Lamghari Jacques A. Ferland Computer Science & OR Dept. University of Montreal.
ICS-171:Notes 4: 1 Notes 4: Optimal Search ICS 171 Summer 1999.
Gizem ALAGÖZ. Simulation optimization has received considerable attention from both simulation researchers and practitioners. Both continuous and discrete.
Spie98-1 Evolutionary Algorithms, Simulated Annealing, and Tabu Search: A Comparative Study H. Youssef, S. M. Sait, H. Adiche
Tabu Search for Model Selection in Multiple Regression Zvi Drezner California State University Fullerton.
1 Nuno Abreu, Zafeiris Kokkinogenis, Behdad Bozorg, Muhammad Ajmal.
MAE 552 – Heuristic Optimization Lecture 6 February 6, 2002.
GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURES Reporter : Benson.
Reporter : Mac Date : Multi-Start Method Rafael Marti.
Optimizing Schedules for Prioritized Path Planning of Multi-Robot Systems Maren Bennewitz Wolfram Burgard Sebastian Thrun.
MAE 552 – Heuristic Optimization
1 IOE/MFG 543 Chapter 14: General purpose procedures for scheduling in practice Section 14.4: Local search (Simulated annealing and tabu search)
Carmine Cerrone, Raffaele Cerulli, Bruce Golden GO IX Sirmione, Italy July
Ch. 11: Optimization and Search Stephen Marsland, Machine Learning: An Algorithmic Perspective. CRC 2009 some slides from Stephen Marsland, some images.
Ant Colony Optimization: an introduction
G5BAIM Artificial Intelligence Methods Tabu Search.
Tabu Search Manuel Laguna. Outline Background Short Term Memory Long Term Memory Related Tabu Search Methods.
R OBERTO B ATTITI, M AURO B RUNATO. The LION Way: Machine Learning plus Intelligent Optimization. LIONlab, University of Trento, Italy, Feb 2014.
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.
Elements of the Heuristic Approach
T ABU S EARCH Ta-Chun Lien. R EFERENCE Fred G., Manuel L., Tabu Search, Kluwer Academic Publishers, USA(1997)
Escaping local optimas Accept nonimproving neighbors – Tabu search and simulated annealing Iterating with different initial solutions – Multistart local.
A Genetic Algorithms Approach to Feature Subset Selection Problem by Hasan Doğu TAŞKIRAN CS 550 – Machine Learning Workshop Department of Computer Engineering.
An efficient distributed protocol for collective decision- making in combinatorial domains CMSS Feb , 2012 Minyi Li Intelligent Agent Technology.
Heuristic Optimization Methods
Tabu Search UW Spring 2005 INDE 516 Project 2 Lei Li, HongRui Liu, Roberto Lu.
Local Search Algorithms This lecture topic Chapter Next lecture topic Chapter 5 (Please read lecture topic material before and after each lecture.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Algorithms and their Applications CS2004 ( )
Heuristic Optimization Methods
Heuristic Optimization Methods Tabu Search: Advanced Topics.
Efficient algorithms for polygonal approximation
Combination of Exact and Approximate Methods for SAT and MAX-SAT Problems Frédéric Lardeux, Frédéric Saubion and Jin-Kao Hao Metaheuristics and Combinatorial.
Course: Logic Programming and Constraints
FORS 8450 Advanced Forest Planning Lecture 11 Tabu Search.
C OMPARING T HREE H EURISTIC S EARCH M ETHODS FOR F UNCTIONAL P ARTITIONING IN H ARDWARE -S OFTWARE C ODESIGN Theerayod Wiangtong, Peter Y. K. Cheung and.
CAS 721 Course Project Implementing Branch and Bound, and Tabu search for combinatorial computing problem By Ho Fai Ko ( )
G5BAIM Artificial Intelligence Methods
Single-solution based metaheuristics. Outline Local Search Simulated annealing Tabu search …
Parameter Optimization of a Bioprocess Model using Tabu Search Algorithm Olympia Roeva, Kalin Kosev Institute of Biophysics and Biomedical Engineering.
Reactive Tabu Search Contents A brief review of search techniques
Presenter: Leo, Shih-Chang, Lin Advisor: Frank, Yeong-Sung, Lin /12/16.
Heuristic Methods for the Single- Machine Problem Chapter 4 Elements of Sequencing and Scheduling by Kenneth R. Baker Byung-Hyun Ha R2.
METAHEURISTIC Jacques A. Ferland Department of Informatique and Recherche Opérationnelle Université de Montréal
Hub Location–Allocation in Intermodal Logistic Networks Hüseyin Utku KIYMAZ.
Preliminary Background Tabu Search Genetic Algorithm.
Assigning Judges to Competitions Using Tabu Search Approach Amina Lamghari Jacques A. Ferland Computer science and OR dept. University of Montreal.
Intro. ANN & Fuzzy Systems Lecture 37 Genetic and Random Search Algorithms (2)
Tabu Search Subset of Slides from Lei Li, HongRui Liu, Roberto Lu Edited by J. Wiebe.
Journal of Computational and Applied Mathematics Volume 253, 1 December 2013, Pages 14–25 Reporter : Zong-Dian Lee A hybrid quantum inspired harmony search.
On the Ability of Graph Coloring Heuristics to Find Substructures in Social Networks David Chalupa By, Tejaswini Nallagatla.
Stochastic Local Search Algorithms for DNA word Design Dan C Tulpan, Holger H Hoos, and Anne Condon Summerized by Ji-Eun Yun.
Introduction to Algorithms: Brute-Force Algorithms.
N-Queens Boanerges Aleman-Meza Cheng Hu Darnell Arford Ning Suo Wade Ertzberger.
Tabu Search for Solving Personnel Scheduling Problem
Heuristic Optimization Methods
Parallel Cooperative Optimization Research Group
Tabu Search Review: Branch and bound has a “rigid” memory structure (i.e. all branches are completed or fathomed). Simulated Annealing has no memory structure.
Subject Name: Operation Research Subject Code: 10CS661 Prepared By:Mrs
metaheuristic methods and their applications
Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Nov. 7, 2000
Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?
Multi-Objective Optimization
School of Computer Science & Engineering
Subset of Slides from Lei Li, HongRui Liu, Roberto Lu
Greg Knowles ECE Fall 2004 Professor Yu Hu Hen
Presentation transcript:

A TABU SEARCH APPROACH TO POLYGONAL APPROXIMATION OF DIGITAL CURVES

Introduction The information on digital curves is mainly contained in the corner points which have the maximal measures of significance. An effective representation of digital curves not only provides compact descriptions with less memory requirement, but also facilitates feature extraction for further image analysis and pattern recognition.

Introduction An exhaustive search for the optimal polygon will result in exponential complexity. These sub-optimal methods fall into three categories: (1) Sequential approaches (2) Split-and-merge approaches (3) Dominant points detection approaches

Introduction All of the sub-optimal methods are very fast but their results may be very far away from the optimal ones. The optimal methods are impractical since they cost a large amount of computations. In this paper, we develop a more efficient near-optimal algorithm based on a tabu search technique to deal with the application.

BASIC PRINCIPLES OF TABU SEARCH TECHNIQUE Tabu search (TS) is a metaheuristic method which guides a local search procedure to effectively explore the solution space of combinatorial optimization problems It is still very new in the field of image processing and computer vision. TS starts from an initial solution chosen randomly or obtained from another heuristic method, it moves iteratively from one solution to another until a certain stop criterion is satisfied.

BASIC PRINCIPLES OF TABU SEARCH TECHNIQUE Those candidate moves that will lead immediately back to the recently-visited solutions are designated tabu active This process is managed by a specially designed memory mechanism, called the tabu list. When a move is picked in one iteration, the direction of this move is recorded in the tabu list and will not be reversed in the next iterations. TS is distinct from local search methods, such as the hill-climbing approach, it will not be entrapped in a local optimum.

Solution Representation and Objective Function

Initialization TS starts from an initial solution, then moves to the next best untabu solution of its neighborhood, There are two ways of generating the initial solution. One is based on randomizing, the other is based on any local search heuristic result.

Definition of Moves We propose three types of moves : 1.A− -move (vertex deletion operation) The value of P controls the decrease rate of the number of vertices. 2.A+ -move (vertex addition operation) The value of The objective function will increase by one unit and become worse by performing this move. 3.B- move (vertex adjustment operation) The value of objective function will not be changed by applying B-move since the number of vertices remains the same.

Definition Aspiration Criteria A− -move: The tabu status of an A− - move is overruled if it results in a better objective value than the best one obtained so far. A+ -move: The tabu status of an A+ - move is overruled if it results in an approximation error less than ε. B -move: The tabu status of a B-move is overruled if it results in an approximation error less than ε.

Solution Representation and Objective Function A−-move and A+-move can perturb the solution configuration and avoid being entrapped in a local optimum. B-move fine-tunes the current solution to satisfy the ε-bound constraint. After the best move is picked, the direction of this move is recorded in the bottom of the tabu list and should not be reversed.

The Proposed algorithm

EXPERIMENTAL RESULTS AND COMPARATIVE PERFORMANCES

The Length of the Tabu List Longer tabu lists will force the search into areas that were not yet visited (diversification), while shorter tabu lists will focus on intensification.

The Number of Trial Moves

The Vertex-deletion Probability

Thankful for your listening