Navigation in outdoor terrain is di cult due to a lack of easily and uniquely identi able landmarks. This paper outlines current research on extraction of navigationally salient features from images and maps, feature matching and viewpoint determination, landmark selection, detection and diagnosis of route following errors, perceptual issues related to vision-based navigation, and database and ...

Depth scans acquired from different views may contain nuisances such as noise, occlusion, and varying point density. We propose a novel Signature of Geometric Centroids descriptor, supporting direct shape matching on the scans, without requiring any preprocessing such as scan denoising or converting into a mesh. First, we construct the descriptor by voxelizing the local shape within a uniquely ...

In a graph, a matching cut is an edge cut that is a matching. Matching Cut is the problem of deciding whether or not a given graph has a matching cut, which is known to be NP-complete even when restricted to bipartite graphs. It has been proved that Matching Cut is polynomially solvable for graphs of diameter two. In this paper, we show that, for any fixed integer d ≥ 4, Matching Cut is NP-comp...

The color of the blends of pre-colored fibers depends on the ratio of each fiber in the blends. Some theories have been introduced for color matching of blends of pre-colored fibers. Most however, are restricted in scope and accuracy. Kubelka and Munk presented the most applicable theory, which is still used in industry. In this work, the classical Kubelka-Munk method for color prediction of a ...

In this paper, we study the inverse problem for Dirac differential operators with  discontinuity conditions in a compact interval. It is shown that the potential functions can be uniquely determined by the value of the potential on some interval and parts of two sets of eigenvalues. Also, it is shown that the potential function can be uniquely determined by a part of a set of values of eigenfun...

Short measures of child inattention-overactivity (IO), aggression-defiance (AG), and anxiety-depression or emotionality (EM) derived through a double validation procedure are administered to mothers of 243 clinic-referred suburban New York boys between 6 and 10 years of age. Mother-rated IO is uniquely related to poor performance on cognitive and achievement tests; observed inattentive, hyperac...

For a mixed hypergraphH= (X,C,D), where C andD are set systems over the vertex set X, a coloring is a partition of X into ‘color classes’such that everyC ∈ Cmeets some class in more than one vertex, and everyD ∈ D has a nonempty intersection with at least two classes.A vertex-order x1, x2, . . . , xn onX (n=|X|) is uniquely colorable if the subhypergraph induced by {xj : 1 j i} has precisely on...

A connected graph G with at least 2m + 2n + 2 vertices is said to have property E(m,n) if, for any two disjoint matchings M and N of size m and n respectively, G has a perfect matching F such that M ⊆ F and N ∩ F = ∅. In particular, a graph with E(m, 0) is m-extendable. Let μ(Σ) be the smallest integer k such that no graphs embedded on a surface Σ are k-extendable. Aldred and Plummer have prove...

Computational approaches to stereo matching have often taken advantage of a geometric constraint which states that matching elements in the left and right eye images will always fall on "epipolar lines". The use of this epipolar constraint reduces the search space from two dimensions to one, producing a tremendous saving in the computation time required to find the matching solution. Use of thi...