Optimum Uniform Piecewise Linear Approximation of Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Three-dimensional object recognition from single two-dimensional images
Artificial Intelligence
Finding Trajectories of Feature Points in a Monocular Image Sequence
IEEE Transactions on Pattern Analysis and Machine Intelligence
On the Detection of Dominant Points on Digital Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape Description by Time Series
IEEE Transactions on Pattern Analysis and Machine Intelligence
Non-parametric dominant point detection
Pattern Recognition
Scale-Based Detection of Corners of Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Detection of significant points and polygonal approximation of digitized curves
Pattern Recognition Letters
An algorithm for detection of dominant points and polygonal approximation of digitized curves
Pattern Recognition Letters
Pattern Recognition Letters
Matching Point Features with Ordered Geometric, Rigidity, and Disparity Constraints
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimum polygonal approximation of digitized curves
Pattern Recognition Letters
Techniques for Assessing Polygonal Approximations of Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
The DEDALE system for complex spatial queries
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Convexity rule for shape decomposition based on discrete contour evolution
Computer Vision and Image Understanding
A boundary concavity code to support dominant point detection
Pattern Recognition Letters
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Boundary Based Corner Detecion and Localization Using New 'Cornerity' Index: A Robust Approach
CRV '04 Proceedings of the 1st Canadian Conference on Computer and Robot Vision
Piecewise Polygonal Approximation of Digital Curves
IV '04 Proceedings of the Information Visualisation, Eighth International Conference
Error-Bounded B-Spline Curve Approximation Based on Dominant Point Selection
CGIV '05 Proceedings of the International Conference on Computer Graphics, Imaging and Visualization
Attributed String Matching with Merging for Shape Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Analysis of the Precision of Generalized Chain Codes for the Representation of Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
On the Performance of Chain Codes for Quantization of Line Drawings
IEEE Transactions on Pattern Analysis and Machine Intelligence
Stochastic models for closed boundary analysis: Representation and reconstruction
IEEE Transactions on Information Theory
A rate and distortion analysis of chain codes for line drawings
IEEE Transactions on Information Theory
A New Algorithm for Dominant Point Detection by Quasi-collinear Break Points Supression
ACIVS '08 Proceedings of the 10th International Conference on Advanced Concepts for Intelligent Vision Systems
Journal of Visual Communication and Image Representation
Polygonal approximation of digital planar curves through break point suppression
Pattern Recognition
Polygonal approximation of digital planar curves through adaptive optimizations
Pattern Recognition Letters
A new measurement for assessing polygonal approximation of curves
Pattern Recognition
Improved stochastic competitive Hopfield network for polygonal approximation
Expert Systems with Applications: An International Journal
Method for polygonal approximation through dominant points deletion
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III
A novel framework for making dominant point detection methods non-parametric
Image and Vision Computing
| Hi-index | 0.00 |
A new approach to polygonal approximation is presented in this paper. It starts from an initial set of dominant points (break points), where the integral square error from a given shape is zero. The proposed algorithm iteratively deletes most redundant dominant points till required approximation is achieved. Stabilization algorithm after elimination of each dominant point ensures high quality of approximation. Results of proposed algorithm are compared with classical algorithms. The proposed algorithm has additional benefits like polygonal approximation with any number of dominant points and up to any error value and robustness of results.