Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/91352
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Biomedical Engineering | en_US |
dc.contributor | Chinese Mainland Affairs Office | en_US |
dc.creator | Woo, CM | en_US |
dc.creator | Li, H | en_US |
dc.creator | Zhao, Q | en_US |
dc.creator | Lai, P | en_US |
dc.date.accessioned | 2021-11-03T06:52:55Z | - |
dc.date.available | 2021-11-03T06:52:55Z | - |
dc.identifier.uri | http://hdl.handle.net/10397/91352 | - |
dc.language.iso | en | en_US |
dc.publisher | Optical Society of America | en_US |
dc.rights | © 2021 Optical Society of America under the terms of the OSA Open Access Publishing Agreement (https://www.osapublishing.org/library/license_v1.cfm#VOR-OA) | en_US |
dc.rights | Journal © 2021 | en_US |
dc.rights | © 2021 Optical Society of America. Users may use, reuse, and build upon the article, or use the article for text or data mining, so long as such uses are for non-commercial purposes and appropriate attribution is maintained. All other rights are reserved. | en_US |
dc.rights | The following publication Woo, C. M., Li, H., Zhao, Q., & Lai, P. (2021). Dynamic mutation enhanced particle swarm optimization for optical wavefront shaping. Optics Express, 29(12), 18420-18426 is available at https://doi.org/10.1364/OE.425615 | en_US |
dc.title | Dynamic mutation enhanced particle swarm optimization for optical wavefront shaping | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 18420 | en_US |
dc.identifier.epage | 18426 | en_US |
dc.identifier.volume | 29 | en_US |
dc.identifier.issue | 12 | en_US |
dc.identifier.doi | 10.1364/OE.425615 | en_US |
dcterms.abstract | Particle swarm optimization (PSO) is a well-known iterative algorithm commonly adopted in wavefront shaping for focusing light through or inside scattering media. The performance is, however, limited by premature convergence in an unstable environment. Therefore, we aim to solve this problem and enhance the focusing performance by adding a dynamic mutation operation into the plain PSO. With dynamic mutation, the "particles,"or the optimized masks, are mutated with quantifiable discrepancy between the current and theoretical optimal solution, i.e., the "error rate."Gauged by that, the diversity of the "particles"is effectively expanded, and the adaptability of the algorithm to noise and instability is significantly promoted, yielding optimization approaching the theoretical optimum. The simulation and experimental results show that PSO with dynamic mutation demonstrates considerably better performance than PSO without mutation or with a constant mutation, especially under a noisy environment. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | Optics express, 7 June 2021, v. 29, no. 12, p. 18420-18426 | en_US |
dcterms.isPartOf | Optics express | en_US |
dcterms.issued | 2021-06 | - |
dc.identifier.scopus | 2-s2.0-85107077287 | - |
dc.identifier.eissn | 1094-4087 | en_US |
dc.description.validate | 202110 bcvc | en_US |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | OA_Scopus/WOS, a1563 | - |
dc.identifier.SubFormID | 45428 | - |
dc.description.fundingSource | RGC | en_US |
dc.description.fundingSource | Others | en_US |
dc.description.fundingText | Others: National Natural Science Foundation of China Guangdong Science and Technology Commission Hong Kong Innovation and Technology Commission Shenzhen Science and Technology Innovation Commission | en_US |
dc.description.pubStatus | Published | en_US |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
oe-29-12-18420.pdf | 3.9 MB | Adobe PDF | View/Open |
Page views
79
Last Week
1
1
Last month
Citations as of Apr 21, 2024
Downloads
46
Citations as of Apr 21, 2024
SCOPUSTM
Citations
15
Citations as of Apr 26, 2024
WEB OF SCIENCETM
Citations
14
Citations as of Apr 25, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.