This paper presents a novel statistical information fusion method to integrate multiple-view sensor data in multi-object tracking applications. The proposed method overcomes the drawbacks of the commonly used Generalized Covariance Intersection method, which considers constant weights allocated for sensors. Our method is based on enhancing the Generalized Covariance Intersection with adaptive w...

This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on average less comparisons than the total number of elements of both inputs (n and m respectively) when n = αm (α > 1). We can find applications of this algorithm on query processing in Web search engines, where large intersection...

This work presents a CAD paradigm to produce traditional zillij style of geometrical patterns using ubiquitous polygonal technique. This method makes use of a grid generated from diagonals of n-sided regular polygon. The grids are in the form of a mesh of having large number of irregular polygons. The vertex of any irregular polygon in the grid is viewed as the point of intersection of two diag...

Suppose M1 and M2 are two special Lagrangian submanifolds of R 2n with boundary that intersect transversally at one point p. The set M1 ∪M2 is a singular special Lagrangian variety with an isolated singularity at the point of intersection. Suppose further that the tangent planes at the intersection satisfy an angle condition (which always holds in dimension n = 3). Then, M1 ∪ M2 is regularisabl...

Given a digraph D = (V,A) and a positive integer k, an arc set F ⊆ A is called a karborescence if it is the disjoint union of k spanning arborescences. The problem of finding a minimum cost k-arborescence is known to be polynomial-time solvable using matroid intersection. In this paper we study the following problem: find a minimum cardinality subset of arcs that contains at least one arc from ...

Assume that G = G(V, E) is an undirected graph with vertex set V and edge set E. A clique of G is a complete subgraph. An edge clique-covering is a family of cliques of G which cover all edges of G. The edge clique-cover number, Be( G), is the minimum number of cliques in an edge clique-cover of G. For results and applications of the edge clique-cover number see [1-4]. Observe that Be(G) does n...

This paper introduces a novel method for affine invariant matching using Zwickels that is especially well suited for images of man-made structures. Zwickels are sections defined by two intersecting line segments, dividing the neighborhood around the intersection point into two sectors. The information inside the smaller sector is used to compute an affine invariant representation. We rectify th...

The maximum intersection problem for a matroid and a greedoid, given by polynomial-time oracles, is shown NP -hard by expressing the satisfiability of boolean formulas in 3-conjunctive normal form as such an intersection. Also the corresponding approximation problem is shown NP -hard for certain approximation performance bounds. This is in contrast with the maximum matroid-matroid intersection ...

Simplicial Complexes are used to model topology in Geographic Information Systems (GIS). Line intersection is an essential operation to update them. We introduce a finite-resolution line intersection method, called Zero Order Intersection, and apply it to simplicial complexes. Any reliable implementation of a line intersection algorithm has to address the limitations of a discrete computational...

This paper investigates the problem of relative spacecraft attitude estimation between three vehicles from a decentralized point of view. Decentralized attitude estimation is achieved through the use of local extended Kalman filters and a data fusion process known as the Covariance Intersection algorithm. Because the global attitude parameterization is the quaternion, the Covariance Intersectio...