Discrete particle swarm optimization based on estimation of distribution for polygonal approximation problems

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Expert systems with applications

• Publication date

  2009-07-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.eswa.2008.12.045
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Particle Swarm Optimization

  2019cited by this paper
• A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications

  2008cited by this paper
• A Discrete Estimation of Distribution Particle Swarm Optimization for Combinatorial Optimization Problems

  2007cited by this paper
• A review of particle swarm optimization. Part I: background and development

  2007cited by this paper
• Genetic Particle Swarm Optimization Based on Estimation of Distribution

  2007cited by this paper
• Genetic particle swarm optimization for polygonal approximation of digital curves

  2006cited by this paper
• A quantum particle swarm optimization

  2004cited by this paper
• A Genetic Algorithm-Based Approach For Detection Of Significant Vertices For Polygonal Approximation Of Digital Curves

  2004cited by this paper
• A discrete particle swarm algorithm for optimal polygonal approximation of digital curves

  2004cited by this paper
• Ant colony search algorithms for optimal polygonal approximation of plane curves

  2003cited by this paper
• Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation

  2001cited by this paper
• An efficient evolutionary algorithm for accurate polygonal approximation

  2001cited by this paper
• Genetic Algorithms for Error-Bounded Polygonal Approximation

  2000cited by this paper
• A Survey of Optimization by Building and Using Probabilistic Models

  2000cited by this paper
• A Tabu Search Approach to Polygonal Approximation of Digital Curves

  2000cited by this paper
• Genetic Algorithms for Polygonal Approximation of Digital Curves

  1999cited by this paper
• Polygonal approximation using genetic algorithms

  1999cited by this paper
• The compact genetic algorithm

  1998cited by this paper
• A new method for polygonal approximation using genetic algorithms

  1998cited by this paper
• A discrete binary version of the particle swarm algorithm

  1997cited by this paper
• From Recombination of Genes to the Estimation of Distributions I. Binary Parameters

  1996cited by this paper
• A new split-and-merge technique for polygonal approximation of chain coded curves

  1995cited by this paper
• Population-Based Incremental Learning: A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning

  1994cited by this paper
• Towards a Hierarchical Contour Description via Dominant Point Detection

  1994cited by this paper
• Determination of optimal polygon from digital curve using L1 norm

  1993cited by this paper
• Piecewise linear approximation of plane curves by perimeter optimization

  1992cited by this paper
• On the Detection of Dominant Points on Digital Curves

  1989cited by this paper
• A fast sequential method for polygonal approximation of digitized curves

  1984cited by this paper

• Polygonal approximation for digital image boundary using firefly algorithm

  2022influential citation
• Diversified Particle Swarm Optimization for Hybrid Flowshop Scheduling

  2019influential citation
• PSO-based parameters selection for the bilateral filter in image denoising

  2017cites this paper
• Fast computation of optimal polygonal approximations of digital planar closed curves

  2016cites this paper
• Model-based human upper body tracking using interest points in real-time video

  2015cites this paper
• Composite Particle Swarm Optimizer With Historical Memory for Function Optimization

  2015cites this paper
• A discrete particle swarm algorithm for geometric image inpainting

  2014cites this paper
• MPSO-PCA Based Facial Recognition

  2014cites this paper
• The computation of polygonal approximations for 2D contours based on a concavity tree

  2014cites this paper
• A novel particle swarm optimisation approach to detecting continuous, thin and smooth edges in noisy images

  2013cites this paper
• Learnable tabu search guided by estimation of distribution for maximum diversity problems

  2012influential citation
• Effects of static and dynamic topologies in Particle Swarm Optimisation for edge detection in noisy images

  2012cites this paper
• ISE-bounded polygonal approximation of digital curves

  2012cites this paper
• Incorporating Memory and Learning Mechanisms Into Meta-RaPS

  2012cites this paper
• Multi-basin particle swarm intelligence method for optimal calibration of parametric Lévy models

  2012cites this paper
• Edge detection using constrained discrete particle swarm optimisation in noisy images

  2011cites this paper
• Memetic clonal selection algorithm with EDA vaccination for unconstrained binary quadratic programming problems

  2011cites this paper
• Detection of continuous, smooth and thin edges in noisy images using constrained particle swarm optimisation

  2011cites this paper
• Local Search with Probabilistic Modeling for Learning Multiple-Valued Logic Networks

  2011cites this paper
• EDA-PSO: A Hybrid Paradigm Combining Estimation of Distribution Algorithms and Particle Swarm Optimization

  2010cites this paper
• Honey Bee Mating Optimization Algorithm for Approximation of Digital Curves with Line Segments and Circular Arcs

  2010cites this paper
• Improving edge detection using particle swarm optimisation

  2010cites this paper
• A Novel Evolutionary Face Recognition Algorithm Using Particle Swarm Optimization

  2009cites this paper
• A Novel Model For Determining Boundary Shape Based On The Optimum Tolerance Value For Polygon Approximation

  year unknowncites this paper