{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T16:13:42Z","timestamp":1764000822823,"version":"build-2065373602"},"reference-count":23,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2024,1,7]],"date-time":"2024-01-07T00:00:00Z","timestamp":1704585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>In this paper, we present a general version of polygonal fitting problem called Unconstrained Polygonal Fitting (UPF). Our goal is to represent a given 2D shape S with an N-vertex polygonal curve P with a known number of vertices, so that the Intersection over Union (IoU) metric between S and P is maximized without any assumption or prior knowledge of the object structure and the location of the N-vertices of P that can be placed anywhere in the 2D space. The search space of the UPF problem is a superset of the classical polygonal approximation (PA) problem, where the vertices are constrained to belong in the boundary of the given 2D shape. Therefore, the resulting solutions of the UPF may better approximate the given curve than the solutions of the PA problem. For a given number of vertices N, a Particle Swarm Optimization (PSO) method is used to maximize the IoU metric, which yields almost optimal solutions. Furthermore, the proposed method has also been implemented under the equal area principle so that the total area covered by P is equal to the area of the original 2D shape to measure how this constraint affects IoU metric. The quantitative results obtained on more than 2800 2D shapes included in two standard datasets quantify the performance of the proposed methods and illustrate that their solutions outperform baselines from the literature.<\/jats:p>","DOI":"10.3390\/a17010025","type":"journal-article","created":{"date-parts":[[2024,1,8]],"date-time":"2024-01-08T05:21:38Z","timestamp":1704691298000},"page":"25","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Particle Swarm Optimization-Based Unconstrained Polygonal Fitting of 2D Shapes"],"prefix":"10.3390","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3680-7087","authenticated-orcid":false,"given":"Costas","family":"Panagiotakis","sequence":"first","affiliation":[{"name":"Department of Management Science and Technology, Hellenic Mediterranean University, 72100 Agios Nikolaos, Greece"}]}],"member":"1968","published-online":{"date-parts":[[2024,1,7]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1016\/j.patrec.2006.10.005","article-title":"Any dimension polygonal approximation based on equal errors principle","volume":"28","author":"Panagiotakis","year":"2007","journal-title":"Pattern Recognit. Lett."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Kyriazis, N., and Argyros, A. (2014, January 23\u201328). Scalable 3D Tracking of Multiple Interacting Objects. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, Columbus, OH, USA.","DOI":"10.1109\/CVPR.2014.438"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Li, M., Lafarge, F., and Marlet, R. (2020, January 14\u201319). Approximating shapes in images with low-complexity polygons. Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, Seattle, WA, USA.","DOI":"10.1109\/CVPR42600.2020.00866"},{"key":"ref_4","first-page":"112","article-title":"Algorithms for the reduction of the number of points required to represent a digitized line or its caricature","volume":"10","author":"Douglas","year":"1973","journal-title":"Cartogr. Int. J. Geogr. Inf. Geovis."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1942","DOI":"10.1109\/ICNN.1995.488968","article-title":"Particle swarm optimization","volume":"Volume 4","author":"Kennedy","year":"1995","journal-title":"Proceedings of the ICNN\u201995-International Conference on Neural Networks"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"109396","DOI":"10.1016\/j.patcog.2023.109396","article-title":"Assessing polygonal approximations: A new measurement and a comparative study","volume":"138","year":"2023","journal-title":"Pattern Recognit."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1080\/13658810701703001","article-title":"A three-dimensional Douglas\u2013Peucker algorithm and its application to automated generalization of DEMs","volume":"23","author":"Fei","year":"2009","journal-title":"Int. J. Geogr. Inf. Sci."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10514-007-9034-y","article-title":"A comparison of line extraction algorithms using 2D range data for indoor mobile robotics","volume":"23","author":"Nguyen","year":"2007","journal-title":"Auton. Robot."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.jvcir.2003.12.001","article-title":"A discrete particle swarm algorithm for optimal polygonal approximation of digital curves","volume":"15","author":"Yin","year":"2004","journal-title":"J. Vis. Commun. Image Represent."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.patrec.2020.04.014","article-title":"Unsupervised generation of polygonal approximations based on the convex hull","volume":"135","author":"Poyato","year":"2020","journal-title":"Pattern Recognit. Lett."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"2940","DOI":"10.1016\/j.patcog.2013.04.004","article-title":"Interactive image segmentation based on synthetic graph coordinates","volume":"46","author":"Panagiotakis","year":"2013","journal-title":"Pattern Recognit."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1109\/TIP.2014.2372615","article-title":"An efficient MRF embedded level set method for image segmentation","volume":"24","author":"Yang","year":"2015","journal-title":"IEEE Trans. Image Process."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.patcog.2015.11.004","article-title":"Parameter-free modelling of 2D shapes with ellipses","volume":"53","author":"Panagiotakis","year":"2016","journal-title":"Pattern Recognit."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"2512","DOI":"10.1016\/j.patcog.2008.01.027","article-title":"A hierarchical approach for fast and robust ellipse extraction","volume":"41","author":"Mai","year":"2008","journal-title":"Pattern Recognit."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Jin, L., Yang, J., Kuang, K., Ni, B., Gao, Y., Sun, Y., Gao, P., Ma, W., Tan, M., and Kang, H. (2020). Deep-learning-assisted detection and segmentation of rib fractures from CT scans: Development and validation of FracNet. EBioMedicine, 62.","DOI":"10.1016\/j.ebiom.2020.103106"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"100868","DOI":"10.1016\/j.swevo.2021.100868","article-title":"Major advances in particle swarm optimization: Theory, analysis, and application","volume":"63","author":"Houssein","year":"2021","journal-title":"Swarm Evol. Comput."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Jain, M., Saihjpal, V., Singh, N., and Singh, S.B. (2022). An overview of variants and advancements of PSO algorithm. Appl. Sci., 12.","DOI":"10.3390\/app12178392"},{"key":"ref_18","first-page":"3","article-title":"Efficient model-based 3D tracking of hand articulations using Kinect","volume":"1","author":"Oikonomidis","year":"2011","journal-title":"BmVC"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"113233","DOI":"10.1016\/j.eswa.2020.113233","article-title":"A multimodal particle swarm optimization-based approach for image segmentation","volume":"149","author":"Farshi","year":"2020","journal-title":"Expert Syst. Appl."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2531","DOI":"10.1007\/s11831-021-09694-4","article-title":"Particle swarm optimization algorithm and its applications: A systematic review","volume":"29","author":"Gad","year":"2022","journal-title":"Arch. Comput. Methods Eng."},{"key":"ref_21","first-page":"424","article-title":"Shape descriptors for non-rigid shapes with a single closed contour","volume":"Volumr 1","author":"Latecki","year":"2000","journal-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"861","DOI":"10.1109\/TPAMI.2009.85","article-title":"Learning context-sensitive shape similarity by graph transduction","volume":"32","author":"Bai","year":"2010","journal-title":"Pattern Anal. Mach. Intell. IEEE Trans."},{"key":"ref_23","unstructured":"Kimia, B. (2015, January 01). A Large Binary Image Database, LEMS Vision Group at Brown University. Available online: http:\/\/www.lems.brown.edu\/~dmc\/."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/1\/25\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T13:41:38Z","timestamp":1760103698000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/17\/1\/25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,7]]},"references-count":23,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,1]]}},"alternative-id":["a17010025"],"URL":"https:\/\/doi.org\/10.3390\/a17010025","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2024,1,7]]}}}