Referenced Items are not available for this document.
Approximation of polygonal curves can be solved by dynamic programming. These methods provide an optimal solution but are slow for a large number of vertices. We propose a new optimization approach based on dynamic programming with a reduced-search in the state space. The proposed algorithm is simple, fast, and has low space complexity. The time and quality trade-off can be controlled by selecting an appropriate corridor width and number of iterations in the algorithm.
Published in:
Pattern Recognition, 2002. Proceedings. 16th International Conference on
(Volume:4
)
Date of Conference: 2002
- Page(s):
- 335 - 338 vol.4
- ISSN :
- 1051-4651
- Print ISBN:
- 0-7695-1695-X
- INSPEC Accession Number:
- 7455892
- Digital Object Identifier :
- 10.1109/ICPR.2002.1047464
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
