Public surveillance monitoring is rapidly finding its way into Intelligent Surveillance System. Street crime is increasing in recent years, which has demanded more reliable and intelligent public surveillance system. In this paper, the ability and the accuracy of an Adaptive Neuro-Fuzzy Inference System (ANFIS) was investigated for the classification of moving objects for street scene applicati...

We present a new method for navigating in a street network using solely data acquired by a (smartphone integrated electronic) compass for self-localization. To make compass-based navigation in street networks practical, it is crucial to deal with all kinds of imprecision and different driving behaviors. We therefore develop a trajectory representation based on so-called inflection points which ...

Let P be a simple rectilinear polygon with n vertices, endowed with rectilinear metric. Let us assign to points Xl,..., xk E P positive weights ~1, . . . , wk. The median problem consists in the computing the point minimizing the total weighted distances to the given points. We present an 0 (n + k log n ) algorithm for solving this median problem. If all weighted points are vertices of a polygo...

We present a fast algorithm to compute an optimal rec-tilinear Steiner tree for extremal point sets. A point set is extremal if each point lies on the boundary of a rectilinear convex hull of the point set. Our algorithm can be used in homotopic routing in VLSI layout design and it runs in O(k 2 n) time, where n is the size of the point set and k is the size of its rectilinear convex hull.

Problem. The problem of distributing competing flows road users in time is prevalent worldwide, and there no fully justified intelligible solution, even if only traffic can be considered. At the busiest street intersections, primary means management signal control. If lights are close to each other, then it a good practice coordinate operation such organise most unhampered movement vehicles one...

This paper derives the distribution of the difference between the distances to the first and the second nearest facilities. Facilities are represented as points of regular and random patterns, and distance is measured as Euclidean and rectilinear distances on a continuous plane. Since the difference between the distances is regarded as the additional travel distance of customers when the neares...

The multifacility minimax location problem with rectilinear distances is considered. It is reduced to a parametric shortest path problem in a network with no negative length arcs. The reduction scheme contributes to this location problem and yields an efficient algorithm with time complexity 0 (n max(m log m, n3 )) where n and m denote the numbers of the new and existing facilitie,s in the plan...

The problem of drawing a graph in the plane with a minimum number of edge crossings—called the crossing number of a graph—is a well-studied problem which dates back to the first half of the twentieth century, as mentioned in [11], and was formulated in full generality in [3]. It was shown that this problem is NP-Complete [4], and that it remains so even when restricted to cubic graphs [5]. Many...

Recently, Aichholzer, Garćıa, Orden, and Ramos derived a remarkably improved lower bound for the number of (≤ k)-edges in an n-point set, and as an immediate corollary an improved lower bound on the rectilinear crossing number of Kn. We use simple allowable sequences to extend all their results to the more general setting of simple generalized configurations of points and slightly improve the l...

One form of hybrid evolutionary algorithm encodes solutions to its target problem as permutations of the problem's elements. A greedy heuristic assembles the solution a permutation represents by appending the problem's elements to the solution in the order the permutation speci es. The algorithm searches the problem's solution space by searching the space of permutations. A hybrid genetic algor...