Title
Polygonal Approximation of Digital Planar Curves via Hybrid Monte Carlo Optimization
Abstract
This letter presents a novel computing paradigm for polygonal approximation of digital planar curves. While the existing heuristic algorithms, such as genetic algorithm (GA) and particle swarm optimization (PSO), have achieved considerable success in solving the two types of polygonal approximation problems, more efficient optimization schemes are still desirable for practical applications. We propose to embed the split-and-merge local search in the Monte Carlo sampling framework, to combine strength of the local optimization and the global sampling. The proposed algorithm is essentially a well-designed basin hopping scheme that performs stochastic exploration in the reduced potential energy space. Experimental results on several benchmarks indicate that the proposed algorithm can achieve high approximation accuracy and is highly competitive to the state-of-the-art alternative algorithms with less computational cost.
Year
DOI
Venue
2013
10.1109/LSP.2012.2230324
IEEE Signal Process. Lett.
Keywords
Field
DocType
split-and-merge,monte carlo sampling framework,stochastic processes,basin hopping,global sampling,approximation theory,stochastic exploration,markov-chain monte carlo,pso,particle swarm optimisation,polygonal approximation,basin hopping scheme,heuristic algorithm,local optimization,hybrid monte carlo optimization,search problems,energy space,genetic algorithm,edge detection,monte carlo methods,genetic algorithms,ga,sampling methods,split-and-merge local search,digital planar curve,particle swarm optimization
Monte Carlo method,Stochastic optimization,Mathematical optimization,Monte Carlo algorithm,Global optimization,Hybrid Monte Carlo,Multi-swarm optimization,Local search (optimization),Mathematics,Metaheuristic
Journal
Volume
Issue
ISSN
20
2
1070-9908
Citations 
PageRank 
References 
1
0.35
11
Authors
3
Name
Order
Citations
PageRank
Xiuzhuang Zhou138020.26
Yuanyuan Shang221016.83
Jiwen Lu33105153.88