Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Eusebio J. Aguilera-Aguilera"'
Autor:
N. L. Fernández-García, Rafael Muñoz-Salinas, F. J. Madrid-Cuevas, A. Carmona-Poyato, Rafael Medina-Carnicer, Eusebio J. Aguilera-Aguilera
Publikováno v:
Journal of Visual Communication and Image Representation. 39:152-163
Approximations with the best balance between fidelity and efficiency are automatically obtained.The method has no parameter to be set.The method has an moderate algorithmic complexity (among O ( N log N ) and O(N2)). The contour of a shape is a power
Publikováno v:
Journal of Visual Communication and Image Representation. 25:1905-1917
A proposal to improve methods to obtain polygonal approximations is proposed.The required levels of detail are achieved using the concavity tree.The local Measurement ISE/CR is used as stop condition.The proposed algorithm improves the methods tested
Publikováno v:
Pattern Recognition and Image Analysis ISBN: 9783319193892
IbPRIA
IbPRIA
In this work we face the problem of determining how many line segments are sufficient to represent a shape. In order to solve this problem we use a method that analyzes the length of the polygonal approximations. This method is used to determine the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a47a1815ebd15b18019bcaaa1329cfc
https://doi.org/10.1007/978-3-319-19390-8_23
https://doi.org/10.1007/978-3-319-19390-8_23
Publikováno v:
Pattern Recognition and Image Analysis ISBN: 9783319193892
IbPRIA
IbPRIA
In this work a new method for obtaining optimal polygonal approximations is presented. The new method is iterative and uses a improved version of the method proposed by Salotti. In the first iteration, the Perez method is used with a random starting
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1e69e9ff38ff9e4de21d614696b08c17
https://doi.org/10.1007/978-3-319-19390-8_17
https://doi.org/10.1007/978-3-319-19390-8_17