Search

Optical interferometric imaging enables astronomical observation at extremely high angular resolution. The necessary optical information for imaging, such as the optical path differences and visibilities, is easy to extract from fringes generated by the combination of two beams. With more than two apertures, the image-plane interference pattern becomes an increasingly indistinguishable mixture of fringe spacings and directions. For decades, the state-of-the-art approaches for obtaining two-aperture fringes from an interferometer array composed of many apertures are limited to pairwise combinations using bulk optics. Here, we derive and demonstrate a fringe disentanglement theory that can digitally transform the interference pattern of N apertures to N(N-1)/2 pairwise fringes without any optics, thus providing straightforward methods of information acquisition for interferometers. We demonstrate applications of our technique by both simulation and experiment, showing that this theory can be used for simultaneously sensing pistons and determining the individual visibilities of all combining apertures. Furthermore, we use the proposed theory to phase a 1.5-meter segmented flat telescope, demonstrating its validity for engineering implementation. This theory may not only benefit optical imaging but also interferometry-based measurements, by providing an exceptional capability to simplify the interferometric output generated by a system of many apertures., Comment: 21 pages, 9 figures

Trust and distrust are common in the opinion interactions among agents in social networks, and they are described by the edges with positive and negative weights in the signed digraph, respectively. It has been shown in social psychology that although the opinions of most agents (followers) tend to prevail, sometimes one agent (leader) with a firm stand and strong influence can impact or even overthrow the preferences of followers. This paper aims to analyze how the leader influences the formation of followers' opinions in signed social networks. In addition, this paper considers an asynchronous evolution mechanism of trust/distrust level based on opinion difference, in which the trust/distrust level between neighboring agents is portrayed as a nonlinear weight function of their opinion difference, and each agent interacts with the neighbors to update the trust/distrust level and opinion at the times determined by its own will. Based on the related properties of sub-stochastic and super-stochastic matrices, the inequality conditions about positive and negative weights to achieve opinion consensus and polarization are established. Some numerical simulations based on two well-known networks called the ``12 Angry Men" network and the Karate Club network are provided to verify the correctness of the theoretical results., Comment: 12 pages, 15 figures

In this paper, we study the problem of localizing the sensors' positions in presence of denial-of-service (DoS) attacks. We consider a general attack model, in which the attacker action is only constrained through the frequency and duration of DoS attacks. We propose a distributed iterative localization algorithm with an abandonment strategy based on the barycentric coordinate of a sensor with respect to its neighbors, which is computed through relative distance measurements. In particular, if a sensor's communication links for receiving its neighbors' information lose packets due to DoS attacks, then the sensor abandons the location estimation. When the attacker launches DoS attacks, the AS-DILOC algorithm is proved theoretically to be able to accurately locate the sensors regardless of the attack strategy at each time. The effectiveness of the proposed algorithm is demonstrated through simulation examples.

In this contribution, the properties of sub-stochastic matrix and super-stochastic matrix are applied to analyze the bipartite tracking issues of multi-agent systems (MASs) over signed networks, in which the edges with positive weight and negative weight are used to describe the cooperation and competition among the agents, respectively. For the sake of integrity of the study, the overall content is divided into two parts. In the first part, we examine the dynamics of bipartite tracking for first-order MASs, second-order MASs and general linear MASs in the presence of asynchronous interactions, respectively. Asynchronous interactions mean that each agent only interacts with its neighbors at the instants when it wants to update the state rather than keeping compulsory consistent with other agents. In the second part, we investigate the problems of bipartite tracing in different practical scenarios, such as time delays, switching topologies, random networks, lossy links, matrix disturbance, external noise disturbance, and a leader of unmeasurable velocity and acceleration. The bipartite tracking problems of MASs under these different scenario settings can be equivalently converted into the product convergence problems of infinite sub-stochastic matrices (ISubSM) or infinite super-stochastic matrices (ISupSM). With the help of nonnegative matrix theory together with some key results related to the compositions of directed edge sets, we establish systematic algebraic-graphical methods of dealing with the product convergence of ISubSM and ISupSM. Finally, the efficiency of the proposed methods is verified by computer simulations.

Fully parallel architecture at disparity-level for efficient semi-global matching (SGM) with refined rank method is presented. The improved SGM algorithm is implemented with the non-parametric unified rank model which is the combination of Rank filter/AD and Rank SAD. Rank SAD is a novel definition by introducing the constraints of local image structure into the rank method. As a result, the unified rank model with Rank SAD can make up for the defects of Rank filter/AD. Experimental results show both excellent subjective quality and objective performance of the refined SGM algorithm. The fully parallel construction for hardware implementation of SGM is architected with reasonable strategies at disparity-level. The parallelism of the data-stream allows proper throughput for specific applications with acceptable maximum frequency. The results of RTL emulation and synthesis ensure that the proposed parallel architecture is suitable for VLSI implementation., Comment: stereo matching; SGM; Rank SAD; fully parallel architecture