Please use this identifier to cite or link to this item: doi:10.22028/D291-40736
Title: Particle swarm optimisation strategies for IOL formula constant optimisation
Author(s): Langenbucher, Achim
Szentmáry, Nóra
Cayless, Alan
Wendelstein, Jascha
Hoffmann, Peter
Language: English
Title: Acta Ophthalmologica
Volume: 101
Issue: 7
Pages: 775-782
Publisher/Platform: Wiley
Year of Publication: 2023
Free key words: formula constant optimisation
formula prediction error
lens power calculation
nonlinear iterative algorithm
particle swarm optimisation
performance metrics
DDC notations: 610 Medicine and health
Publikation type: Journal Article
Abstract: Purpose: To investigate particle swarm optimisation (PSO) as a modern purely data driven non-linear iterative strategy for lens formula constant optimisation in intraocular lens power calculation. Methods: A PSO algorithm was implemented for optimising the root mean squared formula prediction error (rmsPE, defined as achieved refraction minus predicted refraction) for the Castrop formula in a dataset of N =888 cataractous eyes with implantation of the Hoya Vivinex hydrophobic acrylic aspheric lens. The hyperparameters were set to inertia: 0.8, accelerations c1 = c2 = 0.1. The algorithm was initialised with NP =100 particles having random positions and velocities within the box constraints of the constant triplet parameter space C = 0.25 to 0.45, H = −0.25 to 0.25 and R = −0.25 to 0.25. The performance of the algorithm was compared to classical gradient-based Trust-Region-Reflective and Interior-Point algorithms. Results: The PSO algorithm showed fast and stable convergence after 37 iterations. The rmsPE reduced systematically to 0.3440 diopters (D). With further iterations the scatter of the particle positions in the swarm decreased but without further reduction of rmsPE. The final constant triplet was C/H/R = 0.2982/0.2497/0.1435. The Trust-Region-Reflective/Interior-Point algorithms showed convergence after 27/17 iterations, respectively, resulting in formula constant triplets C/H/R = 0.2982/0.2496/0.1436 and 0.2982/0.2495/0.1436, both with the same rmsPE as the PSO algorithm (rmsPE = 0.3440 D). Conclusion: The PSO appears to be a powerful adaptive nonlinear iteration algorithm for formula constant optimisation even in formulae with more than 1 constant. It acts independently of an analytical or numerical gradient and is in general able to search for the best solution even with multiple local minima of the target function.
DOI of the first publication: 10.1111/aos.15664
URL of the first publication: https://doi.org/10.1111/aos.15664
Link to this record: urn:nbn:de:bsz:291--ds-407366
hdl:20.500.11880/36608
http://dx.doi.org/10.22028/D291-40736
ISSN: 1755-3768
1755-375X
Date of registration: 16-Oct-2023
Faculty: M - Medizinische Fakultät
Department: M - Augenheilkunde
Professorship: M - Univ.-Prof. Dr. Dipl.-Ing. Achim Langenbucher
M - Prof. Dr. med. Nóra Szentmáry
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes



This item is licensed under a Creative Commons License Creative Commons