A moment-based polygonal approximation algorithm for regular digital curves
Pages 260 - 263
Abstract
Keeping the features of the original curve is a key issue in polygonal approximation The low order moments of curves have well-defined image description capability. Taking this advantage, this paper uses the difference of the second order moments to measure the similarity between an approximated polygon and the original curve, and implements a PSO-based polygonal approximation algorithm for regular digital curves. Experiments show that the proposed method can obtain good results in keeping the features of the original curves.
References
[1]
Biswajit Sarkar. An Efficient Method for Near-optimal Polygonal Approximation Based on Differential Evolution{J} International Journal of Pattern Recognition 2008, 22(6): 1267--1281.
[2]
Peng-Yeng Yin. A discrete particle swarm algorithm for optimal polygonal approximation of digital curves{J}. Journal of Visual Communication & Image Representation. 2004, 15 (2): 241--260.
[3]
B. K. Ray, K. S. Ray, A non-parametric sequential method for polygonal approximation of digital curves{J}, Pattern Recognition Lett. 1994, 15: 161--167.
[4]
Gildas Ménier, Pierre-François Marteau. Tabu Split and Merge for the Simplification of Polygonal Curves{J}. International Conference on Systems, Man, and Cybernetics 2009: 1322--1327.
[5]
A.carmona-Poyato, R. Medina-Carnicer, N. L. Fernandez-Garcia, etc. Methos for Polygonal Approximation through Dominant Points Deletion{J}. Trends in Applied Systems 2010:350--358.
[6]
Ji-Hwei Horng. Improving fitting quality of polygonal approximation by using the dynamic programming technique{J}. Pattern Recognition Letters. 2002, 23: 1657--1673.
[7]
Shu-Chien Huang, Yung-Nien Sun. polygonal approximation using genetic algorithms {J}. Pattern Recognition. 1999, 32 (8): 1409--1420.
[8]
Peng-Yeng Yin. Ant colony search algorithms for optimal polygonal approximation of plane curves{J}. Pattern Recognition. 2003, 36(8): 1783--1797
[9]
Zhou Peide. Comutational Geometry Algorithm Design and Analysis{M}. Tsinghua University Press. 2011, 9.
[10]
Hu MK. Visual Pattern Recognition by Moment Invariants{J}. IEEE Trans on Information Theory. 1962, (8): 179--187.
[11]
Wei Wei bo, Rui Xiao ting, Study on Moment Invariants Method{J}. Fire control and Command Control. 2007, 32(11): 114--117.
[12]
Wenjun Tan, Shuying Zhao, Chengdong Wu, ect. A Novel Approach to 2-D Shape Representation Based on Equilateral Polygonal Approximation{J}. International Conference on Computer Science and Software Engineering. 2008, 1021--1034.
[13]
Qi Jin, Ruwei Dai Moments, invariant moments, angular moments and Fourier descriptors{J}. Pattern Recognition and Artificial Intelligence. 1993, 6(3): 181--1871.
[14]
Li Songyi Zhou Jindan Zhang Hui, ect. Moment-Based Methods for Polygonal Approximation of Digitized Curves{J}. Chinese J. Computers. 2001, 24(4): 354--357.
[15]
H. Z. Shu, L. M. Luo, J. D. Zhou, ect. Moment-based methods for polygonal approximation of digitized curves{J}. Pattern Recognition. 2002, 35: 421--434.
[16]
Fangmin Dong. Mesh Simplification for CAD Models Based on Global Features Preserving{D}. Huazhong University of Science and Technology. 2007.
Index Terms
- A moment-based polygonal approximation algorithm for regular digital curves
Recommendations
Novel method to obtain the optimal polygonal approximation of digital planar curves based on Mixed Integer Programming
A novel method to obtain optimal polygonal approximation is proposed.The method is based on Mixed Integer Programming techniques.Computation time obtained drastically decreases over state-of-the-art methods.The proposed method does not need parameters ...
Polygonal approximation of digital planar curves through vertex betweenness
Contour polygonal approximation is usually defined as a set of selected points, which describes a polygon and best represents the original contour. This paper presents a novel graph based approach to compute a polygonal approximation of a shape contour. ...
Certified approximation of parametric space curves with cubic B-spline curves
Approximating complex curves with simple parametric curves is widely used in CAGD, CG, and CNC. This paper presents an algorithm to compute a certified approximation to a given parametric space curve with cubic B-spline curves. By certified, we mean ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
August 2013
419 pages
ISBN:9781450322522
DOI:10.1145/2499788
- Conference Chair:
- Tat-Seng Chua,
- General Chairs:
- Ke Lu,
- Tao Mei,
- Xindong Wu
Copyright © 2013 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- NSF of China: National Natural Science Foundation of China
- University of Sciences & Technology, Hefei: University of Sciences & Technology, Hefei
- Beijing ACM SIGMM Chapter
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 17 August 2013
Check for updates
Author Tags
Qualifiers
- Research-article
Funding Sources
Conference
ICIMCS '13
Sponsor:
- NSF of China
- University of Sciences & Technology, Hefei
ICIMCS '13: International Conference on Internet Multimedia Computing and Service
August 17 - 19, 2013
Huangshan, China
Acceptance Rates
ICIMCS '13 Paper Acceptance Rate 20 of 94 submissions, 21%;
Overall Acceptance Rate 163 of 456 submissions, 36%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 69Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 09 Nov 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in