A novel hybrid genetic algorithm (HGA) is proposed to solve the branch-cut phase unwrapping problem. It employs both local and global search methods. The local search is implemented by using the nearest-neighbor method, whereas the global search is performed by using the genetic algorithm. The branch-cut phase unwrapping problem [a nondeterministic polynomial (NP-hard) problem] is implemented in a similar way to the traveling-salesman problem, a very-well-known combinational optimization problem with profound research and applications. The performance of the proposed algorithm was tested on both simulated and real wrapped phase maps. The HGA is found to be robust and fast compared with three well-known branch-cut phase unwrapping algorithms.
Time is considered to be an important encoding dimension in olfaction, as neural populations generate odour-specific spatiotemporal responses to constant stimuli. However, during pheromone mediated anemotactic search insects must discriminate specific ratios of blend components from rapidly time varying input. The dynamics intrinsic to olfactory processing and those of naturalistic stimuli can therefore potentially collide, thereby confounding ratiometric information. In this paper we use a computational model of the macroglomerular complex of the insect antennal lobe to study the impact on ratiometric information of this potential collision between network and stimulus dynamics. We show that the model exhibits two different dynamical regimes depending upon the connectivity pattern between inhibitory interneurons (that we refer to as fixed point attractor and limit cycle attractor), which both generate ratio-specific trajectories in the projection neuron output population that are reminiscent of temporal patterning and periodic hyperpolarisation observed in olfactory antennal lobe neurons. We compare the performance of the two corresponding population codes for reporting ratiometric blend information to higher centres of the insect brain. Our key finding is that whilst the dynamically rich limit cycle attractor spatiotemporal code is faster and more efficient in transmitting blend information under certain conditions it is also more prone to interference between network and stimulus dynamics, thus degrading ratiometric information under naturalistic input conditions. Our results suggest that rich intrinsically generated network dynamics can provide a powerful means of encoding multidimensional stimuli with high accuracy and efficiency, but only when isolated from stimulus dynamics. This interference between temporal dynamics of the stimulus and temporal patterns of neural activity constitutes a real challenge that must be successfully solved by the nervous system when faced with naturalistic input.
What we believe to be a novel technique of branch-cut placement in the phase unwrapping is proposed. This approach is based on what we named residue vector, which is generated by a residue in a wrapped phase map and has an orientation that points out toward the balancing residue of opposite polarity. The residue vector can be used to guide the manner in which branch cuts are placed in phase unwrapping. Also, residue vector can be used for the determination of the weighting values used in different existing phase unwrapping methods such as minimum cost flow and least squares. The theoretical foundations of the residue-vector method are presented, and a branch-cut method using its information is developed and implemented. A general comparison is made between the residue-vector map and other existing quality maps.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.