New method for obtaining optimal polygonal approximations to solve the min- $$\varepsilon$$ ε problem

New method for obtaining optimal polygonal approximations to solve the min- $$\varepsilon$$ ε... A new method for obtaining optimal polygonal approximations in closed curves is proposed. The new method uses the suboptimal method proposed by Pikaz and an improved version of the optimal method proposed by Salotti. Firstly, the Pikaz’s method obtains a suboptimal polygonal approximation and then the improved Salotti’s method is used for obtaining many local optimal polygonal approximations with a prefixed starting point. The error value obtained in each polygonal approximation is used as value of pruning to obtain the next polygonal approximation. In order to select the starting point used by the Salotti’s method, five procedures have been tested. Tests have shown that by obtaining a small number of polygonal approximations, global optimal polygonal approximation is calculated. The results show that the computation time is significantly reduced, compared with existing methods. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Neural Computing and Applications Springer Journals

New method for obtaining optimal polygonal approximations to solve the min- $$\varepsilon$$ ε problem

Loading next page...
 
/lp/springer_journal/new-method-for-obtaining-optimal-polygonal-approximations-to-solve-the-PpNi6sdlY0
Publisher
Springer London
Copyright
Copyright © 2016 by The Natural Computing Applications Forum
Subject
Computer Science; Artificial Intelligence (incl. Robotics); Data Mining and Knowledge Discovery; Probability and Statistics in Computer Science; Computational Science and Engineering; Image Processing and Computer Vision; Computational Biology/Bioinformatics
ISSN
0941-0643
eISSN
1433-3058
D.O.I.
10.1007/s00521-016-2198-7
Publisher site
See Article on Publisher Site

Abstract

A new method for obtaining optimal polygonal approximations in closed curves is proposed. The new method uses the suboptimal method proposed by Pikaz and an improved version of the optimal method proposed by Salotti. Firstly, the Pikaz’s method obtains a suboptimal polygonal approximation and then the improved Salotti’s method is used for obtaining many local optimal polygonal approximations with a prefixed starting point. The error value obtained in each polygonal approximation is used as value of pruning to obtain the next polygonal approximation. In order to select the starting point used by the Salotti’s method, five procedures have been tested. Tests have shown that by obtaining a small number of polygonal approximations, global optimal polygonal approximation is calculated. The results show that the computation time is significantly reduced, compared with existing methods.

Journal

Neural Computing and ApplicationsSpringer Journals

Published: Feb 4, 2016

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve Freelancer

DeepDyve Pro

Price
FREE
$49/month

$360/year
Save searches from
Google Scholar,
PubMed
Create lists to
organize your research
Export lists, citations
Read DeepDyve articles
Abstract access only
Unlimited access to over
18 million full-text articles
Print
20 pages/month
PDF Discount
20% off