A biologically inspired solution for allocation problems of branch-cuts

Renkang Song; Xuelian Yu; Bingmei Guo; Dekai Yang; Jiang Pan; Yue Zhang

doi:10.1117/12.2506989

15 November 2018 A biologically inspired solution for allocation problems of branch-cuts

Renkang Song, Xuelian Yu, Bingmei Guo, Dekai Yang, Jiang Pan, Yue Zhang

Proceedings Volume 10964, Tenth International Conference on Information Optics and Photonics; 109646O (2018) https://doi.org/10.1117/12.2506989
Event: Tenth International Conference on Information Optics and Photonics (CIOP 2018), 2018, Beijing, China

Abstract

Branch-cut is a classical algorithm in phase unwrapping algorithm based on path-following approach. Goldstein’s branch-cuts algorithm is prone to generate large enclosed areas and produce longer branch-cuts. Models inspired by biosystems can provide new insights into complex computing problems in the real-world. A unicellular and multi-headed slime mold, named as Physarum polycephalum, has been a research hotspot over the last few years. According to the two characteristics of Physarum: the adaptive shortest path finding and adaptive network formation, researchers combined the Hagen-Poiseuille and Kirchhoff law to establish bionic mathematical model: the maze-solving model to get shortest path between two points and multiply sources model for designing efficient network. In this paper, based on these bionic models, combined with the foraging characteristics of Physarum, a biologically inspired algorithm called Physarum Foraging Algorithm (PFA) is proposed for allocation problems of branch-cuts. Firstly, according to the distribution characteristics of residues in the interference fringes map, the residues were processed; secondly, using the bionic model to build a branch-cuts network between residues; finally, the Physarum exhibits a characteristic that the critical tubes are reserved in the process of foraging, using this unique feature to optimize the branch-cuts network, then complete reconstruction of branch-cuts. PFA cannot only significantly cut down the overall length of branch-cuts but also effectively overcome the ‘isolated island phenomenon’ in the unwrapping process. Experimental result showed that the algorithm implements optimal allocation problems of branch-cuts which greatly improves the accuracy of phase unwrapping.

Citation Download Citation

Renkang Song, Xuelian Yu, Bingmei Guo, Dekai Yang, Jiang Pan, and Yue Zhang "A biologically inspired solution for allocation problems of branch-cuts", Proc. SPIE 10964, Tenth International Conference on Information Optics and Photonics, 109646O (15 November 2018); https://doi.org/10.1117/12.2506989

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
7 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Mathematical modeling

Biomimetics

Interferometry

Image analysis

Image processing

Network architectures

Optimization (mathematics)

Show All Keywords

Keywords/Phrases

Search In:

Publication Years