Search results for "Graph Theory"
showing 10 items of 784 documents
Engineering multi-agent systems using feedback loops and holarchies
2016
This paper presents a methodological approach for the engineering of Multi-Agent Systems using feedback loops as a first class concept in order to identify organizations. Feedback loops are a way for modeling complex systems that expose emergent behavior by means of a cause-effect loop between two levels called micro and macro levels of the system. The proposed approach principles consist in defining an abstract feedback loop pattern and providing activities and guidelines in order to identify and refine possible candidates for feedback loops during the analysis phase of the Aspecs methodology. This approach is illustrated by using an example drawn from the smart grid field.
Adaptation, coordination, and local interactions via distributed approachability
2017
This paper investigates the relation between cooperation, competition, and local interactions in large distributed multi-agent\ud systems. The main contribution is the game-theoretic problem formulation and solution approach based on the new framework\ud of distributed approachability, and the study of the convergence properties of the resulting game model. Approachability\ud theory is the theory of two-player repeated games with vector payoffs, and distributed approachability is here presented for\ud the first time as an extension to the case where we have a team of agents cooperating against a team of adversaries under local\ud information and interaction structure. The game model turns i…
Accurate keyframe selection and keypoint tracking for robust visual odometry
2016
This paper presents a novel stereo visual odometry (VO) framework based on structure from motion, where a robust keypoint tracking and matching is combined with an effective keyframe selection strategy. In order to track and find correct feature correspondences a robust loop chain matching scheme on two consecutive stereo pairs is introduced. Keyframe selection is based on the proportion of features with high temporal disparity. This criterion relies on the observation that the error in the pose estimation propagates from the uncertainty of 3D points—higher for distant points, that have low 2D motion. Comparative results based on three VO datasets show that the proposed solution is remarkab…
Decorous combinatorial lower bounds for row layout problems
2020
Abstract In this paper we consider the Double-Row Facility Layout Problem (DRFLP). Given a set of departments and pairwise transport weights between them the DRFLP asks for a non-overlapping arrangement of the departments along both sides of a common path such that the weighted sum of the center-to-center distances between the departments is minimized. Despite its broad applicability in factory planning, only small instances can be solved to optimality in reasonable time. Apart from this even deriving good lower bounds using existing integer programming formulations and branch-and-cut methods is a challenging problem. We focus here on deriving combinatorial lower bounds which can be compute…
JOINT TOPOLOGY LEARNING AND GRAPH SIGNAL RECOVERY VIA KALMAN FILTER IN CAUSAL DATA PROCESSES
2018
In this paper, a joint graph-signal recovery approach is investigated when we have a set of noisy graph signals generated based on a causal graph process. By leveraging the Kalman filter framework, a three steps iterative algorithm is utilized to predict and update signal estimation as well as graph topology learning, called Topological Kalman Filter or TKF. Similar to the regular Kalman filter, we first predict the a posterior signal state based on the prior available data and then this prediction is updated and corrected based on the recently arrived measurement. But contrary to the conventional Kalman filter algorithm, we have no information of the transition matrix and hence we relate t…
Higher Degree F-transforms Based on B-splines of Two Variables
2016
The paper deals with the higher degree fuzzy transforms (F-transforms with polynomial components) for functions of two variables in the case when two-dimensional generalized fuzzy partition is given by B-splines of two variables. We investigate properties of the direct and inverse F-transform in this case and prove that using B-splines as basic functions of fuzzy partition allows us to improve the quality of approximation.
Identification of Objects Based on Generalized Amplitude-Phase Images Statistical Models
2017
The article presents the dynamical objects identification technology based on statistical models of amplitude-phase images (APIm) – multidimensional data arrays (semantic models) and statistical correlation analysis methods using the generalized discrete Hilbert transforms (DHT) – 2D Hilbert (Foucault) isotropic (HTI), anisotropic (HTA) and total transforms – AP-analysis (APA) to calculate the APIm. The identified objects are modeled with 3D airplanes templates rotated in space around the center of Cartesian coordinate system. The DHT domain system of coordinates displaying the plane projections (2D flat images) remains to be space-invariant. That causes the anisotropic properties of APIm a…
Combined column-and-row-generation for the optimal communication spanning tree problem
2018
Abstract This paper considers the exact solution of the optimal communication spanning tree problem (OCSTP), which can be described as follows: Given an undirected graph with transportation costs on every edge and communication requirements for all pairs of vertices, the OCSTP seeks for a spanning tree that minimizes the sum of the communication costs between all pairs of vertices, where the communication cost of a pair of vertices is defined as their communication requirement multiplied by the transportation cost of the unique tree path that connects the two vertices. Two types of compact formulations for OCSTP were presented in the literature. The first one is a four-index model based on …
Automated Dental Identification with Lowest Cost Path-Based Teeth and Jaw Separation
2016
Abstract Teeth are some of the most resilient tissues of the human body. Because of their placement, teeth often yield intact indicators even when other metrics, such as finger prints and DNA, are missing. Forensics on dental identification is now mostly manual work which is time and resource intensive. Systems for automated human identification from dental X-ray images have the potential to greatly reduce the necessary efforts spent on dental identification, but it requires a system with high stability and accuracy so that the results can be trusted. This paper proposes a new system for automated dental X-ray identification. The scheme extracts tooth and dental work contours from the X-ray…
Graph Theoretical Framework of Brain Networks in Multiple Sclerosis: A Review of Concepts.
2019
Abstract Network science provides powerful access to essential organizational principles of the human brain. It has been applied in combination with graph theory to characterize brain connectivity patterns. In multiple sclerosis (MS), analysis of the brain networks derived from either structural or functional imaging provides new insights into pathological processes within the gray and white matter. Beyond focal lesions and diffuse tissue damage, network connectivity patterns could be important for closely tracking and predicting the disease course. In this review, we describe concepts of graph theory, highlight novel issues of tissue reorganization in acute and chronic neuroinflammation an…