The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we describe a new optimization method which we call Multiple Birth and Cut (MBC). It combines the recently developed Multiple Birth and Death (MBD) algorithm and the Graph-Cut algorithm. MBD and MBC optimization methods are applied to the energy minimization of an object based model, the marked point process. We compare the MBC to the MBD showing the advantages and disadvantages, where...
We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic Lloyd approach to coverage optimization involves separate centering and partitioning steps and converges to the set of centroidal Voronoi partitions. In this work we present a novel graph coverage algorithm which achieves better performance...
We present a novel “hybrid Hessian” six-degrees-of-freedom simultaneous localization and mapping (SLAM) algorithm. Our method allows for the smooth trade-off of accuracy for efficiency and for the incorporation of GPS measurements during real-time operation, thereby offering significant advantages over other SLAM solvers. Like other stochastic SLAM methods, such as SGD and TORO, our technique is robust...
Based on the Nearest Neighbor Algorithm, this paper introduces the Algorithm of Gradually Convergent and the Cross-wire Cutting, which according to gradually convergence of the path-changing and the principle of minimum path length variation respectively. Both of them optimize the algorithm of Optimal Hamilton Circuit in undirected complete graphs, comparing three aspects of accuracy, stability and...
In this paper, a solution is proposed for n-Queen problem based on ACO (ant colony optimization). The n-Queen problem become intractable for large values of `n' and thus placed in NP (non-deterministic polynomial) class problem. The n-Queen problem is basically a generalized form of 8-Queen problem. In 8-Queen problem, the goal is to place 8 queens such that no queen can kill the other using standard...
This paper presents a performance study of two versions of a unidimensional search algorithm aimed at solving high-dimensional optimization problems. The algorithms were tested on 11 scalable benchmark problems. The aim is to observe how metaheuristics for continuous optimization problems respond with increasing dimension. To this end, we report the algorithms' performance on the 50, 100, 200 and...
A problem in large and dynamic networks consists in making available at each node global information about the state of the network. Gossip-based aggregation schemes are a simple yet effective mechanism to solve the problem. However, they have to cope with the dynamics either of the network and the values being aggregated and thus have to integrate specific solutions to deal with them. The contribution...
At first, some improvements were done in a single ant colony clustering algorithm, then, for different speed ant colony, clustering analysis was finished independently and in parallel by imitating the collaborative performance of multi-colony, and clustering results were combined into a hyper-graph and second division was made in the hyper-graph using ACA, at last, the test result for four databases...
This paper addresses the problem of establishing correspondences between two sets of visual features using higher-order constraints instead of the unary or pairwise ones used in classical methods. Concretely, the corresponding hypergraph matching problem is formulated as the maximization of a multilinear objective function over all permutations of the features. This function is defined by a tensor...
GPS-based synchronous phasor measurement technology is a powerful tool for the security and reliable operation of the inter-connected electric power system. This paper presents an ACO-based approach to optimize the phasor measurement unit (PMU) placement problem. The pheromone trail persistence coefficient adaptive adjustment mechanism and stochastic perturbing progress are introduced into the ant...
GPS-based synchronous phasor measurement technology is a powerful tool for the security and reliable operation of the inter-connected electric power system. This paper presents an ACO-based approach to optimize the phasor measurement unit (PMU) placement problem. The pheromone trail persistence coefficient adaptive adjustment mechanism and stochastic perturbing progress are introduced into the ant...
The aim of outlier detection was to find out abnormal data patterns concealed in abundant data sets which were sparse and isolate. Mine disaster occurred much more frequently in our country, so it was urgent to take out an effective method to prevent mine disaster and guarantee miner's life and property of the company. In this paper, we presented a new method-AHHDOD, it could not only find out the...
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal graph matching problem for weighted graphs, which is computationally challenging due the combinatorial nature of the set of permutations. Contrary to optimization-based relaxations to this problem, in this paper we develop...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.