Tabu split and merge for the simplification of polygonal curves

Authors:
Gildas Ménier;Pierre-François Marteau
Affiliations:
VALORIA, Université de Bretagne Sud, Université Européenne de Bretagne, France;VALORIA, Université de Bretagne Sud, Université Européenne de Bretagne, France
Venue:
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Year:
2009

Citing 11
Cited 1

Optimum polygonal approximation of digitized curves

Pattern Recognition Letters
An algorithm for polygonal approximation based on iterative point elimination

Pattern Recognition Letters
Techniques for Assessing Polygonal Approximations of Curves

IEEE Transactions on Pattern Analysis and Machine Intelligence
An efficient algorithm for the optimal polygonal approximation of digitized curves

Pattern Recognition Letters
Tabu Search

Tabu Search
Improving fitting quality of polygonal approximation by using the dynamic programming technique

Pattern Recognition Letters
Reduced-search dynamic programming for approximation of polygonal curves

Pattern Recognition Letters
Speeding Up the Douglas-Peucker Line-Simplification Algorithm

Speeding Up the Douglas-Peucker Line-Simplification Algorithm
Multiresolution Polygonal Approximation of Digital Curves

ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
Adaptive Multiresolution and Dedicated Elastic Matching in Linear Time Complexity for Time Series Data Mining

ISDA '06 Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications - Volume 01
Time Warp Edit Distance with Stiffness Adjustment for Time Series Matching

IEEE Transactions on Pattern Analysis and Machine Intelligence

A moment-based polygonal approximation algorithm for regular digital curves

Proceedings of the Fifth International Conference on Internet Multimedia Computing and Service

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Tabu Move Merge Split (TMMS) algorithm is proposed for the polygonal approximation problem. TMMS incorporates a tabu principle to avoid premature convergence into local minima. TMMS is compared to optimal, near to optimal top down Multi-Resolution (TDMR) and classical split and merge heuristics solutions. Experiments show that potential improvements for crudest approximations can be obtained. The evaluation is carried out on 2D geographic maps according to effectiveness and efficiency measures.