Line Segment Matching Fusing Local Gradient Order and Non-Local Structure Information

Line segment matching is essential for industrial applications such as scene reconstruction, pattern recognition, and VSLAM. To achieve good performance under the scene with illumination changes, we propose a line segment matching method fusing local gradient order and non-local structure information. This method begins with intensity histogram multiple averaging being utilized for adaptive partitioning. After that, the line support region is divided into several sub-regions, and the whole image is divided into a few intervals. Then the sub-regions are encoded by local gradient order, and the intervals are encoded by non-local structure information of the relationship between the sampled points and the anchor points. Finally, two histograms of the encoded vectors are, respectively, normalized and cascaded. The proposed method was tested on the public datasets and compared with previous methods, which are the line-junction-line (LJL), the mean-standard deviation line descriptor (MSLD) and the line-point invariant (LPI). Experiments show that our approach has better performance than the representative methods in various scenes. Therefore, a tentative conclusion can be drawn that this method is robust and suitable for various illumination changes scenes.

Acceleration-Aware Path Planning with Waypoints

In this article we demonstrate that acceleration and deceleration of direction-turning drones at waypoints have a significant influence to path planning which is important to be considered for time-critical applications, such as drone-supported search and rescue. We present a new path planning approach that takes acceleration and deceleration into account. It follows a local gradient ascend strategy which locally minimizes turns while maximizing search probability accumulation. Our approach outperforms classic coverage-based path planning algorithms, such as spiral- and grid-search, as well as potential field methods that consider search probability distributions. We apply this method in the context of autonomous search and rescue drones and in combination with a novel synthetic aperture imaging technique, called Airborne Optical Sectioning (AOS), which removes occlusion of vegetation and forest in real-time.

The lower bound of nonlocal gradient for non-convex and non-smooth image patches based regularization

In the inverse problem of image processing, we have witnessed that the non-convex and non-smooth regularizers can produce clearer image edges than convex ones such as total variation (TV). This fact can be explained by the uniform lower bound theory of the local gradient in non-convex and non-smooth regularization. In recent years, although it has been numerically shown that the nonlocal regularizers of various image patches based nonlocal methods can recover image textures well, we still desire a theoretical interpretation. To this end, we propose a non-convex non-smooth and block nonlocal (NNBN) regularization model based on image patches. By integrating the advantages of the non-convex and non-smooth potential function in the regularization term, the uniform lower bound theory of the image patches based nonlocal gradient is given. This approach partially explains why the proposed method can produce clearer image textures and edges. Compared to some classical regularization methods, such as total variation (TV), non-convex and non-smooth (NN) regularization, nonlocal total variation (NLTV) and block nonlocal total variation(BNLTV), our experimental results show that the proposed method improves restoration quality.

Particle localization using local gradients and its application to nanometer stabilization of a microscope

Accurate localization of single particles plays an increasingly important role in a range of biological techniques, including single molecule tracking and localization-based superresolution microscopy. Such techniques require fast and accurate particle localization algorithms as well as nanometer-scale stability of the microscope. Here, we present a universal method for three-dimensional localization of single labeled and unlabeled particles based on local gradient calculation of microscopy images. The method outperforms current techniques in high noise conditions, and it is capable of nanometer accuracy localization of nano- and micro-particles with sub-ms calculation time. By localizing a fixed particle as fiducial mark and running a feedback loop, we demonstrate its applicability for active drift correction in sensitive nanomechanical measurements such as optical trapping and superresolution imaging. A multiplatform open software package comprising a set of tools for local gradient calculation in brightfield and fluorescence microscopy is shared to the scientific community.

Cells use molecular working memory to navigate in changing chemoattractant fields

In order to migrate over large distances, cells within tissues and organisms rely on sensing local gradient cues. These cues however are multifarious, irregular or conflicting, changing both in time and space. Here we find that single cells utilize a molecular mechanism akin to a working memory, to generate persistent directional migration when signals are disrupted by temporally memorizing their position, while still remaining adaptive to spatial and temporal changes of the signal source. Using dynamical systems theory, we derive that these information processing capabilities are inherent for protein networks whose dynamics is maintained away from steady state through organization at criticality. We demonstrate experimentally using the Epidermal growth factor receptor (EGFR) signaling network, that the memory is maintained in the prolonged activity of the receptor via a slow-escaping remnant, a dynamical ghost of the attractor of the polarized signaling state, that further results in memory in migration. As this state is metastable, it also enables continuous adaptation of the migration direction when the signals vary in space and time. We therefore show that cells implement real-time computations without stable-states to navigate in changing chemoattractant fields by memorizing position of disrupted signals while maintaining sensitivity to novel chemical cues.

Inverse design of grating couplers using the policy gradient method from reinforcement learning

We present a proof-of-concept technique for the inverse design of electromagnetic devices motivated by the policy gradient method in reinforcement learning, named PHORCED (PHotonic Optimization using REINFORCE Criteria for Enhanced Design). This technique uses a probabilistic generative neural network interfaced with an electromagnetic solver to assist in the design of photonic devices, such as grating couplers. We show that PHORCED obtains better performing grating coupler designs than local gradient-based inverse design via the adjoint method, while potentially providing faster convergence over competing state-of-the-art generative methods. As a further example of the benefits of this method, we implement transfer learning with PHORCED, demonstrating that a neural network trained to optimize 8° grating couplers can then be re-trained on grating couplers with alternate scattering angles while requiring >10× fewer simulations than control cases.