Bio-inspired firefly algorithm for polygonal approximation on various shapes

L Venkateswara Reddy, G Davanam… - … : Proceedings of ICDIC …, 2022 - Springer
Polygonal approximation (PA) is a challenging problem in representation of images in
computer vision, pattern recognition and image analysis. This paper proposes a stochastic …

ISE-bounded polygonal approximation of digital curves

A Kolesnikov - Pattern Recognition Letters, 2012 - Elsevier
In this paper we consider a problem of the polygonal approximation of digital curves with a
minimum number of approximation segments for a given error bound with L2-norm. The …

The computation of polygonal approximations for 2D contours based on a concavity tree

EJ Aguilera-Aguilera, A Carmona-Poyato… - Journal of Visual …, 2014 - Elsevier
In this work, a new proposal to improve some methods based on the merge approach to
obtain polygonal approximations in 2D contours is presented. These methods use a set of …

Representation of image content based on RoI-BoW

J Zhang, D Li, Y Zhao, Z Chen, Y Yuan - Journal of Visual Communication …, 2015 - Elsevier
Abstract Representation of image content is an important part of image annotation and
retrieval, and it has become a hot issue in computer vision. As an efficient and accurate …

Polygonal approximation using integer particle swarm optimization

B Wang, D Brown, X Zhang, H Li, Y Gao, J Cao - Information Sciences, 2014 - Elsevier
Polygonal approximation is an effective yet challenging digital curve representation for
image analysis, pattern recognition and computer vision. This paper proposes a novel …

Polygonal approximation based on coarse-grained parallel genetic algorithm

Z Wu, C Zhao, B Liu - Journal of Visual Communication and Image …, 2020 - Elsevier
This paper proposes to apply coarse-grained parallel genetic algorithm (CGPGA) to solve
polygonal approximation problem. Chromosomes are used to represent digital curves and …

Fast computation of optimal polygonal approximations of digital planar closed curves

EJ Aguilera-Aguilera, A Carmona-Poyato… - Graphical Models, 2016 - Elsevier
We face the problem of obtaining the optimal polygonal approximation of a digital planar
curve. Given an ordered set of points on the Euclidean plane, an efficient method to obtain a …

[PDF][PDF] A Novel Model For Determining Boundary Shape Based On The Optimum Tolerance Value For Polygon Approximation

AA Saeid, BA Atya, R Allami… - Webology (ISSN: 1735 …, 2022 - webology.org
Polygon approximation is a digital curve method lead to create piecewise of linear segments
for digital curve. The automated determination of optimal tolerance value for a shape is a …

Segmented Douglas-Peucker algorithm based on the node importance

X Wang, W Yang, Y Liu, R Sun, J Hu… - KSII Transactions on …, 2020 - koreascience.kr
Vector data compression algorithm can meet requirements of different levels and scales by
reducing the data amount of vector graphics, so as to reduce the transmission, processing …

An analysis on polygonal approximation techniques for digital image boundary

KT Raja, BK Ray - Journal of Mobile Multimedia, 2022 - journals.riverpublishers.com
Polygonal approximation (PA) techniques have been widely applied in the field of pattern
recognition, classification, shape analysis, identification, 3D reconstruction, medical …